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

In this paper we present a reactive GRASP approach to a commercial territory design problem motivated by a real-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.

[1]  S. L. HAKIMIt AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .

[2]  Rajan Batta,et al.  A simulated annealing approach to police district design , 2002, Comput. Oper. Res..

[3]  Fernando Bação,et al.  Applying genetic algorithms to zone design , 2005, Soft Comput..

[4]  Mehran Hojati,et al.  Optimal political districting , 1996, Comput. Oper. Res..

[5]  G. Nemhauser,et al.  An Optimization Based Heuristic for Political Districting , 1998 .

[6]  Celso C. Ribeiro,et al.  Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment , 2000, INFORMS J. Comput..

[7]  Gilbert Laporte,et al.  Solving a home-care districting problem in an urban setting , 2003, J. Oper. Res. Soc..

[8]  Luc Muyldermans,et al.  Districting for salt spreading operations , 2002, Eur. J. Oper. Res..

[9]  Felipe Caro,et al.  School redistricting: embedding GIS tools with integer programming , 2004, J. Oper. Res. Soc..

[10]  Andreas Drexl,et al.  Fast Approximation Methods for Sales Force Deployment , 1999 .

[11]  G. Gallego,et al.  How to avoid stockouts when producing several items on a single facility? What to do if you can't? , 1996, Computers & Operations Research.

[12]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[13]  A. Zoltners,et al.  Sales Territory Alignment: A Review and Model , 1983 .

[14]  G. Nemhauser,et al.  Optimal Political Districting by Implicit Enumeration Techniques , 1970 .

[15]  Stefan Nickel,et al.  Towards a unified territorial design approach — Applications, algorithms and GIS integration , 2005 .

[16]  J. Weaver,et al.  Nonpartisan Political Redistricting by Computer , 1965 .

[17]  Hugues Delmaire,et al.  REACTIVE GRASP AND TABU SEARCH BASED HEURISTICS FOR THE SINGLE SOURCE CAPACITATED PLANT LOCATION PROBLEM , 1999 .

[18]  Gilbert Laporte,et al.  A tabu search heuristic and adaptive memory procedure for political districting , 2003, Eur. J. Oper. Res..

[19]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. I: The p-Centers , 1979 .

[20]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[21]  Sidney W. Hess,et al.  Experiences with a Sales Districting Model: Criteria and Implementation , 1971 .

[22]  David B. Weinberger,et al.  Turfing , 1977, Oper. Res..

[23]  Bernhard Fleischmann,et al.  Solving a large scale districting problem: a case report , 1988, Comput. Oper. Res..