Design of efficient packing system using genetic algorithm based on hyper heuristic approach

被引:14
作者
Thomas, Jaya [1 ]
Chaudhari, Narendra S. [1 ]
机构
[1] Indian Inst Technol, Comp Sci & Engn Discipline, Indore, Madhya Pradesh, India
关键词
Genetic algorithm; Heuristic; Hyper heuristic; Optimization; Strip packing; Transportation industries; PLACEMENT;
D O I
10.1016/j.advengsoft.2014.03.003
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In practice the maximum usage of container space arises in many applications which is one of the crucial economical requirements that have a wide impact on good transportation. A huge amount of monetary infrastructure is spent by companies on packing and transportation. This study recommends that there exists a scope for further optimization which if implemented can lead to huge saving. In this paper, we propose a new hyper heuristic approach which automates the design process for packing of two dimensional rectangular blocks. The paper contributes to the literature by introducing a new search technique where genetic algorithm is coupled with the hyper heuristic to get the optimal or sub optimal solution at an acceptable rate. The results obtained show the benefits of hyper-heuristic over traditional one when compared statistically on large benchmark dataset at the 5% level of significance. Improvements on the solution quality with high filling rate up to 99% are observed on benchmark instances. (C) 2014 Elsevier Ltd. All rights reserved,
引用
收藏
页码:45 / 52
页数:8
相关论文
共 32 条
[1]   A branch and bound algorithm for the strip packing problem [J].
Alvarez-Valdes, R. ;
Parreno, F. ;
Tamarit, J. M. .
OR SPECTRUM, 2009, 31 (02) :431-459
[2]  
[Anonymous], SR9609 SEKI U KAIS
[3]   An exact strip packing algorithm based on canonical forms [J].
Arahori, Yohei ;
Imamichi, Takashi ;
Nagamochi, Hiroshi .
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (12) :2991-3011
[4]   Bidirectional best-fit heuristic for orthogonal rectangular strip packing [J].
Asik, Onder Baris ;
Ozcan, Ender .
ANNALS OF OPERATIONS RESEARCH, 2009, 172 (01) :405-427
[5]   ORTHOGONAL PACKINGS IN 2 DIMENSIONS [J].
BAKER, BS ;
COFFMAN, EG ;
RIVEST, RL .
SIAM JOURNAL ON COMPUTING, 1980, 9 (04) :846-855
[6]   A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces [J].
Bortfeldt, A .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 172 (03) :814-837
[7]   Journal of Scheduling (2013) [J].
Burke, Edmund ;
Pinedo, Michael .
JOURNAL OF SCHEDULING, 2013, 16 (01) :1-2
[8]   A Genetic Programming Hyper-Heuristic Approach for Evolving 2-D Strip Packing Heuristics [J].
Burke, Edmund K. ;
Hyde, Matthew ;
Kendall, Graham ;
Woodward, John .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2010, 14 (06) :942-958
[9]   A new placement heuristic for the orthogonal stock-cutting problem [J].
Burke, EK ;
Kendall, G ;
Whitwell, G .
OPERATIONS RESEARCH, 2004, 52 (04) :655-671
[10]  
Cowling P, 2001, LECT NOTES COMPUT SC, V2079, P176