Efficient many-to-many path planning and the Traveling Salesman Problem on road networks
Jörg Roth · International Journal of Knowledge-based and Intelligent Engineering Systems · 2016
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 some scenarios, however, we want to comput