Seamless Multimodal Transportation Scheduling

    •  Raghunathan, A., Bergman, D., Hooker, J., Serra, T., Kobori, S., "Seamless Multimodal Transportation Scheduling", Informs Journal on Computing, DOI: 10.1287/​ijoc.2019.0163, Vol. 36, No. 2, pp. 336-358, June 2023.
      BibTeX TR2023-076 PDF
      • @article{Raghunathan2023jun,
      • author = {Raghunathan, Arvind and Bergman, David and Hooker, John and Serra, Thiago and Kobori, Shingo},
      • title = {Seamless Multimodal Transportation Scheduling},
      • journal = {Informs Journal on Computing},
      • year = 2023,
      • volume = 36,
      • number = 2,
      • pages = {336--358},
      • month = jun,
      • doi = {10.1287/ijoc.2019.0163},
      • url = {}
      • }
  • MERL Contact:
  • Research Area:



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 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 (about 1 minute) that is orders-of-magnitude faster than 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.