Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): Empirical investigation for assessing relative strengths and computational effort

被引:16
作者
Sharma, R. R. K. [1 ]
Berry, V. [1 ]
机构
[1] Indian Inst Technol, Dept Ind & Management Engn, Kanpur 208016, Uttar Pradesh, India
关键词
location; transportation; distribution;
D O I
10.1016/j.ejor.2005.11.028
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In literature, single/multistage warehouse location problems have been attempted by Geoffrion and Graves [A.M. Geoffrion, G.W. Graves, Multicommodity distribution system design by Benders decomposition, Management Science 2 (1974) 82-114] and Sharma [R.R.K. Sharma, Modeling a fertilizer distribution system, European Journal of Operational Research 51 (1991) 24-34] among others and they have given completely different formulations. We use the formulation style given by Sharma and Sharma [R.R.K. Sharma, K.D. Sharma, A new dual based procedure for the transportation problem, European Journal of Operational Research 122 (3) (2000) 96-109] to develop variety of constraints that link real and 0-1 integer variables; thus developing many formulations of single stage capacitated warehouse location problem (SSCWLP). We relax the integer constraints on 0-1 variables to obtain their relaxations. Later we conduct an empirical investigation to find that there exist relaxations which give better bounds than the `strong' relaxation of SSCWLP. We also find that SSCWLP when formulated using the style due to Sharma [R.R.K. Sharma, Modeling a fertilizer distribution system, European Journal of Operational Research 51 (1991) 24-34] takes significantly less computational time for optimal solution compared to the time taken to reach optimality for the SSCWLP problems when formulated using the style due to Geoffrion and Graves [A.M. Geoffrion, G.W. Graves, Multicommodity distribution system design by Benders decomposition, Management Science 2 (1974) 82-114]. Finally we conducted an experimental investigation on 100 problems of SSCWLP problems each of sizes 25 x 25 x 25, 50 x 50 x 50 and 100 x 100 x 100 and this establishes that the effectiveness of 'capacity' constraints proposed in this paper is particularly strong. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码:803 / 812
页数:10
相关论文
共 25 条
[1]   EFFICIENT BRANCH AND BOUND ALGORITHM FOR CAPACITATED WAREHOUSE LOCATION PROBLEM [J].
AKINC, U ;
KHUMAWALA, BM .
MANAGEMENT SCIENCE, 1977, 23 (06) :585-594
[2]   EXTENSIONS TO A LAGRANGEAN RELAXATION APPROACH FOR THE CAPACITATED WAREHOUSE LOCATION PROBLEM [J].
CHRISTOFIDES, N ;
BEASLEY, JE .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1983, 12 (01) :19-28
[3]   LOCATION OF BANK ACCOUNTS TO OPTIMIZE FLOAT - ANALYTIC STUDY OF EXACT AND APPROXIMATE ALGORITHMS [J].
CORNUEJOLS, G ;
FISHER, ML ;
NEMHAUSER, GL .
MANAGEMENT SCIENCE, 1977, 23 (08) :789-810
[4]   A COMPARISON OF HEURISTICS AND RELAXATIONS FOR THE CAPACITATED PLANT LOCATION PROBLEM [J].
CORNUEJOLS, G ;
SRIDHARAN, R ;
THIZY, JM .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 50 (03) :280-297
[5]  
DAVIS PR, 1969, NAVAL RES LOGISTIC Q, V16, P47
[6]   ADD-HEURISTICS STARTING PROCEDURES FOR CAPACITATED PLANT LOCATION MODELS [J].
DOMSCHKE, W ;
DREXL, A .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 21 (01) :47-53
[7]  
Ellwein LB., 1971, AIIE T, V3, P290, DOI 10.1080/05695557108974818
[8]   DUAL-BASED PROCEDURE FOR UNCAPACITATED FACILITY LOCATION [J].
ERLENKOTTER, D .
OPERATIONS RESEARCH, 1978, 26 (06) :992-1009
[9]  
FELDMAN E, 1966, MANAGE SCI, P123
[10]  
FISHER ML, 1980, MANAGE SCI, V1, P1