{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T03:46:15Z","timestamp":1771386375388,"version":"3.50.1"},"reference-count":107,"publisher":"Elsevier","isbn-type":[{"value":"9780444513465","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1016\/s0927-0507(06)14003-7","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T14:23:13Z","timestamp":1164637393000},"page":"129-187","source":"Crossref","is-referenced-by-count":102,"title":["Chapter 3 Passenger Railway Optimization"],"prefix":"10.1016","author":[{"given":"Alberto","family":"Caprara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leo","family":"Kroon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Monaci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Peeters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Toth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0927-0507(06)14003-7_bib001","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/trsc.1030.0044","article-title":"Allocation of railway rolling stock for passenger trains","volume":"38","author":"Abbink","year":"2004","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14003-7_bib002","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1287\/inte.1050.0158","article-title":"Reinventing crew scheduling at Netherlands railways","volume":"35","author":"Abbink","year":"2005","journal-title":"Interfaces"},{"key":"10.1016\/S0927-0507(06)14003-7_bib003","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1287\/trsc.3.2.140","article-title":"The airline crew scheduling problem: A survey","volume":"3","author":"Arabeyre","year":"1969","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14003-7_bib004","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/net.3230200103","article-title":"A network model for the rotating workforce scheduling problem","volume":"20","author":"Balakrishnan","year":"1990","journal-title":"Networks"},{"key":"10.1016\/S0927-0507(06)14003-7_bib005","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1287\/opre.44.6.875","article-title":"A dynamic subgradient-based branch-and-bound procedure for set covering","volume":"44","author":"Balas","year":"1996","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib006","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BFb0120886","article-title":"Set covering algorithms using cutting planes, heuristics and subgradient optimization: A computational study","volume":"12","author":"Balas","year":"1980","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0927-0507(06)14003-7_bib007","series-title":"Mathematical Programming: State of the Art 1994","first-page":"186","article-title":"Branch-and-price: Column generation for solving huge integer programs","author":"Barnhart","year":"1994"},{"key":"10.1016\/S0927-0507(06)14003-7_bib008","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0377-2217(87)90141-X","article-title":"An algorithm for set covering problems","volume":"31","author":"Beasley","year":"1987","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib009","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO;2-2","article-title":"A Lagrangian heuristic for set covering problems","volume":"37","author":"Beasley","year":"1990","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0927-0507(06)14003-7_bib010","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","article-title":"A genetic algorithm for the set covering problem","volume":"94","author":"Beasley","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib011","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0377-2217(92)90215-U","article-title":"Enhancing an algorithm for set covering problems","volume":"58","author":"Beasley","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib012","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1287\/inte.28.1.6","article-title":"Schedule optimization at SNCF: From conception to day of departure","volume":"28","author":"Ben-Khedher","year":"1998","journal-title":"Interfaces"},{"key":"10.1016\/S0927-0507(06)14003-7_bib013","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1287\/trsc.37.2.213.15250","article-title":"Using integer programming to solve the train platforming problem","volume":"37","author":"Billionnet","year":"2003","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14003-7_bib014","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/PL00020912","article-title":"Scheduling trams in the morning","volume":"49","author":"Blasum","year":"2000","journal-title":"Mathematical Methods of Operations Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib015","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","article-title":"Routing and scheduling of vehicles and crews: The state of the art","volume":"10","author":"Bodin","year":"1983","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib016","first-page":"369","article-title":"Linienplanung und Simulation f\u00fcr \u00d6ffentlichen Verkehrswege in Praxis und Theorie","volume":"43","author":"Bouma","year":"1994","journal-title":"Eisenbahntechnische Rundschau"},{"key":"10.1016\/S0927-0507(06)14003-7_bib017","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1287\/trsc.32.4.358","article-title":"Railway timetabling using Lagrangian relaxation","volume":"32","author":"Br\u00e4nnlund","year":"1998","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14003-7_bib018","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1023\/A:1024843208074","article-title":"Routing of railway carriages: A case study","volume":"27","author":"Brucker","year":"2003","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/S0927-0507(06)14003-7_bib019","unstructured":"Bussieck, M.R. (1998). Optimal lines in public rail transport. PhD thesis, TU Braunschweig"},{"key":"10.1016\/S0927-0507(06)14003-7_bib020","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/0377-2217(95)00367-3","article-title":"Optimal lines for railway systems","volume":"96","author":"Bussieck","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib021","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/BF02614327","article-title":"Discrete optimization in public rail transport","volume":"79","author":"Bussieck","year":"1997","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0927-0507(06)14003-7_bib022","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/0305-0548(94)90099-X","article-title":"A fast heuristic for the train scheduling problem","volume":"21","author":"Cai","year":"1994","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib023","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02614314","article-title":"Algorithms for railway crew management","volume":"79","author":"Caprara","year":"1997","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0927-0507(06)14003-7_bib024","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1287\/opre.46.6.820","article-title":"Modeling and solving the crew rostering problem","volume":"46","author":"Caprara","year":"1998","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib025","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1287\/opre.47.5.730","article-title":"A heuristic method for the set covering problem","volume":"47","author":"Caprara","year":"1999","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib026","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1023\/A:1019225027893","article-title":"Algorithms for the set covering problem","volume":"98","author":"Caprara","year":"2000","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib027","series-title":"Computer-Aided Transit Scheduling","first-page":"17","article-title":"A global method for crew planning in railway applications","volume":"vol. 505","author":"Caprara","year":"2001"},{"key":"10.1016\/S0927-0507(06)14003-7_bib028","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1287\/opre.50.5.851.362","article-title":"Modeling and solving the train timetabling problem","volume":"50","author":"Caprara","year":"2002","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib029","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s10107-003-0413-7","article-title":"Models and algorithms for a staff scheduling problem","volume":"98","author":"Caprara","year":"2003","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0927-0507(06)14003-7_bib030","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1016\/j.dam.2005.05.026","article-title":"A Lagrangian heuristic approach to real-world train timetabling problems","volume":"154","author":"Caprara","year":"2006","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0927-0507(06)14003-7_bib031","first-page":"195","article-title":"Scheduling and platforming trains at busy complex stations","volume":"37","author":"Carey","year":"2003","journal-title":"Transportation Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib032","doi-asserted-by":"crossref","first-page":"988","DOI":"10.1057\/jors.1995.136","article-title":"A model, algorithms and strategy for train pathing","volume":"46","author":"Carey","year":"1995","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0927-0507(06)14003-7_bib033","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01581106","article-title":"A Lagrangian-based heuristic for large-scale set covering problems","volume":"81","author":"Ceria","year":"1998","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0927-0507(06)14003-7_bib034","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1016\/S0305-0548(98)00030-6","article-title":"Crew scheduling of light rail transit in Hong Kong: From modeling to implementation","volume":"25","author":"Chu","year":"1998","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib035","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1016\/S0377-2217(97)00271-3","article-title":"Cost optimal allocation of passenger lines","volume":"110","author":"Claessens","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib036","unstructured":"Constantino, A.A., de Mendonca Neto, C.F.X., Novaes, A.G. (2006). Crew rostering problem with distribution of workload based on preferences. Annals of Operations Research, in press"},{"key":"10.1016\/S0927-0507(06)14003-7_bib037","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1287\/trsc.32.4.380","article-title":"A survey of optimization models for train routing and scheduling","volume":"32","author":"Cordeau","year":"1998","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14003-7_bib038","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1287\/opre.49.4.531.11226","article-title":"Simultaneous assignment of locomotives and cars to passenger trains","volume":"49","author":"Cordeau","year":"2001","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib039","series-title":"Computer-Aided Scheduling of Public Transport","volume":"vol. 505","year":"2001"},{"key":"10.1016\/S0927-0507(06)14003-7_bib040","series-title":"Computer-Aided Transit Scheduling","volume":"vol. 308","year":"1988"},{"key":"10.1016\/S0927-0507(06)14003-7_bib041","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0166-218X(99)00219-X","article-title":"The train marshalling problem","volume":"103","author":"Dahlhaus","year":"2000","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0927-0507(06)14003-7_bib042","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/S0377-2217(98)00299-9","article-title":"k l-list \u03c4 colouring of graphs","volume":"106","author":"De Luca Cardillo","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib043","first-page":"35","article-title":"Time constrained routing and scheduling","volume":"vol. 8","author":"Desrosiers","year":"1995"},{"key":"10.1016\/S0927-0507(06)14003-7_bib044","series-title":"Computer-Aided Transit Scheduling","volume":"vol. 386","year":"1992"},{"key":"10.1016\/S0927-0507(06)14003-7_bib045","unstructured":"Dienst, H. (1978). Linienplanung in Spurgef\u00fchrten Personenverkehr mit Hilfe eines Heuristischen Verfahrens, PhD thesis, TU Braunschweig (in German)"},{"key":"10.1016\/S0927-0507(06)14003-7_bib046","series-title":"Proceedings of ATMOS Workshop 2003","first-page":"16","article-title":"A graph theoretical approach to the shunting problem","volume":"vol. 92","author":"Di Stefano","year":"2004"},{"key":"10.1016\/S0927-0507(06)14003-7_bib047","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1016019314196","article-title":"An integrated optimization model for train crew management","volume":"108","author":"Ernst","year":"2001","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib048","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(03)00095-X","article-title":"Staff scheduling and rostering: A review of applications, methods and models","volume":"153","author":"Ernst","year":"2004","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib049","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/B:ANOR.0000019087.46656.e2","article-title":"Annotated bibliography of personnel scheduling and rostering","volume":"127","author":"Ernst","year":"2004","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib050","doi-asserted-by":"crossref","first-page":"1281","DOI":"10.1016\/j.ejor.2005.03.032","article-title":"A rolling stock circulation model for combining and splitting of passenger trains","volume":"174","author":"Fioole","year":"2006","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib051","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1287\/mnsc.36.6.674","article-title":"Optimal solutions of set covering\/partitioning problems using dual heuristics","volume":"36","author":"Fisher","year":"1990","journal-title":"Management Science"},{"key":"10.1016\/S0927-0507(06)14003-7_bib052","series-title":"Computer-Aided Transit Scheduling","first-page":"137","article-title":"Experiences with a flexible driver scheduler","volume":"vol. 505","author":"Fores","year":"2001"},{"key":"10.1016\/S0927-0507(06)14003-7_bib053","series-title":"Computer-Aided Transit Scheduling","first-page":"153","article-title":"Scheduling train crews: A case study for the Dutch railways","volume":"vol. 505","author":"Freling","year":"2001"},{"key":"10.1016\/S0927-0507(06)14003-7_bib054","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1023\/B:ANOR.0000019090.39650.32","article-title":"A decision support system for crew planning in passenger transportation using a flexible branch-and-price algorithm","volume":"127","author":"Freling","year":"2004","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib055","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1287\/trsc.1030.0076","article-title":"Shunting of passenger train units in a railway station","volume":"39","author":"Freling","year":"2005","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14003-7_bib056","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1287\/trsc.35.3.322.10151","article-title":"Dispatching buses in parking depots","volume":"35","author":"Gallo","year":"2001","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14003-7_bib057","series-title":"Operations Research in Airline Industry","first-page":"124","article-title":"A method for optimally solving the rostering problem","author":"Gamache","year":"1998"},{"key":"10.1016\/S0927-0507(06)14003-7_bib058","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1287\/opre.47.2.247","article-title":"A column generation approach for large scale aircrew rostering problems","volume":"47","author":"Gamache","year":"1999","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib059","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1287\/trsc.1030.0051","article-title":"A branch-and-cut approach for solving railway line-planning problems","volume":"38","author":"Goossens","year":"2004","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14003-7_bib060","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/j.ejor.2004.04.036","article-title":"On solving multi-type railway line planning problems","volume":"168","author":"Goossens","year":"2005","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib061","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1287\/trsc.1050.0139","article-title":"Dispatching buses in a depot using block patterns","volume":"40","author":"Hamdouni","year":"2006","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14003-7_bib062","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/S0377-2217(99)00383-5","article-title":"Fuzzy dispatching model and genetic algorithms for railyard operations","volume":"124","author":"He","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib063","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1009672832658","article-title":"Heuristic techniques for single line train scheduling","volume":"3","author":"Higgings","year":"1997","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0927-0507(06)14003-7_bib064","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1111\/j.1467-9574.2005.00303.x","article-title":"Operations research in passenger railway transportation","volume":"59","author":"Huisman","year":"2005","journal-title":"Statistica Neerlandica"},{"key":"10.1016\/S0927-0507(06)14003-7_bib065","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1002\/1520-6750(199510)42:7<1129::AID-NAV3220420711>3.0.CO;2-M","article-title":"A local search heuristic for large set-covering problems","volume":"52","author":"Jacobs","year":"1995","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0927-0507(06)14003-7_bib066","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1287\/trsc.25.1.46","article-title":"Tactical scheduling of rail operations: The SCAN I system","volume":"25","author":"Jovanovic","year":"1991","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14003-7_bib067","series-title":"Computer-Aided Transit Scheduling","first-page":"181","article-title":"Crew scheduling for the Netherlands railways destination: Customer","volume":"vol. 505","author":"Kroon","year":"2001"},{"key":"10.1016\/S0927-0507(06)14003-7_bib068","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1287\/trsc.37.2.198.15247","article-title":"A variable trip time model for cyclic railway timetabling","volume":"37","author":"Kroon","year":"2003","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14003-7_bib069","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/S0377-2217(95)00342-8","article-title":"Routing trains through railway stations: Complexity issues","volume":"98","author":"Kroon","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib070","unstructured":"Kroon, L.G., Dekker, R., Vromans, M.J.C.M. (2005). Cyclic railway timetabling: A stochastic optimization approach. Technical Report ERS-2005-051-LIS, Erasmus University Rotterdam"},{"key":"10.1016\/S0927-0507(06)14003-7_bib071","series-title":"Computer-Aided Transit Scheduling","first-page":"129","article-title":"Producing train driver schedules under different operating strategies","volume":"vol. 471","author":"Kwan","year":"2001"},{"key":"10.1016\/S0927-0507(06)14003-7_bib072","unstructured":"Lindner, T. (2000). Train schedule optimization in public rail transport. PhD thesis, TU Braunschweig"},{"key":"10.1016\/S0927-0507(06)14003-7_bib073","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1016\/S0191-2615(01)00027-3","article-title":"Operational car assignment at VIA rail Canada","volume":"36","author":"Lingaya","year":"2002","journal-title":"Transportation Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib074","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0377-2217(94)90401-4","article-title":"A surrogate heuristic for set covering problems","volume":"79","author":"Lorena","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib075","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1287\/trsc.1050.0116","article-title":"Maintenance routing for train units: The transition model","volume":"39","author":"Mar\u00f3ti","year":"2005","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14003-7_bib076","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1016\/j.cor.2005.05.026","article-title":"Maintenance routing for train units: The scenario model","volume":"34","author":"Mar\u00f3ti","year":"2007","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib077","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0957-4174(92)90014-J","article-title":"Scheduling and managing crew in the Portuguese railways","volume":"5","author":"Morgado","year":"1992","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/S0927-0507(06)14003-7_bib078","unstructured":"Nachtigall, K. (1999). Periodic network optimization and fixed interval timetables. Habilitation thesis, Deutsches Zentrum f\u00fcr Luft-und Raumfahrt, Braunschweig"},{"key":"10.1016\/S0927-0507(06)14003-7_bib079","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1016\/0305-0548(95)00032-1","article-title":"A genetic algorithm approach to periodic railway synchronization","volume":"23","author":"Nachtigall","year":"1996","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib080","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/0191-2615(96)00005-7","article-title":"A constraint generation algorithm for the construction of periodic railway timetables","volume":"30","author":"Odijk","year":"1996","journal-title":"Transportation Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib081","unstructured":"Oliveira, E., Smith, B.M. (2000). A job-shop scheduling model for the single-track railway scheduling problem. School of Computing Research Report 2000.21, University of Leeds"},{"key":"10.1016\/S0927-0507(06)14003-7_bib082","unstructured":"Oltrogge, C. (1994). Linienplanung f\u00fcr Mehrstufige Bedienungssysteme in \u00d6ffentlichen Personenverkehr. PhD thesis, TU Braunschweig (in German)"},{"key":"10.1016\/S0927-0507(06)14003-7_bib083","unstructured":"Peeters, L.W.P. (2003). Cyclic railway timetable optimization. PhD thesis, Erasmus University Rotterdam"},{"key":"10.1016\/S0927-0507(06)14003-7_bib084","unstructured":"Peeters, M., Kroon, L.G. (2003). Circulation of railway rolling stock: A branch-and-price approach. Computers & Operations Research, in press"},{"key":"10.1016\/S0927-0507(06)14003-7_bib085","series-title":"Computer Scheduling of Public Transport 2","year":"1985"},{"key":"10.1016\/S0927-0507(06)14003-7_bib086","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1057\/jors.1992.72","article-title":"The solution of massive generalized set partitioning problems in aircrew rostering","volume":"43","author":"Ryan","year":"1992","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0927-0507(06)14003-7_bib087","unstructured":"Scholl, S. (2005). Customer-oriented line planning. PhD thesis, University of Kaiserslautern"},{"key":"10.1016\/S0927-0507(06)14003-7_bib088","first-page":"205","article-title":"Minimum circulation of railway stock","volume":"6","author":"Schrijver","year":"1993","journal-title":"CWI Quarterly"},{"key":"10.1016\/S0927-0507(06)14003-7_bib089","unstructured":"Schrijver, A. (2003). Rangeren op Opstelsporen. Technical report, CWI (in Dutch)"},{"key":"10.1016\/S0927-0507(06)14003-7_bib090","unstructured":"Schrijver, A., Steenbeek, A. (1994). Dienstregelingontwikkeling voor Railned. Technical report, CWI (in Dutch)"},{"key":"10.1016\/S0927-0507(06)14003-7_bib091","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1137\/0402049","article-title":"A mathematical model for periodic event scheduling problems","volume":"2","author":"Serafini","year":"1989","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"10.1016\/S0927-0507(06)14003-7_bib092","series-title":"Operation Research'72","first-page":"343","article-title":"Optimal train scheduling on a single track railway","author":"Szpigel","year":"1973"},{"key":"10.1016\/S0927-0507(06)14003-7_bib093","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1137\/1024063","article-title":"On manpower scheduling algorithms","volume":"24","author":"Tien","year":"1982","journal-title":"SIAM Review"},{"key":"10.1016\/S0927-0507(06)14003-7_bib094","series-title":"Computers in Railways VII","first-page":"437","article-title":"Depot shunting scheduling using combined genetic algorithms and PERT","volume":"vol. 7","author":"Tomii","year":"2000"},{"key":"10.1016\/S0927-0507(06)14003-7_bib095","first-page":"790","article-title":"Shunting scheduling problem at railway stations","volume":"vol. 1611","author":"Tomii","year":"1999"},{"key":"10.1016\/S0927-0507(06)14003-7_bib096","unstructured":"van den Broek, J.J.J. (2002). Toets op Inplanbaarheid van Rangeerbewegingen. MSc thesis, Eindhoven University of Technology (in Dutch)"},{"key":"10.1016\/S0927-0507(06)14003-7_bib097","unstructured":"van't Woudt, C. (2001). Shunting of passenger train units. MSc thesis, Erasmus University Rotterdam"},{"key":"10.1016\/S0927-0507(06)14003-7_bib098","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF02099703","article-title":"An algorithm for large scale 0-1 integer programming with application to airline crew scheduling","volume":"57","author":"Wedelin","year":"1995","journal-title":"Annals of Operational Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib099","series-title":"Computer-Aided Transit Scheduling","volume":"vol. 471","year":"1999"},{"key":"10.1016\/S0927-0507(06)14003-7_bib100","unstructured":"Winter, T. (1999). Online and real-time dispatching problems. PhD thesis, TU Braunschweig"},{"key":"10.1016\/S0927-0507(06)14003-7_bib101","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1023\/A:1018907720194","article-title":"Real-time dispatch of trams in storage yards","volume":"96","author":"Winter","year":"2000","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib102","unstructured":"Wise, T.H. (1995). Column generation and polyhedral combinatorics for airline crew scheduling. PhD thesis, Cornell University"},{"key":"10.1016\/S0927-0507(06)14003-7_bib103","series-title":"Computer Scheduling of Public Transport","year":"1981"},{"key":"10.1016\/S0927-0507(06)14003-7_bib104","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1016\/j.ejor.2004.10.018","article-title":"A 3-flip neighborhood local search for the set covering problem","volume":"172","author":"Yagiura","year":"2006","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14003-7_bib105","unstructured":"Zwaneveld, P.J. (1997). Railway planning and allocation of passenger lines. PhD thesis, Rotterdam School of Management"},{"key":"10.1016\/S0927-0507(06)14003-7_bib106","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1287\/trsc.30.3.181","article-title":"Routing trains through railway stations: Model formulation and algorithms","volume":"30","author":"Zwaneveld","year":"1996","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14003-7_bib107","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/S0377-2217(00)00087-4","article-title":"Routing trains through a railway station based on a node packing model","volume":"128","author":"Zwaneveld","year":"2001","journal-title":"European Journal of Operational Research"}],"container-title":["Handbooks in Operations Research and Management Science","Transportation"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T20:51:50Z","timestamp":1683665510000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0927050706140037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9780444513465"],"references-count":107,"URL":"https:\/\/doi.org\/10.1016\/s0927-0507(06)14003-7","relation":{},"ISSN":["0927-0507"],"issn-type":[{"value":"0927-0507","type":"print"}],"subject":[],"published":{"date-parts":[[2007]]}}}