Courier assignment in meal delivery via integer programming: A case study in Rome

COSMI, Matteo; Oriolo, Gianpaolo; Piccialli, Veronica; Ventura, Paolo

doi:10.1016/j.omega.2024.103237

Download

Article (Scientific journals)

Courier assignment in meal delivery via integer programming: A case study in Rome

COSMI, Matteo; Oriolo, Gianpaolo; Piccialli, Veronica et al.

2025 • In Omega: the International Journal of Management Science, 133, p. 103237

Peer reviewed Dataset

Permalink
https://hdl.handle.net/10993/63008

DOI
10.1016/j.omega.2024.103237

Files (1)Send to Details Statistics Bibliography Similar publications

Files

Full Text

Courier assignment in meal delivery via integer programming_ A case study in Rome.pdf

Author postprint (1.87 MB)

Download

All documents in ORBilu are protected by a user license.

Send to

RIS BibTex APA Chicago Permalink X Linkedin

Details

Disciplines :

Production, distribution & supply chain management

Author, co-author :

COSMI, Matteo ; University of Luxembourg > Faculty of Law, Economics and Finance (FDEF) > Department of Economics and Management (DEM) > LCL

Oriolo, Gianpaolo

Piccialli, Veronica

Ventura, Paolo

External co-authors :

yes

Language :

English

Title :

Courier assignment in meal delivery via integer programming: A case study in Rome

Publication date :

June 2025

Journal title :

Omega: the International Journal of Management Science

ISSN :

0305-0483

Publisher :

Elsevier BV

Volume :

133

Pages :

103237

Peer reviewed :

Peer reviewed

Additional URL :

https://api.elsevier.com/content/article/PII:S0305048324002019?httpAccept=text/xml

Data Set :

Rome Meal Delivery Instances

Available on ORBilu :

since 11 December 2024

Statistics

Number of views

95 (4 by Unilu)

Number of downloads

69 (0 by Unilu)

More statistics

Scopus citations^®

Scopus citations^®
without self-citations

OpenCitations

OpenAlex citations

Bibliography

