Local Optima Networks in Solving Algorithm Selection Problem for TSP

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

doi:10.1007/978-3-319-91446-6_9

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 proceedings › Conference contribution

14 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 language	English
Title of host publication	Contemporary Complex Systems and Their Dependability - Proceedings of the 13th International Conference on Dependability and Complex Systems DepCoS-RELCOMEX, 2018
Editors	Janusz Kacprzyk, Wojciech Zamojski, Jacek Mazurkiewicz, Jaroslaw Sugier, Tomasz Walkowiak
Publisher	Springer
Pages	83-93
Number of pages	11
ISBN (Print)	978-3-319-91445-9
DOIs	https://doi.org/10.1007/978-3-319-91446-6_9
Publication status	Published - 2019
Event	International Conference on Dependability and Complex Systems DepCoS-RELCOMEX - Brunów, Poland Duration: 2 Jul 2018 → 6 Jul 2018 http://depcos.pwr.wroc.pl/

Publication series

Name	Advances in Intelligent Systems and Computing
Volume	761
ISSN (Print)	2194-5357

Conference

Conference	International Conference on Dependability and Complex Systems DepCoS-RELCOMEX
Country/Territory	Poland
City	Brunów
Period	02.07.2018 → 06.07.2018
Internet address	http://depcos.pwr.wroc.pl/

Keywords

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

Access to Document

10.1007/978-3-319-91446-6_9

Cite this

Bożejko, W., Gnatowski, A., Niżyński, T., Affenzeller, M., & Beham, A. (2019). Local Optima Networks in Solving Algorithm Selection Problem for TSP. In J. Kacprzyk, W. Zamojski, J. Mazurkiewicz, J. Sugier, & T. Walkowiak (Eds.), Contemporary Complex Systems and Their Dependability - Proceedings of the 13th International Conference on Dependability and Complex Systems DepCoS-RELCOMEX, 2018 (pp. 83-93). (Advances in Intelligent Systems and Computing; Vol. 761). Springer. https://doi.org/10.1007/978-3-319-91446-6_9

Bożejko, Wojciech ; Gnatowski, Andrzej ; Niżyński, Teodor et al. / Local Optima Networks in Solving Algorithm Selection Problem for TSP. Contemporary Complex Systems and Their Dependability - Proceedings of the 13th International Conference on Dependability and Complex Systems DepCoS-RELCOMEX, 2018. editor / Janusz Kacprzyk ; Wojciech Zamojski ; Jacek Mazurkiewicz ; Jaroslaw Sugier ; Tomasz Walkowiak. Springer, 2019. pp. 83-93 (Advances in Intelligent Systems and Computing).

@inproceedings{29ee37ea843149c781ab834bc177955a,

title = "Local Optima Networks in Solving Algorithm Selection Problem for TSP",

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.",

keywords = "algorithm selection, local optima networks, traveling salesman, fitness landscape, algorithm selection, local optima networks, traveling salesman, fitness landscape, Local optima networks, Algorithm selection problem, Travelling salesman problem, Fitness landscape analysis",

author = "Wojciech Bo{\.z}ejko and Andrzej Gnatowski and Teodor Ni{\.z}y{\'n}ski and Michael Affenzeller and Andreas Beham",

year = "2019",

doi = "10.1007/978-3-319-91446-6_9",

language = "English",

isbn = "978-3-319-91445-9",

series = "Advances in Intelligent Systems and Computing",

publisher = "Springer",

pages = "83--93",

editor = "Janusz Kacprzyk and Wojciech Zamojski and Jacek Mazurkiewicz and Jaroslaw Sugier and Tomasz Walkowiak",

booktitle = "Contemporary Complex Systems and Their Dependability - Proceedings of the 13th International Conference on Dependability and Complex Systems DepCoS-RELCOMEX, 2018",

address = "Germany",

note = "International Conference on Dependability and Complex Systems DepCoS-RELCOMEX ; Conference date: 02-07-2018 Through 06-07-2018",

url = "http://depcos.pwr.wroc.pl/",

}

Bożejko, W, Gnatowski, A, Niżyński, T, Affenzeller, M & Beham, A 2019, Local Optima Networks in Solving Algorithm Selection Problem for TSP. in J Kacprzyk, W Zamojski, J Mazurkiewicz, J Sugier & T Walkowiak (eds), Contemporary Complex Systems and Their Dependability - Proceedings of the 13th International Conference on Dependability and Complex Systems DepCoS-RELCOMEX, 2018. Advances in Intelligent Systems and Computing, vol. 761, Springer, pp. 83-93, International Conference on Dependability and Complex Systems DepCoS-RELCOMEX, Brunów, Poland, 02.07.2018. https://doi.org/10.1007/978-3-319-91446-6_9

Local Optima Networks in Solving Algorithm Selection Problem for TSP. / Bożejko, Wojciech; Gnatowski, Andrzej; Niżyński, Teodor et al.
Contemporary Complex Systems and Their Dependability - Proceedings of the 13th International Conference on Dependability and Complex Systems DepCoS-RELCOMEX, 2018. ed. / Janusz Kacprzyk; Wojciech Zamojski; Jacek Mazurkiewicz; Jaroslaw Sugier; Tomasz Walkowiak. Springer, 2019. p. 83-93 (Advances in Intelligent Systems and Computing; Vol. 761).

Research output: Chapter in Book/Report/Conference proceedings › Conference contribution

TY - GEN

T1 - Local Optima Networks in Solving Algorithm Selection Problem for TSP

AU - Bożejko, Wojciech

AU - Gnatowski, Andrzej

AU - Niżyński, Teodor

AU - Affenzeller, Michael

AU - Beham, Andreas

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

KW - algorithm selection

KW - local optima networks

KW - traveling salesman

KW - fitness landscape

KW - algorithm selection

KW - local optima networks

KW - traveling salesman

KW - fitness landscape

KW - Local optima networks

KW - Algorithm selection problem

KW - Travelling salesman problem

KW - Fitness landscape analysis

UR - http://www.scopus.com/inward/record.url?scp=85048041172&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-91446-6_9

DO - 10.1007/978-3-319-91446-6_9

M3 - Conference contribution

SN - 978-3-319-91445-9

T3 - Advances in Intelligent Systems and Computing

SP - 83

EP - 93

BT - Contemporary Complex Systems and Their Dependability - Proceedings of the 13th International Conference on Dependability and Complex Systems DepCoS-RELCOMEX, 2018

A2 - Kacprzyk, Janusz

A2 - Zamojski, Wojciech

A2 - Mazurkiewicz, Jacek

A2 - Sugier, Jaroslaw

A2 - Walkowiak, Tomasz

PB - Springer

T2 - International Conference on Dependability and Complex Systems DepCoS-RELCOMEX

Y2 - 2 July 2018 through 6 July 2018

ER -

Bożejko W, Gnatowski A, Niżyński T, Affenzeller M, Beham A. Local Optima Networks in Solving Algorithm Selection Problem for TSP. In Kacprzyk J, Zamojski W, Mazurkiewicz J, Sugier J, Walkowiak T, editors, Contemporary Complex Systems and Their Dependability - Proceedings of the 13th International Conference on Dependability and Complex Systems DepCoS-RELCOMEX, 2018. Springer. 2019. p. 83-93. (Advances in Intelligent Systems and Computing). doi: 10.1007/978-3-319-91446-6_9

Local Optima Networks in Solving Algorithm Selection Problem for TSP

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this