<電子ブック>
Integrating Routing Decisions in Public Transportation Problems / by Marie E. Schmidt
(Springer Optimization and Its Applications. ISSN:19316836 ; 89)
版 | 1st ed. 2014. |
---|---|
出版者 | (New York, NY : Springer New York : Imprint: Springer) |
出版年 | 2014 |
本文言語 | 英語 |
大きさ | IX, 227 p. 23 illus : online resource |
著者標目 | *Schmidt, Marie E author SpringerLink (Online service) |
件 名 | LCSH:Operations research LCSH:Management science LCSH:Civil engineering LCSH:Algorithms FREE:Operations Research, Management Science FREE:Civil Engineering FREE:Algorithms |
一般注記 | 1. 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 This 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 HTTP:URL=https://doi.org/10.1007/978-1-4614-9566-6 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
Springer eBooks | 9781461495666 |
|
電子リソース |
|
EB00227205 |
書誌詳細を非表示
データ種別 | 電子ブック |
---|---|
分 類 | LCC:T57.6-57.97 LCC:T55.4-60.8 DC23:003 |
書誌ID | 4000117840 |
ISBN | 9781461495666 |
類似資料
この資料の利用統計
このページへのアクセス回数:4回
※2017年9月4日以降