IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v213y2026ics1366554526003066.html

Profitable pre-assigned pickup and delivery problem with product compatibility

Author

Listed:
  • Darvish, Maryam
  • Mancini, Simona

Abstract

This paper addresses a profitable pre-assigned pickup and delivery problem with product compatibility, motivated by a real case in less-than-truckload rural logistics. Couriers follow pre-assigned routes but may accept additional tasks if they are profitable and operationally feasible. Transported goods belong to different categories, some of which are mutually incompatible and must be handled sequentially or by different vehicles. A central decision maker assigns optional requests to available couriers, taking into account vehicle capacity, compatibility constraints, and detour-based compensation. The objective is to maximize platform revenue, defined as the total profit from served requests minus driver compensation. We propose a mixed-integer programming model to obtain optimal solutions for small-sized instances, and a multi-neighborhood matheuristic to extend analysis to larger scenarios. Computational experiments, including a real case study and sensitivity analyses, provide managerial insights into the trade-offs between profitability, detour costs, and product compatibility.

Suggested Citation

  • Darvish, Maryam & Mancini, Simona, 2026. "Profitable pre-assigned pickup and delivery problem with product compatibility," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 213(C).
    • Handle: RePEc:eee:transe:v:213:y:2026:i:c:s1366554526003066
    DOI: 10.1016/j.tre.2026.104967
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554526003066
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2026.104967?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:transe:v:213:y:2026:i:c:s1366554526003066. 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/600244/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.