Adaptive iterated local search for the parallel row ordering problem

作者：

Highlights：

• An Adaptive Iterated Local Search (AILS) algorithm is proposed for the PROP.

• AILS auto-regulates intensification, diversification and intensity of perturbation.

• A technique was used to speed up the calculation of neighborhood move gains.

• AILS improves on previous best solutions for 34 out of 100 tested instances.

• The AILS algorithm can efficiently handle problems with up to 300 facilities.

摘要

•An Adaptive Iterated Local Search (AILS) algorithm is proposed for the PROP.•AILS auto-regulates intensification, diversification and intensity of perturbation.•A technique was used to speed up the calculation of neighborhood move gains.•AILS improves on previous best solutions for 34 out of 100 tested instances.•The AILS algorithm can efficiently handle problems with up to 300 facilities.

论文关键词：Facilities planning and design,Row layout problem,Iterated local search

论文评审过程：Received 25 June 2021, Revised 29 June 2022, Accepted 30 June 2022, Available online 9 July 2022, Version of Record 14 July 2022.

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