Heurísticas de agrupación híbridas eficientes para el problema
暂无分享,去创建一个
José Torres-Jiménez | H. HéctorJ.Fraire | Claudia Gómez Santillán | Laura Cruz Reyes | Marcela Quiroz-Castellanos | Adriana C. F. Alvim
[1] Sara Baase,et al. Computer algorithms - introduction to design and analysis (2 ed.) , 1988 .
[2] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .
[3] Krzysztof Fleszar,et al. New heuristics for one-dimensional bin-packing , 2002, Comput. Oper. Res..
[4] David S. Johnson,et al. Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..
[5] Jatinder N. D. Gupta,et al. A new heuristic algorithm for the one-dimensional bin-packing problem , 1999 .
[6] Enrico Bini,et al. Optimizing the FPGA Implementation of HRT Systems , 2007, 13th IEEE Real Time and Embedded Technology and Applications Symposium (RTAS'07).
[7] Adam Stawowy,et al. Evolutionary based heuristic for bin packing problem , 2008, Comput. Ind. Eng..
[8] Gerhard Wäscher,et al. Heuristics for the integer one-dimensional cutting stock problem: A computational study , 1996 .
[9] Teodor Gabriel Crainic,et al. Efficient lower bounds and heuristics for the variable cost and size bin packing problem , 2011, Comput. Oper. Res..
[10] Philipp Rohlfshagen,et al. Nature inspired genetic algorithms for hard packing problems , 2010, Ann. Oper. Res..
[11] Edward G. Coffman,et al. Approximation algorithms for bin packing: a survey , 1996 .
[12] Rhyd Lewis,et al. A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing , 2009, Comput. Oper. Res..
[13] Armin Scholl,et al. Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem , 1997, Comput. Oper. Res..
[14] A. K. Bhatia,et al. Packing Bins Using Multi-chromosomal Genetic Representation and Better-Fit Heuristic , 2004, ICONIP.
[15] Alain Delchambre,et al. A genetic algorithm for bin packing and line balancing , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.
[16] Gleb Belov. Problems, Models and Algorithms in One- and Two-Dimensional Cutting , 2003 .
[17] Bruce L. Golden,et al. Solving the one-dimensional bin packing problem with a weight annealing heuristic , 2008, Computers & Operations Research.
[18] Marcus Randall,et al. A Hybrid Extremal Optimisation Approach for the Bin Packing Problem , 2009, ACAL.
[19] Frederick Ducatelle,et al. Ant colony optimization and local search for bin packing and cutting stock problems , 2004, J. Oper. Res. Soc..
[20] Paolo Toth,et al. Lower bounds and reduction procedures for the bin packing problem , 1990, Discret. Appl. Math..
[21] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[22] Gerhard Wäscher,et al. The bin-packing problem: A problem generator and some numerical experiments with FFD packing and MTP , 1997 .
[23] Krzysztof Fleszar,et al. Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem , 2011, Eur. J. Oper. Res..
[24] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[25] V. GracielaMoraGuadalupeCastilla,et al. DiPro: An Algorithm for the Packing in Product Transportation Problems with Multiple Loading and Routing Variants , 2007, MICAI.
[26] Emanuel Falkenauer,et al. A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.
[27] Alok Singh,et al. Two heuristics for the one-dimensional bin-packing problem , 2007, OR Spectr..
[28] Fred W. Glover,et al. A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem , 2004, J. Heuristics.