Introducing complexity curtailing techniques for the tour construction heuristics for the travelling salesperson problem

DOI10.1155/2016/4786268OpenAlexW2513360157WikidataQ59129519 ScholiaQ59129519MaRDI QIDQ1659213

David W. Corne, Ziauddin Ursani

Publication date: 15 August 2018

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

Full work available at URL: https://doi.org/10.1155/2016/4786268

zbMATH Keywords

complexity curtailing techniquemax difference

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (1)

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

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• The traveling salesman. Computational solutions for RSP applications
• Fast Algorithms for Geometric Traveling Salesman Problems
• Some Simple Applications of the Travelling Salesman Problem
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• On the Significance of the Initial Solution in Travelling Salesman Heuristics
• A Sequential Method for Discrete Optimization Problems and its Application to the Assignment, Travelling Salesman, and Three Machine Scheduling Problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Introducing complexity curtailing techniques for the tour construction heuristics for the travelling salesperson problem