A Sensitive Metaheuristic for Solving a Large Optimization Problem

DOI10.1007/978-3-540-77566-9_48zbMath1132.68709OpenAlexW1802930290MaRDI QIDQ5448681

Camelia-Mihaela Pintea, Camelia Chira, Petrică C. Pop, D. Dumitrescu

Publication date: 7 March 2008

Published in: SOFSEM 2008: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77566-9_48

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A decision-theoretic framework for comparing heuristics
• A random-key genetic algorithm for the generalized traveling salesman problem
• An efficient composite heuristic for the symmetric generalized traveling salesman problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem