IDEAS home Printed from https://ideas.repec.org/a/taf/applec/v55y2023i41p4841-4852.html
   My bibliography  Save this article

Vehicle routing optimization for rural package collection and delivery integrated with regard to the customer self-pickup radius

Author

Listed:
  • Congping Yang
  • Tong Shu
  • Sheng Liang
  • Shou Chen
  • Shouyang Wang

Abstract

This paper explores the optimization for the integrated vehicle routing of package collection and delivery in rural areas, based on the coverage idea and customer self-pickup strategy. The purpose is to optimize package collection and delivery in rural areas with the scattered and small-scale demand for the express service. An integrated vehicle routing model for rural package collection and delivery is established with regard to the radius of customer self-pickup, via taking the sum of operation cost, transportation cost, time penalty cost and carbon emission cost as the optimization goal. A two-stage algorithm based on the improved k-means clustering algorithm and genetic algorithm is designed to solve the model. Ziyuan county of Guangxi province is taken for typical example. The simulation results show that the optimization model can raise vehicle loading rate and service coverage rate, while reducing cost. A rise in the customer’s self-pickup radius and the number of packages collected and delivered can decrease the unit collection and delivery cost, and it is found that carbon emissions have little effects on the optimization of vehicle routing from the perspective of cost.

Suggested Citation

  • Congping Yang & Tong Shu & Sheng Liang & Shou Chen & Shouyang Wang, 2023. "Vehicle routing optimization for rural package collection and delivery integrated with regard to the customer self-pickup radius," Applied Economics, Taylor & Francis Journals, vol. 55(41), pages 4841-4852, September.
  • Handle: RePEc:taf:applec:v:55:y:2023:i:41:p:4841-4852
    DOI: 10.1080/00036846.2022.2131719
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00036846.2022.2131719
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00036846.2022.2131719?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.

    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:taf:applec:v:55:y:2023:i:41:p:4841-4852. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/RAEC20 .

    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.