Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Journal of the ACM (JACM)
On finding minimum routes in a network with turn penalties
Communications of the ACM
Modeling Costs of Turns in Route Planning
Geoinformatica
Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights
Transportation Science
| Hi-index | 0.00 |
Shortest path problems are simple yet rich in applications in many areas including spatial information theory and geographic information science. Though they explicitly or implicitly involve some object that travels in a given network, existing algorithms and applications tend to focus only on geometric properties of the network (e.g. arc length and connectivity), and overlook physical properties of the object (e.g. velocity and acceleration) which may not be constant during a trip. This paper introduces a physical perspective to shortest path search by enforcing laws of motion, to enhance the estimation of travel times and the search for optimal paths with respect to physical quantities rather than socio-economic values.