Reference Hub4
Contour Gradient Optimization

Contour Gradient Optimization

Zhou Wu, Tommy W. S. Chow, Shi Cheng, Yuhui Shi
Copyright: © 2013 |Volume: 4 |Issue: 2 |Pages: 28
ISSN: 1947-9263|EISSN: 1947-9271|EISBN13: 9781466632479|DOI: 10.4018/jsir.2013040101
Cite Article Cite Article

MLA

Wu, Zhou, et al. "Contour Gradient Optimization." IJSIR vol.4, no.2 2013: pp.1-28. http://doi.org/10.4018/jsir.2013040101

APA

Wu, Z., Chow, T. W., Cheng, S., & Shi, Y. (2013). Contour Gradient Optimization. International Journal of Swarm Intelligence Research (IJSIR), 4(2), 1-28. http://doi.org/10.4018/jsir.2013040101

Chicago

Wu, Zhou, et al. "Contour Gradient Optimization," International Journal of Swarm Intelligence Research (IJSIR) 4, no.2: 1-28. http://doi.org/10.4018/jsir.2013040101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Inspired by the local cooperation behavior in the real world, a new evolutionary algorithm Contour Gradient Optimization algorithm (CGO) is proposed for solving optimization problems. CGO is a new type of global search algorithm that emulates the cooperation among neighbors. Each individual in CGO evolves in its neighborhood environment to find a better region. Each individual moves with a velocity measured by the field of its nearest individuals. The field includes the attractive forces from its better neighbor in the higher contour level and the repulsive force from its worse neighbor in the lower contour level. Intensive simulations were performed and the results show that CGO is able to solve the tested multimodal optimization problems globally. In this paper, CGO is thoroughly compared with six different widely used optimization algorithms under sixteen different benchmark functions. The comparative analysis shows that CGO is comparatively better than these algorithms in the respect of accuracy and effectiveness.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.