The return plant location problem: Modelling and resolution

被引：61

作者：

Marin, A ^{[1
]}

Pelegrin, B ^{[1
]}

机构：

[1] Univ Murcia, Fac Matemat, Dept Estadist & Invest Operat, E-30071 Murcia, Spain

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1998年 / 104卷 / 02期

关键词：

facility location; Lagrangian decomposition; combinatorial analysis; transportation;

D O I：

10.1016/S0377-2217(97)00192-6

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

The formulation and analysis of a new plant location problem is presented. The problem studied, herein referred to as the Return Plant Location Problem (RPLP), is that of cost minimization in a system of suppliers and customers in which there exists a return product from each customer. Lagrangian decomposition based heuristic and exact solution methods are given. The methods are applied to test problems with different structures and compared with the classical subgradient optimization approach. (C) 1998 Elsevier Science B.V.

引用

页码：375 / 392

页数：18

共 13 条

[1] EFFICIENT BRANCH AND BOUND ALGORITHM FOR CAPACITATED WAREHOUSE LOCATION PROBLEM [J].

AKINC, U ;

KHUMAWALA, BM .

MANAGEMENT SCIENCE, 1977, 23 (06) :585-594

[2] 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

[3] IMPROVED LAGRANGEAN DECOMPOSITION - AN APPLICATION TO THE GENERALIZED ASSIGNMENT PROBLEM [J].

BARCIA, P ;

JORNSTEN, K .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 46 (01) :84-92

[4]

Bazaraa MS., 2008, LINEAR PROGRAMMING N

[5]

BEASLEY JE, 1989, EUR J OPL RES, V43, P197

[6] LAGRANGEAN DECOMPOSITION - A MODEL YIELDING STRONGER LAGRANGEAN BOUNDS [J].

GUIGNARD, M ;

KIM, S .

MATHEMATICAL PROGRAMMING, 1987, 39 (02) :215-228

[7]

GUIGNARD M, 1987, RAIRO-RECH OPER, V21, P307

[8] AN APPLICATION OF LAGRANGEAN DECOMPOSITION TO THE RESOURCE-CONSTRAINED MINIMUM WEIGHTED ARBORESCENCE PROBLEM [J].

GUIGNARD, M ;

ROSENWEIN, MB .

NETWORKS, 1990, 20 (03) :345-359

[9] AN APPLICATION-ORIENTED GUIDE FOR DESIGNING LAGRANGEAN DUAL ASCENT ALGORITHMS [J].

GUIGNARD, M ;

ROSENWEIN, MB .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 43 (02) :197-205

[10]

Held M., 1974, Mathematical Programming, V6, P62, DOI 10.1007/BF01580223

← 1 2 →