{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T12:27:19Z","timestamp":1730204839019,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/cec.2016.7744078","type":"proceedings-article","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T22:22:49Z","timestamp":1480544569000},"page":"2345-2351","source":"Crossref","is-referenced-by-count":5,"title":["An effective method to find the k shortest paths in a generalized time-window network"],"prefix":"10.1109","author":[{"given":"Xiao-Bing","family":"Hu","sequence":"first","affiliation":[]},{"given":"Ming-Kong","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jian-Qin","family":"Liao","sequence":"additional","affiliation":[]},{"given":"Hai-Lin","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795290477"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2011.07.003"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/GCIS.2012.96"},{"key":"ref14","article-title":"A Deterministic Agent-Based Path Optimization Method by Mimicking the Spreading of Ripples","author":"hu","year":"2015","journal-title":"Evolutionary Computation"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1993.53"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/opre.44.3.501"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.2.266"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.29.2.156"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(02)00230-7"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.5120\/5048-7444"},{"journal-title":"Artificial Intelligence A Modern Approach","year":"2010","author":"russell","key":"ref3"},{"key":"ref6","first-page":"1088","article-title":"Calculating Complete and Exact Pareto Front for Multi-Objective Optimization: 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":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/49.265708"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s13753-016-0089-2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.02.058"},{"journal-title":"Algorithm Design Foundations Analysis and Internet Examples","year":"2001","author":"goodrich","key":"ref2"},{"journal-title":"Introduction to Algorithms","year":"2001","author":"cormen","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/320998.321004"}],"event":{"name":"2016 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2016,7,24]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2016,7,29]]}},"container-title":["2016 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7636124\/7743769\/07744078.pdf?arnumber=7744078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,12,17]],"date-time":"2016-12-17T08:41:55Z","timestamp":1481964115000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7744078\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/cec.2016.7744078","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}