Minimizing the driving distance in ride sharing systems

Show simple item record

dc.contributor.author Armant, Vincent
dc.contributor.author Brown, Kenneth N.
dc.date.accessioned 2016-04-30T10:29:47Z
dc.date.available 2016-04-30T10:29:47Z
dc.date.issued 2014-11
dc.identifier.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 en
dc.identifier.startpage 568 en
dc.identifier.endpage 575 en
dc.identifier.uri http://hdl.handle.net/10468/2504
dc.identifier.doi 10.1109/ICTAI.2014.91
dc.description.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. en
dc.description.sponsorship Science Foundation Ireland (Grant Number: 12/RC/2289) en
dc.description.uri http://ictai2014.cs.ucy.ac.cy/ en
dc.format.mimetype application/pdf en
dc.language.iso en en
dc.publisher IEEE en
dc.relation.uri http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6984527&isnumber=6983902
dc.rights © 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. en
dc.subject Optimization en
dc.subject Ride sharing en
dc.title Minimizing the driving distance in ride sharing systems en
dc.type Conference item en
dc.internal.authorcontactother Vincent Armant, Computer Science, University College Cork, Cork, Ireland. +353-21-490-3000 Email: vincent.armant@insight-centre.org en
dc.internal.availability Full text available en
dc.date.updated 2016-01-11T14:14:14Z
dc.description.version Accepted Version en
dc.internal.rssid 332356494
dc.contributor.funder Science Foundation Ireland en
dc.description.status Peer reviewed en
dc.internal.copyrightchecked No. !!CORA!! AV permitted by publisher: "IEEE seeks to maximize the rights of its authors and their employers to post preprint versions of an article on the author’s personal Web site, on a server operated by the author’s employer" http://www.ieee.org/publications_standards/publications/rights/rights_policies.html en
dc.internal.licenseacceptance Yes en
dc.internal.conferencelocation Limassol, Cyprus en
dc.internal.IRISemailaddress vincent.armant@insight-centre.org en


Files in this item

This item appears in the following Collection(s)

Show simple item record

This website uses cookies. By using this website, you consent to the use of cookies in accordance with the UCC Privacy and Cookies Statement. For more information about cookies and how you can disable them, visit our Privacy and Cookies statement