Formulations and relaxations for a multi-echelon capacitated location-distribution problem
We consider a multi-echelon location-distribution problem arising from an actual application in fast delivery service. We present and compare two formulations for this problem: an arc-based model and a path-based model. We show that the linear programming (LP) relaxation of the path-based model provides a better bound than the LP relaxation of the arc-based model, We also compare the so-called binary relaxations of the models, which are obtained by relaxing the integrality constraints for the general integer variables, but not for the 0-1 variables. We show that the binary relaxations of the two models always provide the same bound. but that the path-based binary relaxation appears preferable from a computational point of view, since it can he reformulated as an equivalent simple plant location problem (SPIT), for which several efficient algorithms exist. We also show that the LP relaxation of this SPLP reformulation provides a better bound than the LP relaxation of the path-based model. (c) 2008 Elsevier Ltd. All rights reserved.
formulations relaxations multi-echelon location-distribution problem simple plant location problem