Algorithms for path optimizations: a short survey

DOI10.1007/S00607-022-01126-WMaRDI QIDQ6488103zbMATH OpenFDO

Authors T. G. I. Fernando

Publication date 24 March 2023

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00607-022-01126-W

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The shortest-path problem. Analysis and comparison of methods
• Optimal path finding in direction, location, and time dependent environments
• A heuristic optimization path-finding algorithm based on Dijkstra algorithm
• A new approach in agent path-finding using state mark gradients
• scientific article; zbMATH DE number 2117038

Cites work

• Advances in differential evolution
• An improved ant colony optimization for vehicle routing problem
• scientific article; zbMATH DE number 1054962 (Why is no real title available?)
• Particle swarm optimization-based algorithms for TSP and generalized TSP

Cited in

(2)

• A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation.
• scientific article; zbMATH DE number 2096648 (Why is no real title available?)

This page was built for publication: Algorithms for path optimizations: a short survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488103)