EXACT SOLUTION TO A LOCATION PROBLEM WITH STOCHASTIC DEMANDS

被引：98

作者：

LAPORTE, G

LOUVEAUX, FV

VANHAMME, L

机构：

[1] FAC UNIV NOTRE DAME PAIX, FAC SCI ECON & SOCIALES, B-5000 NAMUR, BELGIUM

[2] BEYERS INNOVAT SOFTWARE, B-2130 BRASSCHAAT, BELGIUM

来源：

TRANSPORTATION SCIENCE | 1994年 / 28卷 / 02期

关键词：

D O I：

10.1287/trsc.28.2.95

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper considers a class of Capacitated Facility Location Problems in which customer demands are stochastic. The problem is formulated as a stochastic integer linear program, with first stage binary variables and second stage continuous variables. It is solved to optimality by means of a branch and cut method. Computational results are reported for problems involving up to 40 customers and 10 potential facility locations.

引用

页码：95 / 103

页数：9

共 33 条

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