Proceedings of the Annual Conference of JSAI
Online ISSN : 2758-7347
33rd (2019)
Session ID : 3J4-J-1-03
Conference information

Algorithm of Traveling Salesman Problem using Particle Swarm Optimization
*Yuki YAMADAHajime ANADA
Author information
CONFERENCE PROCEEDINGS FREE ACCESS

Details
Abstract

Many economic and industrial problems lead to combinatorial optimization problems. Of these combinatorial optimization problems, the traveling salesman problem (TSP) is one of the most important problem in the field of technology and science. And particle swarm optimization (PSO) is a population based stochastic optimization technique inspired by social behavior of bird flocking or fish schooling. PSO has been applied to various combinatorial optimization problems belonging to nondeterministic polynomial-time hard (NP-hard) combinational problems. But applying PSO to TSP is difficult. Therefore, we construct a new algorithm which is based on PSO. We confirmed the effectiveness of our algorithm using several benchmark problems taken from the TSPLIB, which is a library of traveling salesman problem.

Content from these authors
© 2019 The Japanese Society for Artificial Intelligence
Previous article Next article
feedback
Top