New Discrete Chaotic Particle Swarm Algorithm for Traveling Salesman Problem

被引：0
作者：
Li, Jiuyong [1 ]
Wang, Jing [1 ]
机构：
[1] Univ Sci & Technol Beijing, NERCAR, Beijing 100083, Peoples R China
来源：
MANUFACTURING PROCESSES AND SYSTEMS, PTS 1-2 | 2011年 / 148-149卷
关键词：
Particle swarm optimization(PSO); Traveling Salesman Problem(TSP); Chaos theory; Information intercourse;
D O I：
10.4028/www.scientific.net/AMR.148-149.210
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
In this paper, a novel algorithm called CIPSO for short based on particle optimization algorithm(PSO) and Chaos optimization Algorithm(COA) is presented to solve traveling salesman problem(TSP). We propose some new operators to solve the difficulties of implementing PSO into solving this discrete problem based on the special fitness landscape of TSP. Meanwhile embedded with chaos theory it can enhance particles' global searching ability so as not to converge to the local optimal solution too quickly, and the introduction of information intercourse can enhance thire local searching ability. Comparing to SA, GA, ACS and so on, this new algorithm shows its validity and satisfactory effect on several benchmark test problems.
引用
收藏
页码：210 / 214
页数：5
相关论文
共 50 条
[21]   A New Bio-inspired Approach to the Traveling Salesman Problem [J].
Feng, Xiang ;
Lau, Francis C. M. ;
Gao, Daqi .
COMPLEX SCIENCES, PT 2, 2009, 5 :1310-+
[22]   New Genetic Operator (Jump Crossover) for the Traveling Salesman Problem [J].
El Hassani, Hicham ;
Benkachcha, Said ;
Benhra, Jamal .
INTERNATIONAL JOURNAL OF APPLIED METAHEURISTIC COMPUTING, 2015, 6 (02) :33-44
[23]   A new Hybrid Discrete Bat Algorithm for Traveling Salesman Problem using ordered crossover and 3-Opt operators for bat's local search [J].
Amara, Jihen ;
Hamdani, Tarek M. ;
Alimi, Adel M. .
2015 15TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS (ISDA), 2015, :154-159
[24]   Composite Algorithm Based on Clarke - Wright and Local Search for the Traveling Salesman Problem [J].
Komarudin ;
Parhusip, Sandiego F. .
2019 5TH INTERNATIONAL CONFERENCE ON INDUSTRIAL AND BUSINESS ENGINEERING (ICIBE 2019), 2019, :87-90
[25]   Chaotic particle swarm optimization algorithm for flexible process planning [J].
Petrovic, Milica ;
Mitic, Marko ;
Vukovic, Najdan ;
Miljkovic, Zoran .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2016, 85 (9-12) :2535-2555
[26]   Chaotic particle swarm optimization algorithm for flexible process planning [J].
Milica Petrović ;
Marko Mitić ;
Najdan Vuković ;
Zoran Miljković .
The International Journal of Advanced Manufacturing Technology, 2016, 85 :2535-2555
[27]   Efficient convex elastic net algorithm to solve the Euclidean traveling salesman problem [J].
Al-Mulhem, M ;
Al-Maghrabi, T .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1998, 28 (04) :618-620
[28]   Iteration Methods for the Stochastic Traveling Salesman Problem [J].
Kucera, Petr ;
Berankova, Martina ;
Houska, Milan ;
Svasta, Jaroslav .
PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON MATHEMATICAL METHODS IN ECONOMICS 2004, 2004, :170-173
[29]   Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem [J].
Ezugwu, Absalom El-Shamir ;
Adewumi, Aderemi Oluyinka ;
Frincu, Marc Eduard .
EXPERT SYSTEMS WITH APPLICATIONS, 2017, 77 :189-210
[30]   A hybrid particle swarm optimization algorithm for predicting the chaotic time series [J].
Liu, Wei ;
Wang, Kejun ;
Sun, Bing ;
Shao, Keyong .
IEEE ICMA 2006: PROCEEDING OF THE 2006 IEEE INTERNATIONAL CONFERENCE ON MECHATRONICS AND AUTOMATION, VOLS 1-3, PROCEEDINGS, 2006, :2454-+
12345