Solving the multi-commodity capacitated multi-facility Weber problem using Lagrangean relaxation and a subgradient-like algorithm.
M. Hakan AkyüzTemel ÖncanI. Kuban AltinelPublished in: J. Oper. Res. Soc. (2012)
Keyphrases
- multi commodity
- network flow problem
- max min
- np hard
- facility location
- heuristic solution
- dynamic programming
- cost function
- network flow
- knapsack problem
- network design problem
- minimal cost
- search space
- multi source
- objective function
- convex hull
- particle swarm optimization
- computational complexity
- special case
- evolutionary algorithm
- facility location problem
- optimal solution