Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem

DOI10.1007/s10878-021-00759-5zbMath1485.90113OpenAlexW3168202604MaRDI QIDQ2075470

Jian Lin, Keqin Li, Jianxun Liu, Xiangfei Zeng

Publication date: 14 February 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00759-5

zbMATH Keywords

Hamiltonian cycletraveling salesman problem (TSP)angle bisector insertion algorithmasymmetric traveling salesman problem (ATSP)constructive heuristic algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• The traveling salesman. Computational solutions for RSP applications
• Introducing complexity curtailing techniques for the tour construction heuristics for the travelling salesperson problem
• Solving large-scale TSP using a fast wedging insertion partitioning approach
• A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
• Note on Hamilton Circuits
• Approximate Traveling Salesman Algorithms
• TSPLIB—A Traveling Salesman Problem Library
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Some distance properties of latent root and vector methods used in multivariate analysis
• Some Theorems on Abstract Graphs