To read the full version of this content please select one of the options below:

Enhancing performance of oppositional BBO using the current optimum (COOBBO) for TSP problems

Qingzheng Xu (Xi’an Communications Institute, Xi’an, China)
Na Wang (Xi’an Communications Institute, Xi’an, China)
Lei Wang (School of Computer Science and Engineering, Xi’an University of Technology, Xi’an, China)

International Journal of Intelligent Computing and Cybernetics

ISSN: 1756-378X

Article publication date: 13 June 2016




The purpose of this paper is to examine and compare the entire impact of various execution skills of oppositional biogeography-based optimization using the current optimum (COOBBO) algorithm.


The improvement measures tested in this paper include different initialization approaches, crossover approaches, local optimization approaches, and greedy approaches. Eight well-known traveling salesman problems (TSP) are employed for performance verification. Four comparison criteria are recoded and compared to analyze the contribution of each modified method.


Experiment results illustrate that the combination model of “25 nearest-neighbor algorithm initialization+inver-over crossover+2-opt+all greedy” may be the best choice of all when considering both the overall algorithm performance and computation overhead.


When solving TSP with varying scales, these modified methods can enhance the performance and efficiency of COOBBO algorithm in different degrees. And an appropriate combination model may make the fullest possible contribution.



This work was supported in part by the National Natural Science Foundation of China (Nos. 61375089 and 61305083).


Xu, Q., Wang, N. and Wang, L. (2016), "Enhancing performance of oppositional BBO using the current optimum (COOBBO) for TSP problems", International Journal of Intelligent Computing and Cybernetics, Vol. 9 No. 2, pp. 144-164.



Emerald Group Publishing Limited

Copyright © 2016, Emerald Group Publishing Limited