1.

Record Nr.

UNINA9910300159503321

Autore

Schmidt Marie E

Titolo

Integrating routing decisions in public transportation problems / / Marie E. Schmidt

Pubbl/distr/stampa

New York : , : Springer, , 2014

ISBN

1-4614-9566-0

Edizione

[1st ed. 2014.]

Descrizione fisica

1 online resource (ix, 227 pages) : illustrations

Collana

Springer Optimization and Its Applications, , 1931-6828 ; ; 89

Disciplina

380.5068

Soggetti

Transportation - Mathematical models

Transportation - Planning - Mathematical models

Mathematical optimization

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

"ISSN: 1931-6828."

"ISSN: 1931-6836 (electronic)."

Nota di bibliografia

Includes bibliographical references and index.

Nota di contenuto

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.

Sommario/riassunto

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.