کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
480366 | 1446107 | 2011 | 12 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: The discrete facility location problem with balanced allocation of customers The discrete facility location problem with balanced allocation of customers](/preview/png/480366.png)
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.
Journal: European Journal of Operational Research - Volume 210, Issue 1, 1 April 2011, Pages 27–38