{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T19:13:18Z","timestamp":1729624398238,"version":"3.28.0"},"reference-count":34,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/ssci.2018.8628928","type":"proceedings-article","created":{"date-parts":[[2019,2,28]],"date-time":"2019-02-28T18:15:32Z","timestamp":1551377732000},"page":"1906-1912","source":"Crossref","is-referenced-by-count":3,"title":["Finding the k Shortest Paths for Co-Evolutionary Path Optimization"],"prefix":"10.1109","author":[{"given":"Xiao-Bing","family":"Hu","sequence":"first","affiliation":[]},{"given":"Jun","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Hang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Ming-Kong","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jian-Qin","family":"Liao","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00156"},{"article-title":"Artificial Intelligence: A Modern Approach (3rd Edition)","year":"2010","author":"russell","key":"ref32"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/4235.585888","article-title":"Evolutionary computation: comments on the history and current state","volume":"1","author":"hammel","year":"1997","journal-title":"IEEE Transactions on Evolutionary Computation"},{"journal-title":"Adaptation in Natural and Artificial Systems An Introductory Analysis With Applications to Biology Control and Artificial Intelligence","year":"1975","author":"holland","key":"ref30"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/GCIS.2012.96"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-014-1434-2"},{"key":"ref11","article-title":"Labelling algorithms for ranking shortest paths","author":"martins","year":"2000","journal-title":"Tech report 00\/001 CISUC"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1287\/opre.49.3.423.11217"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(02)00230-7"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2003.08.004"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/nav.20061"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2013.07.005"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00079-8"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1048"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02011-7_7"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.08.071"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/320998.321004"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2017.06.007"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"1088","DOI":"10.1109\/TSMCB.2012.2223756","article-title":"Calculating complete and exact pareto front for multiobjective opti-mization: a new deterministic approach for discrete problems","volume":"43","author":"hu","year":"2013","journal-title":"IEEE Transactions on Systems Man and Cybernetics Part B"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90095-5"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2016.08.015"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2011.07.003"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795290477"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.5120\/5048-7444"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/GCIS.2012.96"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/49.265708"},{"key":"ref20","first-page":"847","article-title":"Performance comparison of algorithms for the dynamic shortest path problem. IEICE Transactions on Fundamentals of Electronics","volume":"90","author":"taoka","year":"2007","journal-title":"Communications and Computer Sciences"},{"key":"ref22","first-page":"1","article-title":"Fastest paths in time-dependent networks for intelligent vehicle-highway sys-tems application","volume":"1","author":"kaufman","year":"1993","journal-title":"IVHS Journal"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/79147.214078"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/net.10072"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00035-1"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1080\/15472450.2013.806851","article-title":"Reliable shortest path problems in stochastic time-dependent networks","volume":"18","author":"mei","year":"2014","journal-title":"INTELLIGENT TRANS- PORTATION SYSTEMS"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.09.019"}],"event":{"name":"2018 IEEE Symposium Series on Computational Intelligence (SSCI)","start":{"date-parts":[[2018,11,18]]},"location":"Bangalore, India","end":{"date-parts":[[2018,11,21]]}},"container-title":["2018 IEEE Symposium Series on Computational Intelligence (SSCI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8610062\/8628618\/08628928.pdf?arnumber=8628928","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,28]],"date-time":"2020-11-28T18:53:16Z","timestamp":1606589596000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8628928\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/ssci.2018.8628928","relation":{},"subject":[],"published":{"date-parts":[[2018,11]]}}}