On the solving strategy in composite heuristics

DOI10.1016/0167-6377(92)90101-8MaRDI QIDQ1200786zbMATH OpenOpenAlexFDO

Authors Jukka Perttunen

Publication date 16 January 1993

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(92)90101-8

zbMATH Keywords

composite heuristicsEuclidean traveling salesmannetworks

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Programming involving graphs or networks (90C35)

Recommendations

• On the Significance of the Initial Solution in Travelling Salesman Heuristics
• A Study of Composite Heuristic Algorithms
• A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
• An efficient composite heuristic for the symmetric generalized traveling salesman problem
• scientific article; zbMATH DE number 3950233

Cites work

• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Fast Algorithms for Geometric Traveling Salesman Problems
• scientific article; zbMATH DE number 3950233 (Why is no real title available?)
• scientific article; zbMATH DE number 177832 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• Simulated Annealing – An Annotated Bibliography
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II

Cited in

(1)

• A Study of Composite Heuristic Algorithms

This page was built for publication: On the solving strategy in composite heuristics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200786)