A Column Generation-Based Heuristic for the Line Planning Problem with Service Levels (Short Paper).
Hector GattJean-Marie FrecheFabien LehuédéThomas G. YeungPublished in: ATMOS (2021)
Keyphrases
- column generation
- service level
- lagrangean relaxation
- integer linear programming
- optimal solution
- lagrangian relaxation
- mixed integer programming
- set covering
- branch and bound
- grasp with path relinking
- linear programming relaxation
- linear program
- total cost
- linear programming
- dantzig wolfe
- vehicle routing
- set partitioning
- integer programming
- integer program
- vehicle routing problem with time windows
- exact solution
- lead time
- constraint programming
- cutting plane
- supply chain
- dantzig wolfe decomposition
- search algorithm
- production planning
- call center
- objective function
- planning horizon
- exact algorithms
- np hard
- heuristic search
- combinatorial optimization
- beam search
- lower bound
- knapsack problem
- constraint satisfaction
- timetabling problem
- upper bound
- heuristic methods
- search space
- travel time
- inventory policy
- feasible solution
- service requirements