A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution

被引:181
作者
Pirkul, H
Jayaraman, V [1 ]
机构
[1] Washington State Univ, Coll Business & Econ, Vancouver, WA 98686 USA
[2] Univ Texas, Sch Management, Richardson, TX USA
关键词
D O I
10.1016/S0305-0548(97)00096-8
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Distribution system design problems commonly occurs in the following form: A number of production plants supply warehouses with multiple products which in turn distribute these products to customer outlets based on their specified demand quantities of the different products. It is required to select the optimum set of plants and warehouses from a potential set and plan production capacities, warehouse capacities and quantities shipped so that the total operating costs of the distribution network are minimized. This paper is a computational study to investigate the value of coordinating production and distribution planning. We present a mixed integer programming formulation for the capacitated plant and warehouse supply chain management problem and propose an efficient heuristic based on Lagrangian relaxation of the problem. (C) 1998 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:869 / 878
页数:10
相关论文
共 22 条
[1]   FACILITY LOCATION MODELS FOR DISTRIBUTION PLANNING [J].
AIKENS, CH .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 22 (03) :263-279
[2]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[3]  
Balinski ML., 1961, NAVAL RES LOG QUART, V8, P41, DOI [DOI 10.1002/NAV.3800080104, 10.1002/nav.3800080104]
[4]   COMPUTATIONAL RESULTS FROM A NEW LAGRANGEAN RELAXATION ALGORITHM FOR THE CAPACITATED PLANT LOCATION PROBLEM [J].
BARCELO, J ;
FERNANDEZ, E ;
JORNSTEN, KO .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 53 (01) :38-45
[5]   A HEURISTIC LAGRANGEAN ALGORITHM FOR THE CAPACITATED PLANT LOCATION PROBLEM [J].
BARCELO, J ;
CASANOVAS, J .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1984, 15 (02) :212-226
[6]   LAGRANGEAN HEURISTICS FOR LOCATION-PROBLEMS [J].
BEASLEY, JE .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1993, 65 (03) :383-399
[7]   A BRANCH-BOUND ALGORITHM FOR PLANT LOCATION [J].
EFROYMSON, MA ;
RAY, TL .
OPERATIONS RESEARCH, 1966, 14 (03) :361-+
[8]   SITE LOCATION VIA MIXED-INTEGER PROGRAMMING [J].
ELSON, DG .
OPERATIONAL RESEARCH QUARTERLY, 1972, 23 (01) :31-&
[9]   MULTICOMMODITY DISTRIBUTION SYSTEM-DESIGN BY BENDERS DECOMPOSITION [J].
GEOFFRION, AM ;
GRAVES, GW .
MANAGEMENT SCIENCE SERIES A-THEORY, 1974, 20 (05) :822-844
[10]   DIRECT DUAL METHOD FOR THE MIXED PLANT LOCATION PROBLEM WITH SOME SIDE CONSTRAINTS [J].
GUIGNARD, M ;
SPIELBERG, K .
MATHEMATICAL PROGRAMMING, 1979, 17 (02) :198-228