{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T23:57:50Z","timestamp":1772755070944,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1016\/s0305-0548(02)00230-7","type":"journal-article","created":{"date-parts":[[2003,2,17]],"date-time":"2003-02-17T13:07:53Z","timestamp":1045487273000},"page":"499-513","source":"Crossref","is-referenced-by-count":36,"title":["Finding the first K shortest paths in a time-window network"],"prefix":"10.1016","volume":"31","author":[{"given":"Yen-Liang","family":"Chen","sequence":"first","affiliation":[]},{"given":"Hsu-Hao","family":"Yang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(02)00230-7_BIB1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0191-2615(99)00023-5","article-title":"Shortest paths in traffic-light networks","volume":"34","author":"Chen","year":"2000","journal-title":"Transportation Research B"},{"key":"10.1016\/S0305-0548(02)00230-7_BIB2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0305-0548(90)90039-A","article-title":"The quickest path problem","volume":"17","author":"Chen","year":"1990","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(02)00230-7_BIB3","series-title":"Networks flow","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0305-0548(02)00230-7_BIB4","doi-asserted-by":"crossref","unstructured":"Zwick U. Exact and approximate distances in graphs\u2014a survey. Proceedings of the 9th Annual European Symposium on Algorithms, Aarhus, Denmark, 2001, p. 33\u201348.","DOI":"10.1007\/3-540-44676-1_3"},{"key":"10.1016\/S0305-0548(02)00230-7_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.22.1.1","article-title":"Time window constrained routing and scheduling problems","volume":"22","author":"Solomon","year":"1988","journal-title":"Transactions of Science"},{"key":"10.1016\/S0305-0548(02)00230-7_BIB6","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1057\/jors.1993.53","article-title":"Simple heuristics for the vehicle routing problem with soft time windows","volume":"44","author":"Balakrishnan","year":"1993","journal-title":"JORS"},{"key":"10.1016\/S0305-0548(02)00230-7_BIB7","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1287\/opre.44.3.501","article-title":"Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows","volume":"44","author":"Bramel","year":"1996","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00230-7_BIB8","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.35.2.266","article-title":"Vehicle routing with time windows","volume":"35","author":"Kolen","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00230-7_BIB9","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1287\/trsc.29.2.156","article-title":"Hybrid heuristics for the vehicle-routing problem with time windows","volume":"29","author":"Russell","year":"1996","journal-title":"Transactions of Science"},{"key":"10.1016\/S0305-0548(02)00230-7_BIB10","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","article-title":"Finding the k shortest loopless paths in a network","volume":"17","author":"Yen","year":"1971","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(02)00230-7_BIB11","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1002\/net.3230120406","article-title":"An efficient algorithm for k shortest simple paths","volume":"12","author":"Katoh","year":"1982","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(02)00230-7_BIB12","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1287\/opre.26.5.686","article-title":"Data structures and computer science techniques in operations research","volume":"26","author":"Fox","year":"1978","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00230-7_BIB13","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","article-title":"Finding the k shortest paths","volume":"28","author":"Eppstein","year":"1998","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/S0305-0548(02)00230-7_BIB14","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numerische Mathematik"},{"key":"10.1016\/S0305-0548(02)00230-7_BIB15","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","volume":"34","author":"Fredman","year":"1987","journal-title":"JACM"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802002307?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802002307?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T07:52:21Z","timestamp":1553673141000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802002307"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["S0305054802002307"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00230-7","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}