A Hyper-Heuristic Approach to Strip Packing Problems
暂无分享,去创建一个
[1] Graham Kendall,et al. A Tabu-Search Hyperheuristic for Timetabling and Rostering , 2003, J. Heuristics.
[2] Aziz Moukrim,et al. New resolution algorithm and pretreatments for the two-dimensional bin-packing problem , 2008, Comput. Oper. Res..
[3] Peter Rossmanith,et al. Simulated Annealing , 2008, Taschenbuch der Algorithmen.
[4] Gerhard Wäscher,et al. An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..
[5] Peter Ross,et al. Learning a Procedure That Can Solve Hard Bin-Packing Problems: A New GA-Based Approach to Hyper-heuristics , 2003, GECCO.
[6] Andrea Lodi,et al. Two-dimensional packing problems: A survey , 2002, Eur. J. Oper. Res..
[7] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[8] Ramón Alvarez-Valdés,et al. Reactive GRASP for the strip-packing problem , 2008, Comput. Oper. Res..
[9] Hongfei Teng,et al. An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles , 1999, Eur. J. Oper. Res..
[10] E. Hopper,et al. A Review of the Application of Meta-Heuristic Algorithms to 2D Strip Packing Problems , 2001, Artificial Intelligence Review.
[11] Kathryn A. Dowsland,et al. Simulated Annealing , 1989, Encyclopedia of GIS.
[12] Graham Kendall,et al. A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem , 2009, INFORMS J. Comput..
[13] Edward G. Coffman,et al. Approximation algorithms for bin packing: a survey , 1996 .
[14] Dan Boneh,et al. On genetic algorithms , 1995, COLT '95.
[15] Julian F. Miller,et al. Genetic and Evolutionary Computation — GECCO 2003 , 2003, Lecture Notes in Computer Science.
[16] J. Potvin,et al. Tabu Search , 2018, Handbook of Metaheuristics.
[17] Graham Kendall,et al. A New Placement Heuristic for the Orthogonal Stock-Cutting Problem , 2004, Oper. Res..
[18] Sándor P. Fekete,et al. A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing , 2003, Math. Oper. Res..
[19] Graham Kendall,et al. Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems , 2006, Eur. J. Oper. Res..
[20] Graham Kendall,et al. A local search approach to a circle cutting problem arising in the motor cycle industry , 2007, J. Oper. Res. Soc..
[21] Ronald L. Rivest,et al. Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..
[22] Peter Ross,et al. Hyper-heuristics: Learning To Combine Simple Heuristics In Bin-packing Problems , 2002, GECCO.
[23] Goldberg,et al. Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.
[24] Graham Kendall,et al. Hyper-Heuristics: An Emerging Direction in Modern Search Technology , 2003, Handbook of Metaheuristics.