Author
Listed:
- Arvind U. Raghunathan
(Mitsubishi Electric Research Labs, Cambridge, Massachusetts 02139)
- David Bergman
(Operations and Information Management, University of Connecticut, Storrs, Connecticut 06260)
- John N. Hooker
(Tepper School of Business, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213)
- Thiago Serra
(Freeman College of Management, Bucknell University, Lewisburg, Pennsylvania 17837)
- Shingo Kobori
(Advanced Technology R&D Center, Mitsubishi Electric Corporation, Hyogo 661-8661, Japan)
Abstract
Ride-hailing services have expanded the role of shared mobility in passenger transportation systems, creating new markets and creative planning solutions for major urban centers. In this paper, we consider their use for the first-mile or last-mile passenger transportation in coordination with a mass transit service to provide a seamless multimodal transportation experience for the user. A system that provides passengers with predictable information on travel and waiting times in their commutes is immensely valuable. We envision that the passengers will inform the system of their desired travel and arrival windows so that the system can jointly optimize the schedules of passengers. The problem we study balances minimizing travel time and the number of trips taken by the last-mile vehicles, so that long-term planning, maintenance, and environmental impact are all taken into account. We focus on the case where the last-mile service aggregates passengers by destination. We show that this problem is NP-hard, and we propose a decision diagram–based branch-and-price decomposition model that can solve instances of real-world size (10,000 passengers spread over an hour, 50 last-mile destinations, 600 last-mile vehicles) in computational time (∼1 minute) that is orders of magnitude faster than the solution times of other methods appearing in the literature. Our experiments also indicate that aggregating passengers by destination on the last-mile service provides high-quality solutions to more general settings.
Suggested Citation
Arvind U. Raghunathan & David Bergman & John N. Hooker & Thiago Serra & Shingo Kobori, 2024.
"Seamless Multimodal Transportation Scheduling,"
INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 336-358, March.
Handle:
RePEc:inm:orijoc:v:36:y:2024:i:2:p:336-358
DOI: 10.1287/ijoc.2019.0163
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orijoc:v:36:y:2024:i:2:p:336-358. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.