Maximising the number of participants in a ride-sharing scheme: MIP versus CP formulations

Show simple item record Armant, Vincent Mahbub, Nahid Brown, Kenneth N. 2016-04-05T16:53:09Z 2016-04-05T16:53:09Z 2015-11
dc.identifier.citation Armant, V., Mahbub, N. and Brown, K. N. Maximising the number of participants in a ride-sharing scheme: MIP versus CP formulations. Tools with Artificial Intelligence (ICTAI), 2015 IEEE 27th International Conference, Vietri-Sul-Mare Italy, 9-11 Nov. 2015. 836-843. doi: 10.1109/ICTAI.2015.123 en
dc.identifier.startpage 836 en
dc.identifier.endpage 843 en
dc.identifier.issn 1082-3409
dc.identifier.doi 10.1109/ICTAI.2015.123
dc.description.abstract Ride sharing schemes aim to reduce the number of cars in congested cities, while providing the participants with a cheaper alternative to solo driving. To ensure a ride-sharing scheme thrives, it is important to maintain a high participation rate. This requires an adequate balance between drivers and riders. And thus ride matches should be proposed which maximize the number of participants. Different variants of the ride sharing problem have been solved using mixed integer programming. In this paper, we introduce a constraint programming formulation for the problem that uses cumulative constraints with dependencies between trip times. In experiments based on collected trip schedules from four different regions, the constraint model outperforms the MIP model. However, when we change the problem by assuming all drivers have flexible roles, the MIP model allows faster solution times than the CP model. en
dc.description.sponsorship Science Foundation Ireland (Grant Number SFI/12/RC/2289) en
dc.description.uri en
dc.format.mimetype application/pdf en
dc.language.iso en en
dc.publisher IEEE en
dc.relation.ispartof International Conference on Tools with Artificial Intelligence, ICTAI 2015, Vietri-Sul-Mare Italy, 9-11 Nov. 2015.
dc.rights © 2015 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 Ride-sharing optimization en
dc.subject Constraints en
dc.title Maximising the number of participants in a ride-sharing scheme: MIP versus CP formulations en
dc.type Conference item en
dc.internal.authorcontactother Vincent Armant, Computer Science, University College Cork, Cork, Ireland. +353-21-490-3000 Email: en
dc.internal.availability Full text available en 2016-01-11T14:12:42Z
dc.description.version Accepted Version en
dc.internal.rssid 332356487
dc.contributor.funder Science Foundation Ireland en
dc.description.status Peer reviewed en
dc.internal.copyrightchecked No !!CORA!! AV permitted by publisher. en
dc.internal.licenseacceptance Yes en
dc.internal.conferencelocation Vietri-Sul-Mare Italy, 9-11 Nov, 2015. en
dc.internal.IRISemailaddress 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