{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:18:33Z","timestamp":1765354713145,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T00:00:00Z","timestamp":1581984000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Fundamental Research Grant Scheme (FRGS) from the Ministry of Education (MOE), Malaysia","award":["RDU Grant No. RDU170103: A Reinforcement Learning Sine Cosine based Strategy for Combinatorial Test Suite Generation"],"award-info":[{"award-number":["RDU Grant No. RDU170103: A Reinforcement Learning Sine Cosine based Strategy for Combinatorial Test Suite Generation"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,2,18]]},"DOI":"10.1145\/3384544.3384603","type":"proceedings-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T03:58:24Z","timestamp":1588564704000},"page":"94-98","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["An Improved Genetic Bat algorithm for Unconstrained Global Optimization Problems"],"prefix":"10.1145","author":[{"given":"Muhammad Zubair","family":"Rehman","sequence":"first","affiliation":[{"name":"Universiti Malaysia Pahang (UMP), Gambang, Pahang, Malaysia"}]},{"given":"Kamal Z.","family":"Zamli","sequence":"additional","affiliation":[{"name":"Universiti Malaysia Pahang (UMP), Gambang, Pahang, Malaysia"}]},{"given":"Abdullah","family":"Nasser","sequence":"additional","affiliation":[{"name":"Universiti Malaysia Pahang (UMP), Gambang, Pahang, Malaysia"}]}],"member":"320","published-online":{"date-parts":[[2020,4,17]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"David H. Ackley. 1987. An empirical study of bit vector function optimization. Genet. algorithms simulated annealing 1 (1987) 170--204."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58069-7_38"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78295-7"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"PenChen Chou and JenLian Chen. 2011. Enforced Mutation to Enhancing the Capability of Particle Swarm Optimization Algorithms. Adv. Swarm Intell. (2011) 28--37.","DOI":"10.1007\/978-3-642-21515-5_4"},{"key":"e_1_3_2_1_5_1","unstructured":"A Collignan J Pailhes and P Sebastian. 2011. Design optimization: management of large solution spaces and optimization algorithm selection. In IMProVe Venice."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2012.6252938"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Iztok Fister Jr Iztok Fister and Janez Brest. 2012. A hybrid artificial bee colony algorithm for graph 3-coloring. Swarm Evol. Comput. (2012) 66--74.","DOI":"10.1007\/978-3-642-29353-5_8"},{"key":"e_1_3_2_1_8_1","unstructured":"Manfred Gilli and Peter Winker. 2008. A Review of Heuristic Optimization Methods in Econometrics. Swiss Financ. Inst. Res. (2008) 08--12."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","unstructured":"David E Goldberg. 1989. Genetic Algorithms in Search Optimization and Machine Learning. DOI:https:\/\/doi.org\/10.1007\/s10589-009-9261-6","DOI":"10.1007\/s10589-009-9261-6"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00933356"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02827615"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAP.2007.891552"},{"key":"e_1_3_2_1_13_1","volume-title":"A Hybrid Bat Algorithm. 80, 2","author":"Jr Iztok Fister","year":"2013","unstructured":"Iztok Fister Jr and Xin-she Yang. 2013. A Hybrid Bat Algorithm. 80, 2 (2013), 1--7."},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of Innovative Production Machines and Systems Virtual Conference, IPROMS, 1--6.","author":"Karaboga D","year":"2009","unstructured":"D Karaboga and B Akay. 2009. Artificial bee colony (ABC), harmony search and bees algorithms on numerical optimization. In Proceedings of Innovative Production Machines and Systems Virtual Conference, IPROMS, 1--6. Retrieved from http:\/\/natcomp.liacs.nl\/SWI\/papers\/artificial.bee.colony.algorithm\/abc.harmony.search.and.bees.algorithms.on.numerical.optimization.pdf"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","unstructured":"Dervis Karaboga and Bahriye Akay. 2009. A comparative study of Artificial Bee Colony algorithm. Appl. Math. Comput. 214 (2009) 108--132. DOI:https:\/\/doi.org\/10.1016\/j.amc.2009.03.090","DOI":"10.1016\/j.amc.2009.03.090"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.18178\/ijmlc.2017.7.1.611"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","unstructured":"D. Merkle M. Middendorf and H. Schmeck. 2002. Ant colony optimization for resource-constrained project scheduling. IEEE Trans. Evol. Comput. 6 (2002). DOI:https:\/\/doi.org\/10.1109\/TEVC.2002.802450","DOI":"10.1109\/TEVC.2002.802450"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.07.006"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2016.01.008"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0195187"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-009-9137-2"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJBIC.2011.038700"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.18178\/ijmlc.2017.7.5.631"},{"key":"e_1_3_2_1_24_1","unstructured":"L. A. Rastrigin. 1963. Convergence of random search method in extremal control of multi-parameter systems. Avtom. i Telemekhanika 24 (1963) 1467-14731473. Retrieved from http:\/\/apps.webofknowledge.com\/full_record.do?product=UA&search_mode=GeneralSearch&qid=3&SID=Y1dKGaac2oaDhcLOeKB&page=1&doc=1"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAP.2004.823969"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","unstructured":"H. H. Rosenbrock. 1960. An Automatic Method for Finding the Greatest or Least Value of a Function. Comput. J. 3 (1960) 175--184. DOI:https:\/\/doi.org\/10.1093\/comjnl\/3.3.175","DOI":"10.1093\/comjnl\/3.3.175"},{"key":"e_1_3_2_1_27_1","volume-title":"Seventh International Conference on Digital Information Management (ICDIM","author":"Rui Tang","year":"2012","unstructured":"Tang Rui, Fong Simon, Xin She Yang, and Deb Suash. 2012. Wolf search algorithm with ephemeral memory. In Seventh International Conference on Digital Information Management (ICDIM 2012), 165--172."},{"volume-title":"Evolution and Optimum Seeking","author":"Schwefel H. P.","key":"e_1_3_2_1_28_1","unstructured":"H. P. Schwefel. 1995. Evolution and Optimum Seeking. John Wiley & Sons."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","unstructured":"Mohammad Taherdangkoo Mahsa Paziresh Mehran Yazdi and Mohammad Hadi Bagheri. 2013. An efficient algorithm for function optimization: Modified stem cells algorithm. Cent. Eur. J. Eng. (2013). DOI:https:\/\/doi.org\/10.2478\/s13531-012-0047-8","DOI":"10.2478\/s13531-012-0047-8"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDIM.2012.6360147"},{"key":"e_1_3_2_1_31_1","first-page":"223","article-title":"Bat Algorithm is Better Than Intermittent Search Strategy","volume":"22","author":"Deb Suash","year":"2014","unstructured":"Xin-she Yang, Suash Deb, and Simon Fong. 2014. Bat Algorithm is Better Than Intermittent Search Strategy. Mult. Log. Soft Comput. 22, 3 (2014), 223--237.","journal-title":"Mult. Log. Soft Comput."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04944-6_14"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-013-1367-1"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0195675"},{"key":"e_1_3_2_1_35_1","unstructured":"Bohachevsky Function. Retrieved July 4 2015 from www-optima.amp.i.kyotou.ac.jp\/member\/student\/hedar\/Hedar_files\/TestGO_files\/Page595.htm"}],"event":{"name":"ICSCA 2020: 2020 9th International Conference on Software and Computer Applications","acronym":"ICSCA 2020","location":"Langkawi Malaysia"},"container-title":["Proceedings of the 2020 9th International Conference on Software and Computer Applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3384544.3384603","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3384544.3384603","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:18:10Z","timestamp":1755839890000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3384544.3384603"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,18]]},"references-count":35,"alternative-id":["10.1145\/3384544.3384603","10.1145\/3384544"],"URL":"https:\/\/doi.org\/10.1145\/3384544.3384603","relation":{},"subject":[],"published":{"date-parts":[[2020,2,18]]},"assertion":[{"value":"2020-04-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}