scholarly journals Optimisation of a multi-objective two-dimensional strip packing problem based on evolutionary algorithms

2009 ◽  
Vol 48 (7) ◽  
pp. 2011-2028 ◽  
Author(s):  
Jesica de Armas ◽  
Coromoto León ◽  
Gara Miranda ◽  
Carlos Segura
Keyword(s):  
Evolutionary Algorithms ◽  
Packing Problem ◽  
Two Dimensional ◽  
Strip Packing ◽  
Multi Objective

scholarly journals A SAT-based Method for Solving the Two-dimensional Strip Packing Problem

2010 ◽  
Vol 102 (3-4) ◽  
pp. 467-487 ◽  
Author(s):  
Takehide Soh ◽  
Katsumi Inoue ◽  
Naoyuki Tamura ◽  
Mutsunori Banbara ◽  
Hidetomo Nabeshima
Keyword(s):  
Packing Problem ◽  
Two Dimensional ◽  
Strip Packing

A Reinforced Tabu Search Approach for 2D Strip Packing

2012 ◽  
pp. 171-188
Author(s):  
Giglia Gómez-Villouta ◽  
Jean-Philippe Hamiez ◽  
Jin-Kao Hao
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Fitness Function ◽  
Packing Problem ◽  
Two Dimensional ◽  
Strip Packing ◽  
Benchmark Instances ◽  
Finite Set ◽  
Infinite Height ◽  
Search Approach

This paper discusses a particular “packing” problem, namely the two dimensional strip packing problem, where a finite set of objects have to be located in a strip of fixed width and infinite height. The variant studied considers regular items, rectangular to be precise, that must be packed without overlap, not allowing rotations. The objective is to minimize the height of the resulting packing. In this regard, the authors present a local search algorithm based on the well-known tabu search metaheuristic. Two important components of the presented tabu search strategy are reinforced in attempting to include problem knowledge. The fitness function incorporates a measure related to the empty spaces, while the diversification relies on a set of historically “frozen” objects. The resulting reinforced tabu search approach is evaluated on a set of well-known hard benchmark instances and compared with state-of-the-art algorithms.

Application of Nature Inspired Algorithms to Optimize Multi-objective Two-Dimensional Rectangle Packing Problem

2019 ◽  
Vol 04 (04) ◽  
pp. 1950010
Author(s):  
Amandeep Kaur Virk ◽  
Kawaljeet Singh
Keyword(s):  
Production Process ◽  
Bin Packing ◽  
Performance Metrics ◽  
Packing Problem ◽  
Flower Pollination Algorithm ◽  
Two Dimensional ◽  
Due Dates ◽  
Utilization Factor ◽  
Multi Objective ◽  
Metaheuristic Techniques

This paper considers two-dimensional non-guillotine rectangular bin packing problem with multiple objectives in which small rectangular parts are to be arranged optimally on a large rectangular sheet. The optimization of rectangular parts is attained with respect to three objectives involving maximization of (1) utilization factor, minimization of (2) due dates of rectangles and (3) number of cuts. Three nature based metaheuristic algorithms — Cuckoo Search, Bat Algorithm and Flower Pollination Algorithm — have been used to solve the multi-objective packing problem. The purpose of this work is to consider multiple industrial objectives for improving the overall production process and to explore the potential of the recent metaheuristic techniques. Benchmark test data compare the performance of recent approaches with the popular approaches and also of the different objectives used. Different performance metrics analyze the behavior/performance of the proposed technique. Experimental results obtained in this work prove the effectiveness of the recent metaheuristic techniques used. Also, it was observed that considering multiple and independent factors as objectives for the production process does not degrade the overall performance and they do not necessarily conflict with each other.

Improved metaheuristics for the two-dimensional strip packing problem

2020 ◽  
Vol 92 ◽  
pp. 106268 ◽  
Author(s):  
Rosephine G. Rakotonirainy ◽  
Jan H. van Vuuren
Keyword(s):  
Packing Problem ◽  
Two Dimensional ◽  
Strip Packing

Exact algorithms for the two-dimensional strip packing problem with and without rotations

2009 ◽  
Vol 198 (1) ◽  
pp. 73-83 ◽  
Author(s):  
Mitsutoshi Kenmochi ◽  
Takashi Imamichi ◽  
Koji Nonobe ◽  
Mutsunori Yagiura ◽  
Hiroshi Nagamochi
Keyword(s):  
Packing Problem ◽  
Exact Algorithms ◽  
Two Dimensional ◽  
Strip Packing

Heuristics for two-dimensional strip packing problem with 90° rotations

2013 ◽  
Vol 40 (14) ◽  
pp. 5542-5550 ◽  
Author(s):  
Kun He ◽  
Yan Jin ◽  
Wenqi Huang
Keyword(s):  
Packing Problem ◽  
Two Dimensional ◽  
Strip Packing
Sign in / Sign up

Export Citation Format

Share Document