A TOC-based heuristic algorithm for solving a two-row pattern container loading problem
by Yuan Liu, Yajie Tian, Tetsuo Sawaragi
International Journal of Services Operations and Informatics (IJSOI), Vol. 2, No. 4, 2007

Abstract: The container loading problem, a real hard problem, is usually difficult to obtain even a suboptimal solution because of not only multiple complicated restrictions but also of multiple objectives. In this paper, a heuristic algorithm is proposed for solving the two-row pattern of the container loading problem in real-world. The algorithm is based on Drum-Buffer-Rope (DBR) presented in the Theory of Constraints (TOC) and the multiagent cooperative negotiation model. A particular attention is focused on improving the constrained agent by striving for the trade-off of restrictions and cooperative negotiations, so that the final solution can arrive its biggest profit.

Online publication date: Tue, 06-Nov-2007

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 Services Operations and Informatics (IJSOI):
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