This chapter starts with the inspiration and main mechanisms of one of the most well-regarded combinatorial optimization algorithms called Ant Colony Optimizer (ACO). This algorithm is then employed to find the optimal path for an AUV. In fact, the problem investigated is a real-world application of the Traveling Salesman Problem (TSP).
|Title of host publication||Studies in Computational Intelligence|
|Number of pages||15|
|Publication status||Published - 1 Jan 2020|
|Name||Studies in Computational Intelligence|