• English
    • français
  • Help
  •  | 
  • Contact
  •  | 
  • About
  •  | 
  • Login
  • HAL portal
  •  | 
  • Pages Pro
  • EN
  •  / 
  • FR
View Item 
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Rigorous Performance Analysis of ...
  • BibTeX
  • CSV
  • Excel
  • RIS

Document type :
Communication dans un congrès avec actes
DOI :
10.1007/978-3-030-16711-0_7
Title :
Rigorous Performance Analysis of State-of-the-Art TSP Heuristic Solvers
Author(s) :
Mcmenemy, Paul [Auteur]
University of Stirling
Veerapen, Nadarajen [Auteur]
Operational Research, Knowledge And Data [ORKAD]
Adair, Jason [Auteur]
University of Stirling
Ochoa, Gabriela [Auteur]
University of Stirling
Conference title :
European Conference on Evolutionary Computation in Combinatorial Optimization
City :
Leipzig
Country :
Allemagne
Start date of the conference :
2019-04-24
Journal title :
Lecture Notes in Computer Science
Publication date :
2019-03-28
English keyword(s) :
TSP
Algorithm Selection
EAX
GPX
Performance Analysis
HAL domain(s) :
Informatique [cs]/Intelligence artificielle [cs.AI]
Informatique [cs]/Recherche opérationnelle [cs.RO]
English abstract : [en]
Understanding why some problems are better solved by one algorithm rather than another is still an open problem, and the symmetric Travelling Salesperson Problem (TSP) is no exception. We apply three state-of-the-art ...
Show more >
Understanding why some problems are better solved by one algorithm rather than another is still an open problem, and the symmetric Travelling Salesperson Problem (TSP) is no exception. We apply three state-of-the-art heuristic solvers to a large set of TSP instances of varying structure and size, identifying which heuristics solve specific instances to optimality faster than others. The first two solvers considered are variants of the multi-trial Helsgaun’s Lin-Kernighan Heuristic (a form of iterated local search), with each utilising a different form of Partition Crossover; the third solver is a genetic algorithm (GA) using Edge Assembly Crossover. Our results show that the GA with Edge Assembly Crossover is the best solver, shown to significantly outperform the other algorithms in 73% of the instances analysed. A comprehensive set of features for all instances is also extracted, and decision trees are used to identify main features which could best inform algorithm selection. The most prominent features identified a high proportion of instances where the GA with Edge Assembly Crossover performed significantly better when solving to optimality.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Source :
Harvested from HAL
Files
Thumbnail
  • https://hal.archives-ouvertes.fr/hal-02095416/document
  • Open access
  • Access the document
Thumbnail
  • https://hal.archives-ouvertes.fr/hal-02095416/document
  • Open access
  • Access the document
Thumbnail
  • http://dspace.stir.ac.uk/bitstream/1893/29359/1/McMenemy.pdf
  • Open access
  • Access the document
Thumbnail
  • https://hal.archives-ouvertes.fr/hal-02095416/document
  • Open access
  • Access the document
Université de Lille

Mentions légales
Université de Lille © 2017