Chintu, Schmidt Shilukobo, Anthony, Richard, Roshanaei, Maryam and Ierotheou, Constantinos (2014) Intelligent and predictive vehicular networks. Intelligent Control and Automation, 05 (02). pp. 60-71. ISSN 2153-0653 (Print), 2153-0661 (Online) (doi:https://doi.org/10.4236/ica.2014.52007)

Preview

PDF (Publisher's PDF (Open Access)) 15684 ANTHONY_Vehicular_Networks_2014.pdf - Published Version Available under License Creative Commons Attribution. Download (668kB) | Preview

Abstract

Seeking shortest travel times through smart algorithms may not only optimize the travel times but also reduce carbon emissions, such as CO2, CO and Hydro-Carbons. It can also result in reduced driver frustrations and can increase passenger expectations of consistent travel times, which in turn points to benefits in overall planning of day schedules. Fuel consumption savings are another benefit from the same. However, attempts to elect the shortest path as an assumption of quick travel times, often work counter to the very objective intended and come with the risk of creating a “Braess Paradox” which is about congestion resulting when several drivers attempt to elect the same shortest route. The situation that arises has been referred to as the price of anarchy! We propose algorithms that find multiple shortest paths between an origin and a destination. It must be appreciated that these will not yield the exact number of Kilometers travelled, but favourable weights in terms of travel times so that a reasonable allowable time difference between the multiple shortest paths is attained when the same Origin and Destinations are considered and favourable responsive routes are determined as variables of traffic levels and time of day. These routes are selected on the paradigm of route balancing, re-routing algorithms and traffic light intelligence all coming together to result in optimized consistent travel times whose benefits are evenly spread to all motorist, unlike the Entropy balanced k shortest paths (EBkSP) method which favours some motorists on the basis of urgency. This paper proposes a Fully Balanced Multiple-
Candidate shortest path (FBMkP) by which we model in SUMO to overcome the computational overhead of assigning priority differently to each travelling vehicle using intelligence at intersections and other points on the vehicular network. The FBMkP opens up traffic by fully balancing the whole network so as to benefit every motorist. Whereas the EBkSP reserves some routes for cars on high priority, our algorithm distributes the benefits of smart routing to all vehicles on the network and serves the road side units such as induction loops and detectors from having to remember the urgency of each vehicle. Instead, detectors and induction loops simply have to poll the destination of the vehicle and not any urgency factor. The minimal data being processed significantly reduce computational times and the benefits all vehicles. The multiple-candidate shortest paths selected on the basis of current traffic status on each possible route increase the efficiency. Routes are fewer than vehicles so possessing weights of routes is smarter than processing individual vehicle weights. This is a multi-objective function project where improving one factor such as travel times improves many more cost, social and environmental factors.

Item Type:	Article
Additional Information:	Copyright © 2014 by authors and Scientific Research Publishing Inc. This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/
Uncontrolled Keywords:	Simulation of Urban Mobility SUMO, Duarouter, Fully Balanced Multiple-Candidate Shortest Paths (FBMKP), E1 Induction Loop, E3 Detector, Re-Routing, Braess Paradox, Traffic Control Intelligent (TraCI), Partially Re-Routed, Shortest Path Method, Traffic Light Control FBMKP
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Faculty / School / Research Centre / Research Group:	Faculty of Engineering & Science > School of Computing & Mathematical Sciences (CMS)
Last Modified:	09 Aug 2016 09:16
URI:	http://gala.gre.ac.uk/id/eprint/15684

Actions (login required)

View Item

Downloads