DocumentCode :
188629
Title :
Minimizing the Driving Distance in Ride Sharing Systems
Author :
Armant, Vincent ; Brown, Kenneth N.
fYear :
2014
fDate :
10-12 Nov. 2014
Firstpage :
568
Lastpage :
575
Abstract :
Reducing the number of cars driving on roads is an important objective for smart sustainable cities, for reducing emissions and improving traffic flow. To assist with this aim, ride-sharing systems match intending drivers with prospective passengers. The matching problem becomes more complex when drivers can pick-up and drop-off several passengers, both drivers and passengers have to travel within a time-window and are willing to switch roles. We present a mixed integer programming model for this switching rider problem, with the objective of minimizing the total distance driven by the population. We exhibit how the potential saving in kilometers increases as the driver flexibility and the density of the distribution of participants increases. Further, we show how breaking symmetries among the switchers improves performance, gaining over an order of magnitude speed up in solving time, and allowing approximately 50% more participants to be handled in the same computation time.
Keywords :
integer programming; minimisation; road traffic; sustainable development; transportation; driving distance minimisation; emission reduction; mixed integer programming model; ride sharing systems; smart sustainable cities; switching rider problem; time-window; traffic flow improvement; Cities and towns; Encoding; Heuristic algorithms; Roads; Standards; Vehicles; Zirconium; MIP; ride sharing; transportation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Tools with Artificial Intelligence (ICTAI), 2014 IEEE 26th International Conference on
Conference_Location :
Limassol
ISSN :
1082-3409
Type :
conf
DOI :
10.1109/ICTAI.2014.91
Filename :
6984527
Link To Document :
بازگشت