首页 | 本学科首页   官方微博 | 高级检索  
     检索      

指派问题的遗传算法研究与实现
引用本文:李言,陈祖安.指派问题的遗传算法研究与实现[J].西安理工大学学报,1996,12(4):271-276.
作者姓名:李言  陈祖安
作者单位:西安理工大学机械与精仪学院,西北工业大学
摘    要:提出了用遗传算法(GeneticAlgorithm)进行运筹学中指派问题(AssignmentProblem)优化的新方法。根据优化问题的性质,设计了两种编码方案,以及适合此类问题的复制、交换、倒位、变异四种遗传操作符。在此基础上,完成了整个优化算法及程序框图,并用C语言实现。计算结果表明,算法设计正确,程序灵活可靠,是解决此类问题的一种行之有效的方法。

关 键 词:指派问题,遗传算法,优化

Research on Genetic Algorithm for Assignment Problem and Its Realization
Li Yan, Chen Zu''an, Xu Yuefei, Zhang Xiaokun, Peng Yanwu.Research on Genetic Algorithm for Assignment Problem and Its Realization[J].Journal of Xi'an University of Technology,1996,12(4):271-276.
Authors:Li Yan  Chen Zu'an  Xu Yuefei  Zhang Xiaokun  Peng Yanwu
Abstract:A kind of new optimal method based on the genetic algorithm for the asssignmentproblem is put forward in this paper. Two coding methods and four genetic operators about reproduction, crossover,reverse, mutation are designed according to the characteristics of this kindof problem. A complete optimal algorithm is given, which is realized by C language. The resultsshow that the algorithm is correct and the program is nexible and reliable. The method is effective for this type of optimal problem.
Keywords:assignment problem genetic algorithm optimization method  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号