Parallel search strategies for TSPs using a greedy genetic algorithm

CORC > 沈阳自动化研究所 > 中国科学院沈阳自动化研究所 > 装备制造技术研究室

	Parallel search strategies for TSPs using a greedy genetic algorithm
	Wei YZ(魏英姿); Hu YL(胡玉兰); Gu KF(谷侃锋)
	2007
会议名称	3rd International Conference on Natural Computation (ICNC 2007)
会议日期	August 24-27, 2007
会议地点	Haikou, China
页码	786-790
通讯作者	魏英姿
中文摘要	Traditional genetic algorithms often meet the occurrence of slow convergence and enclosure competition. We present a parallel algorithm for the traveling salesman problem (TSP) which incorporates several greedy heuristics based on genetic algorithms. We call this algorithm the greedy genetic algorithm (GGA) here. The ideas we incorporate in our algorithm include: (i) generating the initial population using the gene bank; (ii) double-directional greedy crossover and the local searches of greedy mutation; (iii) special-purpose immigrations to promote diversity and an open competition; (iv) stepwise parallel optimization of each individual of the population; (y) developing an overall design that attempts to strike a right balance between divers flcation and a bias towardsfitter individuals. We test all these ideas to assess their impacts on the GGA performance, and also compare our final algorithm to the simple genetic algorithm on the benchmark instances in TSPLIB, a well-known library of TSP instances. We find the greedy genetic algorithm to be a very effective and robust algorithm for TSPs.
收录类别	EI ; CPCI（ISTP）
产权排序	2
会议录	ICNC 2007: THIRD INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 3, PROCEEDINGS
会议录出版者	IEEE COMPUTER SOC
会议录出版地	LOS ALAMITOS
语种	英语
WOS记录号	WOS:000250427500150
内容类型	会议论文
源URL	[http://ir.sia.cn/handle/173321/19853]
专题	沈阳自动化研究所_装备制造技术研究室
推荐引用方式 GB/T 7714	Wei YZ,Hu YL,Gu KF. Parallel search strategies for TSPs using a greedy genetic algorithm[C]. 见:3rd International Conference on Natural Computation (ICNC 2007). Haikou, China. August 24-27, 2007.