Integrating routing decisions in public transportation problems [electronic resource] / Marie E. Schmidt.
2014
HE147.7
Formats
| Format | |
|---|---|
| BibTeX | |
| MARCXML | |
| TextMARC | |
| MARC | |
| DublinCore | |
| EndNote | |
| NLM | |
| RefWorks | |
| RIS |
Cite
Citation
Linked e-resources
Linked Resource
Details
Title
Integrating routing decisions in public transportation problems [electronic resource] / Marie E. Schmidt.
Author
ISBN
9781461495666 electronic book
1461495660 electronic book
9781461495659
1461495660 electronic book
9781461495659
Published
New York : Springer, 2014.
Language
English
Description
1 online resource (ix, 227 pages) : illustrations.
Item Number
10.1007/978-1-4614-9566-6 doi
Call Number
HE147.7
Dewey Decimal Classification
388.015118
Summary
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.
Bibliography, etc. Note
Includes bibliographical references and index.
Access Note
Access limited to authorized users.
Source of Description
Description based on online resource; title from PDF title page (SpringerLink, viewed January 6, 2014).
Series
Springer optimization and its applications ; v.89. 1931-6828
Linked Resources
Record Appears in
Table of Contents
Line Planning
Timetabling
Delay Management
An Iterative Solution Approach for General Network Problems with Routing
Conclusions and Outlook
Frequently Used Notation.
Timetabling
Delay Management
An Iterative Solution Approach for General Network Problems with Routing
Conclusions and Outlook
Frequently Used Notation.