Skip to main content
SpringerLink
Log in

A Comparative Study of Different Variants of a Memetic Algorithm for ATSP

  • Conference paper
  • First Online:
Computational Collective Intelligence (ICCCI 2017)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10449))

Included in the following conference series:

Abstract

In this paper we present a computational study of how different local search methods and the choice of an algorithm stage in which they are applied affect the performance of Memetic Algorithm (MA) solving Asymmetric Traveling Salesman Problem (ATSP). This study contains a comparison of quality of solutions obtained (both in terms of the value of the objective function and the performance time of the method) by sixteen variants of the Memetic Algorithm. Considerable amount of a given problem’s instance and Wilcoxon Signed-Rank Test were used to ensure the impartiality of gained results.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Castillo, P., Arenas, M., Castellano, J., Merelo, J., Prieto, A., Rivas, V., Romero, G.: Lamarckian Evolution and the Baldwin Effect in Evolutionary Neural Networks (2006). http://www.arxiv.org/PS_cache/cs/pdf/0603/0603004v1.pdf

  2. Dawkins, R.: The Selfish Gene. Oxford University Press, Oxford (1976)

    Google Scholar 

  3. Dib, O., Manier, M., Caminada, A.: Memetic algorithm for computing shortest paths in multimodal transportation networks. Transp. Res. Procedia 10, 745–755 (2015)

    Article  Google Scholar 

  4. Held, M., Hoffman, A., Johnson, E., Wolfe, P.: Aspects of the traveling salesman problem. IBM J. Res. Dev. 28(4), 476–486 (1984)

    Article  MathSciNet  Google Scholar 

  5. Larranaga, P., Kuijpers, C.M.H., Murga, R.H., Inza, I., Dizdarevic, S.: Genetic algorithms for the travelling salesman problem: a review of representations and operators. Artif. Intell. Rev. 13(2), 129–170 (1999)

    Article  Google Scholar 

  6. Lau, H., Agussurja, L., Cheng, S., Pang Jin, T.: A multi-objective memetic algorithm for vehicle resource allocation in sustainable transportation planning. In: International Joint Conference on Artificial Intelligence (IJCAI 2013), Beijing, China, 3–9 August 2013, pp. 2833–2839 (2013)

    Google Scholar 

  7. Moscato, P.: On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts - Towards Memetic Algorithms (1989)

    Google Scholar 

  8. Mrowczynska, B., Nowakowski, P.: Optymalizacja tras przejazdu przy zbiorce zuzytego sprzetu elektrycznego i elektronicznego dla zadanych lokalizacji punktow zbiorki. Czasopismo Logistyka 2, 593–604 (2015)

    Google Scholar 

  9. Pataki, G.: The bad and the good-and-ugly: formulations for the traveling salesman problem. Technical report CORC 2000–1 (2000)

    Google Scholar 

  10. Shaikh, M., Panchal, M.: Solving asymmetric travelling salesman problem using memetic algorithm. Int. J. Emerg. Technol. Adv. Eng. 2(11), 634–639 (2012)

    Google Scholar 

  11. Syberfeldt, A., Rogstrom, J., Geertsen, A.: Simulation-based optimization of a real-world travelling salesman problem using an evolutionary algorithm with a repair function. Int. J. Artif. Intell. Expert Syst. (IJAE) 6(3), 27–39 (2015)

    Google Scholar 

  12. Zakir, A.: Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator. Int. J. Biometrics Bioinform. (IJBB) 3(6), 96–105 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Silesia, Bedzinska 39, 41-205, Sosnowiec, Poland

    Krzysztof Szwarc & Urszula Boryczka

Authors
  1. Krzysztof Szwarc
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Urszula Boryczka
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Krzysztof Szwarc .

Editor information

Editors and Affiliations

  1. Department of Information Systems, Faculty of Computer Science and Management, Wrocław University of Science and Technology, Wrocław, Poland

    Ngoc Thanh Nguyen

  2. Department of Computer Science, University of Cyprus, Nicosia, Cyprus

    George A. Papadopoulos

  3. Department of Information Systems, Gdynia Maritime University, Gdynia, Poland

    Piotr Jędrzejowicz

  4. Department of Information Systems, Faculty of Computer Science and Management, Wrocław University of Science and Technology, Wrocław, Poland

    Bogdan Trawiński

  5. Department of Information Systems, University of Münster, Münster, Germany

    Gottfried Vossen

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Szwarc, K., Boryczka, U. (2017). A Comparative Study of Different Variants of a Memetic Algorithm for ATSP. In: Nguyen, N., Papadopoulos, G., Jędrzejowicz, P., Trawiński, B., Vossen, G. (eds) Computational Collective Intelligence. ICCCI 2017. Lecture Notes in Computer Science(), vol 10449. Springer, Cham. https://doi.org/10.1007/978-3-319-67077-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67077-5_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67076-8

  • Online ISBN: 978-3-319-67077-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation