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

Achieving Better Solutions for Vehicle Routing Problem Involving Split Deliveries and Pickups Using a Competitive Decision Algorithm

Author

Listed:
  • Kefeng Wang

    (School of Energy Science and Engineering, Henan Polytechnic University Jiaozuo City, Henan Province 454000, P. R. China)

  • Chunming Ye

    (Business School, University of Shanghai for Science and Technology, Shanghai 200093, P. R. China)

  • Aibing Ning

    (Business School, University of Shanghai for Science and Technology, Shanghai 200093, P. R. China)

Abstract

This paper discusses vehicle routing problem involving split deliveries and pickups, in which the customer has pickup and delivery demands that can exceed the capacity of the vehicle, and one customer can be visited by no more than one vehicle or by one vehicle for no more than one time. The objective of the problem is to minimize total travel cost. A new heuristic algorithm, the competitive decision algorithm, is proposed to solve the problem. Computational experiments on the benchmark provided by Mitra are performed to evaluate our algorithm against the previously proposed method. The experiment shows that our algorithm provides the best solutions to a total of 110 problems whether or not the number of vehicles used is restricted to the minimum.

Suggested Citation

  • Kefeng Wang & Chunming Ye & Aibing Ning, 2015. "Achieving Better Solutions for Vehicle Routing Problem Involving Split Deliveries and Pickups Using a Competitive Decision Algorithm," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(04), pages 1-22.
    • Handle: RePEc:wsi:apjorx:v:32:y:2015:i:04:n:s0217595915500220
    DOI: 10.1142/S0217595915500220
    as

    Download full text from publisher

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

    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:32:y:2015:i:04:n:s0217595915500220. 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.