arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.4507cs.NEmath.OC
收藏

线性排序问题的多父模因算法

A Multi-parent Memetic Algorithm for the Linear Ordering Problem

Tao Ye, Tao Wang, Zhipeng Lu, Jin-Kao Hao

摘要:

本文提出了一种求解经典线性排序问题的多亲模因算法(MPM)。MPM算法集成了特别是一个多父重组算子产生后代的解决方案和距离和质量为基础的标准池更新。我们的MPM算法进行了评估8套484广泛使用的LOP实例,并与几个国家的最先进的算法在文献中进行比较,显示MPM算法的有效性。具体而言,对于255个最佳解未知的实例,MPM能够检测到比66个实例的先前最佳已知解更好的解,同时匹配163个实例的先前最佳已知结果。在此基础上,对MPM的关键元件和重要参数进行了实验分析。

英文摘要:

In this paper, we present a multi-parent memetic algorithm (denoted by MPM) for solving the classic Linear Ordering Problem (LOP). The MPM algorithm integrates in particular a multi-parent recombination operator for generating offspring solutions and a distance-and-quality based criterion for pool updating. Our MPM algorithm is assessed on 8 sets of 484 widely used LOP instances and compared with several state-of-the-art algorithms in the literature, showing the efficacy of the MPM algorithm. Specifically, for the 255 instances whose optimal solutions are unknown, the MPM is able to detect better solutions than the previous best-known ones for 66 instances, while matching the previous best-known results for 163 instances. Furthermore, some additional experiments are carried out to analyze the key elements and important parameters of MPM.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