A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem
暂无分享,去创建一个
[1] Melanie Mitchell,et al. Relative Building-Block Fitness and the Building Block Hypothesis , 1992, FOGA.
[2] Matthew R. Hyde. A genetic programming hyper-heuristic approach to automated packing , 2010 .
[3] John E. Beasley,et al. A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.
[4] Pierre Hansen,et al. Variable neighborhood search , 1997, Eur. J. Oper. Res..
[5] Ender Özcan,et al. An Experimental Study on Hyper-heuristics and Exam Timetabling , 2006, PATAT.
[6] Ender Özcan,et al. Late acceptance-based selection hyper-heuristics for cross-domain heuristic search , 2013, 2013 13th UK Workshop on Computational Intelligence (UKCI).
[7] Kevin Kok Wai Wong,et al. Classification of adaptive memetic algorithms: a comparative study , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).
[8] G. Raidl,et al. An improved genetic algorithm for the multiconstrained 0-1 knapsack problem , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).
[9] Bart Demoen,et al. ParHyFlex: A framework for parallel hyper-heuristics , 2013 .
[10] Günther R. Raidl,et al. Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem , 2005, Evolutionary Computation.
[11] Michael O'Neill,et al. An Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem , 2005, EvoCOP.
[12] Tad Hogg,et al. An Economics Approach to Hard Computational Problems , 1997, Science.
[13] Robert Hinterding,et al. Mapping, order-independent genes and the knapsack problem , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.
[14] Jens Gottlieb,et al. On the Effectivity of Evolutionary Algorithms for the Multidimensional Knapsack Problem , 1999, Artificial Evolution.
[15] Heitor Silvério Lopes,et al. Particle Swarm Optimization for the Multidimensional Knapsack Problem , 2007, ICANNGA.
[16] Maria Grazia Speranza,et al. CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem , 2012, INFORMS J. Comput..
[17] H. Martin Weingartner,et al. Methods for the Solution of the Multidimensional 0/1 Knapsack Problem , 1967, Operational Research.
[18] Michel Gendreau,et al. Hyper-heuristics: a survey of the state of the art , 2013, J. Oper. Res. Soc..
[19] Gilbert Syswerda,et al. Uniform Crossover in Genetic Algorithms , 1989, ICGA.
[20] Günther R. Raidl,et al. The Core Concept for the Multidimensional Knapsack Problem , 2006, EvoCOP.
[21] L Spaanenburg,et al. ARTIFICIAL NEURAL NETS AND GENETIC ALGORITHMS , 2001 .
[22] Peter I. Cowling,et al. Choosing the Fittest Subset of Low Level Heuristics in a Hyperheuristic Framework , 2005, EvoCOP.
[23] Richard S. Sutton,et al. Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.
[24] Vittorio Maniezzo,et al. Matheuristics: Hybridizing Metaheuristics and Mathematical Programming , 2009 .
[25] Edmund K. Burke,et al. HyFlex: A Flexible Framework for the Design and Analysis of Hyper-heuristics , 2009 .
[26] Graham Kendall,et al. Monte Carlo hyper-heuristics for examination timetabling , 2012, Ann. Oper. Res..
[27] Nenad Mladenovic,et al. New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem , 2010, Hybrid Metaheuristics.
[28] Michèle Sebag,et al. Extreme Value Based Adaptive Operator Selection , 2008, PPSN.
[29] Carlos Cotta,et al. A Hybrid Genetic Algorithm for the 0-1 Multiple Knapsack Problem , 1997, ICANNGA.
[30] Philippe Michelon,et al. A multi-level search strategy for the 0-1 Multidimensional Knapsack Problem , 2010, Discret. Appl. Math..
[31] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[32] Alexander Nareyek,et al. Choosing search heuristics by non-stationary reinforcement learning , 2004 .
[33] Lakhmi C. Jain,et al. Computational Intelligence: Collaboration, Fusion and Emergence , 2009 .
[34] Michel Vasquez,et al. Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem , 2008, J. Comb. Optim..
[35] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[36] Frédéric Saubion,et al. Autonomous operator management for evolutionary algorithms , 2010, J. Heuristics.
[37] Peter I. Cowling,et al. Hyperheuristics: Recent Developments , 2008, Adaptive and Multilevel Metaheuristics.
[38] Ender Özcan,et al. A case study of memetic algorithms for constraint optimization , 2009, Soft Comput..
[39] Osman Oguz,et al. A heuristic algorithm for the multidimensional zero-one knapsack problem , 1984 .
[40] A. Sima Etaner-Uyar,et al. Selection hyper-heuristics in dynamic environments , 2013, J. Oper. Res. Soc..
[41] Ender Özcan,et al. A comprehensive analysis of hyper-heuristics , 2008, Intell. Data Anal..
[42] Michel Vasquez,et al. Improved results on the 0-1 multidimensional knapsack problem , 2005, Eur. J. Oper. Res..
[43] H. Martin Weingartner,et al. Method for the Solution of the Multi-Dimensional 0/1 Knapsack Problem , 2015 .
[44] Graham Kendall,et al. A simulated annealing hyper-heuristic methodology for flexible decision support , 2012, 4OR.
[45] Ender Özcan,et al. A Hyper-heuristic with a Round Robin Neighbourhood Selection , 2013, EvoCOP.
[46] Ender Özcan,et al. Generation of VNS Components with Grammatical Evolution for Vehicle Routing , 2013, EuroGP.
[47] Edmund K. Burke,et al. Examination timetabling using late acceptance hyper-heuristics , 2009, 2009 IEEE Congress on Evolutionary Computation.
[48] Patrick De Causmaecker,et al. An Intelligent Hyper-Heuristic Framework for CHeSC 2011 , 2012, LION.
[49] Mauro Brunato,et al. Reactive Search and Intelligent Optimization , 2008 .
[50] P. Cowling,et al. A Parameter-Free Hyperheuristic for Scheduling a Sales Summit , 2002 .
[51] Graham Kendall,et al. Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques , 2013 .
[52] Hasan Pirkul,et al. A heuristic solution procedure for the multiconstraint zero‐one knapsack problem , 1987 .
[53] Saïd Hanafi,et al. Improved convergent heuristics for the 0-1 multidimensional knapsack problem , 2011, Ann. Oper. Res..
[54] Günther R. Raidl,et al. Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization , 2008, Hybrid Metaheuristics.
[55] Ernesto Costa,et al. Multidimensional Knapsack Problem: A Fitness Landscape Analysis , 2008, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).
[56] Ingo Wegener,et al. Real royal road functions--where crossover provably is essential , 2001, Discret. Appl. Math..
[57] Edmund K. Burke,et al. An Improved Choice Function Heuristic Selection for Cross Domain Heuristic Search , 2012, PPSN.
[58] Saïd Salhi,et al. Hyper-heuristic approaches for the response time variability problem , 2011, Eur. J. Oper. Res..
[59] Sanja Petrovic,et al. A graph-based hyper-heuristic for educational timetabling problems , 2007, Eur. J. Oper. Res..
[60] H. Laborit,et al. [Experimental study]. , 1958, Bulletin mensuel - Societe de medecine militaire francaise.
[61] Patrick De Causmaecker,et al. A hyperheuristic approach to examination timetabling problems: benchmarks and a new problem from practice , 2012, J. Sched..
[62] Pablo Moscato,et al. 3 Memetic Algorithms , 2004 .
[63] Ender Özcan,et al. Hill Climbers and Mutational Heuristics in Hyperheuristics , 2006, PPSN.
[64] Arnaud Fréville,et al. An Efficient Preprocessing Procedure for the Multidimensional 0- 1 Knapsack Problem , 1994, Discret. Appl. Math..
[65] Matthias Prandtstetter,et al. Hybrid Heuristics for Multimodal Homecare Scheduling , 2012, CPAIOR.
[66] Federico Della Croce,et al. Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem , 2012, Comput. Oper. Res..
[67] Qian,et al. Simulated Annealing for the 0/1 Multidimensional Knapsack Problem , 2007 .
[68] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[69] Thomas Bäck,et al. The zero/one multiple knapsack problem and genetic algorithms , 1994, SAC '94.
[70] Graham Kendall,et al. Hyperion - A Recursive Hyper-Heuristic Framework , 2011, LION.
[71] Graham Kendall,et al. A Tabu-Search Hyperheuristic for Timetabling and Rostering , 2003, J. Heuristics.
[72] Richard S. Sutton,et al. Introduction to Reinforcement Learning , 1998 .
[73] Jack J. Dongarra,et al. Performance of various computers using standard linear equations software in a FORTRAN environment , 1988, CARN.
[74] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[75] Terry Jones,et al. Crossover, Macromutationand, and Population-Based Search , 1995, ICGA.
[76] Graham Kendall,et al. A Classification of Hyper-heuristic Approaches , 2010 .
[77] John R. Woodward,et al. Hyper-Heuristics , 2015, GECCO.
[78] E. Burke,et al. A Late Acceptance Strategy in Hill-Climbing for Exam Timetabling Problems , 2008 .
[79] Jin-Kao Hao,et al. A hybrid approach for the 0-1 multidimensional knapsack problem , 2001, IJCAI 2001.
[80] Maria Grazia Speranza,et al. Kernel search: A general heuristic for the multi-dimensional knapsack problem , 2010, Comput. Oper. Res..
[81] Graham Kendall,et al. A Hyperheuristic Approach to Scheduling a Sales Summit , 2000, PATAT.
[82] Graham Kendall,et al. Hyper-Heuristics: An Emerging Direction in Modern Search Technology , 2003, Handbook of Metaheuristics.
[83] John R. Koza,et al. Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.
[84] Elizabeth León Guzman,et al. A hyper-heuristic approach to design and tuning heuristic methods for web document clustering , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).
[85] Graham Kendall,et al. Exploring Hyper-heuristic Methodologies with Genetic Programming , 2009 .