{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T08:54:43Z","timestamp":1781686483624,"version":"3.54.5"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T00:00:00Z","timestamp":1605571200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T00:00:00Z","timestamp":1605571200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Public Transp"],"published-print":{"date-parts":[[2021,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Despite the progress in the field of automatic public transport route optimisation in recent years, there exists a clear gap between the development of optimisation algorithms and their applications in real-world planning processes. In this study, we bridge this gap by developing an interface between the urban transit routing problem (UTRP) and the professional transport modelling software PTV Visum. The interface manages the differences in data requirements between the two worlds of research and allows the optimisation of public transport lines in Visum network models. This is demonstrated with the application of selection hyper-heuristics on two network models representing real-world urban areas. The optimisation objectives include the passengers\u2019 average travel time and operators\u2019 costs. Furthermore, we show how our approach can be combined with a mode choice model to optimise the use of public transport in relation to other modes. This feature is applied in a special optimisation experiment to reduce the number of private vehicles on a selected set of links in the network. The results demonstrate the successful implementation of our interface and the applied optimisation methods for a multi-modal public transport network.<\/jats:p>","DOI":"10.1007\/s12469-020-00249-7","type":"journal-article","created":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T07:02:52Z","timestamp":1605596572000},"page":"163-196","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Public transport network optimisation in PTV Visum using selection hyper-heuristics"],"prefix":"10.1007","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0017-3967","authenticated-orcid":false,"given":"Philipp","family":"Heyken Soares","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leena","family":"Ahmed","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yong","family":"Mao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christine L","family":"Mumford","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,11,17]]},"reference":[{"key":"249_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed L, Heyken\u00a0Soares P, Mumford C, Mao Y (2019) Optimising bus routes with fixed terminal nodes: comparing hyper-heuristics with NSGAII on realistic transportation networks. In: Proceedings of the genetic and evolutionary computation conference. ACM, pp 1102\u20131110","DOI":"10.1145\/3321707.3321867"},{"issue":"2","key":"249_CR2","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/j.ejor.2018.10.022","volume":"274","author":"L Ahmed","year":"2019","unstructured":"Ahmed L, Mumford C, Kheiri A (2019) Solving urban transit route design problem using selection hyper-heuristics. Eur J Oper Res 274(2):545\u2013559","journal-title":"Eur J Oper Res"},{"issue":"1","key":"249_CR3","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s12469-011-0042-0","volume":"3","author":"B Alt","year":"2011","unstructured":"Alt B, Weidmann U (2011) A stochastic multiple area approach for public transport network design. Public Transp 3(1):65\u201387. https:\/\/doi.org\/10.1007\/s12469-011-0042-0","journal-title":"Public Transp"},{"issue":"1","key":"249_CR4","doi-asserted-by":"publisher","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 Emerg Technol 3(1):31\u201350","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"10","key":"249_CR5","doi-asserted-by":"publisher","first-page":"1787","DOI":"10.1016\/j.trb.2011.07.005","volume":"45","author":"SA Bagloee","year":"2011","unstructured":"Bagloee SA, Ceder AA (2011) Transit-network design methodology for actual-size road networks. Transp Res Part B Methodol 45(10):1787\u20131804","journal-title":"Transp Res Part B Methodol"},{"issue":"1","key":"249_CR6","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/S0968-090X(00)00048-6","volume":"10","author":"M Bielli","year":"2002","unstructured":"Bielli M, Caramia M, Carotenuto P (2002) Genetic algorithms in bus network optimization. Transp Res Part C Emerg Technol 10(1):19\u201334","journal-title":"Transp Res Part C Emerg Technol"},{"key":"249_CR7","doi-asserted-by":"crossref","unstructured":"Burke EK, Hyde M, Kendall G, Ochoa G, \u00d6zcan E, Woodward JR (2019) A classification of hyper-heuristic approaches: revisited. In: Handbook of metaheuristics, vol 272. Springer, pp 453\u2013477","DOI":"10.1007\/978-3-319-91086-4_14"},{"key":"249_CR8","unstructured":"Bussieck M (1998) Optimal lines in public rail transport. PhD thesis, TU Braunschweig"},{"issue":"4","key":"249_CR9","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0191-2615(86)90047-0","volume":"20","author":"A Ceder","year":"1986","unstructured":"Ceder A, Wilson NH (1986) Bus network design. Transp Res Part B Methodol 20(4):331\u2013344","journal-title":"Transp Res Part B Methodol"},{"issue":"1","key":"249_CR10","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1061\/(ASCE)0733-947X(1997)123:1(28)","volume":"123","author":"S Chien","year":"1997","unstructured":"Chien S, Schonfeld P (1997) Optimization of grid transit system in heterogeneous urban environment. J Transp Eng 123(1):28\u201335","journal-title":"J Transp Eng"},{"issue":"1","key":"249_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.trc.2010.09.003","volume":"20","author":"E Cipriani","year":"2012","unstructured":"Cipriani E, Gori S, Petrelli M (2012) Transit network design: a procedure and an application to a large urban area. Transp Res Part C Emerg Technol 20(1):3\u201314","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"3","key":"249_CR12","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10732-008-9089-8","volume":"16","author":"L Fan","year":"2010","unstructured":"Fan L, Mumford CL (2010) A metaheuristic approach to the urban transit routing problem. J Heuristics 16(3):353\u2013372","journal-title":"J Heuristics"},{"issue":"2","key":"249_CR13","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1061\/(ASCE)0733-947X(2006)132:2(122)","volume":"132","author":"W Fan","year":"2006","unstructured":"Fan W, Machemehl RB (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":"249_CR14","unstructured":"Franz H-D (1975) Untersuchung zur Planung von Verkehrsnetzen unter besonderer Ber\u00fccksichtigung des \u00f6ffentlichen Personennahverkehrs. Forschung Stra\u00dfenbau und Stra\u00dfenverkehrstechnik, p 182"},{"issue":"4","key":"249_CR15","doi-asserted-by":"publisher","first-page":"19","DOI":"10.5038\/2375-0901.2.4.2","volume":"2","author":"M Friedrich","year":"1999","unstructured":"Friedrich M, Haupt T, Noekel K (1999) Planning and analyzing transit networks: an integrated approach regarding requirements of passengers and operators. J Public Transport 2(4):19\u201339","journal-title":"J Public Transport"},{"issue":"10","key":"249_CR16","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1016\/j.trb.2005.12.003","volume":"40","author":"J Guan","year":"2006","unstructured":"Guan J, Yang H, Wirasinghe SC (2006) Simultaneous optimization of transit line configuration and passenger line assignment. Transp Res Part B Methodol 40(10):885\u2013902","journal-title":"Transp Res Part B Methodol"},{"key":"249_CR17","doi-asserted-by":"crossref","unstructured":"Heyken\u00a0Soares P (2020a) Three steps towards practical application of public transport route optimisation in urban areas. PhD thesis, University of Nottingham","DOI":"10.1007\/s12469-020-00242-0"},{"key":"249_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/s12469-020-00242-0","author":"P Heyken\u00a0Soares","year":"2020","unstructured":"Heyken\u00a0Soares P (2020b) Zone-based public transport route optimisation in an urban network. Public Transp. https:\/\/doi.org\/10.1007\/s12469-020-00242-0","journal-title":"Public Transp"},{"issue":"2","key":"249_CR19","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s12469-019-00208-x","volume":"11","author":"P Heyken Soares","year":"2019","unstructured":"Heyken Soares P, Mumford CL, Amponsah K, Mao Y (2019) An adaptive scaled network for public transport route optimisation. Public Transp 11(2):379\u2013412. https:\/\/doi.org\/10.1007\/s12469-019-00208-x","journal-title":"Public Transp"},{"key":"249_CR20","unstructured":"INRO (2018) INRO, Montreal, Canada. Emme 4 User Manual"},{"key":"249_CR21","first-page":"49","volume-title":"Evolutionary computation in combinatorial optimisation","author":"MP John","year":"2014","unstructured":"John MP, Mumford CL, Lewis R (2014) An improved multi-objective algorithm for the urban transit routing problem. In: Blum C, Ochoa G (eds) Evolutionary computation in combinatorial optimisation. Springer, Berlin, pp 49\u201360"},{"key":"249_CR22","doi-asserted-by":"crossref","unstructured":"Kheiri A, Keedwell E (2015) A sequence-based selection hyper-heuristic utilising a hidden Markov model. In: Proceedings of the 2015 annual conference on genetic and evolutionary computation. ACM, pp 417\u2013424","DOI":"10.1145\/2739480.2754766"},{"issue":"3","key":"249_CR23","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1162\/evco_a_00186","volume":"25","author":"A Kheiri","year":"2017","unstructured":"Kheiri A, Keedwell E (2017) A hidden markov model approach to the problem of heuristic selection in hyper-heuristics with a case study in high school timetabling problems. Evolut Comput 25(3):473\u2013501","journal-title":"Evolut Comput"},{"key":"249_CR24","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.cor.2014.05.001","volume":"51","author":"F K\u0131l\u0131\u00e7","year":"2014","unstructured":"K\u0131l\u0131\u00e7 F, G\u00f6k M (2014) A demand based route generation algorithm for public transit network design. Comput Oper Res 51:21\u201329","journal-title":"Comput Oper Res"},{"key":"249_CR25","unstructured":"Marauli A (2011) Nachfrageorientierte Verkehrsmodellbasierte \u00d6PNV-Planung. TU Graz"},{"key":"249_CR26","doi-asserted-by":"crossref","unstructured":"Mumford CL (2013) New heuristic and evolutionary operators for the multi-objective urban transit routing problem. In: 2013 IEEE congress on evolutionary computation (CEC). IEEE, pp 939\u2013946","DOI":"10.1109\/CEC.2013.6557668"},{"key":"249_CR27","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.trc.2014.05.002","volume":"46","author":"MA Nayeem","year":"2014","unstructured":"Nayeem MA, Rahman MK, Rahman MS (2014) Transit network design by genetic algorithm with elitism. Transp Res Part C Emerg Technol 46:30\u201345","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"15","key":"249_CR28","doi-asserted-by":"publisher","first-page":"5945","DOI":"10.1016\/j.eswa.2013.05.002","volume":"40","author":"M Nikoli\u0107","year":"2013","unstructured":"Nikoli\u0107 M, Teodorovi\u0107 D (2013) Transit network design by bee colony optimization. Expert Syst Appl 40(15):5945\u20135955","journal-title":"Expert Syst Appl"},{"issue":"16","key":"249_CR29","doi-asserted-by":"publisher","first-page":"7200","DOI":"10.1016\/j.eswa.2014.05.034","volume":"41","author":"M Nikoli\u0107","year":"2014","unstructured":"Nikoli\u0107 M, Teodorovi\u0107 D (2014) A simultaneous transit network design and frequency setting: computing with bees. Expert Syst Appl 41(16):7200\u20137209","journal-title":"Expert Syst Appl"},{"key":"249_CR30","unstructured":"N\u00f6kel K (2006) Network design for public transport. PTV AG (not published)"},{"issue":"3","key":"249_CR31","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1016\/j.cor.2007.12.002","volume":"36","author":"J Pacheco","year":"2009","unstructured":"Pacheco J, Alvarez A, Casado S, Gonz\u00e1lez-Velarde JL (2009) A tabu search approach to an urban transport problem in Northern Spain. Comput Oper Res 36(3):967\u2013979","journal-title":"Comput Oper Res"},{"issue":"2","key":"249_CR32","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s12469-011-0046-9","volume":"3","author":"H Poorzahedy","year":"2011","unstructured":"Poorzahedy H, Safari F (2011) An ant system application to the bus network design problem: an algorithm and a case study. Public Transp 3(2):165\u2013187. https:\/\/doi.org\/10.1007\/s12469-011-0046-9","journal-title":"Public Transp"},{"key":"249_CR33","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/j.tra.2015.04.024","volume":"77","author":"M Pternea","year":"2015","unstructured":"Pternea M, Kepaptsoglou K, Karlaftis MG (2015) Sustainable urban transit network design. Transp Res Part A Policy Pract 77:276\u2013291","journal-title":"Transp Res Part A Policy Pract"},{"key":"249_CR34","unstructured":"PTV AG (2014) Introduction to the PTV Visum COM-API, Karlsruhe"},{"key":"249_CR35","unstructured":"PTV AG (2017a) PTV Visum 17\u2014overview of examples in the Visum installation, Karlsruhe"},{"key":"249_CR36","unstructured":"PTV AG (2017b) Vision Traffic Suite\u2014Tutorial PTV Visum 17 Quick Start, Karlsruhe"},{"key":"249_CR37","unstructured":"PTV AG (2018) PTV Visum 17 User Manual, Karlsruhe"},{"key":"249_CR38","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0305-0548(74)90046-X","volume":"1","author":"LA Silman","year":"1974","unstructured":"Silman LA, Barzily Z, Passy U (1974) Planning the route system for urban busses. Comput Oper Res 1:201\u2013211","journal-title":"Comput Oper Res"},{"key":"249_CR39","unstructured":"Simonis C (1981) Optimierung von Omnibuslinien. Berichte des Instituts f\u00fcr Stadtbauwesen, RWTH Aachen, p 26"},{"key":"249_CR40","unstructured":"Sonntag H (1977) Linienplanung im \u00f6ffentlichen Personennahverkehr. PhD thesis, Technical University Berlin"},{"issue":"3","key":"249_CR41","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF00837532","volume":"14","author":"D van Oudheusden","year":"1987","unstructured":"van Oudheusden D, Ranjithan S, Singh K (1987) The design of bus route systems\u2014an interactive location-allocation approach. Transportation 14(3):253\u2013270","journal-title":"Transportation"},{"key":"249_CR42","unstructured":"Walter S (2010) Nachfrageorientierte Liniennetzoptimierung am Beispiel Graz (demand orientated line optimisation at the example of Graz). Master\u2019s thesis, Technische Universit\u00e4t Graz"},{"key":"249_CR43","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.trc.2011.12.003","volume":"22","author":"B Yu","year":"2012","unstructured":"Yu B, Yang Z-Z, Jin P-H, Wu S-H, Yao B-Z (2012) Transit route network design-maximizing direct and transfer demand density. Transp Res Part C Emerg Technol 22:58\u201375","journal-title":"Transp Res Part C Emerg Technol"}],"container-title":["Public Transport"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12469-020-00249-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12469-020-00249-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12469-020-00249-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T09:32:12Z","timestamp":1614850332000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12469-020-00249-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,17]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["249"],"URL":"https:\/\/doi.org\/10.1007\/s12469-020-00249-7","relation":{},"ISSN":["1866-749X","1613-7159"],"issn-type":[{"value":"1866-749X","type":"print"},{"value":"1613-7159","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,17]]},"assertion":[{"value":"18 August 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}