Abstract
We present the i-Deliver pickup-and-delivery (P&D) core algorithmic engine, a decentralized middleware which takes over the delivery logistics in an ecosystem of providers, consumers, couriers, and brokers who match orders for goods (e.g., food, parcels, shopping orders, etc.) between providers and consumers by appropriately (and automatically) allocating them to couriers in such a way that a global performance criterion (e.g., the total travel-time of couriers) is optimized. The middleware consists of two fundamental modules: (i) an order allocation module that assigns P&D orders to couriers in such a way that all spatiotemporal constraints for the orders, as well as constraints related to the couriers’ working conditions (e.g., working shifts) are respected; (ii) a courier guidance module that aids each courier by providing timely-service alerts and routing instructions, while servicing the orders assigned to them. We present the details for the P&D order allocation problem to be solved, via an appropriate MILP formulation. We then discuss both an offline algorithm whose goal is to solve this MILP in its entirety, and an online algorithm that handles the orders in real-time. The online solver (which can also be seen as a heuristic for solving the offline problem) is very suitable for servicing real-time orders, as demonstrated by the evidence provided by our thorough experimentation with real-world data.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
- 2.
They cannot be part of a feasible solution.
References
Dijkstra, E.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)
Guttman, A.: R-Trees: a dynamic index structure for spatial searching. ACM SIGMOD Rec. 14(2), 47–57 (1984). https://doi.org/10.1145/971697.602266
i-Deliver: Delivering platform for delivering goods as a service (2022). https://i-deliver.gr
Kontogiannis, S., Papastavrou, G., Paraskevopoulos, A., Wagner, D., Zaroliagis, C.: Improved oracles for time-dependent road networks. In: 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS), vol. 4, pp. 1–17 (2017). http://drops.dagstuhl.de/opus/volltexte/2017/7895
Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica 28(3), 497–520 (1960). https://doi.org/10.2307/1910129
Parragh, S.N.: A survey on pickup and delivery problems. J. für Betriebswirtschaft 58(1), 21–51 (2008)
Tong, Y., Zeng, Y., Zhou, Z., Chen, L., Xu, K.: Unified route planning for shared mobility: an insertion-based framework. ACM Trans. Database Syst. (TODS) 47(1), 1–48 (2022)
Toth, P.: Vehicle Routing (2nd edition). Society for Industrial and Applied Mathematics (SIAM) (2014)
Acknowledgments
This work was co-financed by the European Regional Development Fund of EU and Greek national funds through the Operational Program Competitiveness, Entrepreneurship, and Innovation (call RESEARCH-CREATE-INNOVATE) under contract no. Τ2EDK-03472 (project “i-Deliver”).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Kontogiannis, S., Paraskevopoulos, A., Pogkas, M., Zaroliagis, C. (2024). i-Deliver P&D Engine: A Decentralized Middleware for a Delivery-as-a-Service System. In: Chatzigiannakis, I., Karydis, I. (eds) Algorithmic Aspects of Cloud Computing. ALGOCLOUD 2023. Lecture Notes in Computer Science, vol 14053. Springer, Cham. https://doi.org/10.1007/978-3-031-49361-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-031-49361-4_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-49360-7
Online ISBN: 978-3-031-49361-4
eBook Packages: Computer ScienceComputer Science (R0)