What is it about?
To compute optimal paths between locations in road networks is an important operation for e.g. transport business. Efficient algorithms for path planning usually assume a single start and a single target. In this paper, we present an approach that computes all paths from multiple starts to multiple targets in one step. This is important, e.g. to compute shortest roundtrips.
Featured Image
Why is it important?
This approach can be applied to numerous problems in the area of road planning. E.g. for a transport company we could request an optimal round-trip from the warehouse to all clients and back to the warehouse, or from multiple storages to multiple clients.
Perspectives
This was in important problem in the area of route planning and worthwhile to solve.
Prof Jörg Roth
Nuremberg Institute of Technology
Read the Original
This page is a summary of: Efficient many-to-many path planning and the Traveling Salesman Problem on road networks, International Journal of Knowledge-based and Intelligent Engineering Systems, July 2016, IOS Press,
DOI: 10.3233/kes-160339.
You can read the full text:
Resources
Contributors
The following have contributed to this page
