{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T10:50:42Z","timestamp":1773226242551,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,11,1]],"date-time":"2009-11-01T00:00:00Z","timestamp":1257033600000},"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":[[2009,11]]},"DOI":"10.1007\/s12469-010-0016-7","type":"journal-article","created":{"date-parts":[[2010,2,10]],"date-time":"2010-02-10T22:47:48Z","timestamp":1265842068000},"page":"253-273","source":"Crossref","is-referenced-by-count":58,"title":["A multi-objective metaheuristic approach for\u00a0the\u00a0Transit Network Design Problem"],"prefix":"10.1007","volume":"1","author":[{"given":"Antonio","family":"Mauttone","sequence":"first","affiliation":[]},{"given":"Mar\u00eda E.","family":"Urquhart","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,11]]},"reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1061\/(ASCE)0887-3801(2004)18:3(248)","volume":"18","author":"J Agrawal","year":"2004","unstructured":"Agrawal J, Tom M (2004) Transit route network design using parallel Genetic Algorithm. J Comput Civ Eng 18(3):248\u2013256","journal-title":"J Comput Civ Eng"},{"key":"16_CR2","first-page":"7","volume":"976","author":"KW Axhausen","year":"1984","unstructured":"Axhausen KW, Smith R (1984) Evaluation of heuristic transit network optimization algorithms. Transp Res Rec 976:7\u201320","journal-title":"Transp Res Rec"},{"key":"16_CR3","first-page":"125","volume":"1283","author":"MH Baaj","year":"1990","unstructured":"Baaj MH, Mahmassani HS (1990) TRUST: a LISP program for the analysis of transit route configurations. Transp Res Rec 1283:125\u2013135","journal-title":"Transp Res Rec"},{"issue":"2","key":"16_CR4","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"},{"issue":"1","key":"16_CR5","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 C 3(1):31\u201350","journal-title":"Transp Res C"},{"key":"16_CR6","unstructured":"Baldoqu\u00edn G (2002) Approximate solution of an extended 0\/1 knapsack problem using GRASP. In: XI Congreso Latino-Iberoamericano de investigaci\u00f3n de operaciones, Concepci\u00f3n, Chile"},{"issue":"1","key":"16_CR7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1287\/trsc.1060.0161","volume":"41","author":"R Bornd\u00f6rfer","year":"2007","unstructured":"Bornd\u00f6rfer R, Gr\u00f6tschel M, Pfetsch M (2007) A column-generation approach to line planning in public transport. Transp Sci 41(1):123\u2013132","journal-title":"Transp Sci"},{"issue":"4","key":"16_CR8","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0191-2615(86)90047-0","volume":"20","author":"A Ceder","year":"1986","unstructured":"Ceder A, Wilson NHM (1986) Bus network design. Transp Res B 20(4):331\u2013344","journal-title":"Transp Res B"},{"issue":"3","key":"16_CR9","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. Computer-Aided Civ Infrastruct Eng 18(3):184\u2013200","journal-title":"Computer-Aided Civ Infrastruct Eng"},{"issue":"2","key":"16_CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/358923.358929","volume":"32","author":"CA Coello","year":"2000","unstructured":"Coello CA (2000) An updated survey of GA-based multiobjective optimization techniques. ACM Comput Surv 32(2):109\u2013143","journal-title":"ACM Comput Surv"},{"key":"16_CR11","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K Deb","year":"2001","unstructured":"Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, New York"},{"key":"16_CR12","series-title":"Handbooks in operations research and management science","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0927-0507(06)14002-5","volume-title":"Transportation","author":"G Desaulniers","year":"2007","unstructured":"Desaulniers G, Hickman MD (2007) Public transit. In: Barnhart C, Laporte G (eds) Transportation. Handbooks in operations research and management science. North Holland, Amsterdam, pp 69\u2013127"},{"key":"16_CR13","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s002910000046","volume":"22","author":"M Ehrgott","year":"2000","unstructured":"Ehrgott M, Gandibleux X (2000) A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spektrum 22:425\u2013460","journal-title":"OR Spektrum"},{"key":"16_CR14","series-title":"International series in operations research & management science","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/b101915","volume-title":"Multiple criteria optimization: state of the art annotated bibliographic surveys","author":"M Ehrgott","year":"2002","unstructured":"Ehrgott M, Gandibleux X (2002) Multiobjective combinatorial optimization. In: Ehrgott M, Gandibleux X (eds) Multiple criteria optimization: state of the art annotated bibliographic surveys. International series in operations research & management science. Springer, Berlin, pp 369\u2013444"},{"issue":"1","key":"16_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02578918","volume":"12","author":"M Ehrgott","year":"2004","unstructured":"Ehrgott M, Gandibleux X (2004) Approximative solution methods for multiobjective combinatorial optimization. Top: Rev Asoc Esp Estad Investig Oper 12(1):1\u201389","journal-title":"Top: Rev Asoc Esp Estad Investig Oper"},{"key":"16_CR16","unstructured":"Fan W, Machemehl RB (2004) Optimal transit route network design problem: algorithms, implementations, and numerical results. Technical Report 167244-1 University of Texas at Austin"},{"issue":"2","key":"16_CR17","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1061\/(ASCE)0733-947X(2006)132:2(122)","volume":"132","author":"W Fan","year":"2006","unstructured":"Fan W, Machemehl R (2006) Using a simulated annealing algorithm to solve the transit route network design problem. J Transp Eng 132(2):122\u2013132","journal-title":"J Transp Eng"},{"key":"16_CR18","series-title":"Lecture notes in economics and mathematical systems","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/978-3-540-73312-6_20","volume-title":"Computer-aided systems in public transport","author":"W Fan","year":"2008","unstructured":"Fan W, Machemehl RB (2008) A tabu search based heuristic method for the transit route network design problem. In: Computer-aided systems in public transport. Lecture notes in economics and mathematical systems, vol 600. Springer, Berlin, pp 387\u2013408"},{"key":"16_CR19","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Glob Optim 6:109\u2013133","journal-title":"J Glob Optim"},{"key":"16_CR20","unstructured":"Gandibleux X, Vancoppenolle D, Tuyttens D (1998) A first making use of GRASP for solving MOCO problems. Technical Report, University of Valenciennes"},{"key":"16_CR21","unstructured":"Hasselstr\u00f6m D (1981) Public transportation planning\u2014a mathematical programming approach. Doctoral Dissertation, University of G\u00f6teborg"},{"issue":"1","key":"16_CR22","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/j.cor.2006.02.027","volume":"35","author":"AJ Higgins","year":"2008","unstructured":"Higgins AJ, Hajkowicz S, Bui E (2008) A multi-objective model for environmental investment decision making. Comput Oper Res 35(1):253\u2013266","journal-title":"Comput Oper Res"},{"key":"16_CR23","volume-title":"Proceedings of the sixth international workshop on computer aided scheduling of public transport","author":"Y Israeli","year":"1993","unstructured":"Israeli Y, Ceder A (1993) Transit route design using scheduling and multiobjective programming techniques. In: Daduna JR, Branco I, Pinto JM (eds) Proceedings of the sixth international workshop on computer aided scheduling of public transport. Springer, Berlin"},{"key":"16_CR24","volume-title":"Lecture notes in economics and mathematical systems","author":"A Jaszkiewicz","year":"2004","unstructured":"Jaszkiewicz A (2004) Evaluation of multiple objective metaheuristics. In: Lecture notes in economics and mathematical systems, vol 535. Springer, Berlin"},{"issue":"1","key":"16_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1061\/(ASCE)0733-947X(2005)131:1(1)","volume":"131","author":"YJ Lee","year":"2005","unstructured":"Lee YJ, Vuchic VR (2005) Transit network design with variable demand. J Transp Eng 131(1):1\u201310","journal-title":"J Transp Eng"},{"key":"16_CR26","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/978-3-642-01020-0_38","volume-title":"Evolutionary multi-criterion optimization","author":"H Li","year":"2009","unstructured":"Li H, Landa-Silva D (2009) An elitist GRASP metaheuristic for the multi-objective quadratic assignment problem. In: Evolutionary multi-criterion optimization. Lecture notes in computer science, vol 5467. Springer, Berlin, pp 481\u2013494"},{"issue":"1","key":"16_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"TL Magnanti","year":"1984","unstructured":"Magnanti TL, Wong RT (1984) Network design and transportation planning: models and algorithms. Transp Sci 18(1):1\u201355","journal-title":"Transp Sci"},{"issue":"6","key":"16_CR28","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/0377-2217(80)90126-5","volume":"5","author":"CE Mandl","year":"1980","unstructured":"Mandl CE (1980) Evaluation and optimization of urban public transportation networks. Eur J Oper Res 5(6):396\u2013404","journal-title":"Eur J Oper Res"},{"key":"16_CR29","unstructured":"Mauttone A, Urquhart ME (2004) GRASP para el dise\u00f1o de recorridos en transporte p\u00fablico. In: XII Congreso Latino-Iberoamericano de investigaci\u00f3n de operaciones, La Habana, Cuba"},{"key":"16_CR30","unstructured":"Mauttone A, Urquhart ME (2007) Optimizaci\u00f3n multi-objetivo de recorridos y frecuencias en transporte p\u00fablico aplicado a un caso de estudio real. In: XIII Congreso chileno de ingenier\u00eda de transporte, Santiago, Chile"},{"issue":"8","key":"16_CR31","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 (2009) A route set construction algorithm for the Transit Network Design Problem. Comput Oper Res 36(8):2440\u20132449","journal-title":"Comput Oper Res"},{"key":"16_CR32","doi-asserted-by":"crossref","unstructured":"Moz M, Resp\u00edcio A, Vaz Pato M (2009) Bi-objective evolutionary heuristics for bus driver rostering. Public Transport 1. online available doi: 10.1007\/s12469-009-0013-x","DOI":"10.1007\/s12469-009-0013-x"},{"issue":"5","key":"16_CR33","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 D (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":"16_CR34","unstructured":"Rao\u00a0Krishna KV, Muralidhar S, Dhingra SL (2000) Public transport routing and scheduling using Genetic Algorithms. In: 8th International conference on computer aided scheduling of public transport, Berlin, Germany"},{"key":"16_CR35","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","volume-title":"Handbook of metaheuristics","author":"M Resende","year":"2003","unstructured":"Resende M, Ribeiro C (2003) Greedy randomized adaptive search procedures. In: Glover F, Kochenberger\u00a0G (eds) Handbook of metaheuristics. Kluwer Academic, Dordrecht, pp 219\u2013249"},{"issue":"10","key":"16_CR36","doi-asserted-by":"crossref","first-page":"1572","DOI":"10.1287\/mnsc.1050.0413","volume":"51","author":"S Sayin","year":"2005","unstructured":"Sayin S, Kouvelis P (2005) The multiobjective discrete optimization problem: a weighted min-max two-stage optimization approach and a bicriteria algorithm. Manag Sci 51(10):1572\u20131581","journal-title":"Manag Sci"},{"issue":"2","key":"16_CR37","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0305-0548(74)90046-X","volume":"1","author":"LA Silman","year":"1974","unstructured":"Silman LA, Barziliy Z, Passy U (1974) Planning the route system for urban buses. Comput Oper Res 1(2):201\u2013211","journal-title":"Comput Oper Res"},{"issue":"2","key":"16_CR38","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1061\/(ASCE)0733-947X(2003)129:2(186)","volume":"129","author":"VM Tom","year":"2003","unstructured":"Tom VM, Mohan S (2003) Transit route network design using frequency coded Genetic Algorithm. J\u00a0Transp Eng 129(2):186\u2013195","journal-title":"J\u00a0Transp Eng"},{"key":"16_CR39","doi-asserted-by":"crossref","unstructured":"Vianna DS, Arroyo JEC (2004) A GRASP algorithm for the multi-objective knapsack problem. In: Proceedings of the 24th international conference of the Chilean computer science society, pp 69\u201375","DOI":"10.1109\/QEST.2004.2"},{"issue":"4","key":"16_CR40","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1023\/B:JMMA.0000020425.99217.cd","volume":"2","author":"QK Wan","year":"2003","unstructured":"Wan QK, Lo HK (2003) A mixed integer formulation for multiple-route transit network design. J Math Model Algorithms 2(4):299\u2013308","journal-title":"J Math Model Algorithms"},{"key":"16_CR41","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1016\/j.ejor.2007.02.005","volume":"186","author":"F Zhao","year":"2008","unstructured":"Zhao F, Zeng X (2008) Optimization of transit route network, vehicle headways and timetables for large-scale transit networks. Eur J Oper Res 186:841\u2013855","journal-title":"Eur J Oper Res"}],"container-title":["Public Transport"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12469-010-0016-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12469-010-0016-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12469-010-0016-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T11:16:18Z","timestamp":1559474178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12469-010-0016-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["16"],"URL":"https:\/\/doi.org\/10.1007\/s12469-010-0016-7","relation":{},"ISSN":["1866-749X","1613-7159"],"issn-type":[{"value":"1866-749X","type":"print"},{"value":"1613-7159","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11]]}}}