Visibility Adaptation in Ant Colony Optimization for Solving Traveling Salesman Problem
Ant Colony Optimization (ACO) is a practical and well-studied bio-inspired algorithm to generate feasible solutions for combinatorial optimization problems such as the Traveling Salesman Problem (TSP). ACO is inspired by the foraging behavior of ants, where an ant selects the next city to visit acco...
Main Authors: | Abu Saleh Bin Shahadat, M. A. H. Akhand, Md Abdus Samad Kamal |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-07-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/10/14/2448 |
Similar Items
-
Modification of Ant Colony Optimization Algorithm to Solve the Traveling Salesman Problem
by: Alda Larasati Anindya, et al.
Published: (2020-12-01) -
Elitist Ant System with 2-opt Local Search for the Traveling Salesman Problem
by: MARTINOVIC, G., et al.
Published: (2012-02-01) -
A Hierarchical Algorithm Based on Density Peaks Clustering and Ant Colony Optimization for Traveling Salesman Problem
by: Erchong Liao, et al.
Published: (2018-01-01) -
Research on improved ant colony optimization for traveling salesman problem
by: Teng Fei, et al.
Published: (2022-06-01) -
Multi-type ant colony system for solving the multiple traveling salesman problem.
by: Yasel José Costa Salas, et al.
Published: (2013-03-01)