A priority-considering approach for the multiple container loading problem
by Jidong Ren; Yajie Tian; Tetsuo Sawaragi
International Journal of Metaheuristics (IJMHEUR), Vol. 1, No. 4, 2011

Abstract: A priority-considering heuristic approach is proposed to solve the multiple container loading problem, i.e., the problem of packing a given set of three-dimensional rectangular items into multiple containers to make the maximum use of the container space. The items with large volume are usually difficult to make efficient use of the container space. These items are set higher priority over other items, and preferentially assigned into the containers. Within the proposed approach an algorithm is used for solving the single container loading problem under the constraint of priority. The proposed approach achieves excellent results for the test cases suggested by Ivancic et al. and Mohanty et al. with reasonable computing time.

Online publication date: Sat, 28-Feb-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Metaheuristics (IJMHEUR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com