An improved grammatical evolution approach for generating perturbative heuristics to solve combinatorial optimization problems

作者：

Highlights：

• Presents a novel methodology for generating perturbative heuristics from scratch.

• Methodology capable of producing good quality perturbative heuristics.

• Methodology can be easily applied to multiple problem domains.

• Methodology can be extended to generate any type of perturbative heuristic.

摘要

•Presents a novel methodology for generating perturbative heuristics from scratch.•Methodology capable of producing good quality perturbative heuristics.•Methodology can be easily applied to multiple problem domains.•Methodology can be extended to generate any type of perturbative heuristic.

论文关键词：Hyper-heuristics,Grammatical evolution,Examination timetabling,Vehicle routing,Boolean satisfiability

论文评审过程：Received 18 October 2019, Revised 2 August 2020, Accepted 4 August 2020, Available online 13 August 2020, Version of Record 17 August 2020.

论文官网地址：https://doi.org/10.1016/j.eswa.2020.113853