Evolutionary-based tailoring of synthetic instances for the Knapsack problem
暂无分享,去创建一个
Carlos A. Coello Coello | Hugo Terashima-Marín | José Carlos Ortiz-Bayliss | Santiago E. Conant-Pablos | Iván Amaya | Luis Fernando Plata-González | C. Coello | H. Terashima-Marín | I. Amaya | S. E. Conant-Pablos | J. C. Ortíz-Bayliss
[1] Lei Fang,et al. A Quantum-Inspired Artificial Immune System for Multiobjective 0-1 Knapsack Problems , 2010, ISNN.
[2] Limin Jia,et al. Physical topology optimization of infrastructure health monitoring sensor network for high-speed rail , 2016 .
[3] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[4] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[5] Daniele Vigo,et al. The Three-Dimensional Bin Packing Problem , 2000, Oper. Res..
[6] Michel Gendreau,et al. Hyper-heuristics: a survey of the state of the art , 2013, J. Oper. Res. Soc..
[7] T. G. I. Fernando,et al. Performance analysis of the multi-objective ant colony optimization algorithms for the traveling salesman problem , 2015, Swarm Evol. Comput..
[8] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .
[9] Ruhul A. Sarker,et al. A methodology for the large-scale multi-period precedence-constrained knapsack problem: an application in the mining industry , 2017 .
[10] Jacques Teghem,et al. The multiobjective multidimensional knapsack problem: a survey and a new approach , 2010, Int. Trans. Oper. Res..
[11] J. I. van Hemert. Evolving binary constraint satisfaction problem instances that are difficult to solve , 2003 .
[12] Carlos A. Coello Coello,et al. Tailoring Instances of the 1D Bin Packing Problem for Assessing Strengths and Weaknesses of Its Solvers , 2018, PPSN.
[13] Thomas Philip Runarsson,et al. An Evolutionary Approach to the Discovery of Hybrid Branching Rules for Mixed Integer Solvers , 2015, 2015 IEEE Symposium Series on Computational Intelligence.
[14] Hermann Hellwagner,et al. Piece selection algorithms for layered video streaming in P2P networks , 2014, Discret. Appl. Math..
[15] Ana Maria A. C. Rocha,et al. Improved binary artificial fish swarm algorithm for the 0-1 multidimensional knapsack problems , 2014, Swarm Evol. Comput..
[16] Jano I. van Hemert,et al. Evolving Combinatorial Problem Instances That Are Difficult to Solve , 2006, Evolutionary Computation.
[17] David Pisinger,et al. Where are the hard knapsack problems? , 2005, Comput. Oper. Res..
[18] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[19] Magdalene Marinaki,et al. Bumble Bees Mating Optimization Algorithm for the Vehicle Routing Problem , 2014 .
[20] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[21] Jano I. van Hemert,et al. Discovering the suitability of optimisation algorithms by learning from evolved instances , 2011, Annals of Mathematics and Artificial Intelligence.
[22] Nicos Christofides,et al. The vehicle routing problem , 1976, Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle.
[23] Marco Laumanns,et al. SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .
[24] Edmund K. Burke,et al. A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem , 2016, Evolutionary Computation.
[25] Bruce L. Golden,et al. The open vehicle routing problem: Algorithms, large-scale test problems, and computational results , 2007, Comput. Oper. Res..
[26] Hugo Terashima-Marín,et al. Combine and conquer: an evolutionary hyper-heuristic approach for solving constraint satisfaction problems , 2016, Artificial Intelligence Review.
[27] Ender Özcan,et al. A genetic programming hyper-heuristic for the multidimensional knapsack problem , 2014, Kybernetes.
[28] David W. Corne,et al. Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, Evolutionary Computation.
[29] Andrea Lodi,et al. MIPLIB 2010 , 2011, Math. Program. Comput..
[30] José Rui Figueira,et al. An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: A computational study and comparison with meta-heuristics , 2015, Appl. Math. Comput..
[31] Ivana Ljubic,et al. An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem , 2017, Eur. J. Oper. Res..
[32] Lothar Thiele,et al. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..
[33] Aruna Apte,et al. An application of the multiple knapsack problem: The self-sufficient marine , 2017, Eur. J. Oper. Res..