Abstract
Pickup and delivery problems are frequently encountered problems in transport companies. This paper presents a variant of the homogeneous vehicle, single-to-single Pickup and Delivery Problem with Time Windows, where several vehicles must fulfill transport requests from pickup nodes to delivery nodes, called missions, with associated service level agreements (SLA). A mathematical programming model is proposed to tackle this variant, focused on optimizing the allocation and sequencing of missions to be executed by autonomous vehicles. Numerical experiments are performed comparing instances with missions with long and short SLAs. The results show that the model takes longer to find the optimal solution when the missions have short SLAs and increased difficulty in meeting them if the number of vehicles is limited.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Note that the value of SP depends on the importance a company wants to give to the amount of delay when compared to the time of empty travels.
References
Anily, S., Hassin, R.: The swapping problem. Networks 22(4), 419–433 (1992)
Baldacci, R., Hadjiconstantinou, E., Mingozzi, A.: An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Oper. Res. 52(5), 723–738 (2004)
Battarra, M., Cordeau, J.F., Iori, M.: Chapter 6: pickup-and-delivery problems for goods transportation. In: Vehicle Routing: Problems, Methods, and Applications, Second Edition, pp. 161–191. SIAM (2014)
Berbeglia, G., Cordeau, J.F., Gribkovskaia, I., Laporte, G.: Static pickup and delivery problems: a classification scheme and survey. TOP 15, 1–31 (2007)
Berbeglia, G., Cordeau, J.F., Laporte, G.: Dynamic pickup and delivery problems. Eur. J. Oper. Res. 202(1), 8–15 (2010)
Braysy, O., Gendreau, M.: Vehicle routing problem with time windows, part i: route construction and local search algorithms. Transp. Sci. 39(1), 104–118 (2005)
Danloup, N., Allaoui, H., Goncalves, G.: A comparison of two meta-heuristics for the pickup and delivery problem with transshipment. Comput. Oper. Res. 100, 155–171 (2018)
Doerner, K.F., Salazar-González, J.J.: Chapter 7: pickup-and-delivery problems for people transportation. In: Vehicle Routing: Problems, Methods, and Applications, Second Edition, pp. 193–212. SIAM (2014)
Factorovich, P., Méndez-Díaz, I., Zabala, P.: Pickup and delivery problem with incompatibility constraints. Comput. Oper. Res. 113, 104805 (2020). https://doi.org/10.1016/j.cor.2019.104805
Jaw, J.J., Odoni, A.R., Psaraftis, H.N., Wilson, N.H.: A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transp. Res. Part B: Methodol. 20(3), 243–257 (1986)
Kim, J., Klein, C.: Location of departmental pickup and delivery points for an agv system. Int. J. Prod. Res. 34(2), 407–420 (1996)
Li, B., Lim, A.: PDPTW Li-Lim Benchmark (2024). https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/. Accessed 30 Apr 2024
Min, J., Jin, C.: A two-phase greedy strategy in one to many pdvrp. In: 2016 International Conference on Logistics, Informatics and Service Sciences (LISS), pp. 1–5. IEEE (2016)
Moghdani, R., Salimifard, K., Demir, E., Benyettou, A.: The green vehicle routing problem: a systematic literature review. J. Clean. Prod. 279, 123691 (2021). https://doi.org/10.1016/j.jclepro.2020.123691
Ngo, H.Q.T., Nguyen, T.P., Nguyen, H.: Research and develop of agv platform for the logistics warehouse environment. In: Proceedings of the Future Technologies Conference (FTC) 2018: Volume 2, pp. 455–465. Springer (2019)
Pankratz, G.: A grouping genetic algorithm for the pickup and delivery problem with time windows. OR Spectrum 27, 21–41 (2005)
Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery models part ii: transportation between pickup and delivery locations. Journal für Betriebswirtschaft 58, 81–117 (2006)
Savelsbergh, M.W., Sol, M.: The general pickup and delivery problem. Transp. Sci. 29(1), 17–29 (1995)
Tam, V., Tseng, L.C.: Effective heuristics to solve pickup and delivery problems with time windows. In: Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence, pp. 184–188. IEEE (2003)
Xu, H., Chen, Z.L., Rajagopal, S., Arunapuram, S.: Solving a practical pickup and delivery problem. Transp. Sci. 37(3), 347–364 (2003)
Zang, X., Zhu, Y., Zhong, Y., Chu, T.: Citespace-based bibliometric review of pickup and delivery problem from 1995 to 2021. Appl. Sci. 12(9), 4607 (2022). https://doi.org/10.3390/app12094607
Acknowledgments
This work has been supported by the European Union under the Next Generation EU, through a grant of the Portuguese Republic’s Recovery and Resilience Plan (PRR) Partnership Agreement, within the scope of the project PRODUTECH R3 - “Agenda Mobilizadora da Fileira das Tecnologias de Produção para a Reindustrialização”, Total project investment: 166.988.013,71 Euros; Total Grant: 97.111.730,27 Euros.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Ethics declarations
Disclosure of Interests
The authors have no competing interests to declare that are relevant to the content of this article.
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Ferreira, P., Pardal, A., Martins, S. (2024). Allocation and Sequencing of Missions on Autonomous Vehicles. In: Pereira, A.I., et al. Optimization, Learning Algorithms and Applications. OL2A 2024. Communications in Computer and Information Science, vol 2281. Springer, Cham. https://doi.org/10.1007/978-3-031-77432-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-031-77432-4_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-77431-7
Online ISBN: 978-3-031-77432-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)