Automatic design of specialized algorithms for the binary knapsack problem
作者：
Highlights：
• Complex optimization problems arise in many artificial intelligence fields.
• Algorithms are automatically designed for a complex optimization problem.
• The automatic design produces several algorithms for the same problem.
• The algorithms are specialized for set of instances.
• The novel algorithms that emerge are computationally effective.
摘要
•Complex optimization problems arise in many artificial intelligence fields.•Algorithms are automatically designed for a complex optimization problem.•The automatic design produces several algorithms for the same problem.•The algorithms are specialized for set of instances.•The novel algorithms that emerge are computationally effective.
论文关键词：Automatic generation of algorithms,Binary knapsack problem,Genetic programming,Hyperheuristic,Generative design of algorithms
论文评审过程：Received 3 December 2018, Revised 31 August 2019, Accepted 31 August 2019, Available online 2 September 2019, Version of Record 12 September 2019.
论文官网地址：https://doi.org/10.1016/j.eswa.2019.112908
