Skip to main content
SpringerLink
Log in

The Discrete Bacterial Memetic Evolutionary Algorithm for Solving the One-Commodity Pickup-and-Delivery Traveling Salesman Problem

  • Chapter
  • First Online:
Book cover Computational Intelligence and Mathematics for Tackling Complex Problems

Part of the book series: Studies in Computational Intelligence ((SCI,volume 819))

Abstract

In this paper we propose a population based memetic algorithm, the Discrete Bacterial Memetic Evolutionary Algorithm for solving the one-commodity Pickup-and-Delivery Traveling Salesman Problem. The algorithm was tested on benchmark instances up to 100 nodes, and the results were compared with the state-of-the art methods in the literature. For all instances the DBMEA found optimal or close-optimal solutions.

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

Access this chapter

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 109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 139.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

References

  1. Hernández-Pérez, H., Salazar-González, J.J.: Heuristics for the one-commodity pickup-and-delivery travelling salesman problem. Trans. Sci. 38, 245–255 (2004)

    Article  Google Scholar 

  2. Kóczy, L.T., Földesi, P., Tüű-Szabó, B.: A discrete bacterial memetic evolutionary algorithm for the traveling salesman problem. In: IEEE World Congress on Computational Intelligence (WCCI 2016), pp. 3261–3267. Vancouver, Canada, (2016)

    Google Scholar 

  3. Kóczy, L.T., Földesi, P., Tüű-Szabó, B.: An effective discrete bacterial memetic evolutionary algorithm for the traveling salesman problem. Int. J. Intell. Syst. 32(8), 862–876 (2017)

    Article  Google Scholar 

  4. Tüű-Szabó, B., Földesi, P., Kóczy, T.L.: Improved discrete bacterial memetic evolutionary algorithm for the traveling salesman problem. In: Proceedings of the Computational Intelligence in Information Systems Conference (CIIS 2016) pp. 27–38. Bandar Seri Begawan, Brunei (2017)

    Google Scholar 

  5. Kóczy, L.T., Földesi, P., Tüű-Szabó, B.: Enhanced discrete bacterial memetic evolutionary algorithm-an efficacious metaheuristic for the traveling salesman optimization, Information Sciences (2017)

    Google Scholar 

  6. Tüű-Szabó, B., Földesi, P., Kóczy, T.L.: Discrete bacterial memetic evolutionary algorithm for the time dependent traveling salesman problem In: International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU2018, pp. 523–533. Cádiz, Spain, (2018)

    Google Scholar 

  7. Moscato, P.: On Evolution, search, optimization, genetic algorithms and martial arts—Towards memetic algorithms. In: Technical Report Caltech Concurrent Computation Program, Report. 826, California Institute of Technology, Pasadena, USA (1989)

    Google Scholar 

  8. Nawa, N.E., Furuhashi, T.: Fuzzy system parameters discovery by bacterial evolutionary algorithm. IEEE Tr. Fuzzy Syst. 7, 608–616 (1999)

    Article  Google Scholar 

  9. Mladenovic, N., Uroševic, D., Hanafi, S., Ilic, A.: A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. Eur. J. Oper. Res. 220, 270–285 (2012)

    Article  MathSciNet  Google Scholar 

  10. Zhao, F., Li, S., Sun, J., Mei, D.: Genetic algorithm for the one-commodity pickup-and-delivery travelling salesman problem. Comput. Ind. Eng. 56, 1642–1648 (2009)

    Article  Google Scholar 

  11. Hernández-Pérez, H., Rodríguez-Martín, I., Salazar-González, J.J.: A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery travelling salesman problem. Comput. Oper. Res. 36, 1639–1645 (2009)

    Article  Google Scholar 

  12. Hernández-Pérez, H., Salazar-González, J.J.: A branch-and-cut algorithm for a travelling salesman problem with pickup and delivery. Discrete Appl. Math. 145, 126–139 (2004)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The research presented in this paper was funded by the Higher Education Institutional Excellence Program.

This research was supported by the National Research, Development and Innovation Office (NKFIH) K124055.

Supported by the ÚNKP-17-3 New National Excellence Program of the Ministry of Human Capacities.

Author information

Authors and Affiliations

  1. Department of Information Technology, Széchenyi István University, Győr, Hungary

    Boldizsár Tüű-Szabó & László T. Kóczy

  2. Department of Logistics, Széchenyi István University, Győr, Hungary

    Péter Földesi

  3. Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Budapest, Hungary

    László T. Kóczy

Authors
  1. Boldizsár Tüű-Szabó
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Péter Földesi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. László T. Kóczy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Boldizsár Tüű-Szabó .

Editor information

Editors and Affiliations

  1. Faculty of Engineering Sciences, Széchenyi István University, Gyõr, Hungary

    László T Kóczy

  2. Science Faculty, Department of Mathematics, University of Cádiz, Cádiz, Spain

    Jesús Medina-Moreno

  3. Faculty of Economic and Business Sciences, Department of Mathematics, University of Cádiz, Cádiz, Spain

    Eloísa Ramírez-Poussa

  4. Institute of Mathematics and Computer Science, University of Latvia, Riga, Latvia

    Alexander Šostak

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Tüű-Szabó, B., Földesi, P., Kóczy, L.T. (2020). The Discrete Bacterial Memetic Evolutionary Algorithm for Solving the One-Commodity Pickup-and-Delivery Traveling Salesman Problem. In: Kóczy, L., Medina-Moreno, J., Ramírez-Poussa, E., Šostak, A. (eds) Computational Intelligence and Mathematics for Tackling Complex Problems. Studies in Computational Intelligence, vol 819. Springer, Cham. https://doi.org/10.1007/978-3-030-16024-1_3

Download citation

Publish with us

Policies and ethics

Search

Navigation