An Improved Ant Colony Optimization Based on an Adaptive Heuristic Factor for the Traveling Salesman Problem
The traveling salesman problem (TSP) is a typical combinatorial optimization problem, which is often applied to sensor placement, path planning, etc. In this paper, an improved ACO algorithm based on an adaptive heuristic factor (AHACO) is proposed to deal with the TSP. In the AHACO, three main impr...
Saved in:
| Main Authors: | Pengzhen Du, Ning Liu, Haofeng Zhang, Jianfeng Lu |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Journal of Advanced Transportation |
| Online Access: | http://dx.doi.org/10.1155/2021/6642009 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Evaluating quantum-classical heuristics for traveling salesman problem
by: Mariia A. Makarova, et al.
Published: (2025-07-01) -
A carbon aware ant colony system for the sustainable generalized traveling salesman problem
by: Marina Lin, et al.
Published: (2025-07-01) -
A Comparison of Heuristic Algorithms for Solving the Traveling Salesman Problem
by: Younes Khdeir, et al.
Published: (2024-09-01) -
PERFORMANCE ANALYSIS OF OPTIMIZATION METHODS FOR SOLVING TRAVELING SALESMAN PROBLEM
by: Chandra Agung, et al.
Published: (2021-03-01) -
On the Optimization and Parallelizing Little Algorithm for Solving the Traveling Salesman Problem
by: V. V. Vasilchikov
Published: (2016-08-01)