An adaptive genetic algorithm for large-size open stack problems

References

• Adenso-Diaz , B and Laguna , M . 2006 . Fine-tuning of algorithms using fractional experimental designs and local search . Operations Research , 54 ( 3 ) : 99 – 114 .
   Web of Science ®Google Scholar
• Andreatta , G . 1989 . Un problema min cutwidth generalizzato e sue applicazioni ad un FMS (A generalized min cutwidth problem and applications to FMS) . Atti delle giornate di lavoro AIRO , : 1 – 17 . (in Italian)
   Google Scholar
• Bagchi , T and Deb , K . 1996 . Calibration of GA parameters: the design of experiments approach . Computer Science and Informatic , 26 ( 3 ) : 46 – 56 .
   Google Scholar
• Baptiste , P . 2005 . “ Simple MIP formulations to minimize the maximum number of open stacks ” . In IJCAI'05 – Constraint modelling challenge 9 – 13 . Edinburgh
   Google Scholar
• Becceneri , JC , Yanasse , HH and Soma , NY . 2004 . A method for solving the minimization of the maximum number of open stacks problem within a cutting process . Computers & Operations Research , 31 ( 14 ) : 2315 – 2332 .
   Web of Science ®Google Scholar
• Birattari , M . 2009 . Tuning metaheuristics: a machine learning perspective , Vol. 197 , Berlin : Springer .
   Google Scholar
• Chu , G and Stuckey , PJ . 2009 . Minimizing the maximum number of open stacks by customer search . Lecture Notes in Computer Science , 5732 : 242 – 257 .
   Google Scholar
• De Giovanni , L , Massi , G and Pezzella , F . 2010 . Preliminary computational experiments with a genetic algorithm for the open stacks problem [online] , Available from: http://www.math.unipd.it/~luigi/manuscripts/201009_AGA_compPrel.pdf [Accessed 4 October 2011]
   Google Scholar
• De Giovanni , L . 2011 . “ A heuristic and an exact method for pattern sequencing problems ” . In In: Proceedings of the VII ALIO/EURO workshop on applied combinatorial optimization Porto, Portugal
   Google Scholar
• de Landgraaf , W , Eiben , A and Nannen , V . 2007 . Parameter calibration using meta-algorithms . In: Proceedings of CEC 2007 - IEEE congress on evolutionary computation , : 71 – 78 .
   Google Scholar
• de Oliveira , ACM and Lorena , LAN . 2002 . A constructive genetic algorithm for gate matrix layout problems . IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems , 21 ( 8 ) : 969 – 974 .
   Web of Science ®Google Scholar
• de Oliveira , ACM and Lorena , LAN . 2005 . Population training heuristics . Lecture Notes in Computer Science , 3448 : 166 – 176 .
   Google Scholar
• de Oliveira , ACM and Lorena , LAN . 2006 . Pattern sequencing problems by clustering search . Lecture Notes in Computer Science , 4140 : 218 – 227 .
   Google Scholar
• Eiben , E , Hinterding , R and Michalewicz , Z . 1999 . Parameter control in evolutionary algorithms . IEEE Transactions on Evolutionary Computation , 3 ( 2 ) : 124 – 141 .
   Web of Science ®Google Scholar
• Faggioli , E and Bentivoglio , CA . 1998 . Heuristic and exact methods for the cutting sequencing problem . European Journal of Operational Research , 110 ( 3 ) : 564 – 575 .
   Web of Science ®Google Scholar
• Fink , A and Voß , S . 1999 . Application of modern heuristic search methods to pattern sequencing problem . Computers & Operations Research , 26 ( 1 ) : 17 – 34 .
   Web of Science ®Google Scholar
• Garcia de la Banda , M and Stuckey , P . 2007 . Dynamic programming to minimize the maximum number of open stacks . INFORMS Journal on Computing , 19 ( 4 ) : 607 – 617 .
   Web of Science ®Google Scholar
• Hu , YH and Chen , SJ . 1990 . GM_Plan: a gate matrix layout algorithm based on artificial intelligence planning techniques . IEEE Transactions on Computer-Aided Design , 9 ( 8 ) : 836 – 845 .
   Web of Science ®Google Scholar
• Lessmann , S , Caserta , M and Montalvo Arango , I . 2011 . Tuning metaheuristics: a data mining based approach for particle swarm optimization . Expert Systems with Applications , 38 ( 10 ) : 12826 – 12838 .
   Web of Science ®Google Scholar
• Lin , S and Kernighan , BW . 1973 . An effective heuristic algorithm for the traveling-salesman problem . Operations Research , 21 ( 2 ) : 498 – 516 .
   Web of Science ®Google Scholar
• Linhares , A and Yanasse , HH . 2002 . Connections between cutting-pattern sequencing, VLSI design, and flexible machines . Computers & Operations Research , 29 ( 12 ) : 1759 – 1772 .
   Web of Science ®Google Scholar
• Lopes , IC and Valério de Carvalho , JM . 2010 . Using interval graphs in an order processing optimization problem . In: Proceedings of the world congress on engineering WCE 2010 , III
   Google Scholar
• Mendes , A and Linhares , A . 2004 . A multiple-population evolutionary approach to gate matrix layout . International Journal of System Science , 35 ( 1 ) : 13 – 23 .
   Web of Science ®Google Scholar
• Miller , A . 2005 . “ Improved lower bounds for solving the minimal open stacks problem ” . In IJCAI'05 fifth workshop on modelling and solving problems with constraints 36 – 43 . Edinburgh
   Google Scholar
• SCOOP Team, 2009. Sheet cutting and process optimization for furniture industry - SCOOP project [online]. Available from: http://www.scoop-project.net [Accessed 4 October 2011]
   Google Scholar
• Smith , B and Gent , I . 2005 . IJCAI'05 – Constraint modelling challenge 2005 Edinburgh
   Google Scholar
• Yanasse , HH and Senne , ELF . 2010 . The minimization of open stacks problem: a review of some properties and their use in pre-processing operations . European Journal of Operational Research , 203 ( 3 ) : 559 – 567 .
   Web of Science ®Google Scholar
• Yuen , BJ . 1995 . Improved heuristics for sequencing cutting patterns . European Journal of Operational Research , 87 ( 1 ) : 57 – 64 .
   Web of Science ®Google Scholar
• Yuen , BJ and Richardson , KV . 1995 . Establishing the optimality of sequencing heuristics for cutting stock problems . European Journal of Operational Research , 84 ( 3 ) : 590 – 598 .
   Web of Science ®Google Scholar