Solving large-scale TSP using a fast wedging insertion partitioning approach

DOI10.1155/2015/854218zbMath1394.90503OpenAlexW2171098336WikidataQ59119677 ScholiaQ59119677MaRDI QIDQ1666767

Xinjun Wang, Yi Zhang, Zhen-Yu Chen, Xingyu Gao, Fangchun Di, Zuoyong Xiang, Guangyi Liu, Li-Xin Li

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/854218

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27)

Related Items (2)

Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem ⋮ IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem

Uses Software

• TSPLIB
• LKH
• Scatter Search
• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The traveling salesman problem: An overview of exact and approximate algorithms
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• The traveling salesman problem and its variations
• Greedy randomized adaptive search procedures
• A distributed implementation of simulated annealing for the travelling salesman problem
• Chained Lin-Kernighan for Large Traveling Salesman Problems
• Dynamic Programming Treatment of the Travelling Salesman Problem
• Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem
• Spacefilling curves and the planar travelling salesman problem
• Fast Algorithms for Geometric Traveling Salesman Problems
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• Scatter Search and Path Relinking: Advances and Applications
• Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
• The Traveling-Salesman Problem and Minimum Spanning Trees

This page was built for publication: Solving large-scale TSP using a fast wedging insertion partitioning approach