IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v28y2011i03ns0217595911003260.html
   My bibliography  Save this article

A Scatter Search For Multi-Depot Vehicle Routing Problem With Weight-Related Cost

Author

Listed:
  • JUN ZHANG

    (Department of Systems Engineering, State Key Laboratory of Integrated Automation of Process Industry of MOE, Northeastern University, Shenyang, China)

  • JIAFU TANG

    (Department of Systems Engineering, State Key Laboratory of Integrated Automation of Process Industry of MOE, Northeastern University, Shenyang, China)

  • RICHARD Y. K. FUNG

    (Department of Manufacturing Engineering & Engineering Management City, University of Hong Kong, Hong Kong, China)

Abstract

The multi-depot vehicle routing problem (MDVRP) is a variant of the classical vehicle routing problem (VRP). Most research on MDVRP and its extensions often do not consider the effect of the freight's weight on the total cost. In this paper, the multi-depot vehicle routing problem with weight-related cost (MDVRPWRC) is introduced. MDVRPWRC considers the cost incurred by the weight of freight to determine the vehicle routine with the objective of minimizing the total cost. A scatter search (SS) for the MDVRPWRC is proposed. The sweep algorithm and the optimal splitting procedure are used to construct the initial trial solutions. An iterative descending algorithm and an arc choosing method are adopted in the SS to improve and combine the solutions, respectively. Computational experiments on a range of test datasets show that the MDVRPWRC can reduce the total cost more efficiently compared with the general MDVRP. Moreover, the proposed SS can solve the MDVRPWRC effectively.

Suggested Citation

  • Jun Zhang & Jiafu Tang & Richard Y. K. Fung, 2011. "A Scatter Search For Multi-Depot Vehicle Routing Problem With Weight-Related Cost," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 28(03), pages 323-348.
    • Handle: RePEc:wsi:apjorx:v:28:y:2011:i:03:n:s0217595911003260
    DOI: 10.1142/S0217595911003260
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595911003260
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595911003260?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhixing Luo & Hu Qin & Wenbin Zhu & Andrew Lim, 2017. "Branch and Price and Cut for the Split-Delivery Vehicle Routing Problem with Time Windows and Linear Weight-Related Cost," Transportation Science, INFORMS, vol. 51(2), pages 668-687, May.
    2. Yang Xia & Tingying Wu & Beixin Xia & Junkang Zhang, 2023. "Truck-Drone Pickup and Delivery Problem with Drone Weight-Related Cost," Sustainability, MDPI, vol. 15(23), pages 1-15, November.
    3. Luo, Zhixing & Qin, Hu & Lim, Andrew, 2014. "Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints," European Journal of Operational Research, Elsevier, vol. 234(1), pages 49-60.
    4. Goeke, D. & Schneider, M., 2015. "Routing a Mixed Fleet of Electric and Conventional Vehicles," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 65939, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    5. Goeke, Dominik & Schneider, Michael, 2015. "Routing a mixed fleet of electric and conventional vehicles," European Journal of Operational Research, Elsevier, vol. 245(1), pages 81-99.

    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:wsi:apjorx:v:28:y:2011:i:03:n:s0217595911003260. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.