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...
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: | |
Online Access: | https://ieeexplore.ieee.org/document/9298761/ |
Similar Items
-
Hermite-Hadamard Type Inequalities via Exponentially (p, h)-Convex Functions
by: N. Mehreen, et al.
Published: (2020-01-01) -
On a Family of Quantum Synchronizable Codes Based on the <inline-formula> <tex-math notation="LaTeX">$(\lambda(u + v)|u - v)$ </tex-math></inline-formula> Construction
by: Chao Du, et al.
Published: (2020-01-01) -
A Certain Class of <italic>t</italic>-Intuitionistic Fuzzy Subgroups
by: Muhammad Gulzar, et al.
Published: (2020-01-01) -
<inline-formula> <tex-math notation="LaTeX">$\ell m_p$ </tex-math></inline-formula>: A Novel Similarity Measure for Matching Local Image Descriptors
by: Guohua Lv
Published: (2018-01-01) -
Antimagicness of <inline-formula> <tex-math notation="LaTeX">$mC_n$ </tex-math></inline-formula>-Path and Its Disjoint Union
by: Yi Hu, et al.
Published: (2019-01-01)