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

The traveling salesman problem with drone based on vehicle mobile parking for customer self-pickup

Author

Listed:
  • Hong, Lingrui
  • Zhou, Lin
  • Baldacci, Roberto

Abstract

This paper introduces the traveling salesman problem with drone based on vehicle mobile parking for customer self-pickup (TSPD-VMPCP) in last-mile delivery. A set of vertices is considered, including a depot, parking spots, home delivery (HD) customers that must be visited directly within predefined time windows by truck or drone, and customers with self-pickup (CP) preference that must be served by designated parking spots. Specifically, we allow the drone to perform multi-loop, in which the drone launches and lands at the same location. CP customers are covered using a probability function based on their self-pickup behavior and the truck’s stoppage duration. The TSPD-VMPCP aims to minimize the total operating cost. We model the TSPD-VMPCP as a mixed-integer linear program and develop an adaptive large neighborhood search (ALNS) metaheuristic, in addition to a two-phase local search (2P-LS) based on variable neighborhood descent (VND) and matheuristic. We assess the performance of ALNS by comparing it with the Gurobi solver on small instances. The numerical results for medium and large instances highlight the effectiveness of the various components of the ALNS. Furthermore, we provide some managerial insights.

Suggested Citation

  • Hong, Lingrui & Zhou, Lin & Baldacci, Roberto, 2025. "The traveling salesman problem with drone based on vehicle mobile parking for customer self-pickup," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 203(C).
  • Handle: RePEc:eee:transe:v:203:y:2025:i:c:s1366554525003886
    DOI: 10.1016/j.tre.2025.104347
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554525003886
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tre.2025.104347?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:203:y:2025:i:c:s1366554525003886. 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.