Traveling salesman problem heuristics: leading methods, implementations and latest advances
From MaRDI portal
Publication:418054
DOI10.1016/J.EJOR.2010.09.010zbMATH Open1237.90209OpenAlexW2104635975WikidataQ56067387 ScholiaQ56067387MaRDI QIDQ418054FDOQ418054
Authors: César Rego, Dorabela Gamboa, Fred Glover, Colin Osterman 
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
Recommendations
- The travelling salesman problem: selected algorithms and heuristics†
- Heuristics and learning approaches for solving the Traveling Salesman Problem
- A new heuristic for the traveling salesman problem
- Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
- A multiperiod traveling salesman problem: Heuristic algorithms
- Special cases of travelling salesman problems and heuristics
- The traveling salesman problem: An overview of exact and approximate algorithms
- The period traveling salesman problem: A new heuristic algorithm
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- TSPLIB—A Traveling Salesman Problem Library
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- A Staged Primal-Dual Algorithm for Perfect b-Matching with Edge Capacities
- Title not available (Why is that?)
- Fast Algorithms for Finding Nearest Common Ancestors
- Title not available (Why is that?)
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Chained Lin-Kernighan for large traveling salesman problems
- Title not available (Why is that?)
- Ejection chain and filter-and-fan methods in combinatorial optimization
- Title not available (Why is that?)
- Data structures and ejection chains for solving large-scale traveling salesman problems
- Fast Algorithms for Geometric Traveling Salesman Problems
- 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
- Relaxed tours and path ejections for the traveling salesman problem
- Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
- A note on single alternating cycle neighborhoods for the TSP
- Local Search for the Asymmetric Traveling Salesman Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Data Structures for Traveling Salesmen
- Algorithms for Large-scale Travelling Salesman Problems
- A data structure useful for finding Hamiltonian cycles
Cited In (27)
- Seriation using tree-penalized path length
- Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection
- Deep clustering of the traveling salesman problem to parallelize its solution
- POPMUSIC for the travelling salesman problem
- Mathematical programming based heuristics for the 0--1 MIP: a survey
- Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem
- Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP
- Large-step Markov chains for the TSP incorporating local search heuristics
- Global versus local search: the impact of population sizes on evolutionary algorithm performance
- The travelling salesman problem: selected algorithms and heuristics†
- Comments on: ``Shared resources in collaborative vehicle routing
- Traveling salesman problems with PageRank distance on complex networks reveal community structure
- A new mathematical programming formulation for the single-picker routing problem
- Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem
- Finding the largest triangle in a graph in expected quadratic time
- Social structure optimization in team formation
- Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
- A note on single alternating cycle neighborhoods for the TSP
- Uncertain multiobjective traveling salesman problem
- Stability and recovery for independence systems
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP
- A linearithmic heuristic for the travelling salesman problem
- Embedded local search approaches for routing optimization
- Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach
- The distributed Kolkata paise restaurant game
- Data structures and ejection chains for solving large-scale traveling salesman problems
Uses Software
This page was built for publication: Traveling salesman problem heuristics: leading methods, implementations and latest advances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418054)
