Efficient solutions to a class of generalized time-dependent combinatorial optimization problems
Todd W. Kolb, Lixin Tao, Michael Tao · 2005
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. Key-Words: Time-dependent combinatorial optimization problems, meta-heuristics, simulated annealing. 1