Local Optima Networks in Solving Algorithm Selection Problem for TSP

Wojciech Bożejko, Andrzej Gnatowski, Teodor Niżyński, Michael Affenzeller, Andreas Beham

Research output: Chapter in Book/Report/Conference proceedingsConference contribution

12 Citations (Scopus)

Abstract

In the era of commonly available problem-solving tools for, it is especially important to choose the best available method. We use local optima network analysis and machine learning to select appropriate algorithms on the instance-to-instance basis. The preliminary results show that such method can be successfully applied for sufficiently distinct instances and algorithms.
Original languageEnglish
Title of host publicationContemporary Complex Systems and Their Dependability - Proceedings of the 13th International Conference on Dependability and Complex Systems DepCoS-RELCOMEX, 2018
EditorsJanusz Kacprzyk, Wojciech Zamojski, Jacek Mazurkiewicz, Jaroslaw Sugier, Tomasz Walkowiak
PublisherSpringer
Pages83-93
Number of pages11
ISBN (Print)978-3-319-91445-9
DOIs
Publication statusPublished - 2019
EventInternational Conference on Dependability and Complex Systems DepCoS-RELCOMEX - Brunów, Poland
Duration: 2 Jul 20186 Jul 2018
http://depcos.pwr.wroc.pl/

Publication series

NameAdvances in Intelligent Systems and Computing
Volume761
ISSN (Print)2194-5357

Conference

ConferenceInternational Conference on Dependability and Complex Systems DepCoS-RELCOMEX
Country/TerritoryPoland
CityBrunów
Period02.07.201806.07.2018
Internet address

Keywords

  • algorithm selection
  • local optima networks
  • traveling salesman
  • fitness landscape
  • Local optima networks
  • Algorithm selection problem
  • Travelling salesman problem
  • Fitness landscape analysis

Fingerprint

Dive into the research topics of 'Local Optima Networks in Solving Algorithm Selection Problem for TSP'. Together they form a unique fingerprint.

Cite this