{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:36:06Z","timestamp":1781105766980,"version":"3.54.1"},"reference-count":36,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4,1]]},"abstract":"<p>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.<\/p>","DOI":"10.4018\/jsir.2013040101","type":"journal-article","created":{"date-parts":[[2013,8,9]],"date-time":"2013-08-09T15:49:02Z","timestamp":1376063342000},"page":"1-28","source":"Crossref","is-referenced-by-count":4,"title":["Contour Gradient Optimization"],"prefix":"10.4018","volume":"4","author":[{"given":"Zhou","family":"Wu","sequence":"first","affiliation":[{"name":"Department of Electrical and Electronic Engineering, City University of Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tommy W. S.","family":"Chow","sequence":"additional","affiliation":[{"name":"Department of Electrical and Electronic Engineering, City University of Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shi","family":"Cheng","sequence":"additional","affiliation":[{"name":"Division of Computer Science, The University of Nottingham Ningbo, Ningbo, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuhui","family":"Shi","sequence":"additional","affiliation":[{"name":"Department of Electrical and Electronic Engineering, Xi'an Jiaotong-Liverpool University, Suzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jsir.2013040101-0","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04378-3"},{"key":"jsir.2013040101-1","doi-asserted-by":"crossref","unstructured":"Eberhart, R., & Kennedy, J. (1995). A new optimizer using particle swarm theory. In Proceedings of the Sixth International Symposium on Micro Machine and Human Science (pp. 39-43).","DOI":"10.1109\/MHS.1995.494215"},{"key":"jsir.2013040101-2","doi-asserted-by":"crossref","unstructured":"Eberhart, R., & Shi, Y. (2000). Comparing inertia weights and constriction factors in particle swarm optimization. In Proceedings of the 2000 IEEE Congress on Evolutionary Computation (CEC2000) (pp. 84-89).","DOI":"10.1109\/CEC.2000.870279"},{"key":"jsir.2013040101-3","doi-asserted-by":"crossref","unstructured":"Eberhart, R., & Shi, Y. (2001). Particle swarm optimization: developments, applications and resources. In Proceedings of the 2001 IEEE Congress on Evolutionary Computation (CEC2001) (pp. 81-86).","DOI":"10.1109\/CEC.2001.934374"},{"issue":"15","key":"jsir.2013040101-4","first-page":"617","article-title":"A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behavior: A case study on the CEC'2005 special session on real parameter optimization.","volume":"6","author":"S.Garc\u00eda","year":"2009","journal-title":"Journal of Heuristics"},{"key":"jsir.2013040101-5","doi-asserted-by":"crossref","unstructured":"Huhse, J., Villmann, T., Merz, P., & Zell, A. (2002). Evolution strategy with neighborhood attraction using a neural gas approach. In Proceedings of the Parallel Problem Solving from Nature (PPSN VII) (LNCS 2439, pp. 391-400).","DOI":"10.1007\/3-540-45712-7_38"},{"key":"jsir.2013040101-6","first-page":"33","article-title":"Adaptive simulated annealing (ASA): Lessons learned.","volume":"25","author":"L.Ingber","year":"1996","journal-title":"Control and Cybernetics"},{"key":"jsir.2013040101-7","unstructured":"Kennedy, J., & Eberhart, R. (1995) Particle swarm optimization. In Proceedings of IEEE International Conference on Neural Networks (pp.1942-1948)"},{"key":"jsir.2013040101-8","doi-asserted-by":"publisher","DOI":"10.1177\/027836498600500106"},{"key":"jsir.2013040101-9","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2006.892100"},{"key":"jsir.2013040101-10","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"jsir.2013040101-11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97966-8"},{"key":"jsir.2013040101-12","doi-asserted-by":"publisher","DOI":"10.1109\/72.712155"},{"key":"jsir.2013040101-13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39930-8_6"},{"key":"jsir.2013040101-14","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2005.04.004"},{"key":"jsir.2013040101-15","doi-asserted-by":"crossref","unstructured":"Liang, J., Suganthan, P. N., & Deb, K. (2005). Novel composition test functions for numerical global optimization. In Proceedings of the 2005 IEEE Swarm Intelligence Symposium (SIS2005) (pp. 68-75).","DOI":"10.1109\/SIS.2005.1501604"},{"key":"jsir.2013040101-16","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.857610"},{"key":"jsir.2013040101-17","unstructured":"Lin, Y., Zhang, J., & Lan, L. (2008). A contour method in population-based stochastic algorithms. In Proceedings of the 2008 IEEE Congress on Evolutionary Computation (CEC2008) (pp. 2388-2395)."},{"key":"jsir.2013040101-18","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2007.916696"},{"key":"jsir.2013040101-19","doi-asserted-by":"publisher","DOI":"10.1109\/3468.844352"},{"key":"jsir.2013040101-20","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.826074"},{"key":"jsir.2013040101-21","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2004.826132"},{"key":"jsir.2013040101-22","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-010-0647-2"},{"key":"jsir.2013040101-23","doi-asserted-by":"crossref","unstructured":"Ronkkonen, J., Kukkonen, S., & Price, K. V. (2005). Real-parameter optimization with differential evolution. In Proceedings of the 2005 IEEE Congress on Evolutionary Computation (CEC2005) (pp. 506-513).","DOI":"10.1109\/CEC.2005.1554725"},{"key":"jsir.2013040101-24","doi-asserted-by":"publisher","DOI":"10.1016\/0303-2647(96)01621-8"},{"key":"jsir.2013040101-25","doi-asserted-by":"crossref","unstructured":"Shi, Y., & Eberhart, R. (1998). A modified particle swarm optimizer. In Proceedings of the 1998 IEEE Congress on Evolutionary Computation (CEC1998) (pp. 69-73).","DOI":"10.1109\/ICEC.1998.699146"},{"key":"jsir.2013040101-26","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008202821328"},{"key":"jsir.2013040101-27","author":"P. N.Suganthan","year":"2005","journal-title":"Problem definitions and evaluation criteria for the cec2005 special session on real parameter optimization. Technical report"},{"key":"jsir.2013040101-28","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.826069"},{"key":"jsir.2013040101-29","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6229.001.0001","author":"M. D.Vose","year":"1999","journal-title":"Simple genetic algorithm: Foundation and theory"},{"key":"jsir.2013040101-30","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"jsir.2013040101-31","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2006.887556"},{"key":"jsir.2013040101-32","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2010.2047264"},{"key":"jsir.2013040101-33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39930-8_7"},{"key":"jsir.2013040101-34","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2014613"},{"key":"jsir.2013040101-35","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2003.821456"}],"container-title":["International Journal of Swarm Intelligence Research"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=79974","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T16:02:46Z","timestamp":1688400166000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jsir.2013040101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2013,4,1]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"URL":"https:\/\/doi.org\/10.4018\/jsir.2013040101","relation":{},"ISSN":["1947-9263","1947-9271"],"issn-type":[{"value":"1947-9263","type":"print"},{"value":"1947-9271","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,1]]}}}