A Divide-and-Conquer Approach to Commercial Territory Design

• M. Angélica Salazar-Aguilar ^[3] ; J. Luis González-Velarde ^[1] ; Roger Z. Ríos-Mercado ^[2]
  1. [1] Instituto Tecnológico y de Estudios Superiores de Monterrey

     Instituto Tecnológico y de Estudios Superiores de Monterrey

     México

     
  2. [2] Universidad Autónoma de Nuevo León

     Universidad Autónoma de Nuevo León

     México

     
  3. [3] Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation

  Mostrar afiliaciones +
• Localización: Computación y Sistemas (CyS), ISSN 1405-5546, ISSN-e 2007-9737, Vol. 16, Nº. 3, 2012, págs. 309-320
• Idioma: inglés
• Títulos paralelos:
  • Procedimiento divide y vencerás para el diseño de territorios comerciales
• Enlaces
  • Texto completo
• Resumen
  • español

    En este trabajo se presenta un procedimiento heurístico para el diseño de territorios comerciales. El procedimiento propuesto, basado en el paradigma dividir-y-vencer, consiste básicamente en un proceso de dicotomías sucesivas a partir de una instancia dada. Durante este proceso se resuelven una serie de subproblemas de programación cuadrática entera. Los resultados computacionales muestran que la heurística propuesta es una técnica de solución atractiva que permite la obtención de soluciones óptimas locales para instancias grandes del problema, las cuales resultan intratables al intentar resolverlas a través de métodos exactos.

  • English

    A new heuristic procedure for a commercial territory design problem is introduced in this work. The proposed procedure is based on the divide-and-conquer paradigm and basically consists of a successive dichotomy process on a given large instance of the problem. During this process, a series of integer quadratic subproblems is solved. The obtained computational results have shown that the proposed heuristic is an attractive technique for obtaining locally optimal solutions for large instances which are intractable by using exact optimization methods.

• Referencias bibliográficas
  • Bacao, F.,Lobo, V.,Painho, M.. (2005). Applying genetic algorithms to zone design. Soft Computing. 9. 341-348
  • Bertolazzi, P.,Bianco, L.,Ricciardelli, S.. (1977). A method for determining the optimal districting in urban emergency services. Computers...
  • Blais, M.,Lapierre, S. D.,Laporte, G.. (2003). Solving a home-care districting problem in an urban setting. Journal of the Operational Research...
  • Bong, C.W.,Wang, Y.C.. (2004). A multiobjective hybrid metaheuristic approach for GIS-based spatial zone model. Journal of Mathematical Modelling...
  • Bozkaya, B.,Erkut, E.,Laporte, G.. (2003). A tabu search heuristic and adaptive memory procedure for political districting. European Journal...
  • Caballero-Hernández, S.I.,Ríos-Mercado, R.Z.,López, F.,Schaeffer, S.E.. (2007). Empirical evaluation of a metaheuristic for commercial territory...
  • Chou, C.I.,Chu, Y.L.,Li, S.P.. (2007). Evolutionary strategy for political districting problem using genetic algorithm. Computational Science....
  • Drexl, A.,Haase, K.. (1999). Fast approximation methods for sales force deployment. Management Science. 45. 1307-1323
  • Fleischmann, B.,Paraschis, J. N.. (1988). Solving a large scale districting problem: A case report. Computers & Operations Research. 15....
  • Garfinkel, R.S,Nemhauser, G.L.. (1970). Optimal political districting by implicit enumeration techniques. Management Science. 16. 495-508
  • Guo, J.,Trinidad, G.,Smith, N.. (2000). MOZART: A multi-objective zoning and aggregation tool. 197-201
  • Hess, S.W.,Samuels, S.A.. (1971). Experiences with a sales districting model: Criteria and implementation. Management Science. 18. 41-54
  • Hess, S.W.,Weaver, J.B.,Siegfeldt, H.J.,Whelan, J.N.,Zitlau, P.A.. (1965). Nonpartisan political redistricting by computer. Operations Research....
  • Hojati, M.. (1996). Optimal political districting. Computers & Operations Research. 23. 1147-1161
  • Kalcsics, J.,Nickel, S.,Schröder, M.. (2005). Towards a unified territorial design approach -Applications, algorithms, and GIS integration....
  • Marlin, P.G.. (1981). Application of the transportation model to a large-scale districting problem. Computers & Operations Research. 8....
  • Mehrotra, A.,Johnson, E.L.,Nemhauser, G.L.. (1998). An optimization based heuristic for political districting. Management Science. 44. 1100-1114
  • Muyldermans, L.,Cattrysse, D.,Van Oudheusden, D.,Lotan, T.. (2002). Districting for salt spreading operations. European Journal of Operational...
  • Pezzella, F.,Bonanno, R.,Nicoletti, B.. (1981). A system approach to the optimal health-care districting. European Journal of Operational...
  • Ricca, F.. (2004). A multicriteria districting heuristic for the aggregation of zones and its use in computing origin-destination matrices....
  • Ricca, F.,Simeone, B.. (2008). Local search algorithms for political districting. European Journal of Operational Research. 189. 1409-1426
  • Ríos-Mercado, R.Z.,Fernández, E.. (2009). A reactive GRASP for a commercial territory design problem with multiple balancing requirements....
  • Salazar-Aguilar, M.A.,Ríos-Mercado, R.Z.,Cabrera-Ríos, M.. (2011). New models for commercial territory design. Networks and Spatial Economics....
  • Salazar-Aguilar, M.A.. (2010). Models, Algorithms, and Heuristics for Multiobjective Commercial Territory Design.
  • Segura-Ramiro, J.A.,Ríos-Mercado, R.Z.,Álvarez-Socarrás, A.M.,de Alba, K.. (2007). A location-allocation heuristic for a territory design...
  • Tavares-Pereira, F.,Figueira, J.R.,Mousseau, V.,Roy, B.. (2007). Multiple criteria districting problems: The public transportaron network...
  • Xu, R.,Wunsch, D.. (2005). Survey of clustering algorithms. IEEE Transactions on Neural Networks. 16. 645-678