IDEAS home Printed from https://ideas.repec.org/a/hin/complx/4933311.html
   My bibliography  Save this article

Research on Path Optimization of Vehicle-Drone Joint Distribution considering Customer Priority

Author

Listed:
  • Xiaoye Zhou
  • Yuhao Feng
  • Qingling Wang

Abstract

To meet the personalized distribution needs of customers, comprehensively consider customer value, the urgency of customer needs, and the impact of priority distribution to the customer on the enterprise, and based on regional restrictions, put forward vehicle-drone joint distribution path optimization problem considering customer priority. First, the goal is to minimize the sum of total distribution cost and customer priority cost integrating soft time windows and constructing a path optimization model of the vehicle-drone joint distribution. Second, a two-stage hybrid algorithm is proposed for the problem model. In the first stage, the deep neural network and the grid search improved support vector machine algorithm (DNN-GSM-SVM) are used to screen and classify customer priority features, and in the second stage, adaptive large-scale neighborhood search improved genetic algorithms (ALNS-GA) are used to solve the problem of vehicle-drone joint distribution path planning problem. Finally, combined with the numerical example, the optimization scheme of the vehicle-drone joint distribution path considering priority is analyzed. Compared with the three algorithms and error analysis, the effectiveness of the model and the two-stage algorithm was verified. Compared with the results of the scheme that does not consider priority, the results show that priority can significantly improve customer satisfaction. The efficiency of the vehicle-drone joint distribution was verified by comparing the three scenarios.

Suggested Citation

  • Xiaoye Zhou & Yuhao Feng & Qingling Wang, 2024. "Research on Path Optimization of Vehicle-Drone Joint Distribution considering Customer Priority," Complexity, Hindawi, vol. 2024, pages 1-17, January.
  • Handle: RePEc:hin:complx:4933311
    DOI: 10.1155/2024/4933311
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2024/4933311.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2024/4933311.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2024/4933311?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
    ---><---

    More about this item

    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:hin:complx:4933311. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.