A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations.
I. Kuban AltinelEngin DurmazNecati ArasKerem Can ÖzkisacikPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- facility location problem
- multi source
- multi commodity
- facility location
- demand points
- heuristic solution
- transportation costs
- optimal location
- location information
- single facility
- data fusion
- approximation algorithms
- single source
- lagrangian relaxation
- information fusion
- multi period
- spatial proximity
- vehicle routing problem with stochastic demands
- probabilistic model
- integer programming
- optimal solution
- multiple sources
- network design
- search algorithm
- dynamic programming
- electronic commerce
- bayesian networks
- geographical locations
- travel distance
- max min
- simulated annealing
- resource allocation
- movement patterns
- np hard
- limited capacity
- knapsack problem
- location problems
- scheduling problem
- data sources
- mixed integer programming
- lower bound
- branch and bound
- lower and upper bounds
- feasible solution
- community detection