{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T02:56:21Z","timestamp":1777949781066,"version":"3.51.4"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1109\/cec48606.2020.9185701","type":"proceedings-article","created":{"date-parts":[[2020,9,3]],"date-time":"2020-09-03T19:34:48Z","timestamp":1599161688000},"page":"1-8","source":"Crossref","is-referenced-by-count":14,"title":["Multifactorial Evolutionary Algorithm for Inter-Domain Path Computation under Domain Uniqueness Constraint"],"prefix":"10.1109","author":[{"given":"Huynh Thi Thanh","family":"Binh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ta Bao","family":"Thangy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nguyen Binh","family":"Long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ngo Viet","family":"Hoang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pham Dinh","family":"Thanh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2010.5502390"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1364\/JOCN.4.000876"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1997.592343"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-019-01599-x"},{"key":"ref14","first-page":"37","article-title":"Evolutionary multi-task learning for modular training of feed-forward neural networks","author":"chandra","year":"2016","journal-title":"International Conference on Neural Information Processing"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-018-00374-x"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2018.8477684"},{"key":"ref17","author":"agoston","year":"2003","journal-title":"Introduction to Evolutionary Computing"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84996-129-5","author":"yu","year":"2010","journal-title":"Introduction to Evolutionary Algorithms"},{"key":"ref19","article-title":"Inter-domain path computation under domain uniqueness constraint instances","volume":"v3","author":"thanh","year":"2020","journal-title":"Mendeley Data"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2458037"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.05.015"},{"key":"ref6","first-page":"794","article-title":"Adaptive fastest path computation on a road network: a traffic mining approach","author":"gonzalez","year":"2007","journal-title":"Proceedings of the 33rd International Conference on Very Large Data Bases"},{"key":"ref5","first-page":"819","article-title":"Effective multifactorial evolutionary algorithm for solving the cluster shortest path tree problem","author":"binh","year":"2018","journal-title":"2018 IEEE Congress on Evolutionary Computation (CEC)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2007.386468"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/72.286889"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1201\/9781482268713","author":"b\u00e4ck","year":"2018","journal-title":"Evolutionary Computation 1 Basic Algorithms and Operators"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21800"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2013.011413.00087"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205545"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TENCON.2016.7848632"}],"event":{"name":"2020 IEEE Congress on Evolutionary Computation (CEC)","location":"Glasgow, United Kingdom","start":{"date-parts":[[2020,7,19]]},"end":{"date-parts":[[2020,7,24]]}},"container-title":["2020 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9178820\/9185488\/09185701.pdf?arnumber=9185701","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T11:56:53Z","timestamp":1656331013000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9185701\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/cec48606.2020.9185701","relation":{},"subject":[],"published":{"date-parts":[[2020,7]]}}}