遗传算法求解FDP问题  

Genetic algorithm to FDP

作　　者：吴勇[1] 郭京蕾[2] 魏长华[2] 

机构地区：[1]武汉理工大学自动化学院,湖北武汉430070 [2]华中师范大学计算机科学系,湖北武汉430079

出　　处：《计算机工程与设计》2004年第4期561-563,共3页Computer Engineering and Design

摘　　要：FDP(Film-copy Delivering Problem)问题是一个典型的NP-Hard组合优化问题,长期以来,人们一直在寻求快速、高效的近似算法。介绍了一种适于求解FDP问题的遗传算法,详细地介绍了边重组杂交算子、反转变异算子的设计和分配选择概率的线性函数。通过实验表明,该算法正确、可行,而且计算的结果精确、快速。The FDP (film-copy deliverer problem) is one of the typical NP-hard problems in combinatorial problem. The fast and effective approximate algorithms have been needed to solve the large-scale problem in reasonable time. A genetic algorithm was presented to solve the FDP. Edge recombination crossover, inverse mutation operator and linear function of ranking selection wrer introduced explicitly. The experiment result showed that the genetic algorithm was correct and feasible.

关 键 词：FDP 遗传算法 边重组杂交 反转变异 线性函数 

分 类 号：O224[理学—运筹学与控制论] O242.23[理学—数学]