Route-exchange algorithm for combinatorial optimization based on swarm intelligence
He XX(何小贤); Zhu YL(朱云龙); Hu KY(胡琨元); Niu B(牛奔)
2006
会议名称International Conference on Intelligent Computing (ICIC)
会议日期August 16-19, 2006
会议地点Kunming, China
页码192-200
中文摘要Inspired by the information interaction of individuals in swarm intelligence, a new algorithm for combinatorial optimization is proposed, which is called as Route-Exchange Algorithm (REA). This is a heuristic approach, in which the individuals of the swarm search the state space independently and simultaneously. When one encounters another in the process, they would interact with each other, exchange the information of routes toured, and utilize the more valuable experiences to improve their own search efficiency. An elite strategy is designed to avoid vibrations. The algorithm has been applied to Traveling Salesman Problem (TSP) and assignment problem in this paper. Some benchmark functions are tested in the experiments. The results indicate the algorithm can quickly converge to the optimal solution with quite low cost.
收录类别SCI ; EI ; CPCI(ISTP)
产权排序1
会议主办者IEEE Computat Intelligence Soc, Int Neural Network Soc, Natl Sci Fdn China
会议录COMPUTATIONAL INTELLIGENCE AND BIOINFORMATICS, PT 3, PROCEEDINGS
会议录出版者SPRINGER-VERLAG
会议录出版地BERLIN
语种英语
ISSN号0302-9743
ISBN号3-540-37277-6
WOS记录号WOS:000240085400021
研究领域[WOS]Biochemistry & Molecular Biology ; Computer Science
WOS标题词Science & Technology ; Life Sciences & Biomedicine ; Technology
内容类型会议论文
源URL[http://ir.sia.cn/handle/173321/8180]  
专题沈阳自动化研究所_工业信息学研究室_先进制造技术研究室
推荐引用方式
GB/T 7714
He XX,Zhu YL,Hu KY,et al. Route-exchange algorithm for combinatorial optimization based on swarm intelligence[C]. 见:International Conference on Intelligent Computing (ICIC). Kunming, China. August 16-19, 2006.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace