Minimizing the driving distance in ride sharing systems
Loading...
Files
Accepted Version
Date
2014-11
Authors
Armant, Vincent
Brown, Kenneth N.
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE
Published Version
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 kilometres 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.
Description
Keywords
Optimization , Ride sharing
Citation
Armant, V. and Brown, K. N. (2014) "Minimizing the driving distance in ride sharing systems", IEEE 26th International Conference on Tools with Artificial Intelligence (ICTAI), Limassol, Cyprus, 10-12 November. doi: 10.1109/ICTAI.2014.91
Link to publisher’s version
Copyright
© 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.