A PRACTICAL IMPLEMENTATION OF TIME-DEPENDENT FASTEST PATH ALGORITHM: A CASE STUDY OF BANGKOK ROAD NETWORK

Kriangsak Vanitchakornpong; Nakorn Indra-Payoong; Peerapol Sittivijan

Proceedings of ICLT 2015

A PRACTICAL IMPLEMENTATION OF TIME-DEPENDENT FASTEST PATH ALGORITHM: A CASE STUDY OF BANGKOK ROAD NETWORK

Kriangsak Vanitchakornpong; Nakorn Indra-Payoong; Peerapol Sittivijan

Faculty of Logistics, Burapha University, Thailand; Faculty of Logistics, Burapha University, Thailand; Faculty of Logistics, Burapha University, Thailand

International Conference on Logistics & Transport 2015, Lyon, France, pp. 9-16

Download PDF | View interactive page

Abstract

Shortest path algorithms e.g. Dijkstra and A* have been applied to business and industrial applications. Unit of measurement can be various in a shortest path algorithm. With distance, the algorithms try to find the path with shortest distance between a pair of origin and destination while in case of travel time, the algorithm try to find a path with minimum travel time or fastest path instead.

Keywords

logistics; transport; ASEAN-Europe

Citation

Kriangsak Vanitchakornpong; Nakorn Indra-Payoong; Peerapol Sittivijan (2015). A PRACTICAL IMPLEMENTATION OF TIME-DEPENDENT FASTEST PATH ALGORITHM: A CASE STUDY OF BANGKOK ROAD NETWORK. Proceedings of the International Conference on Logistics & Transport (ICLT 2015), Lyon, France, pp. 9-16.