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

一种求解图的L(2,1)标号问题的混合遗传算法
引用本文:储育青,齐义飞,肖立顺,陈晖敏,石玉文.一种求解图的L(2,1)标号问题的混合遗传算法[J].科学技术与工程,2010,10(21).
作者姓名:储育青  齐义飞  肖立顺  陈晖敏  石玉文
作者单位:中国矿业大学理学院,徐州,221116
基金项目:中国矿业大学大学生实践创新训练计划 
摘    要:通过Floyd算法、贪心算法和遗传算法结合提出了一种解决L(2,1)标号问题的混合遗传算法.通过仿真实验说明该混合算法加快了单纯应用遗传算法求解的收敛速度,能够快速解决给定图的L(2,1)标号问题.

关 键 词:L(2  1)标号  贪心算法  混合遗传算法
收稿时间:4/28/2010 8:07:53 PM
修稿时间:4/28/2010 8:07:53 PM

An Hybrid genetic Algorithm for Solving L (2,1)-Label of Graph
Chu Yuqing,Qi Yifei,Xiao Lishun,Chen Huimin and Shi Yuwen.An Hybrid genetic Algorithm for Solving L (2,1)-Label of Graph[J].Science Technology and Engineering,2010,10(21).
Authors:Chu Yuqing  Qi Yifei  Xiao Lishun  Chen Huimin and Shi Yuwen
Institution:College of Sciences,China University of Mining and Technology,College of Sciences,China University of Mining and Technology,College of Sciences,China University of Mining and Technology,College of Sciences,China University of Mining and Technology
Abstract:This paper presents a hybrid genetic algorithm for solving the L(2,1)-label problem based on combining the Floyd algorithm,greedy algorithm and tenetic algorithm.Also the simulation results shows that compared with genetic algorithm, the hybrid algorithm has converges faster and can solve the L(2,1)-label of a given graph fleetly.
Keywords:L(2  1)-label  Greedy altorithm  Hybrid algorithm
本文献已被 万方数据 等数据库收录!
点击此处可从《科学技术与工程》浏览原始摘要信息
点击此处可从《科学技术与工程》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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