On Randomness and Structure in Euclidean TSP Instances: A Study With Heuristic Methods
Prediction of the quality of the result provided by a specific solving method is an important factor when choosing how to solve a given problem. The more accurate the prediction, the more appropriate the decision on what to choose when several solving applications are available. In this article, we...
Main Authors: | Gloria Cerasela Crisan, Elena Nechita, Dana Simian |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2021-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9312045/ |
Similar Items
-
Genetic algorithm with Lin-Kernighan heuristic as a substep of solving the multinomenclature vehicle routing problem
by: T.A. Yakovleva
Published: (2011-05-01) -
An Efficient Combined Meta-Heuristic Algorithm for Solving the Traveling Salesman Problem
by: Majid Yousefikhoshbakht, et al.
Published: (2016-08-01) -
On the Resilience of Ant Algorithms. Experiment with Adapted MMAS on TSP
by: Elena Nechita, et al.
Published: (2020-05-01) -
QUANTUM INSPIRED PARTICLE SWARM COMBINED WITH LIN-KERNIGHAN-HELSGAUN METHOD TO THE TRAVELING SALESMAN PROBLEM
by: Bruno Avila Leal de Meirelles Herrera, et al.
Published: (2015-12-01) -
IntraClusTSP—An Incremental Intra-Cluster Refinement Heuristic Algorithm for Symmetric Travelling Salesman Problem
by: László Kovács, et al.
Published: (2018-11-01)