Abstract
This paper addresses a commercial districting problem arising in the bottled beverage distribution industry. The problem consists of grouping a set of city blocks into territories so as to maximize territory compactness. As planning requirements, the grouping seeks to balance both number of customers and product demand across territories, maintain connectivity of territories, and limit the total cost of routing. A combinatorial optimization model for this problem is introduced. Work on commercial territory design has particularly focused on design decisions. This work is, to the best of our knowledge, the first to address both design and routing decisions simultaneously by considering a budget constraint on the total routing cost in commercial territory design. A greedy randomized adaptive search procedure that incorporates advanced features such as adaptive memory and strategic oscillation is developed. Empirical evidence over a wide set of randomly generated instances based on real-world data show a very positive impact of these advanced components. Solution quality is significantly improved as well.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Applegate, D., Bixby, R.E., Chvátal, V., Cook, W.: TSP Cuts Which Do Not Conform to the Template Paradigm. In: Jünger, M., Naddef, D. (eds.) Computational Combinatorial Optimization. LNCS, vol. 2241, pp. 261–304. Springer, Heidelberg (2001)
Bozkaya, B., Erkut, E., Laporte, G.: A tabu search heuristic and adaptive memory procedure for political districting. European Journal of Operational Research 144(1), 12–26 (2003)
Caro, F., Shirabe, T., Guignard, M., Weintraub, A.: School redistricting: Embedding GIS tools with integer programming. Journal of the Operational Research Society 55(8), 836–849 (2004)
Duque, J.C., Ramos, R., Suriñach, J.: Supervised regionalization methods: A survey. International Regional Science Review 30(3), 195–220 (2007)
Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6(2), 109–133 (1995)
Fernández, E.A., Kalcsics, J., Nickel, S., Ríos-Mercado, R.Z.: A novel maximum dispersion territory design model arising in the implementation of the WEEE-directive. Journal of the Operational Research Society 61(3), 503–514 (2010)
Glover, F., Hao, J.K.: The case for strategic oscillation. Annals of Operations Research 183(1), 163–173 (2011)
Gutin, G., Punnen, A.P. (eds.): The Traveling Salesman Problem and its Variations. Springer, New York (2002)
Haugland, D., Ho, S.C., Laporte, G.: Designing delivery district for the vehicle routing problem with stochastic demands. European Journal of Operational Research 180(3), 997–1010 (2005)
Kalcsics, J., Nickel, S., Schröder, M.: Towards a unified territory design approach: Applications, algorithms, and GIS integration. TOP 13(1), 1–56 (2005)
Ríos-Mercado, R.Z., Fernández, E.A.: A reactive GRASP for a commercial territory design problem with multiple balancing requirements. Computers & Operations Research 36(3), 755–776 (2009)
Salazar-Aguilar, M.A., Ríos-Mercado, R.Z., Cabrera-Ríos, M.: New models for commercial territory design. Networks and Spatial Economics (Forthcoming, 2011) doi: 10.1007/s11067-010-9151-6
Salazar-Aguilar, M.A., Ríos-Mercado, R.Z., González-Velarde, J.L.: GRASP strategies for a bi-objective commercial territory design problem. Journal of Heuristics (Forthcoming, 2011), doi: 10.1007/s10732-011-9160-8
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ríos-Mercado, R.Z., Salazar-Acosta, J.C. (2011). A GRASP with Strategic Oscillation for a Commercial Territory Design Problem with a Routing Budget Constraint. In: Batyrshin, I., Sidorov, G. (eds) Advances in Soft Computing. MICAI 2011. Lecture Notes in Computer Science(), vol 7095. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25330-0_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-25330-0_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25329-4
Online ISBN: 978-3-642-25330-0
eBook Packages: Computer ScienceComputer Science (R0)