Útvonaltervezés heurisztikus módszerekkel –a hangyakolónia algoritmus

Szerzők

  • Gabriella Polyak Subotica Tech College of Applied Sciences
  • Miklós Póth Subotica Tech College of Applied Sciences

Kulcsszavak:

route planning, Excel Solver, ant colony algorithm, Formula 1

Absztrakt

The aim of this paper is to solve a route planning problem using a heuristic method. The basis of the work is the geographical coordinates of the grand prix locations of the Formula 1 race calendar, but the programs can also be run on any other publicly available data set. An extension of Microsoft Excel, Excel Solver, was used in the paper, as well as a program written in MATLAB, which uses the ant colony algorithm. 

Hivatkozások

[1] Stankovic, V. & Jovic, J (2006). Ekonomika – Problem trgovačkog putnika. vol. 52, br. 5-6, str. 198-202
[2] Liu, X., Fotouhi, A. & Auger, D. (2022). Application of advanced tree search and proximal policy optimization on formula-E race strategy development. DOI: https://doi.org/10.1016/j.eswa.2022.116718
[3] Laporte, G. (1992). The traveling salesman problem: An overview of exact and approximate algorithms. European Journal of Operational Research, 59(2), 231–247. doi:10.1016/0377-2217(92)90138-y
[4] Jünger, M., Reinelt, G., & Rinaldi, G. (1995). Chapter 4 The traveling salesman problem. Network Models, 225–330. doi:10.1016/s0927-0507(05)80121-5
[5] Kylie Bryant, Arthur Benjamin, Advisor, “Genetic Algorithms and the Traveling Salesman Problem”, Department of Mathematics, December 2000.
[6] Dahiya C. & Sangwan S. (2018). Literature Review on Travelling Salesman Problem, International Journal of Research - June 2018
[7] Dasic T., & Stanic M. (2014). Metode optimizacije – Grafovi algoritmi
[8] Dorigo, M., Birattari, M., & Stutzle, T. (2006). Ant colony optimization. IEEE Computational Intelligence Magazine, 1(4), 28–39. doi:10.1109/mci.2006.329691
[9] Sampaio, C., Bandeira, J. M., Macedo, E., Vilaça, M., Guarnaccia, C., Friedrich, B., Coelho, M. C. (2019). A Dynamic Link-based Eco-indicator for supporting equitable traffic management strategies. Transportation Research Procedia, 37, 43–50. doi:10.1016/j.trpro.2018.12.164
[10] https://wtf1.com/post/how-much-does-it-cost-to-host-an-f1-race/
[11] https://hu.motorsport.com/f1biz/news/mennyibe-kerulhet-egy-formula-1-es-auto/4392635/

##submission.downloads##

Megjelent

2024-02-27

Folyóirat szám

Évf. 6 szám 1 (2024): Bánki Közlemények/Bánki Reports Spring (2024)

Rovat

Technical Informatics (Műszaki Informatika)

License

Copyright (c) 2023 Bánki Közlemények (Bánki Reports)

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Bánki Közlemények is loyal to open access for academic work. All the original articles and review papers published in this journal are free to access immediately from the date of publication. We don’t charge any fees for any reader to download articles and reviews for their own scholarly use.

The Bánki Közlemények also operates under the Creative Commons Licence CC-BY-NC-ND. This allows for the reproduction of articles, free of charge, for non-commercial use only and with the appropriate citation information. All authors publishing with the Bánki Közlemények accept these as the terms of publication.