Advertisement

Robust Bi-level Routing Problem for the Last Mile Delivery Under Demand and Travel Time Uncertainty

  • Xingjun Huang
  • Yun LinEmail author
  • Yulin Zhu
  • Lu Li
  • Hao Qu
  • Jie Li
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 924)

Abstract

Designing the last mile delivery system in a lean way has become an important part of serving customers efficiently and economically. However, in practice, the uncertainty in customer demand and travel times often means vehicles capacity may be exceeded along the planed route and vehicles miss theses time windows, increasing the cost, reducing efficiency and decreasing the customer satisfaction. Previous studies have lacked an uncertainty-based view, and few studies have discussed how to develop an uncertain model. To address this issue, the bi-level routing problem for the last mile delivery is formulated as a robust vehicle routing problem with uncertain customer demand and travel times. In addition, a modified simulated annealing algorithm is proposed and tested in computational experiments. The results show that the proposed model has good performance for uncertainty processing.

Keywords

Last mile delivery Uncertainty Modified simulated annealing algorithm Robust optimization 

References

  1. 1.
    Ben-Tal, A., Ghaoui, L., Nemirovski, A.: Robust Optimization (2009)Google Scholar
  2. 2.
    Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35–53 (2004).  https://doi.org/10.1287/opre.1030.0065MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Han, J., Lee, C., Park, S.: A robust scenario approach for the vehicle routing problem with uncertain travel times. Transp. Sci. 48(3), 373–390 (2014).  https://doi.org/10.1287/trsc.2013.0476CrossRefGoogle Scholar
  4. 4.
    Hu, C., Lu, J., Liu, X., Zhang, G.: Robust vehicle routing problem with hard time windows under demand and travel time uncertainty. Comput. Oper. Res. 94, 139–153 (2018).  https://doi.org/10.1016/j.cor.2018.02.006MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Kloimüllner, C., Papazek, P., Hu, B., Raidl, G.R.: A cluster-first route-second approach for balancing bicycle sharing systems. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) EUROCAST 2015. LNCS, vol. 9520, pp. 439–446. Springer, Cham (2015).  https://doi.org/10.1007/978-3-319-27340-2_55CrossRefGoogle Scholar
  6. 6.
    López-Santana, E., Rodríguez-Vásquez, W., Méndez-Giraldo, G.: A hybrid expert system, clustering and ant colony optimization approach for scheduling and routing problem in courier services. Int. J. Ind. Eng. Comput. 9(3), 369–396 (2018).  https://doi.org/10.5267/j.ijiec.2017.8.001CrossRefGoogle Scholar
  7. 7.
    Taş, D., Dellaert, N., Van Woensel, T., De Kok, T.: Vehicle routing problem with stochastic travel times including soft time windows and service costs. Comput. Oper. Res. 40(1), 214–224 (2013).  https://doi.org/10.1016/j.cor.2012.06.008MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Zhou, L., Lin, Y., Wang, X., Zhou, F.: Model and algorithm for bilevel multisized terminal location-routing problem for the last mile delivery. Int. Trans. Oper. Res. (2017).  https://doi.org/10.1111/itor.12399

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  1. 1.College of Mechanical EngineeringChongqing UniversityChongqingChina
  2. 2.School of Automotive EngineeringChongqing UniversityChongqingChina

Personalised recommendations