{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T02:22:36Z","timestamp":1773454956284,"version":"3.50.1"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100003093","name":"Ministry of Higher Education Malaysia","doi-asserted-by":"publisher","award":["TRGS\/1\/2019\/UKM\/01\/4\/1"],"award-info":[{"award-number":["TRGS\/1\/2019\/UKM\/01\/4\/1"]}],"id":[{"id":"10.13039\/501100003093","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004515","name":"Universiti Kebangsaan Malaysia","doi-asserted-by":"publisher","award":["DIP-2019-013"],"award-info":[{"award-number":["DIP-2019-013"]}],"id":[{"id":"10.13039\/501100004515","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3102154","type":"journal-article","created":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T20:08:35Z","timestamp":1628021315000},"page":"115972-115989","source":"Crossref","is-referenced-by-count":11,"title":["Hybrid Bird Mating Optimizer With Single-Based Algorithms for Combinatorial Optimization Problems"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4268-5864","authenticated-orcid":false,"given":"Anas","family":"Arram","sequence":"first","affiliation":[{"name":"Centre for Artificial Intelligence (CAIT), Data Mining and Optimization Research Group (DMO), Universiti Kebangsaan Malaysia, Bangi, Selangor, Malaysia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5157-7921","authenticated-orcid":false,"given":"Masri","family":"Ayob","sequence":"additional","affiliation":[{"name":"Centre for Artificial Intelligence (CAIT), Data Mining and Optimization Research Group (DMO), Universiti Kebangsaan Malaysia, Bangi, Selangor, Malaysia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0149-3479","authenticated-orcid":false,"given":"Alaa","family":"Sulaiman","sequence":"additional","affiliation":[{"name":"Centre for Artificial Intelligence (CAIT), Data Mining and Optimization Research Group (DMO), Universiti Kebangsaan Malaysia, Bangi, Selangor, Malaysia"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Development and application of hyperheuristics to personnel scheduling","author":"soubeiga","year":"2003"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2014.6900251"},{"key":"ref33","author":"reinelt","year":"1994","journal-title":"The Traveling Salesman Computational Solutions for TSP Applications"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.3923\/ajaps.2014.662.670"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90138-Y"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2014.01.015"},{"key":"ref37","first-page":"3283","article-title":"A novel discrete particle swarm optimization to solve traveling salesman problem","author":"zhong","year":"2007","journal-title":"Proc IEEE Congr Evol Comput"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.08.051"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1050.0120"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.12.030"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.12.009"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-009-9122-6"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(199510)42:7<1129::AID-NAV3220420711>3.0.CO;2-M"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45561-2_36"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0303-2647(97)01708-5"},{"key":"ref14","first-page":"300","author":"blum","year":"2004","journal-title":"Ant Colony Optimization"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/MHS.1995.494215"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cnsns.2013.08.027"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2993491"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.19139\/86"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.3390\/en9090671"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1080\/00207540701418960"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.09.034"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1109\/3468.709611","article-title":"An annealing framework with learning memory","volume":"28","author":"lo","year":"1998","journal-title":"IEEE Trans Syst Man Cybern A Syst Humans"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-015-9209-7"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23350-5"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91086-4_3"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"kirkpatrick","year":"1983","journal-title":"Science"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-014-9637-0"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.07.012"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2861"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.07.009"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/568438.568443"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.05.006"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICEEI.2015.7352543"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105887"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.07.082"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/EICT.2014.6777868"},{"key":"ref21","article-title":"Genetic algorithms and the traveling salesman problem by kylie bryant genetic algorithms and the traveling salesman problem","author":"bryant","year":"2000","journal-title":"Proc 1st GNT Reg Conf Math Stat Appl"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.01.002"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-011-9139-0"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/218925"},{"key":"ref23","volume":"74","author":"mahadevan","year":"2009","journal-title":"Ammonium nitrate explosives for civil applications slurries emulsions and ammonium nitrate fuel oils"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2013.768241"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","article-title":"Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm","volume":"45","author":"?ern\u00fd","year":"1985","journal-title":"J Optim Theory Appl"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78604-7_10"},{"key":"ref25","first-page":"1","article-title":"A late acceptance strategy in hill-climbing for exam timetabling problems","author":"burke","year":"2008","journal-title":"Proc PATAT Conf"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09504543.pdf?arnumber=9504543","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T20:57:51Z","timestamp":1662670671000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9504543\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3102154","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}