TRAVELING SALESMAN PROBLEM SOLVED using bacterial foraging algorithm. “Travelling salesman problem (TSP) is one of the most intensively studied problems in computational mathematics. It is a standard test bed for new algorithmic ideas. The proposed work is computation of chemotaxis, where a bacterium takes steps over the foraging landscape in order to reach the regions with high-nutrient content. If a bacterium does not encounter a city within the minimum distance constraint in its first step, then it searches for another city by taking another step and so on.“
https://lnkd.in/d5PS8VA
linkedin post 2022-06-29 05:12:48
Nigel Fleming
September 21, 2022