{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:58:24Z","timestamp":1725487104633},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540728290"},{"type":"electronic","value":"9783540728306"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72830-6_51","type":"book-chapter","created":{"date-parts":[[2007,7,5]],"date-time":"2007-07-05T23:38:54Z","timestamp":1183678734000},"page":"496-505","source":"Crossref","is-referenced-by-count":0,"title":["An Algorithm for Loopless Optimum Paths Finding Agent System and Its Application to Multimodal Public Transit Network"],"prefix":"10.1007","author":[{"given":"Doohee","family":"Nam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seongil","family":"Shin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changho","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongtaek","family":"Lim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seung Jae","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"51_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0377-2217(93)90095-5","volume":"69","author":"J.A. Azevedo","year":"1993","unstructured":"Azevedo, J.A., Costa, M.E.O.S., Madeira, J.J.E.R.S., Martins, E.Q.V.: An Algorithm from the Ranking of Shortest Paths. European Journal of Operational Research\u00a069, 97\u2013106 (1993)","journal-title":"European Journal of Operational Research"},{"key":"51_CR2","first-page":"582","volume":"8","author":"R. Bellman","year":"1968","unstructured":"Bellman, R., Kalaba, R.: On Kth Best Policies. J. SIAM\u00a08, 582\u2013588 (1968)","journal-title":"J. SIAM"},{"key":"51_CR3","unstructured":"De Cea, J., Fern\u00e1ndez, J.E.: Transit Assignment for Minimal Routes: An Efficient New Algorithm. Traffic Engng. Control, pp. 492\u2013494 (1989)"},{"key":"51_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A Note of Two Problems in Connected with Graphs. Numerical Mathematics\u00a01, 269\u2013271 (1959)","journal-title":"Numerical Mathematics"},{"key":"51_CR5","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/S0041-1647(69)80022-5","volume":"3","author":"R.F. Kirby","year":"1969","unstructured":"Kirby, R.F., Potts, R.B.: The Minimum RouteProblem for Networks with Turn Penalties and Prohibitions. Transportation Research\u00a03, 397\u2013408 (1969)","journal-title":"Transportation Research"},{"key":"51_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0377-2217(84)90269-8","volume":"18","author":"E.Q.V. Martins","year":"1984","unstructured":"Martins, E.Q.V.: An Algorithm for Ranking Paths that Contain Cycles. European Journal of Operational Research\u00a018, 123\u2013130 (1984)","journal-title":"European Journal of Operational Research"},{"key":"51_CR7","unstructured":"Moore, E.F.: The Shortest Path through A Maze. In: Proc. Int. Conf. on the Theory of Switching, Harvard Univ., Cambridge, MA (1957)"},{"key":"51_CR8","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1287\/opre.9.4.578","volume":"9","author":"M. Pollack","year":"1961","unstructured":"Pollack, M.: The Kth Best Route Through A Network. Operations Research\u00a09, 578\u2013580 (1961)","journal-title":"Operations Research"},{"key":"51_CR9","volume-title":"Flows in Transportation Networks","author":"R.B. Potts","year":"1972","unstructured":"Potts, R.B., Oliver, R.M.: Flows in Transportation Networks. Academic Press, London (1972)"},{"key":"51_CR10","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230090303","volume":"9","author":"R.D. Shier","year":"1979","unstructured":"Shier, R.D.: On Algorithms from Finding the k Shortest Paths in a Network. Networks\u00a09, 195\u2013214 (1979)","journal-title":"Networks"},{"key":"51_CR11","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"J.Y. Yen","year":"1971","unstructured":"Yen, J.Y.: Finding the K shortest Loopless Paths in a Network. Management Science\u00a017, 711\u2013715 (1971)","journal-title":"Management Science"}],"container-title":["Lecture Notes in Computer Science","Agent and Multi-Agent Systems: Technologies and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72830-6_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,4]],"date-time":"2018-10-04T12:12:19Z","timestamp":1538655139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72830-6_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540728290","9783540728306"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72830-6_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}