{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T10:12:18Z","timestamp":1778753538016,"version":"3.51.4"},"reference-count":49,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72371017"],"award-info":[{"award-number":["72371017"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.ejor.2026.04.020","type":"journal-article","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T23:12:45Z","timestamp":1776294765000},"page":"111-127","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["An exact approach for the transit route network design problem"],"prefix":"10.1016","volume":"334","author":[{"given":"Wentao","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jihui","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanbo","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunjiao","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2026.04.020_bib0001","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.ejor.2018.10.022","article-title":"Solving urban transit route design problem using selection hyper-heuristics","volume":"274","author":"Ahmed","year":"2019","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.04.020_bib0002","doi-asserted-by":"crossref","first-page":"1787","DOI":"10.1016\/j.trb.2011.07.005","article-title":"Transit-network design methodology for actual-size road networks","volume":"45","author":"Asadi Bagloee","year":"2011","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.1016\/j.ejor.2026.04.020_bib0003","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.eswa.2018.04.011","article-title":"A differential evolution for simultaneous transit network design and frequency setting problem","volume":"106","author":"Buba","year":"2018","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.ejor.2026.04.020_bib0004","series-title":"Public transit planning and operation: Modeling, practice and behavior","author":"Ceder","year":"2016"},{"key":"10.1016\/j.ejor.2026.04.020_bib0005","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0191-2615(86)90047-0","article-title":"Bus network design","volume":"20","author":"Ceder","year":"1986","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.1016\/j.ejor.2026.04.020_bib0006","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.trb.2023.04.009","article-title":"Analyzing the trade-off between minimizing travel times and reducing monetary costs for users in the transit network design","volume":"173","author":"Cervantes-Sanmiguel","year":"2023","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.1016\/j.ejor.2026.04.020_bib0007","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1111\/1467-8667.00309","article-title":"Genetic algorithms for optimal Urban Transit network design","volume":"18","author":"Chakroborty","year":"2003","journal-title":"Computer Aided Civil Engineering"},{"key":"10.1016\/j.ejor.2026.04.020_bib0008","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1080\/03052150210909","article-title":"Optimal route network design for transit systems using genetic algorithms","volume":"34","author":"Chakroborty","year":"2002","journal-title":"Engineering Optimization"},{"key":"10.1016\/j.ejor.2026.04.020_bib0009","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1142\/S2010194512005491","article-title":"A genetic algorithm for urban transit routing problem","volume":"09","author":"Chew","year":"2012","journal-title":"International of Journal Modeling Physics Conference Series"},{"key":"10.1016\/j.ejor.2026.04.020_bib0010","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/j.trb.2021.01.010","article-title":"Mathematical formulations for the bimodal bus-pedestrian social welfare network design problem","volume":"145","author":"De-Los-Santos","year":"2021","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.1016\/j.ejor.2026.04.020_bib0011","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s12469-019-00200-5","article-title":"Transit network design with pollution minimization","volume":"11","author":"Duran","year":"2019","journal-title":"Public Transportation"},{"key":"10.1016\/j.ejor.2026.04.020_bib0012","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s12469-021-00284-y","article-title":"A survey on the transit network design and frequency setting problem","volume":"14","author":"Dur\u00e1n-Micco","year":"2022","journal-title":"Public Transportation"},{"key":"10.1016\/j.ejor.2026.04.020_bib0013","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s10732-008-9089-8","article-title":"A metaheuristic approach to the urban transit routing problem","volume":"16","author":"Fan","year":"2010","journal-title":"Journal of Heuristics"},{"key":"10.1016\/j.ejor.2026.04.020_bib0014","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/j.ejor.2013.01.001","article-title":"A review of urban transportation network design problems","volume":"229","author":"Farahani","year":"2013","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.04.020_bib0015","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1016\/j.trb.2005.12.003","article-title":"Simultaneous optimization of transit line configuration and passenger line assignment","volume":"40","author":"Guan","year":"2006","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.1016\/j.ejor.2026.04.020_bib0016","first-page":"1251","article-title":"Transit network design and scheduling: A global review","volume":"42","author":"Guihaire","year":"2008","journal-title":"Transportation Research Part A: Policy and Practice"},{"key":"10.1016\/j.ejor.2026.04.020_bib0017","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106481","article-title":"An improved solution methodology for the urban transit routing problem","volume":"163","author":"H\u00fcsselmann","year":"2024","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.04.020_bib0018","doi-asserted-by":"crossref","DOI":"10.1016\/j.trc.2021.103255","article-title":"Robust electric transit route network design problem (RE-TRNDP) with delay considerations: Model and application","volume":"129","author":"Iliopoulou","year":"2021","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"10.1016\/j.ejor.2026.04.020_bib0019","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/j.trd.2019.10.016","article-title":"Integrated transit route network design and infrastructure planning for on-line electric vehicles","volume":"77","author":"Iliopoulou","year":"2019","journal-title":"Transportation Research Part D: Transport and Environment"},{"key":"10.1016\/j.ejor.2026.04.020_bib0020","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s12469-019-00211-2","article-title":"Metaheuristics for the transit route network design problem: A review and comparative analysis","volume":"11","author":"Iliopoulou","year":"2019","journal-title":"Public Transportation"},{"key":"10.1016\/j.ejor.2026.04.020_bib0021","doi-asserted-by":"crossref","DOI":"10.3390\/app122010232","article-title":"A variable neighbourhood search-based algorithm for the Transit route network design problem","volume":"12","author":"Iliopoulou","year":"2022","journal-title":"Applied Sciences"},{"key":"10.1016\/j.ejor.2026.04.020_bib0022","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.swevo.2019.02.007","article-title":"A heuristic aided stochastic Beam Search algorithm for solving the transit network design problem","volume":"46","author":"Islam","year":"2019","journal-title":"Swarm and Evolutionary Computation"},{"key":"10.1016\/j.ejor.2026.04.020_bib0023","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.cie.2019.02.025","article-title":"A multi-objective meta-heuristic approach for transit network design and frequency setting problem in a bus transit system","volume":"130","author":"Jha","year":"2019","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.ejor.2026.04.020_bib0024","doi-asserted-by":"crossref","first-page":"223","DOI":"10.3390\/a13090223","article-title":"Solving the urban transit routing problem using a cat swarm optimization-based algorithm","volume":"13","author":"Katsaragakis","year":"2020","journal-title":"Algorithms"},{"key":"10.1016\/j.ejor.2026.04.020_bib0025","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1016\/j.asoc.2014.04.005","article-title":"Solving the Urban Transit routing problem using a particle swarm optimization based algorithm","volume":"21","author":"Kechagiopoulos","year":"2014","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.ejor.2026.04.020_bib0026","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1061\/(ASCE)0733-947X(2009)135:8(491)","article-title":"Transit Route network design problem: Review","volume":"135","author":"Kepaptsoglou","year":"2009","journal-title":"Journal of Transportation Engineering"},{"key":"10.1016\/j.ejor.2026.04.020_bib0027","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2024.111446","article-title":"An artificial fish swarm optimization algorithm for the urban transit routing problem","volume":"155","author":"Kourepinis","year":"2024","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.ejor.2026.04.020_bib0028","doi-asserted-by":"crossref","first-page":"3358","DOI":"10.3390\/electronics12153358","article-title":"An improved particle swarm optimization algorithm for the urban transit routing problem","volume":"12","author":"Kourepinis","year":"2023","journal-title":"Electronics"},{"key":"10.1016\/j.ejor.2026.04.020_bib0029","doi-asserted-by":"crossref","first-page":"1574","DOI":"10.1007\/s11771-015-2674-8","article-title":"Simultaneous optimization of transit network and public bicycle station network","volume":"22","author":"Liu","year":"2015","journal-title":"Journal of Cent. South University"},{"key":"10.1016\/j.ejor.2026.04.020_bib0030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2017.07.044","article-title":"A survey on robustness in railway planning","volume":"266","author":"Lusby","year":"2018","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.04.020_bib0031","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","article-title":"Network design and transportation planning: Models and algorithms","volume":"18","author":"Magnanti","year":"1984","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2026.04.020_bib0032","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2025.104317","article-title":"Expansion of bi-modal express transit networks \u2212 a hybrid optimization approach","volume":"202","author":"Mahmoudi","year":"2025","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.ejor.2026.04.020_bib0033","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/0377-2217(80)90126-5","article-title":"Evaluation and optimization of urban public transportation networks","volume":"5","author":"Mandl","year":"1980","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.04.020_bib0034","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","article-title":"Integer programming formulation of traveling salesman problems","volume":"7","author":"Miller","year":"1960","journal-title":"Journal ACM"},{"key":"10.1016\/j.ejor.2026.04.020_bib0035","doi-asserted-by":"crossref","unstructured":"Mumford, C.L., 2013. New heuristic and evolutionary operators for the multi-objective urban transit routing problem, in: 2013 IEEE Congress on Evolutionary Computation. Presented at the 2013 IEEE Congress on Evolutionary Computation (CEC), IEEE, Cancun, Mexico, pp. 939\u2013946. https:\/\/doi.org\/10.1109\/CEC.2013.6557668.","DOI":"10.1109\/CEC.2013.6557668"},{"key":"10.1016\/j.ejor.2026.04.020_bib0036","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.trc.2014.05.002","article-title":"Transit network design by genetic algorithm with elitism","volume":"46","author":"Nayeem","year":"2014","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"10.1016\/j.ejor.2026.04.020_bib0037","doi-asserted-by":"crossref","DOI":"10.1287\/trsc.13.1.20","article-title":"Some issues relating to the optimal design of bus routes","author":"Newell","year":"1979","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2026.04.020_bib0038","doi-asserted-by":"crossref","first-page":"5945","DOI":"10.1016\/j.eswa.2013.05.002","article-title":"Transit network design by Bee Colony Optimization","volume":"40","author":"Nikoli\u0107","year":"2013","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.ejor.2026.04.020_bib0039","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1061\/(ASCE)0733-947X(1998)124:4(368)","article-title":"Urban bus transit route network design using genetic algorithm","volume":"124","author":"Pattnaik","year":"1998","journal-title":"Journal Transportation of Engineering"},{"key":"10.1016\/j.ejor.2026.04.020_bib0040","series-title":"Springer optimization and its applications","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-9566-6","article-title":"Integrating routing decisions in public transportation problems","author":"Schmidt","year":"2014"},{"key":"10.1016\/j.ejor.2026.04.020_bib0041","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2021\/6684795","article-title":"An exact solution approach for the bus line planning problem with integrated passenger routing","volume":"2021","author":"Vermeir","year":"2021","journal-title":"Journal of Advanced Transportation"},{"key":"10.1016\/j.ejor.2026.04.020_bib0042","doi-asserted-by":"crossref","unstructured":"Wang, S., Sun, Y., Musco, C., Bao, Z., 2021. Public transport planning: When transit network connectivity meets commuting demand, in: Proceedings of the 2021 International Conference on Management of Data, SIGMOD \u201921. Association for Computing Machinery, New York, NY, USA, pp. 1906\u20131919. https:\/\/doi.org\/10.1145\/3448016.3457247.","DOI":"10.1145\/3448016.3457247"},{"key":"10.1016\/j.ejor.2026.04.020_bib0043","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107191","article-title":"A decentralised genetic algorithm with sub-objectives for the transit network design problem","volume":"183","author":"Wens","year":"2025","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.04.020_bib0044","doi-asserted-by":"crossref","first-page":"1298","DOI":"10.1007\/s10878-020-00647-4","article-title":"A bi-objective decision model and method for the integrated optimization of bus line planning and lane reservation","volume":"43","author":"Wu","year":"2022","journal-title":"Journal of Combinatorial Optimization"},{"key":"10.1016\/j.ejor.2026.04.020_bib0045","doi-asserted-by":"crossref","unstructured":"Xu, G., Shi, F., Wang, P., 2014. Model and algorithm of optimizing bus transit network based on line segment combination 1514\u20131525. https:\/\/doi.org\/10.1061\/9780784413623.146.","DOI":"10.1061\/9780784413623.146"},{"key":"10.1016\/j.ejor.2026.04.020_bib0046","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1111\/j.1467-8667.2006.00469.x","article-title":"A parallel ant colony algorithm for bus network optimization","volume":"22","author":"Yang","year":"2007","journal-title":"Computer Aided Civil Engineering"},{"key":"10.1016\/j.ejor.2026.04.020_bib0047","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.trc.2013.12.005","article-title":"Transit network design based on travel time reliability","volume":"43","author":"Yao","year":"2014","journal-title":"Transportation Research Part C: Emerging Technologies, Special Issue on \u201cNature-Inspired Optimization Techniques in Transportation Planning and Operation\u201d"},{"key":"10.1016\/j.ejor.2026.04.020_bib0048","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.trc.2011.12.003","article-title":"Transit route network design-maximizing direct and transfer demand density","volume":"22","author":"Yu","year":"2012","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"10.1016\/j.ejor.2026.04.020_bib0049","first-page":"1","article-title":"Transit route network design for low-mobility individuals using a hybrid metaheuristic approach","volume":"2020","author":"Zhang","year":"2020","journal-title":"Journal of Advanced Transportation"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726003553?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726003553?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T09:17:56Z","timestamp":1778750276000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221726003553"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,10]]}},"alternative-id":["S0377221726003553"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2026.04.020","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An exact approach for the transit route network design problem","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2026.04.020","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}