Affiliation:
1. Instituto Engenharia de Sistemas e Computadores do Porto
2. Universidade do Porto
Abstract
This paper is motivated by the problem of loading identical items of circular base (tubes, rolls, ...) into a rectangular base (the pallet). For practical reasons, all the loaded items are considered to have the same height. The resolution of this problem consists in determining the positioning pattern of the circular bases of the items on the rectangular pallet, while maximizing the number of items. This pattern will be repeated for each layer stacked on the pallet. Two algorithms based on the meta-heuristic Simulated Annealing have been developed and implemented. The tuning of these algorithms parameters implied running intensive tests in order to improve its efficiency. The algorithms developed were easily extended to the case of non-identical circles.
Subject
Management Science and Operations Research
Reference13 articles.
1. A new upper bound for the cylinder packing problem;Correia M.,2000
2. Optimising the palletisation of cylinders in cases;Dowsland K.A.;OR Spektrum,1991
3. Integrated container loading software for pulp and paper industry;Fraser H.;European Journal of Operational Research,1994
4. Computers and Intractability: A guide to the theory of NP-completeness;Garey M.,1979
5. Packing different sized circles into a rectangular container;George J.;European Journal of Operational Research,1995
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献