论文信息 - Solving Multi-objective Two Dimensional Rectangle Packing Problem

Solving Multi-objective Two Dimensional Rectangle Packing Problem

The work presented here solves rectangular packing problem in which rectangular items are packed on a rectangular stock sheet. Multiple objectives have been considered which are optimized using rectangle packing algorithm with different heuristics. A mathematical formulation has been presented to solve the problem. Computational experiments have been conducted to find the best packing layout for the problem.

Amandeep kaur Virk | Kawaljeet Singh

[1] Gerhard Wäscher,et al. An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..

[2] Yaodong Cui,et al. Heuristic algorithm for a cutting stock problem in the steel bridge construction , 2009, Comput. Oper. Res..

[3] C. Potts,et al. A genetic algorithm for two-dimensional bin packing with due dates , 2013 .

[4] E. Hopper,et al. A Review of the Application of Meta-Heuristic Algorithms to 2D Strip Packing Problems , 2001, Artificial Intelligence Review.

[5] Liu Hu-yao,et al. Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle , 2006 .

[6] Flávio Neves,et al. Genetic Algorithms for the Nesting Problem in the Packing Industry , 2007, IMECS.

[7] Marvin D. Troutt,et al. Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem , 2001 .

[8] Hsu-Hao Yang,et al. On genetic algorithms for shoe making nesting - A Taiwan case , 2009, Expert Syst. Appl..

[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .