Skip to main content
SpringerLink
Log in

Algorithms for path optimizations: a short survey

  • Regular Paper
  • Published:
Computing Aims and scope Submit manuscript

Abstract

Path finding is used to solve the problem of finding a traversable path through an environment with obstacles. This problem can be seen in many different fields of study and these areas rely on fast and efficient path finding algorithms. This paper aims to describe and review state of the art optimization techniques that are used on optimized path finding and compare their performances. Moreover, a special attention is paid on the proposed approaches to identify how they are tested on different test cases; whether the test cases are automatically generated or benchmark instances. The review opens avenues about the importance of automatic test case generation to test the different path finding algorithms.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Thantulage G, Kalganova T, Fernando WAC(2006) A grid-based ant colony algorithm for automatic 3d hose routing, In: 2006 IEEE International conference on evolutionary computation, pp. 48–55,

  2. Alwis P, Premarathna A, Fonseka Y, Samarasinghe S, Wijayakulasooriya J (2014) Automated printed circuit board (pcb) drilling machine with efficient path planning, 01

  3. Lin CW, Rao L, Giusto P, D’Ambrosio J, Vincentelli A (2014) An efficient wire routing and wire sizing algorithm for weight minimization of automotive systems, 06

  4. Omar R, Gu DW (2010) 3d path planning for unmanned aerial vehicles using visibility line based method. 1(01), pp. 80–85,

  5. Bai J, Lian S, Liu Z, Wang K, Liu D (2018) Deep learning based robot for automatically picking up garbage on the grass. IEEE Trans Cons Electr 64:382–389

    Article  Google Scholar 

  6. Thantulage G, Kalganova T, Wilson M (2008) Grid based and random based ant colony algorithms for automatic hose routing in 3d space. Trans Eng, Comp Technol, Int J Appl Sci 14:02

    Google Scholar 

  7. Bonyadi MR, Michalewicz Z (2017) Particle swarm optimization for single objective continuous space problems: a review

  8. Ariyaratne MKA, Pemarathne WPJ (2015) A review of recent advancements of firefly algorithm; a modern nature inspired algorithm

  9. Paulinas M, Ušinskas A (2007) A survey of genetic algorithms applications for image enhancement and segmentation. Info Technol Contr 36:278–284

  10. Chakraborty UK (2008) Advances in differential evolution, vol 143. Springer, Berlin

    Book  MATH  Google Scholar 

  11. Cordón García O, Herrera Triguero F, Stützle T (2002) A review on the ant colony optimization metaheuristic: basis, models and new trends. Mathw Soft Comput 9:2–3

    MATH  MathSciNet  Google Scholar 

  12. Ariyasingha I, Fernando T (2017) Random weight-based ant colony optimisation algorithm for the multi-objective optimisation problems. Int J Swarm Intell 3(01):77

    Article  Google Scholar 

  13. Pemarathne WPJ, Fernando TGI (2019) Optimizing the electrical wire routing through multiple points using multi-objective ant colony algorithms for electrical wire routing (moacs-ewr), In: 2019 14th Conference on industrial and information systems (ICIIS), pp. 494–499

  14. Mohammed MA, Ghani M K Abd, Hamed RI, Mostafa SA, Ahmad MS, Ibrahim DA (2017) Solving vehicle routing problem by using improved genetic algorithm for optimal solution. J Computat Sci 21:255–262

  15. Kwaśniewski K, Gosiewski Z (2018) Genetic algorithm for mobile robot route planning with obstacle avoidance. Acta Mechanica et Automatica 12(06):151–159

    Article  Google Scholar 

  16. Dewang H, Mohanty P, Kundu S (2018) A robust path planning for mobile robot using smart particle swarm optimization. Procedia Comp Sci 133(01):290–297

    Article  Google Scholar 

  17. Nazari M, Oroojlooy A, Snyder LV, Takáč M (2018) Reinforcement learning for solving the vehicle routing problem. Adv Neural Inf Proc Sys 31

  18. Kumar KA, Verma S, Paul T, Yoshida T (2019) Rl solver pro: reinforcement learning for solving vehicle routing problem, 09, pp. 94–99. https://doi.org/10.1109/AiDAS47888.2019.8970890

  19. Bae H, Gidong K, Kim J, Qian D, Lee S (2019) Multi-robot path planning method using reinforcement learning. Appl Sci 9(07):3057

    Article  Google Scholar 

  20. Miki S, Yamamoto D, Ebara H (2018) Applying deep learning and reinforcement learning to traveling salesman problem, pp. 65–70, 08

  21. Abiyev R, Arslan M, Gunsel I, Cagman A (2017) Robot pathfinding using vision based obstacle detection. pp. 1–6, 06

  22. Gaya J, Gonçalves L, Duarte A, Zanchetta B, Drews-Jr P, Botelho S (2016) Vision-based obstacle avoidance using deep learning. In 2016 XIII Latin American Robotics Symposium and IV Brazilian Robotics Symposium (LARS/SBR) pp. 7–12. https://doi.org/10.1109/LARS-SBR.2016.9

  23. Liao H, Zhang W, Dong X, Póczos B, Shimada K, Kara L (2019) A deep reinforcement learning approach for global routing, arXiv.abs/1906.08809,

  24. Laghmara H, Boudali M.-T, Laurain T, Ledy J, Orjuela R, Lauffenburger J.-P, Basset M (2019) Obstacle avoidance, path planning and control for autonomous vehicles, pp. 529–534, 06

  25. Xie D, Xu Y, Wang R (2019) Obstacle detection and tracking method for autonomous vehicle based on three-dimensional lidar. Int J Adv Robot Sys 16(03):172988141983158

    Article  Google Scholar 

  26. Ganguly S, Das S (2013) A novel ant colony optimization algorithm for the vehicle routing problem. In: Panigrahi BK, Suganthan PN, Das S, Dash SS (eds) Swarm, evolutionary and memetic computing. Springer, Cham, pp 401–412

    Chapter  Google Scholar 

  27. Brand M, Masuda M, Wehner N, Yu X-H (2010) Ant colony optimization algorithm for robot path planning. Int Conf Comp Design Appl 3:V3-436

    Google Scholar 

  28. Ouaarab A, Ahiod B, Yang X-S (2013) Discrete cuckoo search algorithm for the travelling salesman problem. Neur Comp Appl 24:1659–1669

    Article  Google Scholar 

  29. Yusof Z, Hong T, Zainal AAF, Salam M, Adam A, Khalil K, Mukred J, Husin N. Shaikh, Ibrahim Z (2011) A two-step binary particle swarm optimization approach for routing in VLSI with iterative RLC delay model, 09

  30. Maire BL, Mladenov V (2012) Comparison of neural networks for solving the travelling salesman problem, 09

  31. Abdel-Moetty S (2010) Traveling salesman problem using neural network techniques, pp. 1–6, 04

  32. Vanneste S, Bellekens B, Weyn M (2014) 3dvfh+: real-time three-dimensional obstacle avoidance using an octomap, 1319, 07

  33. Thantulage G, Kalganova T, Wilson M (2008) Grid based and random based ant colony algorithms for automatic hose routing in 3d space. Int J Comp Info Eng 2(2):510–516

    Google Scholar 

  34. ma X, Iida K, Xie M, Nishino J, Odaka T, Ogura H (2006) A genetic algorithm for the optimization of cable routing,. Sys Comp Japan 37(06):61–71

    Article  Google Scholar 

  35. Sandurkar S, Chen W (2000) Gaprus - genetic algorithms based pipe routing using tessellated objects. Comp Ind 38(08):209–223

    Google Scholar 

  36. Khan M, Khiyal S (2004) Obstacle avoidance and self-localization system for autonomous vehicles. IFAC Proceed Vol 37(07):519–524

    Article  Google Scholar 

  37. Angus D (2007) Crowding population-based ant colony optimisation for the multi-objective travelling salesman problem, 2007 IEEE Symposium on computational intelligence in multi-criteria decision-making, pp. 333–340

  38. Tan X, Zhuo X, Zhang J (2006) Ant colony system for optimizing vehicle routing problem with time windows (vrptw). In: Huang DS, Li K, Irwin GW (eds) Computational intelligence and bioinformatics. Springer, Berlin and Heidelberg, pp 33–38

    Chapter  Google Scholar 

  39. Pinto D, Barán B (2006) Multiobjective multicast routing with ant colony optimization. In: Gaiti D (ed) Network control and engineering for Qos Security and Mobility. Springer, Boston, pp 101–115

    Chapter  Google Scholar 

  40. Chen SM, Chien C-Y (2011) Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. Exp Sys Appl 38(12):14439–14450

    Article  Google Scholar 

  41. Shi X, Liang Y, Lee H, Lu C, Wang Q (2007) Particle swarm optimization-based algorithms for tsp and generalized tsp. Infor Process Lett 103(5):169–176

    Article  MATH  MathSciNet  Google Scholar 

  42. Bello I, Pham H, Le Q. V, Norouzi M, Bengio S (2016) Neural combinatorial optimization with reinforcement learning, arXiv:abs/1611.09940

  43. Yu B, Yang Z-Z, Yao B (2009) An improved ant colony optimization for vehicle routing problem. Eur J Operat Res 196(1):171–176

    Article  MATH  Google Scholar 

  44. Honglin Y, Jijun Y (2002) An improved genetic algorithm for the vehicle routing problem

  45. Rego C, Roucairol C (1996) A parallel tabu search algorithm using ejection chains for the vehicle routing problem. Springer, Boston, MA, pp 661–675

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Faculty of Computing, General Sir John Kotelawala Defence University, Rathmalana, Sri Lanka

    S C M S De Sirisuriya

  2. Faculty of Graduate Studies, University of Sri Jayewardenepura, Nugegoda, Sri Lanka

    S C M S De Sirisuriya

  3. Department of Computer Science, Faculty of Applied Sciences, University of Sri Jayewardenepura, Nugegoda, Sri Lanka

    T G I Fernando & M K A Ariyaratne

Authors
  1. S C M S De Sirisuriya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T G I Fernando
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M K A Ariyaratne
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S C M S De Sirisuriya.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

De Sirisuriya, S.C.M.S., Fernando, T.G.I. & Ariyaratne, M.K.A. Algorithms for path optimizations: a short survey. Computing 105, 293–319 (2023). https://doi.org/10.1007/s00607-022-01126-w

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-022-01126-w

Keywords

Mathematics Subject Classification

Search

Navigation