Improvement of Traveling Salesman Problem Solution Using Hybrid Algorithm Based on Best-Worst Ant System and Particle Swarm Optimization
This work presents a novel Best-Worst Ant System (BWAS) based algorithm to settle the Traveling Salesman Problem (TSP). The researchers has been involved in ordinary Ant Colony Optimization (ACO) technique for TSP due to its versatile and easily adaptable nature. However, additional potential improv...
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-05-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/11/11/4780 |