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

粒子群优化算法求解地图四色问题
引用本文:陈红顺,夏斌,潘聪,吕志强,韩云. 粒子群优化算法求解地图四色问题[J]. 计算机工程与应用, 2009, 45(20): 39-41. DOI: 10.3778/j.issn.1002-8331.2009.20.011
作者姓名:陈红顺  夏斌  潘聪  吕志强  韩云
作者单位:中国科学院,广州地球化学研究所,广州,510640;中国科学院,地理信息产业发展中心,北京,100101;中国科学院,研究生院,北京,100049;中国科学院,广州地球化学研究所,广州,510640;中国科学院,地理信息产业发展中心,北京,100101;中国科学院,广州地球化学研究所,广州,510640;中国科学院,研究生院,北京,100049;南方数码科技有限公司,广州,510665
摘    要:针对地图四色问题,重新定义了粒子群优化算法中粒子的位置、速度及其运算规则,并融入了遗传算法的变异思想,在传统粒子群优化算法的基础上增加了变异算子。将改进后的粒子群优化算法在湖南省地图上进行仿真实验,结果表明改进后的算法在全局寻优能力方面有较大的提高,求解速度和稳定性方面也都取得了较为满意的效果。

关 键 词:四色问题  粒子群优化算法  贪心算法  组合优化
收稿时间:2008-04-21
修稿时间:2008-7-22 

Particle Swarm Optimization algorithm for solving four-coloring map problem
CHEN Hong-shun,XIA Bin,PAN Cong,LV Zhi-qiang,HAN Yun. Particle Swarm Optimization algorithm for solving four-coloring map problem[J]. Computer Engineering and Applications, 2009, 45(20): 39-41. DOI: 10.3778/j.issn.1002-8331.2009.20.011
Authors:CHEN Hong-shun  XIA Bin  PAN Cong  LV Zhi-qiang  HAN Yun
Affiliation:1.Guangzhou Institute of Geochemistry,Chinese Academy of Sciences,Guangzhou 510640,China 2.Center for GIS Industry Development,Chinese Academy of Sciences,Beijing 100101,China 3.Graduate University of Chinese Academy of Sciences,Beijing 100049,China 4.South Digital Technology Co.Ltd(South Surveying & Mapping),Guangzhou 510665,China
Abstract:Particle's position,velocity and their operation rules in Particle Swarm Optimization ( PSO) are redefined based on the characteristic of four-coloring map problem.A mutation operator is designed according to the mutation thought in Genetic Algorithm( GA).The improved algorithm is tested by coloring Hunan Province Administrative Map,and the results show that it is good at the ability of finding optimal value,the speed and the stability.
Keywords:four-coloring problem  Particle Swarm Optimization(PSO)  greedy algorithm  combinatorial optimization
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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