Last-Mile Scheduling Under Uncertainty

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11494)


Shared mobility is revolutionizing urban transportation and has sparked interest in optimizing the joint schedule of passengers using public transit and last-mile services. Scheduling systems must anticipate future requests and provision flexibility in order to be adopted in practice. In this work, we consider a two-stage stochastic programming formulation for scheduling a set of known passengers and uncertain passengers that are realized from a finite set of scenarios. We present an optimization approach based on decision diagrams. We obtain, in minutes, schedules for 1,000 known passengers that are robust and optimized with respect to scenarios involving up to 100 additional uncertain passengers.


Decision diagrams Scheduling Stochastic programming 


  1. 1.
    Andersen, H.R., Hadzic, T., Hooker, J.N., Tiedemann, P.: A constraint store based on multivalued decision diagrams. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 118–132. Springer, Heidelberg (2007). Scholar
  2. 2.
    Ben-Tal, A., Nemirovski, A.: Robust optimization - methodology and applications. Math. Program. 92(3), 453–480 (2002). Scholar
  3. 3.
    Bergman, D., Cire, A., van Hoeve, W., Hooker, J.: Decision Diagrams for Optimization. Springer, Cham (2016). Scholar
  4. 4.
    Bergman, D., Cire, A.A.: Decomposition based on decision diagrams. In: Quimper, C.-G. (ed.) CPAIOR 2016. LNCS, vol. 9676, pp. 45–54. Springer, Cham (2016). Scholar
  5. 5.
    Bergman, D., Cire, A.A.: Discrete nonlinear optimization by state-space decompositions. Manage. Sci. 64(10), 4700–4720 (2018). Scholar
  6. 6.
    Bergman, D., van Hoeve, W.-J., Hooker, J.N.: Manipulating MDD relaxations for combinatorial optimization. In: Achterberg, T., Beck, J.C. (eds.) CPAIOR 2011. LNCS, vol. 6697, pp. 20–35. Springer, Heidelberg (2011). Scholar
  7. 7.
    Bergman, D., Lozano, L.: Decision diagram decomposition for quadratically constrained binary optimization. Optimization Online e-prints, October 2018Google Scholar
  8. 8.
    Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, New York (2011). Scholar
  9. 9.
    Grosse-Ophoff, A., Hausler, S., Heineke, K., Möller, T.: How shared mobility will change the automotive industry (2017).
  10. 10.
    Haus, U.U., Michini, C., Laumanns, M.: Scenario aggregation using binary decision diagrams for stochastic programs with endogenous uncertainty (2017)Google Scholar
  11. 11.
    Kleywegt, A., Shapiro, A., Homem-de Mello, T.: The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2), 479–502 (2002). Scholar
  12. 12.
    Liu, Z., Jiang, X., Cheng, W.: Solving in the last mile problem: ensure the success of public bicycle system in Beijing. Procedia Soc. Behav. Sci. 43, 73–78 (2012)CrossRefGoogle Scholar
  13. 13.
    Lozano, L., Bergman, D., Smith, J.C.: On the consistent path problem. Optimization Online e-prints, April 2018Google Scholar
  14. 14.
    Lozano, L., Smith, J.C.: A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs. Math. Program. (2018). Scholar
  15. 15.
    Mahéo, A., Kilby, P., Hentenryck, P.V.: Benders decomposition for the design of a hub and shuttle public transit system. Transp. Sci. 53(1), 77–88 (2018)CrossRefGoogle Scholar
  16. 16.
    McCoy, K., Andrew, J., Glynn, R., Lyons, W.: Integrating shared mobility into multimodal transportation planning: improving regional performance to meet public goals. Technical report, Office of the Assistant Secretary of Transportation for Research and Technology, U.S. Department of Transportation (2018)Google Scholar
  17. 17.
    Raghunathan, A.U., Bergman, D., Hooker, J., Serra, T., Kobori, S.: Seamless multimodal transportation scheduling. arXiv:1807.09676 (2018)
  18. 18.
    Raghunathan, A.U., Bergman, D., Hooker, J.N., Serra, T., Kobori, S.: The integrated last-mile transportation problem (ILMTP). In: Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, ICAPS 2018, Delft, The Netherlands, 24–29 June 2018, pp. 388–398 (2018).
  19. 19.
    Shaheen, S.: U.S. carsharing & station car policy considerations: monitoring growth, trends & overall impacts. Technical report, Institute of transportation studies, Working paper series, Institute of Transportation Studies, UC Davis (2004)Google Scholar
  20. 20.
    Shen, Y., Zhang, H., Zhao, J.: Simulating the first mile service to access train stations by shared autonomous vehicle. In: Transportation Research Board 96th Annual Meeting (2017)Google Scholar
  21. 21.
    Thien, N.D.: Fair cost sharing auction mechanisms in last mile ridesharing. Ph.D. thesis, Singapore Management University (2013)Google Scholar
  22. 22.
    Wang, H.: Routing and scheduling for a last-mile transportation problem. Transp. Sci. 53(1), 1–17 (2017). Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Mitsubishi Electric Research LabsCambridgeUSA
  2. 2.University of ConnecticutStorrsUSA
  3. 3.Carnegie Mellon UniversityPittsburghUSA
  4. 4.Advanced Technology R&D CenterMitsubishi Electric CorporationHyogoJapan

Personalised recommendations