Research output: Contribution to conference - Without ISBN/ISSN › Abstract
Research output: Contribution to conference - Without ISBN/ISSN › Abstract
}
TY - CONF
T1 - Computing bounds for the capacitated multifacility Weber problem by branch and price and Lagrangean relaxation
AU - Boyacı, Burak
AU - Altınel, İ. Kuban
AU - Aras, Necati
PY - 2009/7/1
Y1 - 2009/7/1
N2 - The capacitated multi-facility Weber problem is concerned with locating m facilities in the plane, and allocating their capacities to n customers at minimum total cost, which is a non-convex optimization problem and difficult to solve. In this work we relax the capacity constraints and solve the uncapacitated Lagrangean subproblems every step of a subgradient algorithm. Their objectives have facility dependent distance functions, which is different than the usual multifacility Weber problem. We solve them by branch-and-price using column generation with concave minimization pricing.
AB - The capacitated multi-facility Weber problem is concerned with locating m facilities in the plane, and allocating their capacities to n customers at minimum total cost, which is a non-convex optimization problem and difficult to solve. In this work we relax the capacity constraints and solve the uncapacitated Lagrangean subproblems every step of a subgradient algorithm. Their objectives have facility dependent distance functions, which is different than the usual multifacility Weber problem. We solve them by branch-and-price using column generation with concave minimization pricing.
M3 - Abstract
T2 - EURO XXIII
Y2 - 1 July 2009
ER -