{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:56:33Z","timestamp":1764996993870},"reference-count":31,"publisher":"Hindawi Limited","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"funder":[{"name":"The University of Southern Mississippi"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Applied Mathematics"],"published-print":{"date-parts":[[2013]]},"abstract":"<jats:p>Structured population in evolutionary algorithms (EAs) is an important research track where an individual only interacts with its neighboring individuals in the breeding step. The main rationale behind this is to provide a high level of diversity to overcome the genetic drift. Cellular automata concepts have been embedded to the process of EA in order to provide a decentralized method in order to preserve the population structure. Harmony search (HS) is a recent EA that considers the whole individuals in the breeding step. In this paper, the cellular automata concepts are embedded into the HS algorithm to come up with a new version called cellular harmony search (cHS). In cHS, the population is arranged as a two-dimensional toroidal grid, where each individual in the grid is a cell and only interacts with its neighbors. The memory consideration and population update are modified according to cellular EA theory. The experimental results using benchmark functions show that embedding the cellular automata concepts with HS processes directly affects the performance. Finally, a parameter sensitivity analysis of the cHS variation is analyzed and a comparative evaluation shows the success of cHS.<\/jats:p>","DOI":"10.1155\/2013\/139464","type":"journal-article","created":{"date-parts":[[2013,10,28]],"date-time":"2013-10-28T21:02:31Z","timestamp":1382994151000},"page":"1-20","source":"Crossref","is-referenced-by-count":25,"title":["Cellular Harmony Search for Optimization Problems"],"prefix":"10.1155","volume":"2013","author":[{"given":"Mohammed Azmi","family":"Al-Betar","sequence":"first","affiliation":[{"name":"School of Computer Sciences, Universiti Sains Malaysia, 11800 Penang, Malaysia"},{"name":"Department of Information Technology, Al-Huson University College, Al-Balqa Applied University, P.O. Box 50, Al-Huson, Irbid, Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahamad Tajudin","family":"Khader","sequence":"additional","affiliation":[{"name":"School of Computer Sciences, Universiti Sains Malaysia, 11800 Penang, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed A.","family":"Awadallah","sequence":"additional","affiliation":[{"name":"School of Computer Sciences, Universiti Sains Malaysia, 11800 Penang, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahmmoud Hafsaldin","family":"Alawan","sequence":"additional","affiliation":[{"name":"School of Computer Sciences, Universiti Sains Malaysia, 11800 Penang, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Belal","family":"Zaqaibeh","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Jadara University, P.O. Box 733, Irbid, Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"98","reference":[{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/937503.937505"},{"issue":"2","key":"20","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","year":"2001","journal-title":"Simulation"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2006.11.033"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2007.09.049"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2011.11.095"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2011.2174356"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-010-0769-z"},{"key":"10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/978-3-642-27242-4_4","volume-title":"Nurse rostering using modied harmony search algorithm","volume":"7077","year":"2011"},{"key":"11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/978-3-642-34481-7_45","volume-title":"Office-space-allocation problem using harmony search algorithm","volume":"7664","year":"2012"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/696491"},{"key":"46","doi-asserted-by":"publisher","DOI":"10.1155\/2012\/860681"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/427936"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/380985"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2007.09.004"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00185-7_1"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2013.04.053"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.843751"},{"key":"42","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1080\/09528139008953723","volume":"2","year":"1990","journal-title":"Journal of Experimental & Theoretical Articial Intelligence"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.05.025"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-012-9314-6"},{"key":"7","volume":"42","year":"2008"},{"key":"24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/11730095_10","volume-title":"Hierarchical cellular genetic algorithm","volume":"3906","year":"2006"},{"issue":"1\u20133","key":"13","first-page":"35","volume":"94","year":"1999","journal-title":"Discrete Applied Mathematics"},{"key":"15","volume":"1","year":"2000"},{"issue":"6-7","key":"29","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1016\/S0167-8191(05)80052-3","volume":"17","year":"1991","journal-title":"Parallel Computing"},{"key":"31","year":"1966"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1016\/S0303-2647(99)00025-8"},{"issue":"1-2","key":"41","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0004-3702(95)00124-7","volume":"85","year":"1996","journal-title":"Artificial Intelligence"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.1109\/4235.771163"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1080\/03052150701618153"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1080\/03052150903104366"}],"container-title":["Journal of Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2013\/139464.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2013\/139464.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2013\/139464.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T00:56:29Z","timestamp":1498092989000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.hindawi.com\/journals\/jam\/2013\/139464\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"references-count":31,"alternative-id":["139464","139464"],"URL":"https:\/\/doi.org\/10.1155\/2013\/139464","relation":{},"ISSN":["1110-757X","1687-0042"],"issn-type":[{"value":"1110-757X","type":"print"},{"value":"1687-0042","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}