Skip to main content

A Population Based Metaheuristic for the Minimum Latency Problem

  • Chapter
  • First Online:
Trends in Mathematics and Computational Intelligence

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

Abstract

In this paper we present a population based metaheuristic for solving the Minimum Latency Problem, which is the combination of bacterial evolutionary algorithm with local search techniques. The algorithm was tested on TSPLIB benchmark instances, and the results are competitive in terms of accuracy and runtimes with the state-of-the art methods. Except for two instances our algorithm found the best-known solution, and for the biggest tested instance it outperformed the best-known solution. The runtime was on average 30% faster than the most efficient method in the literature.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.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. Abeledo, H., Fukasawa, R., Pessoa, A., Uchoa, E.: The time dependent traveling salesman problem: polyhedra and algorithm. Math. Program. Comput. 5(1), 27–55 (2013)

    Article  MathSciNet  Google Scholar 

  2. Botzheim, J., Cabrita, C., Kóczy, L.T., Ruano, A.E.: Fuzzy rule extraction by bacterial me-metic algorithms. In: Proceedings of the 11th World Congress of International Fuzzy Systems Association, IFSA 2005, Beijing, China, pp. 1563–1568 (2005)

    Google Scholar 

  3. Farkas, M., Földesi, P., Botzheim, J., Kóczy, T.L.: Approximation of a modified traveling salesman problem using bacterial memetic algorithms. In: Towards Intelligent Engineering and Information Technology. SCI vol. 243, pp. 607–625. Springer, Berlin, Heidelberg (2009)

    Google Scholar 

  4. Holland, J.H.: Adaption in Natural and Artificial Systems. The MIT Press, Cambridge (1992)

    Google Scholar 

  5. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks (ICNN 1995), Perth, WA, Australia, vol. 4, pp. 1942–1948 (1995)

    Google Scholar 

  6. 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. (2017)

    Google Scholar 

  7. 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), Vancouver, Canada, pp. 3261–3267 (2016)

    Google Scholar 

  8. Moscato, P.: On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts -Towards Memetic Algorithms. Technical Report Caltech Concurrent Computation Program, Report. 826, California Institute of Technology, Pasadena, USA (1989)

    Google Scholar 

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

    Article  Google Scholar 

  10. Salehipour, A., Sörensen, K., Goos, P., Bräysy, O.: Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem. 4OR: A Q. J. Oper. Res. 9(2), 189–209 (2011)

    Article  MathSciNet  Google Scholar 

  11. Silva, M.M., Subramanian, A., Vidal, T., Ochi, L.S.: A simple and effective metaheuristic for the minimum Latency problem. Eur. J. Oper. Res. 221(3), 513–520 (2012)

    Article  Google Scholar 

  12. 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), Bandar Seri Begawan, Brunei, pp. 27–38 (2017)

    Google Scholar 

Download references

Acknowledgements

This research was supported by the National Research, Development and Innovation Office (NKFIH) K108405 and by the EFOP-3.6.2-16-2017-00015 “HU-MATHS-IN-Intensification of the activity of the Hungarian Industrial Innovation Service Network” grant.

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

Author information

Authors and Affiliations

Authors

Corresponding author

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

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 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. (2019). A Population Based Metaheuristic for the Minimum Latency Problem. In: Cornejo, M., Kóczy, L., Medina, J., De Barros Ruano, A. (eds) Trends in Mathematics and Computational Intelligence. Studies in Computational Intelligence, vol 796. Springer, Cham. https://doi.org/10.1007/978-3-030-00485-9_13

Download citation

Publish with us

Policies and ethics