A heuristic approach to the multi-period multi-commodity transportation problem.
Kim-Leng PohK. W. ChooC. G. WongPublished in: J. Oper. Res. Soc. (2005)
Keyphrases
- transportation problem
- multi period
- facility location
- facility location problem
- heuristic solution
- integer programming
- lagrangian relaxation
- production planning
- knapsack problem
- optimal solution
- network design problem
- network design
- planning horizon
- mixed integer programming
- lower bound
- lot sizing
- routing problem
- np hard
- dynamic programming
- total cost
- linear programming
- feasible solution
- search algorithm
- network flow
- column generation
- combinatorial optimization
- constraint programming
- cutting plane
- branch and bound
- production cost
- simulated annealing
- lower and upper bounds
- decision making