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: | M. Hakan Akyüz |
---|---|
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 |
Similar Items
-
A perturbation-based heuristic for the capacitated multisource weber problem
by: Zainuddin, Zaitul Marlizawati, et al.
Published: (2007) -
A MULTI-EXCHANGE HEURISTIC FOR THE SINGLE SOURCE CAPACITATED FACILITY LOCATION PROBLEM
by: Ahuja, R.K., et al.
Published: (2003) -
Approximate solution algorithm for multi-parametric non-convex programming problems with polyhedral constraints
by: Abay Molla Kassa, et al.
Published: (2014-07-01) -
A guided reactive GRASP for the capacitated multi-source Weber problem
by: Luis, Martino, et al.
Published: (2011) -
Polyhedral approximation in mixed-integer convex optimization
by: Yamangil, Emre, et al.
Published: (2018)