IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-40063-6_81.html
   My bibliography  Save this book chapter

Artificial Bee Colony Algorithm for Three-Dimensional Loading Capacitated Vehicle Routing Problem

In: Proceedings of 20th International Conference on Industrial Engineering and Engineering Management

Author

Listed:
  • Bin Wu

    (Nanjing University of Technology)

  • Jin-guo Lin

    (Nanjing University of Technology)

  • Min Dong

    (Nanjing University of Technology)

Abstract

The artificial bee colony algorithm (ABC) hybrid two loading heuristics for the three-dimensional loading capacitated vehicle routing problem (3L-CVRP) is presented in the paper. The 3L-CVRP is a combination of two well-known NP-hard problems, the capacitated vehicle routing problem, and the three-dimensional bin packing problem. It is very difficult to get a good performance solution in practice for these problems. The problem is solved by different heuristics for the loading part, and by artificial bee colony algorithm for the overall optimization. To solve the representation problem of the solution, a novel real encoding method is presented to represent the solution for ABC. The effectiveness of the proposed algorithm is tested, and proven by extensive computational experiments on benchmark instances.

Suggested Citation

  • Bin Wu & Jin-guo Lin & Min Dong, 2013. "Artificial Bee Colony Algorithm for Three-Dimensional Loading Capacitated Vehicle Routing Problem," Springer Books, in: Ershi Qi & Jiang Shen & Runliang Dou (ed.), Proceedings of 20th International Conference on Industrial Engineering and Engineering Management, edition 127, pages 815-825, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-40063-6_81
    DOI: 10.1007/978-3-642-40063-6_81
    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:sprchp:978-3-642-40063-6_81. 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.