A Slime Mold-Ant Colony Fusion Algorithm for Solving Traveling Salesman Problem

A Slime Mold-Ant Colony Fusion Algorithm for Solving Traveling Salesman Problem

The Ant Colony Optimization (ACO) is easy to fall into the local optimum and its convergence speed is slow in solving the Travelling Salesman Problem (TSP). Therefore, a Slime Mold-Ant Colony Fusion Algorithm (SMACFA) is proposed in this paper. Firstly, an optimized path is obtained by Slime Mold Al...

Full description

Bibliographic Details
Main Authors: Meijiao Liu, Yanhui Li, Ang Li, Qi Huo, Ning Zhang, Nan Qu, Mingchao Zhu, Liheng Chen
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Slime mold algorithm
ant colony optimization
high-quality pipelines
fixed selection
travelling salesman problem
Online Access:https://ieeexplore.ieee.org/document/9247179/

Internet

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

Similar Items