Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Structural analysis of local search heuristics combinatorial optimization
Computers and Operations Research
Practical numerical algorithms for chaotic systems
Practical numerical algorithms for chaotic systems
Evolutionary walks on rugged landscapes
SIAM Journal on Applied Mathematics
Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
Fitness landscapes and memetic algorithm design
New ideas in optimization
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
SIAM Review
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
Local Optimization and the Traveling Salesman Problem
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Dynamics of heuristic search system for combinatorial optimization problems: the traveling salesman problem case
A Tabu-Search Hyperheuristic for Timetabling and Rostering
Journal of Heuristics
Distributed choice function hyper-heuristics for timetabling and scheduling
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
A multilevel tabu search algorithm for the feature selection problem in biomedical data
Computers & Mathematics with Applications
Seeking global edges for traveling salesman problem in multi-start search
Journal of Global Optimization
International Journal of Metaheuristics
| Hi-index | 0.00 |
This paper investigates dynamics of a local search trajectory generated by running the Or-opt heuristic on the traveling salesman problem. This study evaluates the dynamics of the local search heuristic by estimating the correlation dimension for the search trajectory, and finds that the local heuristic search process exhibits the transition from high-dimensional stochastic to low-dimensional chaotic behavior. The detection of dynamical complexity for a heuristic search process has both practical as well as theoretical relevance. The revealed dynamics may cast new light on design and analysis of heuristics and result in the potential for improved search process.