Paper Info
Title
The discrete facility location problem with balanced allocation of customers
Abstract
We consider a discrete facility location problem where the difference between the maximum and minimum number of customers allocated to every plant has to be balanced. Two different Integer Programming formulations are built, and several families of valid inequalities for these formulations are developed. Preprocessing techniques which allow to reduce the size of the largest formulation, based on the upper bound obtained by means of an ad hoc heuristic solution, are also incorporated. Since the number of available valid inequalities for this formulation is exponential, a branch-and-cut algorithm is designed where the most violated inequalities are separated at every node of the branching tree. Both formulations, with and without the improvements, are tested in a computational framework in order to discriminate the most promising solution methods. Difficult instances with up to 50 potential plants and 100 customers, and largest easy instances, can be solved in one CPU hour.
Year
DOI
Venue
2011
10.1016/j.ejor.2010.10.012
European Journal of Operational Research
Keywords
Field
DocType
Allocation,Facility location,Integer Programming,Branch-and-cut
Heuristic,Mathematical optimization,Tree (graph theory),Exponential function,Upper and lower bounds,Branch and cut,Algorithm,Facility location problem,Resource allocation,Integer programming,Mathematics
Journal
Volume
Issue
ISSN
210
1
0377-2217
Citations 
PageRank 
References 
16
0.79
7
Authors
1
Name
Order
Citations
PageRank
Alfredo Marín145332.98