Discrete bacteria foraging optimization algorithm for solving TSP

Traveling salesman problem (TSP) is a typical representative of combinatorial optimization problems. This paper proposed a discrete bacteria foraging optimization (DBFO) algorithm to tackle the TSP. It designed a new chemotaxis operator which was combined with 2-opt algorithm so as to handle discret...

Full description

Saved in:
Bibliographic Details
Published inJi suan ji ying yong yan jiu Vol. 31; no. 12; pp. 3642 - 3650
Main Authors Wang, Yong-Zhen, Chen, Yan, Li, Tao-Ying
Format Journal Article
LanguageChinese
Published 01.12.2014
Subjects
Algorithms
Bacteria
Combinatorial analysis
Computer simulation
Forages
Operators
Optimization
Traveling salesman problem
Online AccessGet full text

Cover

More Information
Summary:Traveling salesman problem (TSP) is a typical representative of combinatorial optimization problems. This paper proposed a discrete bacteria foraging optimization (DBFO) algorithm to tackle the TSP. It designed a new chemotaxis operator which was combined with 2-opt algorithm so as to handle discrete variables, and it made the bacteria foraging algorithm extend to the discrete situation. With the characteristics of the TSP, it designed a new elimination operator which is combined with gene pool so as to direct the generation of new individuals, which improved the search efficiency. Simulation experiments on 22 TSP problems from TSPLIB show that, the proposed algorithm can solve the TSP which city scale is below 500 effectively, and is superior to hybrid ACO and discrete GSO algorithm.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1001-3695
DOI:10.3969/j.issn.1001-3695.2014.12.032