By Topic

A relaxation method for the three-dimensional loading capacitated vehicle routing problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jidong Ren ; Grad. Sch. of Eng., Kyoto Univ., Kyoto, Japan ; Tian, Y. ; Sawaragi, T.

This paper addresses the three-dimensional loading capacitated vehicle routing problem which is strongly NP-hard for it generalizes two of the most well known NP-hard problems: the container loading problem and the vehicle routing problem. A relaxation method is proposed for solving the problem. In the proposed method, the loading constraint is replaced by the constraint of volume ratio, which greatly reduces the computing time. The method achieves excellent results for public available test cases with reasonable computing time.

Published in:

System Integration (SII), 2011 IEEE/SICE International Symposium on

Date of Conference:

20-22 Dec. 2011