Affiliation:
1. Moscow State University of Technology "STANKIN"
Abstract
The actual in industry strip packing problem which is NP-hard in strong sense is considered in paper. To the strip packing problem comes down solution of a large number of different practical problems, including problems in logistics, scheduling and planning. The new heuristics intended to pack a given set of rectangular two-dimensional objects in order to minimize of the total length of the filled part of container with an infinity length and fixed width are offered. The proposed multimethod genetic algorithm is investigated on well-known standard benchmarks of two-dimensional strip packing problems.
Publisher
Trans Tech Publications, Ltd.
Reference17 articles.
1. M. Gary, D. Johnson: Computers Intractability: a Guide to the Theory of NP-completeness (W.H. Freeman, San Francisco 1979).
2. G. Wascher, H. Haubner, H. Schumann: An improved typology of cutting and packing problems. European Journal of Operational Research. Vol. 183: 3 (2007), pp.1109-1130.
3. A. Lodi, S. Martello, M. Monaci: Two-dimensional packing problems: A survey. European journal of operational research. Vol. 141: 2 (2002), pp.241-252.
4. M.C. Riff, X. Bonnaire, B. Neveu: A revision of recent approaches for two-dimensional strip-packing problems. Engineering Applications of Artificial Intelligence. Vol. 22: 4-5 (2009), pp.823-827.
5. E. Hopper: Two-Dimensional Packing Utilising Evolutionary Algorithms and other Meta-Heuristic Methods. Ph.D. Thesis (Cardiff University, 2000).
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献