Efficient solutions to a class of generalized time-dependent combinatorial optimization problems

Authors:
Todd W. Kolb;Lixin Tao;Michael W. Tao
Affiliations:
School of Computer Science and Information Systems, Pace University, White Plains, NY;School of Computer Science and Information Systems, Pace University, White Plains, NY;Thomas Jefferson High School for Science and Technology, Braddock Road, Alexandria, VA
Venue:
MATH'05 Proceedings of the 7th WSEAS International Conference on Applied Mathematics
Year:
2005

Citing 4
Cited 0

Optimization by simulated annealing: an experimental evaluation. Part I, graph partitioning

Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Sensitivity analysis of certain time-dependent matroid base models solved by genetic algorithms

Sensitivity analysis of certain time-dependent matroid base models solved by genetic algorithms
Solving optimization problems using genetic algorithms with multiple genome coding

Solving optimization problems using genetic algorithms with multiple genome coding

Quantified Score

Hi-index	0.00

Visualization

Abstract

A class of generalized intractable time-dependent problems is identified and abstracted into a mathematical model. Simulated annealing is adopted as the base of the solution strategy. Comprehensive experiments are conducted to study the sensitivity of the algorithm to the values of its multiple parameters. Extensive performance evaluation shows that the proposed algorithm significantly outperforms the best published alternative algorithms for the same problem class.