Multi-Subdomain Grouping-Based Particle Swarm Optimization for the Traveling Salesman Problem

Multi-Subdomain Grouping-Based Particle Swarm Optimization for the Traveling Salesman Problem

Traveling salesman problem (TSP) has been widely applied to various fields of production and life. In order to solve the TSP, this work optimizes the architecture of the particle swarm optimization (PSO) by introducing a preprocessing multi-subdomain grouping approach to divide the entire search spa...

Full description

Bibliographic Details
Main Authors: Ying Cui, Jiabao Zhong, Fengru Yang, Shixin Li, Penghao Li
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Traveling salesman problem
particle swarm optimization
mutation
particle competition mechanism
multi-subdomain grouping
<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">k</italic>-opt
Online Access:https://ieeexplore.ieee.org/document/9298761/

Internet

https://ieeexplore.ieee.org/document/9298761/

Similar Items