A column-generation-based matheuristic for periodic train timetabling with integrated passenger routing.
Bernardo Martin-IradiStefan RopkePublished in: CoRR (2019)
Keyphrases
- column generation
- constraint programming
- branch and bound
- linear programming
- set partitioning
- vehicle routing
- integer programming
- mixed integer programming
- linear program
- integer linear programming
- cutting plane
- integer program
- optimal solution
- linear programming problems
- vehicle routing problem with time windows
- routing problem
- lagrangian relaxation
- set covering
- lagrangean relaxation
- exact solution
- shortest path
- timetabling problem
- dantzig wolfe decomposition
- constraint satisfaction
- valid inequalities
- constraint satisfaction problems
- lower bound
- linear programming relaxation
- routing algorithm
- ad hoc networks
- cutting plane algorithm
- upper bound
- np hard