Next Article in Journal
Fusion of Multiple Pyroelectric Characteristics for Human Body Identification
Previous Article in Journal
Time Series Prediction Method of Bank Cash Flow and Simulation Comparison
Article Menu

Export Article

Open AccessArticle
Algorithms 2014, 7(4), 663-684; doi:10.3390/a7040663

COOBBO: A Novel Opposition-Based Soft Computing Algorithm for TSP Problems

1
Department of Information Service, Xi'an Communications Institute, No. 8, Zhangba East Road, Xi'an 710106, China
2
Department of Basic Courses, Xi'an Communications Institute, No. 8, Zhangba East Road, Xi'an 710106, China
*
Author to whom correspondence should be addressed.
Received: 9 October 2014 / Revised: 26 November 2014 / Accepted: 8 December 2014 / Published: 12 December 2014
View Full-Text   |   Download PDF [277 KB, uploaded 12 December 2014]   |  

Abstract

In this paper, we propose a novel definition of opposite path. Its core feature is that the sequence of candidate paths and the distances between adjacent nodes in the tour are considered simultaneously. In a sense, the candidate path and its corresponding opposite path have the same (or similar at least) distance to the optimal path in the current population. Based on an accepted framework for employing opposition-based learning, Oppositional Biogeography-Based Optimization using the Current Optimum, called COOBBO algorithm, is introduced to solve traveling salesman problems. We demonstrate its performance on eight benchmark problems and compare it with other optimization algorithms. Simulation results illustrate that the excellent performance of our proposed algorithm is attributed to the distinct definition of opposite path. In addition, its great strength lies in exploitation for enhancing the solution accuracy, not exploration for improving the population diversity. Finally, by comparing different version of COOBBO, another conclusion is that each successful opposition-based soft computing algorithm needs to adjust and remain a good balance between backward adjacent node and forward adjacent node. View Full-Text
Keywords: biogeography-based optimization; opposition-based learning; traveling salesman problems; discrete domain; opposite path; population diversity biogeography-based optimization; opposition-based learning; traveling salesman problems; discrete domain; opposite path; population diversity
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Xu, Q.; Guo, L.; Wang, N.; He, Y. COOBBO: A Novel Opposition-Based Soft Computing Algorithm for TSP Problems. Algorithms 2014, 7, 663-684.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top