LEADER 03434oam 2200493 450 001 9910300159503321 005 20190911103512.0 010 $a1-4614-9566-0 024 7 $a10.1007/978-1-4614-9566-6 035 $a(OCoLC)869214288 035 $a(MiFhGG)GVRL6XTM 035 $a(EXLCZ)993710000000083275 100 $a20131219d2014 uy 0 101 0 $aeng 135 $aurun|---uuuua 181 $ctxt 182 $cc 183 $acr 200 10$aIntegrating routing decisions in public transportation problems /$fMarie E. Schmidt 205 $a1st ed. 2014. 210 1$aNew York :$cSpringer,$d2014. 215 $a1 online resource (ix, 227 pages) $cillustrations 225 1 $aSpringer Optimization and Its Applications,$x1931-6828 ;$v89 300 $a"ISSN: 1931-6828." 300 $a"ISSN: 1931-6836 (electronic)." 311 $a1-4614-9565-2 320 $aIncludes bibliographical references and index. 327 $a1. Introduction -- 2. Line Planning -- 3. Timetabling -- 4. Delay Management -- 5. An Iterative Solution Approach for General Network Problems with Routing -- 6. Conclusions and Outlook -- Frequently Used Notation -- References -- Index. 330 $aThis book treats three planning problems arising in public railway transportation planning: line planning, timetabling, and delay management, with the objective to minimize passengers? travel time. While many optimization approaches simplify these problems by assuming that passengers? route choice is independent of the solution, this book focuses on models which take into account that passengers will adapt their travel route to the implemented planning solution. That is, a planning solution and passengers? routes are determined and evaluated simultaneously. This work is technically deep, with insightful findings regarding complexity and algorithmic approaches to public transportation problems with integrated passenger routing. It is intended for researchers in the fields of mathematics, computer science, or operations research, working in the field of public transportation from an optimization standpoint. It is also ideal for students who want to gain intuition and experience in doing complexity proofs and designing polynomial-time algorithms for network problems. The book models line planning, timetabling, and delay management as combined design and routing problems on networks. In a complexity analysis, the border between NP-hard and polynomially solvable problems is illustrated. Based on that, the insights gained are used to develop solution approaches for the considered problems. Besides integer programming formulations, a heuristic method iterating planning and routing steps is proposed to solve the problems. 410 0$aSpringer optimization and its applications ;$vvolume 89. 606 $aTransportation$xMathematical models 606 $aTransportation$xPlanning$xMathematical models 606 $aMathematical optimization 615 0$aTransportation$xMathematical models. 615 0$aTransportation$xPlanning$xMathematical models. 615 0$aMathematical optimization. 676 $a380.5068 700 $aSchmidt$b Marie E$4aut$4http://id.loc.gov/vocabulary/relators/aut$0721711 801 0$bMiFhGG 801 1$bMiFhGG 906 $aBOOK 912 $a9910300159503321 996 $aIntegrating routing decisions in public transport$92983436 997 $aUNINA