{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:44:19Z","timestamp":1725763459242},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642538773"},{"type":"electronic","value":"9783642538780"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-53878-0_10","type":"book-chapter","created":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T02:31:19Z","timestamp":1386815479000},"page":"191-207","source":"Crossref","is-referenced-by-count":0,"title":["Evolutionary Algorithm with Geographic Heuristics for Urban Public Transportation"],"prefix":"10.1007","author":[{"given":"Jolanta","family":"Koszelew","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Ostrowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1002\/net.10072","volume":"41","author":"R.K. Ahuja","year":"2003","unstructured":"Ahuja, R.K., Orlin, J.B., Pallotino, S., Scutella, M.G.: Dynamic shortest path minimizing travel times and costs. Networks\u00a041(4), 197\u2013205 (2003)","journal-title":"Networks"},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R.E. Bellman","year":"1958","unstructured":"Bellman, R.E.: On a Routing Problem. Journal Quarterly of Applied Mathematics\u00a016, 87\u201390 (1958)","journal-title":"Journal Quarterly of Applied Mathematics"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-1-4757-4137-7_5","volume":"86","author":"U. Boryczka","year":"2004","unstructured":"Boryczka, U., Boryczka, M.: Multi-cast ant colony system for the bus routing problem. Metaheuristics, Applied Optimization\u00a086, 91\u2013125 (2004)","journal-title":"Metaheuristics, Applied Optimization"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Chabini, I.: Discrete dynamic shortest path problems in transportation applications. Complexity and Algorithms with Optimal Run Time, Journal Transportation Research Records, 170\u2013175 (1998)","DOI":"10.3141\/1645-21"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Chakroborty, P.: Genetic algorithms for optimal urban transit network design. In: Computer-Aided Civil and Infastructure Engineering, vol.\u00a018, pp. 184\u2013200 (2003)","DOI":"10.1111\/1467-8667.00309"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0377-2217(99)00277-5","volume":"126","author":"H.K. Chen","year":"2000","unstructured":"Chen, H.K., Feng, G.: Heuristics for the dynamic user-optimal route choice problem. European Journal of Operational Research\u00a0126, 13\u201330 (2000)","journal-title":"European Journal of Operational Research"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/0022-247X(66)90009-6","volume":"14","author":"K.L. Cooke","year":"1998","unstructured":"Cooke, K.L., Halsey, E.: The shortest route through a network with time-dependent intermodal transit times. Journal Math. Anal. Appl.\u00a014, 493\u2013498 (1998)","journal-title":"Journal Math. Anal. Appl."},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"S.E. Dreyfus","year":"1969","unstructured":"Dreyfus, S.E.: An Appraisal of Some Shortest-path Algorithms. Journal Operations Research\u00a017, 395\u2013412 (1969)","journal-title":"Journal Operations Research"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Galves-Fernandez, C., Khadraoui, D.: remainder: Distribited Aproach for Solving Time-Dependent Problems in Multimodal Transport Networks. Advanced in Operation Research, Article ID 512613, 15 pages (2009), doi:10.1155\/2009\/512613","DOI":"10.1155\/2009\/512613"},{"key":"10_CR10","volume-title":"Genetic algorithms and their applications","author":"D.E. Goldberg","year":"1995","unstructured":"Goldberg, D.E.: Genetic algorithms and their applications. WNT, Warsaw (1995)"},{"key":"10_CR11","unstructured":"Hartley, J.K., Wu, Q.: Accommodating User Preferences in the Optimization of Public Transport Travel. International Journal of Simulation Systems, Science and Technology: Applied Modeling and Simulation, 12\u201325 (2004)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Hansen, P.: Bicriterion path problems. In: Multicriteria Decision Making: Theory and Applications. Lecture Notes in Economics and Mathematical Systems, vol.\u00a0177, pp. 236\u2013245 (1980)","DOI":"10.1007\/978-3-642-48782-8_9"},{"key":"10_CR13","first-page":"418","volume":"17","author":"J. Koszelew","year":"2008","unstructured":"Koszelew, J.: Approximation method to route generation in public transportation network. Polish Journal of Enviromental Studies\u00a017, 418\u2013422 (2008)","journal-title":"Polish Journal of Enviromental Studies"},{"key":"10_CR14","series-title":"CCIS","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-16472-9_21","volume-title":"Transport Systems Telematics","author":"A. Piwonska","year":"2010","unstructured":"Piwonska, A., Koszelew, J.: Evolutionary algorithms find routes in public transport network with optimal time of realization. In: Mikulski, J. (ed.) TST 2010. CCIS, vol.\u00a0104, pp. 194\u2013201. Springer, Heidelberg (2010)"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-23935-9_23","volume-title":"Computational Collective Intelligence. Technologies and Applications","author":"J. Koszelew","year":"2011","unstructured":"Koszelew, J.: An Evolutionary Algorithm for the Urban Public Transportation. In: J\u0119drzejowicz, P., Nguyen, N.T., Hoang, K. (eds.) ICCCI 2011, Part I. LNCS, vol.\u00a06922, pp. 234\u2013243. Springer, Heidelberg (2011)"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"E.L. Lawler","year":"1972","unstructured":"Lawler, E.L.: A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem. Management Science\u00a018, 401\u2013405 (1972)","journal-title":"Management Science"},{"issue":"3","key":"10_CR17","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/79147.214078","volume":"37","author":"A. Orda","year":"1990","unstructured":"Orda, A., Rom, R.: Shortest path and minimum - delay algorithms in networks with time-dependent edge-length. Journal Assoc. Computer Mach.\u00a037(3), 607\u2013625 (1990)","journal-title":"Journal Assoc. Computer Mach."},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1061\/(ASCE)0733-947X(1998)124:4(368)","volume":"124","author":"S.B. Pattnaik","year":"1998","unstructured":"Pattnaik, S.B., Mohan, S., Tom, V.M.: Urban bus transit route network design using genetic algorithm. Journal of Transportation Engineering\u00a0124, 124\u2013368 (1998)","journal-title":"Journal of Transportation Engineering"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Pyrga, E., Schultz, F., Wagner, D., Zaroliagis, C.D.: Efficient models for timetable inforamtion in public transformation systems. Journal of Experimental Algorithms\u00a012, Article No. 2.4 (2008)","DOI":"10.1145\/1227161.1227166"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-13803-4_17","volume-title":"Hybrid Artificial Intelligence Systems","author":"L.C. Reyes","year":"2010","unstructured":"Reyes, L.C., Zezzatti, C.A.O.O., Santill\u00e1n, C.G., Hern\u00e1ndez, P.H., Fuerte, M.V.: A Cultural Algorithm for the Urban Public Transportation. In: Corchado, E., Gra\u00f1a Romay, M., Manhaes Savio, A. (eds.) HAIS 2010, Part II. LNCS, vol.\u00a06077, pp. 135\u2013142. Springer, Heidelberg (2010)"},{"key":"10_CR21","unstructured":"Wellman, M.P., Ford, M., Larson, K.: Path planning under time-dependent uncertainty. In: Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence, pp. 532\u2013539 (1995)"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, Y.: Shiying Ch., Jinfeng L., Fu D.: The Application of Genetic Algorithm in Vehicle Routing Problem. In: Electronic Commerce and Security, International Symposium, International Symposium on Electronic Commerce and Security, pp. 3\u20136 (2008)","DOI":"10.1109\/ISECS.2008.227"}],"container-title":["Lecture Notes in Computer Science","Transactions on Computational Collective Intelligence XII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-53878-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T11:30:19Z","timestamp":1558783819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-53878-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642538773","9783642538780"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-53878-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}