POPMUSIC for the travelling salesman problem

DOI10.1016/j.ejor.2018.06.039zbMath1403.90590OpenAlexW2810479212MaRDI QIDQ1991147

Éric D. Taillard, Keld Helsgaun

Publication date: 30 October 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hesso.tind.io/record/4337/files/author%20postprint.pdf

zbMATH Keywords

large-scale optimizationmetaheuristicslocal searchtravelling salesmanPOPMUSIC

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (9)

A POPMUSIC matheuristic for the capacitated vehicle routing problem ⋮ An adaptive memory matheuristic for the set orienteering problem ⋮ Finding the edges in optimal Hamiltonian cycles based on frequency quadrilaterals ⋮ Multi-goal motion planning using traveling salesman problem in belief space ⋮ A linearithmic heuristic for the travelling salesman problem ⋮ Routing automated lane-guided transport vehicles in a warehouse handling returns ⋮ The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem ⋮ The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem ⋮ An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem

Uses Software

• Concorde
• DIMACS
• POPMUSIC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Traveling salesman problem heuristics: leading methods, implementations and latest advances
• POPMUSIC for the point feature label placement problem
• General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
• Heuristic methods for large centroid clustering problems
• The traveling salesman problem and its variations.
• Chained Lin-Kernighan for Large Traveling Salesman Problems
• Tour Merging via Branch-Decomposition
• POPMUSIC for a real-world large-scale vehicle routing problem with time windows
• Multidimensional binary search trees used for associative searching
• Parallel iterative search methods for vehicle routing problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• In Pursuit of the Traveling Salesman

This page was built for publication: POPMUSIC for the travelling salesman problem