Solving a large scale districting problem: a case report
Computers and Operations Research
Computers and Operations Research
An Optimization Based Heuristic for Political Districting
Management Science
Fast Approximation Methods for Sales Force Deployment
Management Science
A simulated annealing approach to police district design
Computers and Operations Research - Location analysis
Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
INFORMS Journal on Computing
Applying genetic algorithms to zone design
Soft Computing - A Fusion of Foundations, Methodologies and Applications
A mini-max spanning forest approach to the political districting problem
International Journal of Systems Science
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
A guided reactive GRASP for the capacitated multi-source Weber problem
Computers and Operations Research
MICAI'11 Proceedings of the 10th international conference on Artificial Intelligence: advances in Soft Computing - Volume Part II
Proceedings of the 14th annual conference on Genetic and evolutionary computation
GRASP strategies for a bi-objective commercial territory design problem
Journal of Heuristics
The synchronized arc and node routing problem: Application to road marking
Computers and Operations Research
Operations management applied to home care services: Analysis of the districting problem
Decision Support Systems
A dual bounding scheme for a territory design problem
Computers and Operations Research
Hi-index | 0.01 |
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.