{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:37:06Z","timestamp":1757450226490,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"20","license":[{"start":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T00:00:00Z","timestamp":1620086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T00:00:00Z","timestamp":1620086400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s00521-021-06041-3","type":"journal-article","created":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T01:03:00Z","timestamp":1620090180000},"page":"13981-13997","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Dynamic Cat Swarm Optimization algorithm for backboard wiring problem"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5640-0172","authenticated-orcid":false,"given":"Aram M.","family":"Ahmed","sequence":"first","affiliation":[]},{"given":"Tarik A.","family":"Rashid","sequence":"additional","affiliation":[]},{"given":"Soran Ab. M.","family":"Saeed","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,4]]},"reference":[{"key":"6041_CR1","doi-asserted-by":"crossref","unstructured":"Baskan O (ed) (2016) Optimization algorithms: methods and applications. BoD\u2013Books on Demand.","DOI":"10.5772\/61426"},{"key":"6041_CR2","volume-title":"An introduction with metaheuristic applications. Engineering Optimization","author":"Y Xin-She","year":"2010","unstructured":"Xin-She Y (2010) An introduction with metaheuristic applications. Engineering Optimization. John Wiley, New York"},{"key":"6041_CR3","doi-asserted-by":"crossref","unstructured":"Vo\u00df S (2000) Meta-heuristics: the state of the art. In: Workshop on local search for planning and scheduling. Springer, Berlin, pp 1\u201323","DOI":"10.1007\/3-540-45612-0_1"},{"key":"6041_CR4","first-page":"101104","volume":"46","author":"XS Yang","year":"2020","unstructured":"Yang XS (2020) Nature-inspired optimization algorithms: challenges and open problems. J ComputSci 46:101104","journal-title":"J ComputSci"},{"key":"6041_CR5","unstructured":"Yang XS (2010) Nature-inspired metaheuristic algorithms. Luniver Press"},{"key":"6041_CR6","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/j.asoc.2018.02.012","volume":"66","author":"L Pappula","year":"2018","unstructured":"Pappula L, Ghosh D (2018) Cat swarm optimization with normal mutation for fast convergence of multimodal functions. Appl Soft Comput 66:473\u2013491","journal-title":"Appl Soft Comput"},{"key":"6041_CR7","doi-asserted-by":"crossref","unstructured":"Nie X, Wang W, Nie H (2017) Chaos quantum-behaved cat swarm optimization algorithm and its application in the PV MPPT. Comput Intell Neurosci","DOI":"10.1155\/2017\/1583847"},{"key":"6041_CR8","doi-asserted-by":"crossref","unstructured":"Orouskhani M., Mansouri M, Teshnehlab M (2011) Average-inertia weighted cat swarm optimization. In: International conference in swarm intelligence. Springer, Berlin, pp 321\u2013328","DOI":"10.1007\/978-3-642-21515-5_38"},{"key":"6041_CR9","doi-asserted-by":"crossref","unstructured":"Ahmed AM, Rashid TA, Saeed SAM (2020) Cat swarm optimization algorithm: a survey and performance evaluation. Comput Intell Neurosci 2020","DOI":"10.36227\/techrxiv.11656458"},{"key":"6041_CR10","doi-asserted-by":"crossref","unstructured":"Abdel-Basset M, Abdel-Fatah L, Sangaiah AK (2018) Metaheuristic algorithms: a comprehensive review. In: Computational intelligence for multimedia big data on the cloud with engineering applications. Academic Press, London, pp 185\u2013231","DOI":"10.1016\/B978-0-12-813314-9.00010-4"},{"key":"6041_CR11","doi-asserted-by":"publisher","first-page":"113338","DOI":"10.1016\/j.eswa.2020.113338","volume":"149","author":"M Khishe","year":"2020","unstructured":"Khishe M, Mosavi MR (2020) Chimp optimization algorithm. Expert SystAppl 149:113338","journal-title":"Expert SystAppl"},{"issue":"1","key":"6041_CR12","first-page":"163","volume":"3","author":"SC Chu","year":"2007","unstructured":"Chu SC, Tsai PW (2007) Computational intelligence based on the behavior of cats. Int J InnovComputInf Control 3(1):163\u2013173","journal-title":"Int J InnovComputInf Control"},{"issue":"4","key":"6041_CR13","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution\u2014a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341\u2013359","journal-title":"J Global Optim"},{"issue":"1","key":"6041_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1137\/1003003","volume":"3","author":"L Steinberg","year":"1961","unstructured":"Steinberg L (1961) The backboard wiring problem: a placement algorithm. SIAM Rev 3(1):37\u201350","journal-title":"SIAM Rev"},{"key":"6041_CR15","doi-asserted-by":"crossref","unstructured":"Burkard RE, Karisch SE, Rendl F (1997) QAPLIB\u2014a quadratic assignment problem library. J Glob Optim 10(4), 391\u2013403. Accessed 27 June 2020","DOI":"10.1023\/A:1008293323270"},{"key":"6041_CR16","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.engappai.2014.12.011","volume":"39","author":"U Tosun","year":"2015","unstructured":"Tosun U (2015) On the performance of parallel hybrid algorithms for the solution of the quadratic assignment problem. Eng Appl Artif Intell 39:267\u2013278","journal-title":"Eng Appl Artif Intell"},{"key":"6041_CR17","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.asoc.2018.04.011","volume":"68","author":"AMF Fard","year":"2018","unstructured":"Fard AMF, Hajiaghaei-Keshteli M (2018) A bi-objective partial interdiction problem considering different defensive systems with capacity expansion of facilities under imminent attacks. Appl Soft Comput 68:343\u2013359","journal-title":"Appl Soft Comput"},{"key":"6041_CR18","doi-asserted-by":"crossref","unstructured":"Chu SC, Tsai PW, Pan JS (2006) Cat swarm optimization. In: Pacific Rim international conference on artificial intelligence. Springer, Berlin, pp 854\u2013858","DOI":"10.1007\/978-3-540-36668-3_94"},{"key":"6041_CR19","volume-title":"The 100-digit challenge: problem definitions and evaluation criteria for the 100-digit challenge special session and competition on single objective numerical optimization","author":"KV Price","year":"2018","unstructured":"Price KV, Awad NH, Ali MZ, Suganthan PN (2018) The 100-digit challenge: problem definitions and evaluation criteria for the 100-digit challenge special session and competition on single objective numerical optimization. Nanyang Technological University, Singapore"},{"key":"6041_CR20","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1016\/j.energy.2018.05.037","volume":"155","author":"TT Nguyen","year":"2018","unstructured":"Nguyen TT, Vo DN, Dinh BH (2018) An effectively adaptive selective cuckoo search algorithm for solving three complicated short-term hydrothermal scheduling problems. Energy 155:930\u2013956","journal-title":"Energy"},{"issue":"2","key":"6041_CR21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1515\/jaiscr-2015-0001","volume":"4","author":"S Cheng","year":"2014","unstructured":"Cheng S, Shi Y, Qin Q, Zhang Q, Bai R (2014) Population diversity maintenance in brain storm optimization algorithm. J ArtifIntell Soft Comput Res 4(2):83\u201397","journal-title":"J ArtifIntell Soft Comput Res"},{"issue":"11","key":"6041_CR22","doi-asserted-by":"publisher","first-page":"7665","DOI":"10.1007\/s00521-018-3592-0","volume":"31","author":"K Hussain","year":"2019","unstructured":"Hussain K, Salleh MNM, Cheng S, Shi Y (2019) On the exploration and exploitation in popular swarm-based metaheuristic algorithms. Neural Comput Appl 31(11):7665\u20137683","journal-title":"Neural Comput Appl"},{"key":"6041_CR23","doi-asserted-by":"publisher","first-page":"100671","DOI":"10.1016\/j.swevo.2020.100671","volume":"54","author":"B Morales-Casta\u00f1eda","year":"2020","unstructured":"Morales-Casta\u00f1eda B, Zaldivar D, Cuevas E, Fausto F, Rodr\u00edguez A (2020) A better balance in metaheuristic algorithms: does it exist? Swarm Evol Comput 54:100671","journal-title":"Swarm EvolComput"},{"key":"6041_CR24","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51\u201367","journal-title":"Adv Eng Softw"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-06041-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-021-06041-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-06041-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,24]],"date-time":"2021-10-24T07:11:36Z","timestamp":1635059496000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-021-06041-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,4]]},"references-count":24,"journal-issue":{"issue":"20","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["6041"],"URL":"https:\/\/doi.org\/10.1007\/s00521-021-06041-3","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2021,5,4]]},"assertion":[{"value":"18 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}