(function(doc, html, url) { var widget = doc.createElement("div"); widget.innerHTML = html; var script = doc.currentScript; // e = a.currentScript; if (!script) { var scripts = doc.scripts; for (var i = 0; i < scripts.length; ++i) { script = scripts[i]; if (script.src && script.src.indexOf(url) != -1) break; } } script.parentElement.replaceChild(widget, script); }(document, '

Wayfinding from multiple starts to multiple targets

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.

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.

Read more on Kudos…
The following have contributed to this page:
Jörg Roth
' ,"url"));