An exact algorithm for the three-dimensional loading capacitated vehicle routing problem

Jidong Ren, Yajie Tian and Tetsuo Sawaragi

International Journal of Business Performance and Supply Chain Modelling, 2012, vol. 4, issue 3/4, 317-332

Abstract: The three-dimensional loading capacitated vehicle routing problem is a strong NP-hard problem. Most existing algorithms for the problem are heuristic or meta-heuristic algorithms. In this paper, an exact algorithm is proposed for the problem. For solving the loading sub-problem, we use an effective method to generate possible points for loading items, which greatly reduce the search scope. Then we proposed an exact algorithm which iteratively calls a branch-and-bound algorithm based on set partition. The validity of the proposed algorithm is examined by comparing the present results with those of published algorithms using the same data.

Keywords: vehicle routing problem; set partition; container loading problem; CLP; branch-and-bound algorithm; heuristics; 3D loading capacitated VRP. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=50391 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijbpsc:v:4:y:2012:i:3/4:p:317-332

Access Statistics for this article

More articles in International Journal of Business Performance and Supply Chain Modelling from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().