Traveling salesman problem heuristics: leading methods, implementations and latest advances
From MaRDI portal
Publication:418054
DOI10.1016/j.ejor.2010.09.010zbMath1237.90209OpenAlexW2104635975WikidataQ56067387 ScholiaQ56067387MaRDI QIDQ418054
Fred Glover, Dorabela Gamboa, Colin Osterman, César Rego
Publication date: 14 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.09.010
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem, Traveling salesman problems with PageRank distance on complex networks reveal community structure, Uncertain multiobjective traveling salesman problem, A new mathematical programming formulation for the single-picker routing problem, Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem, Social structure optimization in team formation, Mathematical programming based heuristics for the 0--1 MIP: a survey, A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem, Finding the largest triangle in a graph in expected quadratic time, Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach, A linearithmic heuristic for the travelling salesman problem, POPMUSIC for the travelling salesman problem, Global versus local search: the impact of population sizes on evolutionary algorithm performance, Comments on: ``Shared resources in collaborative vehicle routing, A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP, Stability and Recovery for Independence Systems, Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection, The distributed Kolkata paise restaurant game, Seriation using tree-penalized path length
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A data structure useful for finding Hamiltonian cycles
- Large-step Markov chains for the TSP incorporating local search heuristics
- Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
- TSP ejection chains
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Relaxed tours and path ejections for the traveling salesman problem
- Data structures and ejection chains for solving large-scale traveling salesman problems
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
- A note on single alternating cycle neighborhoods for the TSP
- Chained Lin-Kernighan for Large Traveling Salesman Problems
- Fast Algorithms for Finding Nearest Common Ancestors
- Local Search for the Asymmetric Traveling Salesman Problem
- TSPLIB—A Traveling Salesman Problem Library
- Fast Algorithms for Geometric Traveling Salesman Problems
- Data Structures for Traveling Salesmen
- A Staged Primal-Dual Algorithm for Perfect b-Matching with Edge Capacities
- Algorithms for Large-scale Travelling Salesman Problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Ejection chain and filter-and-fan methods in combinatorial optimization
