Solution of travelling salesman problem using bacterial foraging optimisation algorithm
by Om Prakash Verma; Rashmi Jain; Vindhya Chhabra
International Journal of Swarm Intelligence (IJSI), Vol. 1, No. 2, 2014

Abstract: 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. A good performance of an algorithm on TSP indicates its usefulness in the field of optimisation. This paper presents a new method to solve the TSP using bacterial foraging optimisation algorithm (BFOA). The key step of BFOA used in 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. In the proposed algorithm, the movement of bacterium is decided by computing direction and distance matrix. 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. The new approach is also analysed quantitatively with genetic algorithm based on running time of the algorithm.

Online publication date: Wed, 02-Jul-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Swarm Intelligence (IJSI):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com