Vehicle routing based on traffic cost at intersection

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Road/route searching problems have been investigated traditionally as one of the most basic/interesting issues for our human activities. In particular, the computer-supported route planning systems such as a car navigation system are usable in a wide range of applications. In this paper, we address a traffic route planning system to make the cost-effective driving time possible in comparison with the shortest route selection. Our idea is to compute the waiting time occurred by traffic signals at intersection and estimate the total driving time by the waiting time and ordinary running time for shortest route. In order to attain this objective, we distinguish the external link for road segment and the internal link which is three direction-dependent paths in inside of intersection: right-turn, straight and left-turn. Namely, the internal link is introduced to manipulate the waiting time in inside of intersection in addition to the conventional external link. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Watanabe, T., & Lijiao, C. (2011). Vehicle routing based on traffic cost at intersection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6682 LNAI, pp. 592–601). https://doi.org/10.1007/978-3-642-22000-5_61

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free