{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T02:48:29Z","timestamp":1776912509543,"version":"3.51.2"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T00:00:00Z","timestamp":1330128000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Public Transp"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s12469-012-0051-7","type":"journal-article","created":{"date-parts":[[2012,2,24]],"date-time":"2012-02-24T08:33:03Z","timestamp":1330072383000},"page":"57-76","source":"Crossref","is-referenced-by-count":38,"title":["A bus network design procedure with elastic demand for large urban areas"],"prefix":"10.1007","volume":"4","author":[{"given":"Ernesto","family":"Cipriani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Gori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Petrelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,2,25]]},"reference":[{"issue":"2","key":"51_CR1","first-page":"187","volume":"25","author":"MH Baaj","year":"1991","unstructured":"Baaj MH, Mahmassani HS (1991) An AI-based approach for transit route system planning and design. J\u00a0Adv Transp 25(2):187\u2013210","journal-title":"J\u00a0Adv Transp"},{"key":"51_CR2","first-page":"125","volume":"1283","author":"MH Baaj","year":"1992","unstructured":"Baaj MH, Mahmassani HS (1992) TRUST: a Lisp program for the analysis of transit route configurations. Transp Res Rec 1283:125\u2013135","journal-title":"Transp Res Rec"},{"key":"51_CR3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0968-090X(94)00011-S","volume":"3","author":"MH Baaj","year":"1995","unstructured":"Baaj MH, Mahmassani HS (1995) Hybrid route generation heuristic algorithm for the design of transit networks. Transp Res Part C 3:31\u201350","journal-title":"Transp Res Part C"},{"key":"51_CR4","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.trc.2009.04.008","volume":"17","author":"B Beltran","year":"2009","unstructured":"Beltran B, Carrese S, Cipriani E, Petrelli M (2009) Transit network design with allocation of green vehicles: A genetic algorithm approach. Transp Res Part C 17:475\u2013483","journal-title":"Transp Res Part C"},{"key":"51_CR5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/0-306-48220-7_11","volume":"64","author":"S Carrese","year":"2002","unstructured":"Carrese S, Gori S (2002) An urban bus network design procedure. Appl Optim 64:177\u2013196","journal-title":"Appl Optim"},{"key":"51_CR6","volume-title":"Proceedings of the 3rd international conference on competition and ownership in surface passenger transport","author":"A Ceder","year":"1993","unstructured":"Ceder A, Israeli Y (1993) Design and evaluation of transit routes in urban networks. In: Proceedings of the 3rd international conference on competition and ownership in surface passenger transport, Ontario, Canada"},{"key":"51_CR7","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1111\/1467-8667.00309","volume":"18","author":"P Chakroborty","year":"2003","unstructured":"Chakroborty P (2003) Genetic algorithms for optimal urban transit network design. Comput-Aided Civ Infrastruct Eng 18:184\u2013200","journal-title":"Comput-Aided Civ Infrastruct Eng"},{"key":"51_CR8","first-page":"5","volume":"10","author":"E Cipriani","year":"2006","unstructured":"Cipriani E, Fusco G, Petrelli M (2006) A multimodal transit network design procedure for urban areas. J\u00a0Adv Transp Stud, Sect A 10:5\u201320","journal-title":"J\u00a0Adv Transp Stud, Sect A"},{"key":"51_CR9","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.tranpol.2005.08.001","volume":"13","author":"L D\u2019Acierno","year":"2005","unstructured":"D\u2019Acierno L, Gallo M, Montella B (2005) Optimisation models for the urban parking pricing problem. Transp Policy 13:34\u201348","journal-title":"Transp Policy"},{"key":"51_CR10","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1016\/j.tra.2011.04.006","volume":"45","author":"M Estrada","year":"2011","unstructured":"Estrada M, Roca-Riu M, Badia H, Robust\u00e9 F, Daganzo CF (2011) Design and implementation of efficient transit networks: procedure, case study and validity test. Transp Res, Part A, Policy Pract 45:935\u2013950","journal-title":"Transp Res, Part A, Policy Pract"},{"issue":"1","key":"51_CR11","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1061\/(ASCE)0733-947X(2006)132:1(40)","volume":"132","author":"W Fan","year":"2006","unstructured":"Fan W, Machemehl RB (2006) Optimal transit route network design problem with variable transit demand: genetic algorithm approach. J Transp Eng 132(1):40\u201351","journal-title":"J Transp Eng"},{"key":"51_CR12","first-page":"652","volume-title":"Proceedings of 9th Euro working group on transportation","author":"G Fusco","year":"2002","unstructured":"Fusco G, Gori S, Petrelli M (2002) A heuristic transit network design algorithm for medium size towns. In: Proceedings of 9th Euro working group on transportation, Bari, Italy, pp\u00a0652\u2013656"},{"key":"51_CR13","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading"},{"key":"51_CR14","doi-asserted-by":"crossref","first-page":"1251","DOI":"10.1016\/j.tra.2008.03.011","volume":"42","author":"V Guihaire","year":"2008","unstructured":"Guihaire V, Hao J (2008) Transit network design and scheduling: a\u00a0global review. Transp Res, Part A, Policy Pract 42:1251\u20131273","journal-title":"Transp Res, Part A, Policy Pract"},{"issue":"8","key":"51_CR15","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1061\/(ASCE)0733-947X(2009)135:8(491)","volume":"135","author":"K Kepaptsoglou","year":"2009","unstructured":"Kepaptsoglou K, Karlaftis M (2009) Transit route network design problem: review. J Transp Eng 135(8):491\u2013505","journal-title":"J Transp Eng"},{"key":"51_CR16","volume-title":"Proceedings of the 8th international conference on computer-aided scheduling of public transport (CASPT-2000)","author":"KV Krishna Rao","year":"2000","unstructured":"Krishna Rao KV, Muralidhar S, Dhingra SL (2000) Public transport routing and scheduling using genetic algorithms. In: Proceedings of the 8th international conference on computer-aided scheduling of public transport (CASPT-2000), Berlin, Germany"},{"issue":"1","key":"51_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1061\/(ASCE)0733-947X(2005)131:1(1)","volume":"131","author":"Y Lee","year":"2005","unstructured":"Lee Y, Vuchic VR (2005) Transit network design with variable demand. J Transp Eng 131(1):1\u201310","journal-title":"J Transp Eng"},{"key":"51_CR18","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/0377-2217(80)90126-5","volume":"5","author":"CE Mandl","year":"1979","unstructured":"Mandl CE (1979) Evaluation and optimization of urban public transportation network. Eur J Oper Res 5:396\u2013404","journal-title":"Eur J Oper Res"},{"key":"51_CR19","doi-asserted-by":"crossref","first-page":"2440","DOI":"10.1016\/j.cor.2008.09.014","volume":"36","author":"A Mauttone","year":"2009","unstructured":"Mauttone A, Urquhart ME (2009a) A route set construction algorithm for the transit network design problem. Comput Oper Res 36:2440\u20132449","journal-title":"Comput Oper Res"},{"key":"51_CR20","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s12469-010-0016-7","volume":"1","author":"A Mauttone","year":"2009","unstructured":"Mauttone A, Urquhart ME (2009b) A multi-objective metaheuristic approach for the transit network design problem. Public Transp 1:253\u2013273","journal-title":"Public Transp"},{"issue":"1","key":"51_CR21","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1287\/trsc.13.1.20","volume":"13","author":"G Newell","year":"1979","unstructured":"Newell G (1979) Some issue relating to the optimal design of bus lines. Transp Sci 13(1):20\u201335","journal-title":"Transp Sci"},{"issue":"5","key":"51_CR22","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1061\/(ASCE)0733-947X(2003)129:5(510)","volume":"129","author":"S Ngamchai","year":"2003","unstructured":"Ngamchai S, Lovell DJ (2003) Optimal time transfer in bus transit route network design using a genetic algorithm. J Transp Eng 129(5):510\u2013521","journal-title":"J Transp Eng"},{"key":"51_CR23","volume-title":"Modelling transport","author":"JD Ortuzar","year":"1996","unstructured":"Ortuzar JD, Willumsen L (1996) Modelling transport. Wiley, New York"},{"issue":"4","key":"51_CR24","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1061\/(ASCE)0733-947X(1998)124:4(368)","volume":"124","author":"SB Pattnaik","year":"1998","unstructured":"Pattnaik SB, Mohan S, Tom VM (1998) Urban bus transit network design using genetic algorithm. J Transp Eng 124(4):368\u2013375","journal-title":"J Transp Eng"},{"key":"51_CR25","unstructured":"Schreyer C, Schneider C, Maibach M (INFRAS) and Rothengatter W, Doll C, Schmedding D (IWW) (2004) External costs of transport. Update study. Zurich\/Karlsruhe"},{"key":"51_CR26","first-page":"37","volume":"1364","author":"YE Xiong","year":"1993","unstructured":"Xiong YE, Schneider JB (1993) Transportation network design using a cumulative genetic algorithm and neural network. Transp Res Rec 1364:37\u201344","journal-title":"Transp Res Rec"}],"container-title":["Public Transport"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12469-012-0051-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12469-012-0051-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12469-012-0051-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T07:16:19Z","timestamp":1559459779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12469-012-0051-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,25]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["51"],"URL":"https:\/\/doi.org\/10.1007\/s12469-012-0051-7","relation":{},"ISSN":["1866-749X","1613-7159"],"issn-type":[{"value":"1866-749X","type":"print"},{"value":"1613-7159","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,25]]}}}