IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-981-16-8656-6_43.html
   My bibliography  Save this book chapter

A Two-Stage Heuristic Approach for Split Vehicle Routing Problem with Deliveries and Pickups

In: Liss 2021

Author

Listed:
  • Jianing Min

    (Taihu University of Wuxi)

  • Lijun Lu

    (Nanjing University)

  • Cheng Jin

    (Taihu University of Wuxi)

Abstract

The vehicle routing problem with split deliveries and pickups is an important research topic in which deliveries and pickups to and from each customer are split into multiple visits. The objective is to minimize the travel distance while using the fewest vehicles. Therefore, this paper proposes a two-stage constructive heuristic approach to solve this problem. First, revised sweep algorithms are adopted to partition the customer domain into sub-domains limited in vehicle capacity and customer deliveries and pickups. Second, a modified Clarke-Wright saving algorithm is used to optimize the route in each sub-domain from the delivery and pickup demands of each point. The reconstructed Solomon benchmark datasets were adopted to evaluate the proposed algorithms. The computational results indicate that the proposed algorithms are feasible and efficient in reducing the total travel distance, decreasing the number of vehicles used, and increasing the average loading rate.

Suggested Citation

  • Jianing Min & Lijun Lu & Cheng Jin, 2022. "A Two-Stage Heuristic Approach for Split Vehicle Routing Problem with Deliveries and Pickups," Lecture Notes in Operations Research, in: Xianliang Shi & Gábor Bohács & Yixuan Ma & Daqing Gong & Xiaopu Shang (ed.), Liss 2021, pages 478-490, Springer.
    • Handle: RePEc:spr:lnopch:978-981-16-8656-6_43
    DOI: 10.1007/978-981-16-8656-6_43
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:lnopch:978-981-16-8656-6_43. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.