Abstract
This paper addresses the problem of optimally routing and scheduling airport shuttle vehicles that offer pickup and drop-off services to customers through ridesharing. This problem, which is a version of the dial-a-ride problem, is formulated as a mixed integer program. For the solution, an exact approach applying constraint programming in a column generation framework and the adaptation of two existing heuristics are proposed. Implementations of the mathematical program and proposed solution approaches for three operational policies are presented. The performance of the proposed approaches in regard to computational requirements and solution quality was evaluated in a real-world case study involving service records for one service day out of Washington, D.C., Dulles International Airport in Chantilly, Virginia, provided by an actual airport shuttle service provider. Results show that the heuristics provide good approximations to the exact solution.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Transportation Research Record: Journal of the Transportation Research Board
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
