{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T20:14:41Z","timestamp":1773519281489,"version":"3.50.1"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100002920","name":"Research Grants Council of the Hong Kong Special Administrative Region","doi-asserted-by":"publisher","award":["CityU11215622"],"award-info":[{"award-number":["CityU11215622"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1109\/tevc.2024.3357819","type":"journal-article","created":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T19:03:13Z","timestamp":1707246193000},"page":"317-330","source":"Crossref","is-referenced-by-count":13,"title":["Machine Learning-Assisted Multiobjective Evolutionary Algorithm for Routing and Packing"],"prefix":"10.1109","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6719-0409","authenticated-orcid":false,"given":"Fei","family":"Liu","sequence":"first","affiliation":[{"name":"Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0786-0671","authenticated-orcid":false,"given":"Qingfu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong"}]},{"given":"Qingling","family":"Zhu","sequence":"additional","affiliation":[{"name":"National Engineering Laboratory for Big Data System Computing Technology, Shenzhen University, Shenzhen, China"}]},{"given":"Xialiang","family":"Tong","sequence":"additional","affiliation":[{"name":"Huawei Noah’s Ark Lab, Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2236-8784","authenticated-orcid":false,"given":"Mingxuan","family":"Yuan","sequence":"additional","affiliation":[{"name":"Huawei Noah’s Ark Lab, Hong Kong, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2494218"},{"key":"ref3","first-page":"937","article-title":"Bayesian optimization with inequality constraints","volume-title":"Proc. ICML","author":"Gardner"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2869001"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2834881"},{"key":"ref6","first-page":"1","article-title":"Learning combinatorial optimization algorithms over graphs","volume":"30","author":"Khalil","year":"2017","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref7","article-title":"Learning to optimize: A primer and a benchmark","author":"Chen","year":"2021","journal-title":"arXiv:2103.12828"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105400"},{"key":"ref9","first-page":"1","article-title":"Pointer networks","volume":"28","author":"Vinyals","year":"2015","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219872"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2006.1597059"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-018-9685-y"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2608507"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2973670"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3049712"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.09.024"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.04.016"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/9781119902881.ch1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1050.0145"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-008-0129-4"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2013.07.025"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.08.025"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3123960"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3164260"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3144142"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2014.01.011"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.cor.2015.11.012","article-title":"Split algorithm in O(n) for the capacitated vehicle routing problem","volume":"69","author":"Vidal","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"ref29","first-page":"445","article-title":"Algorithms for the container loading problem","volume-title":"Proc. Oper. Res. Proc.","author":"Scheithauer"},{"issue":"3","key":"ref30","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1287\/opre.1060.0369","article-title":"An exact algorithm for higher-dimensional orthogonal packing","volume":"55","author":"Fekete","year":"2007","journal-title":"Oper. Res."},{"issue":"1","key":"ref31","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s10479-011-0942-z","article-title":"MIP-based approaches for the container loading problem with multi-drop constraints","volume":"199","author":"Junqueira","year":"2012","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"ref32","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.cor.2010.07.017","article-title":"Three-dimensional container loading models with cargo stability and load bearing constraints","volume":"39","author":"Junqueira","year":"2012","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"ref33","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1287\/ijoc.1090.0338","article-title":"A tree search algorithm for solving the container loading problem","volume":"22","author":"Fanslau","year":"2010","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"ref34","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/j.ejor.2012.04.036","article-title":"A new iterative-doubling greedy\u2013lookahead algorithm for the single container loading problem","volume":"222","author":"Zhu","year":"2012","journal-title":"Eur. J. Oper. Res."},{"key":"ref35","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.cor.2013.09.003","article-title":"A beam search approach to the container loading problem","volume":"43","author":"Araya","year":"2014","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"ref36","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/S0167-8191(03)00047-4","article-title":"A parallel tabu search algorithm for solving the container loading problem","volume":"29","author":"Bortfeldt","year":"2003","journal-title":"Parallel Comput."},{"issue":"4","key":"ref37","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1016\/j.cor.2010.09.002","article-title":"A novel hybrid tabu search approach to container loading","volume":"38","author":"Liu","year":"2011","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"ref38","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0305-0548(80)90001-5","article-title":"A heuristic for packing boxes into a container","volume":"7","author":"George","year":"1980","journal-title":"Comput. Oper. Res."},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2003.08.004"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1287\/opre.48.2.256.12386"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0109"},{"issue":"1","key":"ref42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3447540","article-title":"Feature construction for meta-heuristic algorithm recommendation of capacitated vehicle routing problems","volume":"1","author":"Jiang","year":"2021","journal-title":"ACM Trans. Evol. Learn. Optim."},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/BigDataService.2017.18"},{"issue":"2","key":"ref44","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s11749-016-0481-7","article-title":"A random forest guided tour","volume":"25","author":"Biau","year":"2016","journal-title":"Test"},{"issue":"1","key":"ref45","first-page":"3","article-title":"Supervised machine learning: A review of classification techniques","volume":"160","author":"Kotsiantis","year":"2007","journal-title":"Emerg. Artif. Intell. Appl. Comput. Eng."},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1801.01078"},{"key":"ref47","article-title":"Evaluation: From precision, recall and F-measure to ROC, informedness, markedness and correlation","author":"Powers","year":"2020","journal-title":"arXiv:2010.16061"},{"key":"ref48","first-page":"179","article-title":"Addressing the curse of imbalanced training sets: One-sided selection","volume-title":"Proc. 14th Int. Conf. Mach. Learn.","author":"Kubat"},{"key":"ref49","first-page":"154","article-title":"Alleles, loci, and the traveling salesman problem","volume-title":"Proc. Int. Conf. Genetic Algorithm. Appl.","author":"Goldberg"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3097339"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.04.032"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2869674"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3065707"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.106836"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4235\/10947080\/10423590.pdf?arnumber=10423590","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T12:58:03Z","timestamp":1743598683000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10423590\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4]]},"references-count":54,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2024.3357819","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"value":"1089-778X","type":"print"},{"value":"1089-778X","type":"print"},{"value":"1941-0026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4]]}}}