1988 An algorithm for solving large capacitated warehouse location problems教程.pdfVIP

314 European Journal of Operational Research 33 (1988) 314-325 North-Holland An algorithm for solving large capacitated warehouse location problems J.E. B E A S L E Y Department of Management Science, Imperial College, London SW7 2BX, England Abstract: In this paper we present a lower bound for the capacitated warehouse location problem based upon lagrangean relaxation of a mixed-integer formulation of the problem. Feasible solution exclusion constraints are used together with problem reduction tests derived from both the original problem and the lagrangean relaxation. By incorporating the lower bound and the reduction tests into a tree search procedure we are able to solve problems involving up to 500 potential warehouse locations and 1000 customers. Keyword: Location 1. Introduction 1.1. Literature survey The capacitated warehouse location problem In our previous paper [10] we briefly reviewed (henceforth denoted by CWLP) is the problem of the literature relating to CWLP and so, for rea- locating a number of warehouses which have to sons of space, we shall only deal here with papers service a set of customers, at minimum cost, where additional to those discussed in [10]. each customer has an associated demand and there Bartezzaghi, Colorni and Palermo [7] presented are constraints on the total demand that can be a tree search algorithm based upon a lower bound met from a warehouse.