ADD-HEURISTICS STARTING PROCEDURES FOR CAPACITATED PLANT LOCATION MODELS

被引:27
作者
DOMSCHKE, W
DREXL, A
机构
[1] Hochschule der Bundeswehr, Inst fuer, Unternehmensforschung und, Informatik, Hamburg, West Ger, Hochschule der Bundeswehr, Inst fuer Unternehmensforschung und Informatik, Hamburg, West Ger
关键词
MANAGEMENT SCIENCE - OPERATIONS RESEARCH;
D O I
10.1016/0377-2217(85)90086-4
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper is concerned with heuristics for capacitated plant location models where locations have different capacities. In this case ADD-heuristics normally lead to bad solutions. We present some starting procedures (priority rules) in order to overcome this difficulty. Finally, we report numerical results, including comparisons between ADD-heuristics with starting procedures and DROP-heuristics.
引用
收藏
页码:47 / 53
页数:7
相关论文
共 16 条
[1]  
AHRENS JH, 1977, CODE TRANSPORTATION
[2]   EFFICIENT BRANCH AND BOUND ALGORITHM FOR CAPACITATED WAREHOUSE LOCATION PROBLEM [J].
AKINC, U ;
KHUMAWALA, BM .
MANAGEMENT SCIENCE, 1977, 23 (06) :585-594
[3]   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
[4]  
DOMSCHKE W, 1984, LECTURE NOTES EC MAT
[5]  
DOMSCHKE W, 1981, LOGISTIK TRANSPORT G
[6]  
DOMSCHKE W, 1984, LOGISTIK STANDORTE
[7]  
Feldman E., 1966, MANAGE SCI, V12, P670, DOI DOI 10.1287/MNSC.12.9.670
[8]   LOCATIONAL ANALYSIS [J].
FRANCIS, RL ;
MCGINNIS, LF ;
WHITE, JA .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1983, 12 (03) :220-252
[9]  
GOSCH T, 1982, THESIS HAMBURG
[10]  
HUMMELTENBERG W, 1981, OPTIMIERUNGSMETHODEN