IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-981-97-4045-1_31.html
   My bibliography  Save this book chapter

Improved Ant Colony Algorithm for Split Delivery Vehicle Routing Problem with Capacity Constraint

In: Liss 2023

Author

Listed:
  • Shasha Zeng

    (Beijing Jiaotong University)

  • Jianqin Zhou

    (Beijing Jiaotong University)

Abstract

The traditional vehicle routing problem (VRP) is a typical NP-hard problem in combinatorial optimization, based on the premise that customer demands are indivisible. However, in practical logistics operations, sometimes splitting demands can lead to better cost reduction in transportation. In this paper, we establish an integer programming model for split delivery vehicle routing problem (SDVRP) with capacity constraint and design an improved Ant Colony Algorithm tailored to the characteristics of the model, with the main design idea being the innovation of a mechanism for selecting splitting points. Through computational experiments, we compare the solution results with the traditional VRP, demonstrating the superiority of demand splitting. Additionally, we compare the results with those obtained in other studies using the same instances, confirming that the algorithm proposed in this paper has certain advantages in solving the split delivery vehicle routing problem.

Suggested Citation

  • Shasha Zeng & Jianqin Zhou, 2024. "Improved Ant Colony Algorithm for Split Delivery Vehicle Routing Problem with Capacity Constraint," Lecture Notes in Operations Research, in: Daqing Gong & Yixuan Ma & Xiaowen Fu & Juliang Zhang & Xiaopu Shang (ed.), Liss 2023, pages 393-405, Springer.
    • Handle: RePEc:spr:lnopch:978-981-97-4045-1_31
    DOI: 10.1007/978-981-97-4045-1_31
    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-97-4045-1_31. 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.