Cosmi, Matteo, Oriolo, Gianpaolo, Piccialli, Veronica, Ventura, Paolo, Single courier single restaurant meal delivery (without routing). Oper Res Lett 47:6 (2019), 537–541, 10.1016/j.orl.2019.09.007.
Cordeau, Jean-François, Laporte, Gilbert, Potvin, Jeana Yves, Savelsbergh, Martin, Chapter 7 Transportation on demand. Handbooks Oper Res Management Sci 14:C (2007), 429–466, 10.1016/S0927-0507(06)14007-4 URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-77950475013&doi=10.1016%2fS0927-0507%2806%2914007-4&partnerID=40&md5=0d41e4c655b72008797313455c0a19ed.
Cant, Callum, Riding for deliveroo: Resistance in the new economy. 2019, Wiley 978-1-509-53550-7.
Martínez-Sykora, Antonio, McLeod, Fraser, Cherrett, Tom, Friday, Adrian, Exploring fairness in food delivery routing and scheduling problems. Expert Syst Appl, 240, 2024, 122488, 10.1016/j.eswa.2023.122488.
Cordeau, Jean-François, Laporte, Gilbert, The dial-a-ride problem: models and algorithms. Ann Oper Res 153 (2007), 29–46, 10.1007/s10479-007-0170-8.
Molenbruch, Yves, Braekers, Kris, Caris, An, Typology and literature review for dial-a-ride problems. Ann Oper Res 259 (2017), 295–325, 10.1007/s10479-017-2525-0.
Ho, Sina C., Szeto, W.Y., Kuo, Yong-Hong, Leung, Jannya M.Y., Petering, Matthew, Tou, Terencea W.H., A survey of dial-a-ride problems: Literature review and recent developments. Transp Res B 111 (2018), 395–421, 10.1016/j.trb.2018.02.001.
Gökay, Sevket, Heuvels, Andreas, Krempels, Karl-Heinz, A high-level category survey of dial-a-ride problems. Proceedings of the 5th international conference on vehicle technology and intelligent transport systems, 2019, SciTePress, 594–600, 10.5220/0007801605940600.
Ulmer, Marlina W., Goodson, Justina C., Mattfeld, Dirka C., Thomas, Barretta W., On modeling stochastic dynamic vehicle routing problems. EURO J Transp Logist, 9(2), 2020, 100008, 10.1016/j.ejtl.2020.100008.
Klein, Vienna, Steinhardt, Claudius, Dynamic demand management and online tour planning for same-day delivery. European J Oper Res, 2022, 10.1016/j.ejor.2022.09.011.
Klapp, Mathiasa A., Erera, Alan, Toriello, Alejandro, The dynamic dispatch waves problem for same-day delivery. European J Oper Res 271:2 (2018), 519–534, 10.1016/j.ejor.2018.05.032.
Klapp, Mathiasa A., Erera, Alan, Toriello, Alejandro, The one-dimensional dynamic dispatch waves problem. Transp Sci 52:2 (2018), 402–415, 10.1287/trsc.2016.0682.
Ulmer, Marlina W., Thomas, Barretta W., Mattfeld, Dirka C., Preemptive depot returns for dynamic same-day delivery. EURO J Transp Logist 8:4 (2019), 327–361, 10.1007/s13676-018-0124-0.
Voccia, Stacya A., Campbell, Anna Melissa, Thomas, Barretta W., The same-day delivery problem for online purchases. Transp Sci 53:1 (2019), 167–184, 10.1287/trsc.2016.0732.
Stroh, Alexandera M., Erera, Alan, Toriello, Alejandro, Tactical design of same-day delivery systems. Manage Sci 68:5 (2022), 3444–3463, 10.1287/mnsc.2021.4041.
Chen, Xinwei, Ulmer, Marlina W., Thomas, Barretta W., Deep Q-learning for same-day delivery with vehicles and drones. European J Oper Res 298:3 (2022), 939–952, 10.1016/j.ejor.2021.06.021.
Côté, Jean-François, Alves de Queiroz, Thiago, Gallesi, Francesco, Iori, Manuel, A branch-and-regret algorithm for the same-day delivery problem. Transp Res E, 177, 2023, 103226, 10.1016/j.tre.2023.103226.
Pillac, Victor, Gendreau, Michel, Guéret, Christelle, Medaglia, Andrésa L., A review of dynamic vehicle routing problems. European J Oper Res 225:1 (2013), 1–11, 10.1016/j.ejor.2012.08.015.
Reyes, Damian, Erera, Alan, Savelsbergh, Martin, Sahasrabudhe, Sagar, O'Neil, Ryan, The meal delivery routing problem. Optimization-Online, 2018 URL: http://www.optimization-online.org/DB_HTML/2018/04/6571.html.
Yildiz, Baris, Savelsbergh, Martin, Provably high-quality solutions for the meal delivery routing problem. Transp Sci 53:5 (2019), 1372–1388, 10.1287/trsc.2018.0887.
Steever, Zachary, Karwan, Mark, Murray, Chase, Dynamic courier routing for a food delivery service. Comput Oper Res 107 (2019), 173–188, 10.1016/j.cor.2019.03.008.
Ulmer, Marlina W., Thomas, Barretta W., Campbell, Anna Melissa, Woyak, Nicholas, The restaurant meal delivery problem: Dynamic pickup and delivery with deadlines and random ready times. Transp Sci 55:1 (2020), 75–100, 10.1287/trsc.2020.1000.
Auad, Ramon, Erera, Alan, Savelsbergh, Martin, Courier satisfaction in rapid delivery systems using dynamic operating regions. Omega, 121, 2023, 102917, 10.1016/j.omega.2023.102917.
Xue, Guiqin, Wang, Zheng, Wang, Guan, Optimization of rider scheduling for a food delivery service in O2O business. J Adv Transp, 2021, 2021, 10.1155/2021/5515909.
Liao, Wenzhu, Zhang, Liuyang, Wei, Zhenzhen, Multi-objective green meal delivery routing problem based on a two-stage solution strategy. J Clean Prod, 258, 2020, 120627, 10.1016/j.jclepro.2020.120627.
Bozanta, Aysun, Cevik, Mucahit, Kavaklioglu, Can, Kavuk, Eraya M., Tosun, Ayse, Sonuc, Sibela B., et al. Courier routing and assignment for food delivery service using reinforcement learning. Comput Ind Eng, 164, 2022, 107871, 10.1016/j.cie.2021.107871.
Ausseil, Rosemonde, Ulmer, Marlina W., Pazour, Jennifera A., Online acceptance probability approximation in peer-to-peer transportation. Omega, 123, 2024, 102993, 10.1016/j.omega.2023.102993.
Böhm, Martin, Megow, Nicole, Schlöter, Jens, Throughput scheduling with equal additive laxity. Calamoneri, Tiziana, Coró, Federico, (eds.) Algorithms and complexity, 2021, Springer International Publishing, 130–143.
Cosmi, Matteo, Nicosia, Gaia, Pacifici, Andrea, Lower bounds for a meal pickup-and-delivery scheduling problem. Proceedings of the 17th cologne-twente workshop on graphs and combinatorial optimization, 2019, 33–36 URL: https://foreman.virt.dacs.utwente.nl/~ctw/CTW2019ProceedingsFinal.pdf.
Cosmi, Matteo, Nicosia, Gaia, Pacifici, Andrea, Scheduling for last-mile meal-delivery processes. IFAC-papersOnLine IFAC-MIM conference 2019, vol. 52, no. 13, 2019, 511–516, 10.1016/j.ifacol.2019.11.117.
Agnetis, Alessandro, Cosmi, Matteo, Nicosia, Gaia, Pacifici, Andrea, Two is better than one? Order aggregation in a meal delivery scheduling problem. Comput Ind Eng, 2023, 109514, 10.1016/j.cie.2023.109514.
Joshi, Manas, Singh, Arshdeep, Ranu, Sayan, Bagchi, Amitabha, Karia, Priyank, Kala, Puneet, Batching and matching for food delivery in dynamic road networks. 2021 IEEE 37th international conference on data engineering, 2021, IEEE Computer Society, Los Alamitos, CA, USA, 2099–2104, 10.1109/ICDE51399.2021.00207.
Joshi, Manas, Singh, Arshdeep, Ranu, Sayan, Bagchi, Amitabha, Karia, Priyank, Kala, Puneet, FoodMatch: Batching and matching for food delivery in dynamic road networks. ACM Trans Spatial Algorithms Syst 2374-0353, 8(1), 2022, 10.1145/3494530.
Böhm, Martin, Megow, Nicole, Schlöter, Jens, Throughput scheduling with equal additive laxity. Oper Res Lett 50:5 (2022), 463–469, 10.1016/j.orl.2022.06.007.
Soeffker, Ninja, Ulmer, Marlina W., Mattfeld, Dirka C., Stochastic dynamic vehicle routing in the light of prescriptive analytics: A review. European J Oper Res 0377-2217, 298(3), 2022, 801–820, 10.1016/j.cie.2023.109514.
Garey, M.R., Johnson, Davida S., Computers and intractability: A guide to the theory of NP-ompleteness. 1979, W. H. Freeman 0-7167-1044-7.