{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:37:11Z","timestamp":1729629431794,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1109\/cec.2010.5586424","type":"proceedings-article","created":{"date-parts":[[2010,9,29]],"date-time":"2010-09-29T19:54:29Z","timestamp":1285790069000},"page":"1-8","source":"Crossref","is-referenced-by-count":1,"title":["Multiple ODs routing algorithm for traffic systems using GA"],"prefix":"10.1109","author":[{"given":"Yu","family":"Wang","sequence":"first","affiliation":[]},{"given":"Shingo","family":"Mabu","sequence":"additional","affiliation":[]},{"given":"Qingbiao","family":"Meng","sequence":"additional","affiliation":[]},{"given":"Manoj Kanta","family":"Mainali","sequence":"additional","affiliation":[]},{"given":"Kotaro","family":"Hirasawa","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.33.1.65"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2005.850180"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/90.893870"},{"key":"ref13","first-page":"126","article-title":"Minimum Dynamic Update for Shortest Path Tree Construction","author":"xiao","year":"2001","journal-title":"Proc IEEE Global Telecommunications Conference"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0191-2615(96)00036-7","article-title":"Toward a class of link travel time functions for dynamic assignment models on signalized networks","volume":"31","author":"rouphail","year":"1997","journal-title":"Transportation Research Part B Methodological"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2002.806806"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/VNIS.1989.98778"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/3468.650331"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/tee.20601"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"546","DOI":"10.20965\/jaciii.2008.p0546","article-title":"Search for the Optimal Traveling Time of Road Networks by Dynamic Programming","volume":"12","author":"mainali","year":"2008","journal-title":"Journal of Advanced Computational Intelligence and Intelligent Informatics"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0041-1647(74)90013-6"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"704","DOI":"10.20965\/jaciii.2009.p0704","article-title":"Global Optimal Routing Algorithm for Traffic Systems with Multiple ODs","volume":"13","author":"wang","year":"2009","journal-title":"Journal of Advanced Computational Intelligence and Informatics"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1954-09848-8"}],"event":{"name":"2010 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2010,7,18]]},"location":"Barcelona, Spain","end":{"date-parts":[[2010,7,23]]}},"container-title":["IEEE Congress on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5573635\/5585910\/05586424.pdf?arnumber=5586424","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T04:27:13Z","timestamp":1559708833000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5586424\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/cec.2010.5586424","relation":{},"subject":[],"published":{"date-parts":[[2010,7]]}}}