A set partitioning heuristic for local drayage routing under time-dependent port delay.
Rajeev NamboothiriAlan L. EreraPublished in: SMC (4) (2004)
Keyphrases
- set partitioning
- routing problem
- column generation
- travel time
- dantzig wolfe decomposition
- mixed integer programming
- linear programming relaxation
- integer programming
- vehicle routing problem with time windows
- optimal solution
- lagrangian relaxation
- vehicle routing
- routing algorithm
- tabu search
- vehicle routing problem
- combinatorial optimization
- integer program
- simulated annealing
- branch and bound
- search procedure
- constraint satisfaction
- dynamic programming
- shortest path
- linear programming
- search algorithm
- global optimization
- lower bound
- np hard
- valid inequalities
- cutting plane
- exact algorithms
- heuristic methods
- routing protocol
- knapsack problem
- search strategies