Abstract
The Metric Travelling Salesman Problem is a subcase of the Travelling Salesman Problem (TSP), where the triangle inequality holds. It is a key problem in combinatorial optimization. Solutions of the Metric TSP are generally used for costs minimization tasks in logistics, manufacturing, genetics and other fields. Since this problem is NP-hard, heuristic algorithms providing near optimal solutions in polynomial time will be considered instead of the exact ones. The aim of this article is to experimentally find Pareto optimal heuristics for Metric TSP under criteria of error rate and run time efficiency. Two real-life kinds of inputs are intercompared - VLSI Data Sets based on very large scale integration schemes and National TSPs that use geographic coordinates of cities. This paper provides an overview and prior estimates of seventeen heuristic algorithms implemented in C++ and tested on both data sets. The details of the research methodology are provided, the computational scenario is presented. In the course of computational experiments, the comparative figures are obtained and on their basis multi-objective optimization is provided. Overall, the group of Pareto-optimal algorithms for different N consists of some of the MC, SC, NN, DENN, CI, GRD, CI + 2-Opt, GRD + 2-Opt, CHR and LKH heuristics.
Highlights
The Travelling Salesman Problem (TSP) is one of the most widely known questions in a class of combinatorial optimization problems
The presented study is undertaken to determine what heuristics for Metric TSP should be used in specific circumstances with limited resources
This paper provides an overview of seventeen heuristic algorithms implemented in C++ and tested on both the very large-scale integration (VLSI) data set and instances of National TSPs
Summary
The Travelling Salesman Problem (TSP) is one of the most widely known questions in a class of combinatorial optimization problems. A subcase of the TSP is Avdoshin S.M., Beresneva E.N. The Metric Travelling Salesman Problem: The Experiment On Pareto-optimal Algorithms. The purpose of this study is to determine the group of Pareto-optimal algorithms among the set of selected ones for Metric TSP by criteria of run time and qualitative performance. A study of this type is inevitably restricted by various constraints, in this research only heuristic algorithms constructing near optimal solutions in polynomial time will be considered instead of the exact ones. It presents definition of resource-efficient parameters, Pareto optimization and, at last, the formulation of the aim of the project. After that the details of the research methodology and expected results are mentioned
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
