Integrating routing decisions in public transportation problems (Q384816)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6234395
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Integrating routing decisions in public transportation problems |
scientific article; zbMATH DE number 6234395 |
Statements
Integrating routing decisions in public transportation problems (English)
0 references
28 November 2013
0 references
The authors study the integrating of the routing decisions in the problems arising in public transportation. They focus on three types of problems: line planinng, timetabling and delay management. In each case a model formulation is presented, the computational complexity is studied (in particular, NP-hardness is proved) and the algorithms are provided, in particular polynomial-time algorithms for special cases and heuristics for the general cases. One chapter has been dedicated to each of three problems. In addition, in the last chapter the authors study an iterative approach for general networks problems with routing. The book is technically deep, the models and algorithms are accompanied with the formal analysis of the problems under discussion.
0 references
routing decisions
0 references
network optimization
0 references
combinatorial optimization
0 references
integer programming
0 references
0.8529730439186096
0 references
0.8146719336509705
0 references
0.8042042255401611
0 references
0.8006465435028076
0 references
