Discretization Based Heuristics for the Capacitated Multi-facility Weber Problem with Convex Polyhedral Barriers
The Capacitated Multi-facility Weber Problem addresses optimally locating I capacitated facilities in the plane and satisfying demand of J customers so as to minimize the total transportation cost. It assumes that facilities can be located anywhere on the plane and customers are directly connected t...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Balikesir University
2017-12-01
|
| Series: | An International Journal of Optimization and Control: Theories & Applications |
| Online Access: | http://ijocta.org/index.php/files/article/view/388 |