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

DOI10.1155/2015/854218MaRDI QIDQ1666767zbMATH OpenOpenAlexWikidataFDO

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

Publication date 27 August 2018

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

Copyright license Creative Commons Attribution 3.0 Unported

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)

Recommendations

• An algorithm for solving large-scale travelling-salesman problems and its numerical implementation
• An algorithm for the approximate solution of a large-scale travelling salesman problem in a plane
• A new hybrid algorithm for solving large scale TSP
• Hybrid nested partitions method for the traveling salesman problem
• Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem

Cites work

• scientific article; zbMATH DE number 3932819 (Why is no real title available?)
• scientific article; zbMATH DE number 515943 (Why is no real title available?)
• scientific article; zbMATH DE number 1082106 (Why is no real title available?)
• scientific article; zbMATH DE number 1163099 (Why is no real title available?)
• scientific article; zbMATH DE number 1163103 (Why is no real title available?)
• scientific article; zbMATH DE number 2050708 (Why is no real title available?)
• scientific article; zbMATH DE number 2064412 (Why is no real title available?)
• scientific article; zbMATH DE number 871931 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• scientific article; zbMATH DE number 3193293 (Why is no real title available?)
• A distributed implementation of simulated annealing for the travelling salesman problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Chained Lin-Kernighan for large traveling salesman problems
• Dynamic Programming Treatment of the Travelling Salesman Problem
• Fast Algorithms for Geometric Traveling Salesman Problems
• Greedy randomized adaptive search procedures
• Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem
• Scatter Search and Path Relinking: Advances and Applications
• Spacefilling curves and the planar travelling salesman problem
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling salesman problem and its variations
• The traveling salesman problem: An overview of exact and approximate algorithms

Cited in

(2)

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

Describes a project that uses

Uses Software

• DIMACS
• Scatter Search
• LKH
• TSPLIB

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1666767)