Improving the Bin Packing Heuristic through Grammatical Evolution Based on Swarm Intelligence
暂无分享,去创建一个
Marco Aurelio Sotelo-Figueroa | Héctor José Puga Soberanes | Laura Cruz Reyes | Jorge A. Soria-Alcaraz | Héctor Joaquín Fraire Huacuja | Juan Martín Carpio | J. M. Carpio | M. Sotelo-Figueroa | L. C. Reyes | J. Soria-Alcaraz | H. J. F. Huacuja
[1] Emanuel Falkenauer,et al. A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.
[2] Andrew Chi-Chih Yao,et al. New Algorithms for Bin Packing , 1978, JACM.
[3] Víctor Ayala-Ramírez,et al. Bin-packing using genetic algorithms , 2005, 15th International Conference on Electronics, Communications and Computers (CONIELECOMP'05).
[4] Vidroha Debroy,et al. Genetic Programming , 1998, Lecture Notes in Computer Science.
[5] José M. Valério de Carvalho,et al. Exact solution of bin-packing problems using column generation and branch-and-bound , 1999, Ann. Oper. Res..
[6] Krzysztof Fleszar,et al. New heuristics for one-dimensional bin-packing , 2002, Comput. Oper. Res..
[7] Juan Martín Carpio Valadez,et al. Evolving Bin Packing Heuristic Using Micro-Differential Evolution with Indirect Representation , 2013, Recent Advances on Hybrid Intelligent Systems.
[8] Fred W. Glover,et al. A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem , 2004, J. Heuristics.
[9] Tao Gong,et al. Binary particle swarm optimization: a forma analysis approach , 2007, GECCO '07.
[10] D. Richard Kuhn,et al. Combinatorial Testing for Software: an Adaptation of Design of Experiments , 2013 .
[11] Anthony Brabazon,et al. Grammatical Differential Evolution , 2006, IC-AI.
[12] T. Kampke. Simulated Annealing: use of new tool in bin packing , 1988 .
[13] Angel Eduardo Muñoz Zavala,et al. Constrained optimization via particle evolutionary swarm optimization algorithm (PESO) , 2005, GECCO '05.
[14] E. Feigenbaum,et al. Computers and Thought , 1963 .
[15] E. Hopper,et al. A Review of the Application of Meta-Heuristic Algorithms to 2D Strip Packing Problems , 2001, Artificial Intelligence Review.
[16] Carlos A. Coello Coello,et al. A constraint-handling mechanism for particle swarm optimization , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).
[17] János Csirik,et al. A Classification Scheme for Bin Packing Theory , 2007, Acta Cybern..
[18] Fred W. Glover,et al. Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..
[19] James Kennedy,et al. Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.
[20] Michael O'Neill,et al. Grammatical Evolution: Evolving Programs for an Arbitrary Language , 1998, EuroGP.
[21] David J. Sheskin,et al. Handbook of Parametric and Nonparametric Statistical Procedures , 1997 .
[22] Riccardo Poli,et al. Particle swarm optimization , 1995, Swarm Intelligence.
[23] Anthony Brabazon,et al. Grammatical Swarm: The generation of programs by social programming , 2006, Natural Computing.
[24] Peter Ross,et al. A Promising Genetic Algorithm Approach to Job-Shop SchedulingRe-Schedulingand Open-Shop Scheduling Problems , 1993, ICGA.
[25] Graham Kendall,et al. Evolving Bin Packing Heuristics with Genetic Programming , 2006, PPSN.
[26] Francisco Herrera,et al. A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms , 2011, Swarm Evol. Comput..
[27] Alain Delchambre,et al. A genetic algorithm for bin packing and line balancing , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.
[28] Julian Togelius,et al. Geometric PSO + GP = Particle Swarm Programming , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).
[29] Matthew R. Hyde. A genetic programming hyper-heuristic approach to automated packing , 2010 .
[30] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[31] José Torres-Jiménez,et al. A Mutation-Selection Algorithm for the Problem of Minimum Brauer Chains , 2011, MICAI.
[32] Bernard T. Han,et al. Multiple-type, two-dimensional bin packing problems: Applications and algorithms , 1994, Ann. Oper. Res..
[33] Marc H. J. Romanycia,et al. What is a heuristic? , 1985 .
[34] Daniele Vigo,et al. Recent advances on two-dimensional bin packing problems , 2002, Discret. Appl. Math..
[35] Alberto Moraglio,et al. Geometric Differential Evolution on the Space of Genetic Programs , 2010, EuroGP.
[36] Mihalis Yannakakis,et al. Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings , 2000, SIAM J. Discret. Math..
[37] Teodor Gabriel Crainic,et al. New bin packing fast lower bounds , 2007, Comput. Oper. Res..
[38] Lap-Mou Tam,et al. A new optimization method, the Algorithm of Changes, for Bin Packing Problem , 2010, 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA).
[39] Daniele Vigo,et al. Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems , 1999, INFORMS J. Comput..
[40] Armin Scholl,et al. Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem , 1997, Comput. Oper. Res..
[41] Enrique Raúl Villa Diharce,et al. PESO+for Constrained Optimization , 2006, IEEE Congress on Evolutionary Computation.
[42] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .
[43] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[44] Juan Martín Carpio Valadez,et al. Evolving and reusing Bin Packing heuristic through Grammatical Differential Evolution , 2013, 2013 World Congress on Nature and Biologically Inspired Computing.
[45] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[46] LEAH EPSTEIN,et al. New Bounds for Variable-Sized Online Bin Packing , 2003, SIAM J. Comput..
[47] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..
[48] Günther R. Raidl,et al. Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification , 2005, IWINAC.
[49] T. Kampke. Simulated annealing: Use of a new tool in bin packing , 1988 .
[50] John R. Koza,et al. Hierarchical Genetic Algorithms Operating on Populations of Computer Programs , 1989, IJCAI.
[51] Carlos Toledo Suarez,et al. A Heuristic Algorithm for the Offline One-Dimensional Bin Packing Problem Inspired by the Point Jacobi Matrix Iterative Method , 2006, 2006 Fifth Mexican International Conference on Artificial Intelligence.
[52] Sándor P. Fekete,et al. New classes of fast lower bounds for bin packing problems , 2001, Math. Program..
[53] Graham Kendall,et al. Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques , 2013 .
[54] Angel Eduardo Muñoz Zavala,et al. Particle evolutionary swarm optimization algorithm (PESO) , 2005, Sixth Mexican International Conference on Computer Science (ENC'05).
[55] Mehmet Fatih Tasgetiren,et al. A discrete particle swarm optimization algorithm for the generalized traveling salesman problem , 2007, GECCO '07.
[56] Wansoo T. Rhee,et al. On Line Bin Packing with Items of Random Size , 1993, Math. Oper. Res..
[57] H. Van de Vel,et al. An Application of the Bin-packing Technique to Job Scheduling on Uniform Processors , 1991 .