A reactive GRASP for a commercial territory design problem with multiple balancing requirements

被引:89
作者
Rios-Mercado, Roger Z. [1 ]
Fernandez, Elena [2 ]
机构
[1] Univ Autonoma Nuevo Leon, Grad Program Syst Engn, San Nicolas De Los Garza 66450, NL, Mexico
[2] Univ Politecn Cataluna, Dept Stat & Operat Res, ES-08034 Barcelona, Spain
关键词
Combinatorial optimization; Territory design; Multiple balancing requirements; Metaheuristics; Reactive GRASP; DISTRICTING PROBLEM;
D O I
10.1016/j.cor.2007.10.024
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper we present a reactive GRASP approach to a commercial territory design problem motivated by a rea I-world application in a beverage distribution firm. The mathematical framework includes. as planning criteria, minimizing a measure of territory dispersion. balancing the different node activity measures among territories and territory Contiguity. The proposed GRASP approach incorporates several features such as reactivity, by allowing self-adjustment of the restricted candidate list quality parameter, and filtering, which avoids executing the local search phase in unpromising bad solutions generated by the construction phase. The algorithm has been tested in several data sets. The results show the effectiveness of the proposed approach. It was observed that the reactivity and the filtering proved very useful in terms of feasibility with respect to the balancing constraints, and find more robust solutions when tested over the basic GRASP. The local search scheme proved to be very effective as well. Moreover, the proposed approach obtained solutions of much better quality (in terms of both its dispersion measure and its feasibility with respect to the balancing constraints) than those found by the firm method in relatively fast computation times. (C) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码:755 / 776
页数:22
相关论文
共 21 条
[1]   Applying genetic algorithms to zone design [J].
Baçao, F ;
Lobo, V ;
Painho, M .
SOFT COMPUTING, 2005, 9 (05) :341-348
[2]   Solving a home-care districting problem in an urban setting [J].
Blais, M ;
Lapierre, SD ;
Laporte, G .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2003, 54 (11) :1141-1147
[3]   A tabu search heuristic and adaptive memory procedure for political districting [J].
Bozkaya, B ;
Erkut, E ;
Laporte, G .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 144 (01) :12-26
[4]   School redistricting: embedding GIS tools with integer programming [J].
Caro, F ;
Shirabe, T ;
Guignard, M ;
Weintraub, A .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2004, 55 (08) :836-849
[5]   A simulated annealing approach to police district design [J].
D'Amico, SJ ;
Wang, SJ ;
Batta, R ;
Rump, CM .
COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (06) :667-684
[6]  
Delmaire H, 1999, INFOR, V37, P194
[7]   Fast approximation methods for sales force deployment [J].
Drexl, A ;
Haase, K .
MANAGEMENT SCIENCE, 1999, 45 (10) :1307-1323
[8]   GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES [J].
FEO, TA ;
RESENDE, MGC .
JOURNAL OF GLOBAL OPTIMIZATION, 1995, 6 (02) :109-133
[9]   SOLVING A LARGE-SCALE DISTRICTING PROBLEM - A CASE-REPORT [J].
FLEISCHMANN, B ;
PARASCHIS, JN .
COMPUTERS & OPERATIONS RESEARCH, 1988, 15 (06) :521-533
[10]  
GARFINKEL RS, 1970, MANAGE SCI B-APPL, V16, pB495