A new Probabilistic Extension of Dijkstra’s Algorithm to simulate more realistic traffic flow in a smart city

José L. Galán-García, Gabriel Aguilera-Venegas, María Á. Galán-García and Pedro Rodríguez-Cielos

Applied Mathematics and Computation, 2015, vol. 267, issue C, 780-789

Abstract: Dijkstra’s algorithm to solve the shortest path problem (SPP) is a very well-known algorithm. When applied to real situations, although the shortest path can be computed with Dijkstra’s algorithm, it is not always the one that is chosen. In traffic situations, for example, the driver may not know the exact length of the lanes or the shortest path to follow. Even more compelling is the fact that although the driver knows the shortest route, he/she may prefer choosing a different route.

Keywords: Extension of Dijkstra’s Algorithm; Accelerated-time simulations; Smart cities; Probabilistic algorithms (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300314016087
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:267:y:2015:i:c:p:780-789

DOI: 10.1016/j.amc.2014.11.076

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().