[1]SHEN Jihong,WANG Kan.The light ray particle swarm optimization for solving the traveling salesman problem[J].CAAI Transactions on Intelligent Systems,2012,7(2):174-182.
Copy

The light ray particle swarm optimization for solving the traveling salesman problem

CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume: 7 Number of periods: 2012 2 Page number: 174-182 Column: 学术论文—智能系统 Public date: 2012-04-25
Title:
The light ray particle swarm optimization for solving the traveling salesman problem
Author(s):
SHEN Jihong1;  WANG Kan2
1.College of Science, Harbin Engineering University, Harbin 150001, China;
2. College of Automation, Harbin Engineering University, Harbin 150001, China
Keywords:
travel salesman problem;  chaos optimization algorithm;  Ferma’s principle;  particle swarm optimization;  light ray optimization
CLC:
TP301.6
DOI:
-
Abstract:
A new hybrid intelligent optimization was given to solve the traveling salesman problem (TSP) by introducing the thought of an LRO algorithm, chaos optimization algorithm, and particle swarm optimization (PSO). A group of optimal initial values were found by using the features of LRO. Next, by employing the method of discrete chaotic particle swarm optimization and introducing the swap operator, swap sequence, and chaos sequence, an optical chaos PSO adaptive for the TSP problem was proposed. The stability and convergence of the optimization was proved decisively. The numerical simulation results show that this new optimization method has a good convergence rate and less iterative steps, thus allowing a satisfactory solution to be found rapidly. The method provides a new inspiration for solving the TSP problem. 
References:
［1］KENNEDY J, EBERHART R. A discrete binary version of the particle swarm algorithm［C］//Proceedings of the World Multiconference on Systemic, Cybernetics and Informatics. Piscataway, USA: IEEE Service Center, 1997: 41044109.
［2］CLERC M. Discrete particle swarm optimization［C］//New Optimization Techniques in Engineering. Berlin：SpingerVerlag, 2004: 204219.
［3］高尚，韩斌，吴小俊，等. 求解旅行商问题的混合粒子群优化算法［J］. 控制与决策, 2004, 19(11): 12861289.
GAO Shang, HAN Bin, WU Xiaojun, et al. Solving traveling salesman problem by hybrid particle swarm optimization algorithm［J］. Control and Decision, 2004, 19(11): 12861289.
［4］HENDLASS T. Preserving diversity in particle swarm optimization［J］. Lecture Notes in Artificial Intelligence, 2003(2718): 155199.
［5］XIE Shenli, TANG Min, DONG Jinxiang. An improved genetic algorithm for TSP problem［J］. Computer Engineering and Application, 2002, 38(8): 5860.
［6］SHEN Jihong, LI Yan. Light ray optimization and its parameter analysis［C］//Proceedings of the 2009 International Joint Conference on Computational Science and Optimization. Kunming, China, 2007: 918922.
［7］沈继红，李焱. 基于正六边形网格的光线寻优算法［C］//中国运筹学会第十届学术交流会论文集. 南京, 中国, 2010: 8994.
SHEN Jihong, LI Yan. Light ray optimization on hexagonal grid［C］//Proceedings of the 10th ORSC. Nanjing, China, 2010: 8994.
［8］SHEN Jihong, LI Jialian. The principle analysis of light ray optimization［C］//2010 Second International Conference on Computational Intelligence and Natural Computing. Wuhan, China, 2010: 154157.
［9］SHI Y, EBERHART R C. A modified particle swarm optimizer［C］//Proceedings of the Congress on Evolutionary Computation. Anchorage, USA, 1998: 6973.
［10］ZHANG Guoping, WANG Zhengou, YUAN Guolin. A chaotic search method for a class of combinatorial optimization problems［J］. Systems Engineering Theory & Practice, 2001, 21(5): 102105.
［11］梁艳春,吴春国.群智能优化算法理论与应用［M］.北京： 科学出版社, 2009: 1721.
［12］郑大中.线性系统理论［M］.北京： 清华大学出版社, 2009: 213251.
［13］ANDRIES P E.计算智能导论［M］.北京： 清华大学出版社, 2010: 111123.
Similar References:

Memo

-

Last Update: 2012-07-12

Copyright © CAAI Transactions on Intelligent Systems