Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems.
M. Hakan AkyüzTemel ÖncanI. Kuban AltinelPublished in: Comput. Oper. Res. (2013)
Keyphrases
- beam search
- multi commodity
- heuristic solution
- network flow problem
- facility location
- search methods
- search problems
- branch and bound
- search algorithm
- max min
- network design problem
- heuristic search
- minimum cost
- integer programming
- combinatorial optimization
- metaheuristic
- transportation costs
- lot sizing
- hill climbing
- ranking functions
- orders of magnitude
- special case