A memetic algorithm based on edge-state learning for max-cut

作者：

Highlights：

• An original edge-state perspective for design learning operators for max-cut.

• A novel learning operator to learn edge states.

• A new evolutionary framework for max-cut.

• It provides competitive results on two mostly used benchmark sets.

摘要

•An original edge-state perspective for design learning operators for max-cut.•A novel learning operator to learn edge states.•A new evolutionary framework for max-cut.•It provides competitive results on two mostly used benchmark sets.

论文关键词：Max-cut,Combinatory optimization,Metaheuristics,Memetic algorithm,EDA algorithms,Path relinking

论文评审过程：Received 26 May 2020, Revised 30 May 2022, Accepted 3 July 2022, Available online 22 July 2022, Version of Record 10 August 2022.

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