A unified hyper-heuristic framework for solving bin packing problems
作者：
Highlights：
• Our evolutionary model produces hyper-heuristics that are condition-action rules.
• The hyper-heuristics combine up to six different heuristics in the solution process.
• One and two-dimensional (regular and irregular) bin packing problems are considered.
• We present an algorithm to create random bin packing instances with concave shapes.
• We include several analyses about how heuristics are combined solving problems.
摘要
•Our evolutionary model produces hyper-heuristics that are condition-action rules.•The hyper-heuristics combine up to six different heuristics in the solution process.•One and two-dimensional (regular and irregular) bin packing problems are considered.•We present an algorithm to create random bin packing instances with concave shapes.•We include several analyses about how heuristics are combined solving problems.
论文关键词：Bin packing problems,Evolutionary computation,Hyper-heuristics,Heuristics,Optimization
论文评审过程：Available online 10 May 2014.
论文官网地址：https://doi.org/10.1016/j.eswa.2014.04.043
