{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T15:41:38Z","timestamp":1766504498796,"version":"3.37.3"},"reference-count":64,"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"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Mexican Secretariat of Public Education with Grant SEP-Cinvestav No. 00114"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3126015","type":"journal-article","created":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T22:35:42Z","timestamp":1636410942000},"page":"151266-151277","source":"Crossref","is-referenced-by-count":5,"title":["Search Trajectory Networks Applied to the Cyclic Bandwidth Sum Problem"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2071-9568","authenticated-orcid":false,"given":"Valentina","family":"Narvaez-Teran","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7649-5669","authenticated-orcid":false,"given":"Gabriela","family":"Ochoa","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0333-0633","authenticated-orcid":false,"given":"Eduardo","family":"Rodriguez-Tello","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"1","article-title":"A note on computational approaches for the antibandwidth problem","volume":"1","author":"sinnl","year":"2020","journal-title":"Central Eur J Oper Res"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-9076-0_13"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90071-0"},{"key":"ref32","first-page":"151","article-title":"Labelings of graphs","volume":"3","author":"chung","year":"1988","journal-title":"Selected Topics in Graph Theory"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/568522.568523"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.06.024"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2019.2895354"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/0112012"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60313-1_166"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797331671"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754712"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/58.3.509"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.2307\/2348634"},{"article-title":"The irace package: Iterated race for automatic algorithm configuration","year":"2011","author":"l\u00f3pez-ib\u00e1nez","key":"ref64"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.09.031"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-73471-2"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2004.01.002"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/931256"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/4235.771163","article-title":"Evolutionary programming made faster","volume":"3","author":"yao","year":"1999","journal-title":"IEEE Trans Evol Comput"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.05.007"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.924339"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99253-2_7"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-007-9051-y"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11169-3_13"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2906840"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/s11766-001-0016-0"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/SCES.2012.6199079"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13800-3_7"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380211102"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90102-6"},{"key":"ref56","first-page":"1","article-title":"The igraph software package for complex network research","volume":"1695","author":"cs\u00e1rdi","year":"2006","journal-title":"InterJ Complex Syst"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.05.018"},{"key":"ref54","first-page":"1","article-title":"Profiling the distance characteristics of mutation operators for permutation-based genetic algorithms","author":"cicirello","year":"2013","journal-title":"Proc 26th Int Florida Artif Intell Res Soc Conf"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.08.008"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnw006"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.measurement.2020.107576"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-015-2034-y"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019361"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30671-6_1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91086-4_14"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-2008-12102"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-43722-0_5"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107492"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2046175"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389204"},{"key":"ref19","first-page":"514","article-title":"Appendix A. 1: Unconstrained uni-modal test functions","author":"price","year":"2005","journal-title":"Differential Evolution A Practical Approach to Global Optimization"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2006.329691"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2005.04.005"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1504\/IJSI.2013.055801"},{"article-title":"An idea based on honey bee swarm for numerical optimization","year":"2005","author":"karaboga","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2015.12.009"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-020-09867-w"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2003.10.006"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11831-016-9187-y"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2013.01.016"},{"key":"ref45","first-page":"91","article-title":"Some NP-complete problems on graphs","author":"gavril","year":"1977","journal-title":"Proc 11st Conf Inf Sci Syst"},{"key":"ref48","first-page":"6","article-title":"Cyclic arrangement of graphs","author":"yuan","year":"1995","journal-title":"Graph Theory Notes of New York"},{"key":"ref47","first-page":"147","article-title":"On bandwidth and cyclic bandwidth of graphs","volume":"47","author":"lam","year":"1997","journal-title":"Ars Combinatoria"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/0213040"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/BF02280884"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.10.004"},{"key":"ref43","first-page":"282","article-title":"The cyclic bandwidth problem","volume":"7","author":"lin","year":"1994","journal-title":"J Syst Sci Complex"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09605670.pdf?arnumber=9605670","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T21:45:47Z","timestamp":1647294347000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9605670\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":64,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3126015","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2021]]}}}