Traveling salesman problem heuristics: leading methods, implementations and latest advances
From MaRDI portal
(Redirected from Publication:418054)
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
Cites work
- scientific article; zbMATH DE number 23663 (Why is no real title available?)
- scientific article; zbMATH DE number 1082106 (Why is no real title available?)
- scientific article; zbMATH DE number 2064411 (Why is no real title available?)
- scientific article; zbMATH DE number 2064412 (Why is no real title available?)
- scientific article; zbMATH DE number 2064413 (Why is no real title available?)
- scientific article; zbMATH DE number 1893558 (Why is no real title available?)
- A Staged Primal-Dual Algorithm for Perfect b-Matching with Edge Capacities
- A data structure useful for finding Hamiltonian cycles
- A note on single alternating cycle neighborhoods for the TSP
- Algorithms for Large-scale Travelling Salesman Problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Chained Lin-Kernighan for large traveling salesman problems
- Data Structures for Traveling Salesmen
- Data structures and ejection chains for solving large-scale traveling salesman problems
- Ejection chain and filter-and-fan methods in combinatorial optimization
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Fast Algorithms for Finding Nearest Common Ancestors
- Fast Algorithms for Geometric Traveling Salesman Problems
- Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
- Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
- Large-step Markov chains for the TSP incorporating local search heuristics
- Local Search for the Asymmetric Traveling Salesman Problem
- Relaxed tours and path ejections for the traveling salesman problem
- TSP ejection chains
- TSPLIB—A Traveling Salesman Problem Library
Cited in
(27)- Uncertain multiobjective traveling salesman problem
- Mathematical programming based heuristics for the 0--1 MIP: a survey
- Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP
- Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection
- Social structure optimization in team formation
- Finding the largest triangle in a graph in expected quadratic time
- Embedded local search approaches for routing optimization
- Traveling salesman problems with PageRank distance on complex networks reveal community structure
- POPMUSIC for the travelling salesman problem
- Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- Data structures and ejection chains for solving large-scale traveling salesman problems
- Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem
- Stability and recovery for independence systems
- A linearithmic heuristic for the travelling salesman problem
- Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
- Global versus local search: the impact of population sizes on evolutionary algorithm performance
- Large-step Markov chains for the TSP incorporating local search heuristics
- A note on single alternating cycle neighborhoods for the TSP
- A new mathematical programming formulation for the single-picker routing problem
- Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem
- Seriation using tree-penalized path length
- Comments on: ``Shared resources in collaborative vehicle routing
- A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP
- Deep clustering of the traveling salesman problem to parallelize its solution
- The travelling salesman problem: selected algorithms and heuristics†
- The distributed Kolkata paise restaurant game
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)
