Estimation and determination of shortest path length in a road network with obstacles
From MaRDI portal
Publication:1388932
DOI10.1016/0377-2217(94)00015-5zbMath0903.90060OpenAlexW2127989417MaRDI QIDQ1388932
Frédéric Semet, Nicolas Dubois
Publication date: 11 June 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)00015-5
Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)
Related Items (4)
Acceleration of the A*-Algorithm for the Shortest Path Problem in Digital Road Maps ⋮ A study on the effect of the asymmetry on real capacitated vehicle routing problems ⋮ The effect of the asymmetry of road transportation networks on the traveling salesman problem ⋮ \(L_{1}\) cheapest paths in ``Fjord scenery
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Estimating road distances by mathematical functions
- An improvement of Dijkstra's method for finding a shortest path in a graph
- Mathematical Models of Road Travel Distances
- The Development of Linear Distance Functions for Distribution Analysis
This page was built for publication: Estimation and determination of shortest path length in a road network with obstacles
