Skip to main content
SpringerLink
Log in
Book cover

International Conference on Dependability and Complex Systems

DepCoS-RELCOMEX 2018: Contemporary Complex Systems and Their Dependability pp 83–93Cite as

Local Optima Networks in Solving Algorithm Selection Problem for TSP

  • Conference paper
  • First Online:

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 761))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    https://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/.

  2. 2.

    https://developers.google.com/optimization/.

  3. 3.

    https://www.cs.waikato.ac.nz/~ml/weka/.

References

  1. Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton Series in Applied Mathematics. Princeton University Press, Princeton (2006)

    MATH  Google Scholar 

  2. Bożejko, W., Gnatowski, A., Idzikowski, R., Wodecki, M.: Cyclic flow shop scheduling problem with two-machine cells. Arch. Control Sci. 27(2), 151–167 (2017)

    Article  MathSciNet  Google Scholar 

  3. Bożejko, W., Gnatowski, A., Niżyński, T., Wodecki, M.: Tabu search algorithm with neural tabu mechanism for the cyclic job shop problem. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) Artificial Intelligence and Soft Computing, pp. 409–418. Springer, Cham (2016)

    Google Scholar 

  4. Bożejko, W., Gnatowski, A., Pempera, J., Wodecki, M.: Parallel tabu search for the cyclic job shop scheduling problem. Comput. Ind. Eng. 113, 512–524 (2017)

    Article  Google Scholar 

  5. Bożejko, W., Pempera, J., Wodecki, M.: Parallel simulated annealing algorithm for cyclic flexible job shop scheduling problem. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) Artificial Intelligence and Soft Computing, pp. 603–612. Springer, Cham (2015)

    Chapter  Google Scholar 

  6. Chaudhry, I.A., Khan, A.A.: A research survey: review of flexible job shop scheduling techniques. Int. Trans. Oper. Res. 23(3), 551–591 (2016)

    Article  MathSciNet  Google Scholar 

  7. Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791–812 (1958)

    Article  MathSciNet  Google Scholar 

  8. Iclanzan, D., Daolio, F., Tomassini, M.: Data-driven local optima network characterization of QAPLIB instances. In: Proceedings of the 2014 Conference on Genetic and Evolutionary Computation, GECCO 2014, pp. 453–460. ACM Press, New York (2014)

    Google Scholar 

  9. Jana, N.D., Sil, J., Das, S.: Selection of appropriate metaheuristic algorithms for protein structure prediction in AB off-lattice model: a perspective from fitness landscape analysis. Inf. Sci. 391–392, 28–64 (2017)

    Article  Google Scholar 

  10. Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. In: Bessiere, C., De Raedt, L., Kotthoff, L., Nijssen, S., O’Sullivan, B., Pedreschi, D. (eds.) Data Mining and Constraint Programming: Foundations of a Cross-Disciplinary Approach, pp. 149–190. Springer, Cham (2016)

    Chapter  Google Scholar 

  11. Ochoa, G., Veerapen, N.: Additional dimensions to the study of funnels in combinatorial landscapes. In: Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, GECCO 2016, pp. 373–380. ACM Press, New York (2016)

    Google Scholar 

  12. Ochoa, G., Veerapen, N.: Mapping the global structure of TSP fitness landscapes. J. Heuristics 1–30 (2017)

    Google Scholar 

  13. Ochoa, G., Verel, S., Daolio, F., Tomassini, M.: Local optima networks: a new model of combinatorial fitness landscapes. In: Richter, H., Engelbrecht, A. (eds.) Recent Advances in the Theory and Application of Fitness Landscapes, pp. 233–262. Springer, Heidelberg (2014). Chapter 9

    Chapter  Google Scholar 

  14. Pitzer, E., Beham, A., Affenzeller, M.: Automatic algorithm selection for the quadratic assignment problem using fitness landscape analysis. In: Proceedings of the 13th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2013, pp. 109–120. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  15. Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65–118 (1976)

    Article  Google Scholar 

  16. Smith-Miles, K.A.: Neural networks for prediction and classification. In: Wang, J. (ed.) Encyclopaedia of Data Warehousing and Mining, pp. 865–869. Information Science Publishing (2006)

    Google Scholar 

  17. Smith-Miles, K.A.: Towards insightful algorithm selection for optimisation using meta-learning concepts. In: IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence), pp. 4118–4124. IEEE, June 2008

    Google Scholar 

  18. Stadler, P.F.: Fitness landscapes. In: Lässig, M., Valleriani, A. (eds.) Biological Evolution and Statistical Physics, pp. 183–204. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  19. Thomson, S.L., Ochoa, G., Daolio, F., Veerapen, N.: The effect of landscape funnels in QAPLIB instances. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2017, pp. 1495–1500. ACM Press, New York (2017)

    Google Scholar 

  20. Tomassini, M., Verel, S., Ochoa, G.: Complex-network analysis of combinatorial spaces: the NK landscape case. Phys. Rev. E 78(6), 066114 (2008)

    Article  Google Scholar 

  21. Vaishnav, P., Choudhary, N., Jain, K.: Traveling salesman problem using genetic algorithm: a survey. Int. J. Sci. Res. Comput. Sci. Eng. Inf. Technol. 3(3), 105–108 (2017)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Automatics, Mechatronics and Control Systems, Wrocław University of Science and Technology, 11–17 Janiszewskiego St., 50-372, Wrocław, Poland

    Wojciech Bożejko, Andrzej Gnatowski & Teodor Niżyński

  2. Heuristic and Evolutionary Algorithms Laboratory, University of Applied Sciences Upper Austria, Softwarepark 11, 4232, Hagenberg, Austria

    Michael Affenzeller & Andreas Beham

  3. Institute for Formal Models and Verification, Johannes Kepler University Linz, Altenberger Straße 69, Linz, Austria

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

Authors
  1. Wojciech Bożejko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej Gnatowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Teodor Niżyński
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Michael Affenzeller
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Andreas Beham
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wojciech Bożejko .

Editor information

Editors and Affiliations

  1. Department of Computer Engineering, Wrocław University of Technology, Wrocław, Poland

    Wojciech Zamojski

  2. Department of Computer Engineering, Wrocław University of Technology, Wrocław, Poland

    Jacek Mazurkiewicz

  3. Department of Computer Engineering, Wrocław University of Technology, Wrocław, Poland

    Jarosław Sugier

  4. Department of Computer Engineering, Wrocław University of Technology, Wrocław, Poland

    Tomasz Walkowiak

  5. Polish Academy of Sciences, Systems Research Institute, Warsaw, Poland

    Janusz Kacprzyk

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

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: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds) Contemporary Complex Systems and Their Dependability. DepCoS-RELCOMEX 2018. Advances in Intelligent Systems and Computing, vol 761. Springer, Cham. https://doi.org/10.1007/978-3-319-91446-6_9

Download citation

Publish with us

Policies and ethics

Search

Navigation