Multi-objective meta-heuristics for the traveling salesman problem with profits
Publication:928691
DOI10.1007/S10852-008-9080-2zbMath1140.90018OpenAlexW1982052569MaRDI QIDQ928691
Manuel Laguna, Nicolas Jozefowiez, Fred Glover
Publication date: 11 June 2008
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-008-9080-2
Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (13)
Uses Software
Cites Work
- The selective travelling salesman problem
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
- Relaxed tours and path ejections for the traveling salesman problem
- A tabu search heuristic for the undirected selective travelling salesman problem
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Multiobjective routing problems
- AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
- The prize collecting traveling salesman problem
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
- On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
This page was built for publication: Multi-objective meta-heuristics for the traveling salesman problem with profits