000 03505nam a22005055i 4500
001 978-1-4614-9566-6
003 DE-He213
005 20140220082505.0
007 cr nn 008mamaa
008 140102s2014 xxu| s |||| 0|eng d
020 _a9781461495666
_9978-1-4614-9566-6
024 7 _a10.1007/978-1-4614-9566-6
_2doi
050 4 _aQA402-402.37
050 4 _aT57.6-57.97
072 7 _aKJT
_2bicssc
072 7 _aKJM
_2bicssc
072 7 _aBUS049000
_2bisacsh
072 7 _aBUS042000
_2bisacsh
082 0 4 _a519.6
_223
100 1 _aSchmidt, Marie E.
_eauthor.
245 1 0 _aIntegrating Routing Decisions in Public Transportation Problems
_h[electronic resource] /
_cby Marie E. Schmidt.
264 1 _aNew York, NY :
_bSpringer New York :
_bImprint: Springer,
_c2014.
300 _aIX, 227 p. 23 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSpringer Optimization and Its Applications,
_x1931-6828 ;
_v89
505 0 _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.
520 _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.
650 0 _aMathematics.
650 0 _aComputer software.
650 0 _aCivil engineering.
650 1 4 _aMathematics.
650 2 4 _aOperations Research, Management Science.
650 2 4 _aCivil Engineering.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9781461495659
830 0 _aSpringer Optimization and Its Applications,
_x1931-6828 ;
_v89
856 4 0 _uhttp://dx.doi.org/10.1007/978-1-4614-9566-6
912 _aZDB-2-SMA
999 _c92395
_d92395