Dynamic reduction heuristics for the rectangle packing area minimization problem-Reference-Cited by-同舟云学术

Dynamic reduction heuristics for the rectangle packing area minimization problem

Published:2015-03 Issue:3 Volume:241 Page:674-685
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

He Kun,Ji Pengli,Li Chumin

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference22 articles.

1. A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces;Bortfeldt;European Journal of Operational Research,2006

2. A reduction approach for solving the rectangle packing area minimization problem;Bortfeldt;European Journal of Operational Research,2013

3. A hybrid genetic algorithm for the container loading problem;Bortfeldt;European Journal of Operational Research,2001

4. Practical slicing and non-slicing block-packing without simulated annealing;Chan,2004

5. B*-trees: A new representation for non-slicing floorplans;Chang,2000

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Effective Scoring-Based Metaheuristic Algorithm for Rectilinear Block Placement;IEEE Transactions on Emerging Topics in Computational Intelligence;2023-12

2. A Q-learning-based algorithm for the 2D-rectangular packing problem;Soft Computing;2023-06-04

3. A separation and compaction algorithm for the two-open dimension nesting problem using penetration-fit raster and obstruction map;Expert Systems with Applications;2023-06

4. Floorplanning for thermal consideration: Slicing with low power on field programmable gate array;Measurement: Sensors;2022-12

5. A biased genetic algorithm hybridized with VNS for the two-dimensional knapsack packing problem with defects;Applied Soft Computing;2022-03