IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v133y2025ics0305048324002019.html
   My bibliography  Save this article

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

Author

Listed:
  • Cosmi, Matteo
  • Oriolo, Gianpaolo
  • Piccialli, Veronica
  • Ventura, Paolo

Abstract

We present an optimization model for assigning orders to couriers developed for an Italian meal delivery firm focusing on Rome. The firm focuses on top-end restaurants and customers and pursues high Quality of Service through careful management of delays. Our model reflects that in the firm’s business, the majority of orders are placed in advance. This took us to design a sequential decision process implementing a rolling horizon approach where we do not try to anticipate future demands. We, therefore, iterate the solution of a fully deterministic optimization problem, the Offline Couriers Assignment Problem (ocap), where we assume full knowledge of the orders and aim at minimizing delays and rejections. We solve ocap through integer linear programming and in particular by a “flow-like” formulation on a suitable network whose size is kept as small as possible. We validate both the quality of this formulation and the sequential decision process through some computational tests on real instances collected on the ground. We make these instances available to the scientific community.

Suggested Citation

  • Cosmi, Matteo & Oriolo, Gianpaolo & Piccialli, Veronica & Ventura, Paolo, 2025. "Courier assignment in meal delivery via integer programming: A case study in Rome," Omega, Elsevier, vol. 133(C).
    • Handle: RePEc:eee:jomega:v:133:y:2025:i:c:s0305048324002019
    DOI: 10.1016/j.omega.2024.103237
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048324002019
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2024.103237?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:133:y:2025:i:c:s0305048324002019. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.