Logic Cuts Generation in a Branch and Cut Framework for Location Problems.pdfVIP

Logic Cuts Generation in a Branch and Cut Framework for Location Problems Mara A. Osorio Lama Rosalba Mujica Garca School of Computer Science Autonomous University of Puebla, Puebla 72560 Mexico Abstract In the warehouse location problem, the objective is to choose a set of warehouses of limited capacity so as to serve a set of demand points while minimizing xed and transport costs. In particular, it includes a knapsack constraint that can be useful for generating simple logical constraints named logic cuts. The logic cuts can be generated in linear time and can be implemented in a branch and cut framework for accelerating the solution of the capacitated warehouse location problems with xed costs. We use the Hooker algorithm for generating all contiguous t-cuts in every node of the tree and report the experimental results. Keywords: Warehouse Location Problems, Knapsack Constraint, Logic Cuts. 1 Introduction Capacitated warehouse location models arise in many practical applications. The MILP formulation includes a model that use binary variables to denote the existence of some of the total sources that accomplish the total demand and minimize the total cost. In this case, the cost includes the xed existence cost for every warehouse and the continuous transportation cost for every combination between the warehouse sources and the demand points. Unfortunately, the solution of these models can be quite expensive with the LP-based branch and bound methods that are implemented in many commercial and academic computer codes (e.g. OSL, MPSX, SCICONIC, ZOOM, LINDO, APEX, CPLEX, etc.) This has motivated in recent years substantial development of reformulation techniques and cutting plane algorithms, as for instance in the work by Sherali and Adams and Balas et al. [2]. However, these new developments have concentrated on numerical aspects, mainly on convexication with branch and bound. 155 156 Lama, M. O. and Garca, R. M.  Logic Cuts Generation in a Branch ... A