Abstract
Delivery robots represent a rather new technology, which has been developed in recent years. These robots drive with walking speed on sidewalks and have unit capacity. The advantage is that these robots are able to drive autonomous and a single operator can manage a fleet of robots. This enables deliveries to be made within a time slot chosen by the customer. Delivery robots are suitable for deliveries of small goods such as groceries, medicine, food, or parcels.
In this contribution, a simulation model for a parcel delivery network on the last-mile is presented. The model represents deliveries from a hub, which is close to an urban area, to customers. In addition to conventional delivery vehicles, the delivery with parcel robots is examined. Decision processes of the simulation are supported by mathematical optimization. In the optimization, two extension of the Traveling Salesman Problem are solved heuristically. To evaluate the simulation we created a case study based on real world data from parcel delivery company Hermes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ascheuer, N., Juenger, M., Reinelt, G.: A branch and cut algorithm for the asymmetric traveling salesman problem with precedence constraints. Comput. Optim. Appl. 17(1), 61–84 (2000). https://doi.org/10.1023/a:1008779125567
Asih, A.M.S., Jatiningrum, W.S., Sopha, B.M.: Collaborative distribution - application to the city of yogyakarta, indonesia. In: 2016 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), IEEE (2016). https://doi.org/10.1109/ieem.2016.7798056
Bertram, I.: Hermes testet Starship-Roboter – Die wichtigsten Fragen (2016). https://newsroom.hermesworld.com/hermes-testet-starship-roboter-die-wichtigsten-fragen-10720/. Accessed 19 Oct 2018
Bertram, I.: Hermes startet Test mit Starship-Robotern in London (2017). https://newsroom.hermesworld.com/hermes-startet-test-mit-starship-robotern-in-london-12325/. Accessed 19 Oct 2018
Fikar, C., Gronalt, M., Hirsch, P.: A decision support system for coordinated disaster relief distribution. Expert Syst. Appl. 57, 104–116 (2016). https://doi.org/10.1016/j.eswa.2016.03.039
Fikar, C., Hirsch, P., Gronalt, M.: A decision support system to investigate dynamic last-mile distribution facilitating cargo-bikes. Int. J. Logistics Res. Appl. 21(3), 300–317 (2017). https://doi.org/10.1080/13675567.2017.1395830
Gester, F., Bogdanski, R.: Innovationen auf der letzten Meile - Bewertung von Chancen für die nachhaltige Stadtlogistik von morgen. Technical report, Bundesverband Paket & Expresslogistik (BIEK) (2017). https://www.biek.de/download.html?getfile=508
Govindan, K., Jafarian, A., Khodaverdi, R., Devika, K.: Two-echelon multiple-vehicle location–routing problem with time windows for optimization of sustainable supply chain network of perishable food. Int. J. Prod. Econ. 152, 9–28 (2014). https://doi.org/10.1016/j.ijpe.2013.12.028
Hermes: Hermes PaketRadar. Website (2017). https://newsroom.hermesworld.com/wp-content/uploads/heatmaps2017/koeln.html. Accessed 21 Oct 2018
Hofmann, W., Assmann, T., Neghabadi, P.D., Tolujew, J.: A simulation tool to assess the integration of cargo bikes into an urban distribution system. In: The 5th International Workshop on Simulation for Energy, Sustainable Development & Environment, Barcelona, Spain (2017)
Law, A.M.: Simulation Modeling and Analysis, 5th edn. McGraw-Hill Education, New York (2015)
Lin, S.W., Yu, V.F.: A simulated annealing heuristic for the multiconstraint team orienteering problem with multiple time windows. Appl. Soft Comput. 37, 632–642 (2015). https://doi.org/10.1016/j.asoc.2015.08.058
Maadi, M., Javidnia, M., Ramezani, R.: Modified cuckoo optimization algorithm (MCOA) to solve precedence constrained sequencing problem (PCSP). Appl. Intell. 48(6), 1407–1422 (2017). https://doi.org/10.1007/s10489-017-1022-0
Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM 7(4), 326–329 (1960). https://doi.org/10.1145/321043.321046
Mingozzi, A., Bianco, L., Ricciardelli, S.: Dynamic programming strategies for the traveling salesman problem with time window and precedence constraints. Oper. Res. 45(3), 365–377 (1997). https://doi.org/10.1287/opre.45.3.365
Rabe, M., Klueter, A., Clausen, U., Poeting, M.: An approach for modeling collaborative route planning in supply chain simulation. In: Roeder, T.M.K., Frazier, P.I., Szechtman, R., Zhou, E., Huschka, T., Chick, S.E. (eds.) Proceedings of the 2016 Winter Simulation Conference, pp. 2228–2238. IEEE, Piscataway (2016)
Sung, J., Jeong, B.: An adaptive evolutionary algorithm for traveling salesman problem with precedence constraints. Sci. World J. 2014, 1–11 (2014). https://doi.org/10.1155/2014/313767
Thaller, C., Clausen, U., Kampmann, R.: System dynamics based, microscopic freight transport simulation for urban areas. In: Commercial Transport, Springer International Publishing, pp. 55–72 (2015). https://doi.org/10.1007/978-3-319-21266-1_4
Tricoire, F., Romauch, M., Doerner, K.F., Hartl, R.F.: Algorithms for the multi-period orienteering problem with multiple time windows. EU Meeting 2008 - Troyes, France, October 23–24 (2008)
Tricoire, F., Romauch, M., Doerner, K.F., Hartl, R.F.: Heuristics for the multi-period orienteering problem with multiple time windows. Comput. Oper. Res. 37(2), 351–367 (2010). https://doi.org/10.1016/j.cor.2009.05.012
Vansteenwegen, P., Souffriau, W., Oudheusden, D.V.: The orienteering problem: a survey. Eur. J. Oper. Res. 209(1), 1–10 (2011). https://doi.org/10.1016/j.ejor.2010.03.045
Yun, Y., Moon, C.: Genetic algorithm approach for precedence-constrained sequencing problems. J. Intell. Manuf. 22(3), 379–388 (2009). https://doi.org/10.1007/s10845-009-0296-4
Yun, Y., Chung, H., Moon, C.: Hybrid genetic algorithm approach for precedence-constrained sequencing problem. Comput. Ind. Eng. 65(1), 137–147 (2013). https://doi.org/10.1016/j.cie.2011.11.019
Acknowledgements
This paper is a research result in context of the Leistungszentrum (Center of Excellence) for Logistics & IT, an initiative of the Fraunhofer-Gesellschaft and the state of North Rhine-Westphalia.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendix
Appendix
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Poeting, M., Schaudt, S., Clausen, U. (2019). Simulation of an Optimized Last-Mile Parcel Delivery Network Involving Delivery Robots. In: Clausen, U., Langkau, S., Kreuz, F. (eds) Advances in Production, Logistics and Traffic. ICPLT 2019. Lecture Notes in Logistics. Springer, Cham. https://doi.org/10.1007/978-3-030-13535-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-13535-5_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-13534-8
Online ISBN: 978-3-030-13535-5
eBook Packages: EngineeringEngineering (R0)