带累积费用的线性排序问题的模因算法
A Memetic Algorithm for the Linear Ordering Problem with Cumulative Costs
摘要:
针对具有累积费用的线性排序问题,提出了一种有效的模因算法。该算法结合了基于顺序的重组算子和改进的前后向局部搜索过程,并采用基于解质量的替换准则进行池更新。在118个著名的基准测试实例上的实验表明,该算法通过识别46个新的上界,取得了有竞争力的结果。此外,我们的算法的一些关键成分进行了分析,以了解其性能的来源。
英文摘要:
This paper introduces an effective memetic algorithm for the linear ordering problem with cumulative costs. The proposed algorithm combines an order-based recombination operator with an improved forward-backward local search procedure and employs a solution quality based replacement criterion for pool updating. Extensive experiments on 118 well-known benchmark instances show that the proposed algorithm achieves competitive results by identifying 46 new upper bounds. Furthermore, some critical ingredients of our algorithm are analyzed to understand the source of its performance.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。