A MULTICOMMODITY, MULTIPLANT, CAPACITATED FACILITY LOCATION PROBLEM -FORMULATION AND EFFICIENT HEURISTIC SOLUTION

Citation
H. Pirkul et V. Jayaraman, A MULTICOMMODITY, MULTIPLANT, CAPACITATED FACILITY LOCATION PROBLEM -FORMULATION AND EFFICIENT HEURISTIC SOLUTION, Computers & operations research, 25(10), 1998, pp. 869-878
Citations number
22
Categorie Soggetti
Operatione Research & Management Science","Computer Science Interdisciplinary Applications","Operatione Research & Management Science","Computer Science Interdisciplinary Applications","Engineering, Industrial
ISSN journal
03050548
Volume
25
Issue
10
Year of publication
1998
Pages
869 - 878
Database
ISI
SICI code
0305-0548(1998)25:10<869:AMMCFL>2.0.ZU;2-X
Abstract
Distribution system design problems commonly occurs in the following f orm: A number of production plants supply warehouses with multiple pro ducts which in turn distribute these products to customer outlets base d on their specified demand quantities of the different products. It i s required to select the optimum set of plants and warehouses from a p otential set and plan production capacities, warehouse capacities and quantities shipped so that the total operating costs of the distributi on network are minimized. This paper is a computational study to inves tigate the value of coordinating production and distribution planning. We present a mixed integer programming formulation for the capacitate d plant and warehouse supply chain management problem and propose an e fficient heuristic based on Lagrangian relaxation of the problem. (C) 1998 Elsevier Science Ltd. All rights reserved.