IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v11y2011i3p487-507.html
   My bibliography  Save this article

New Models for Commercial Territory Design

Author

Listed:
  • María Salazar-Aguilar
  • Roger Ríos-Mercado
  • Mauricio Cabrera-Ríos

Abstract

No abstract is available for this item.

Suggested Citation

  • María Salazar-Aguilar & Roger Ríos-Mercado & Mauricio Cabrera-Ríos, 2011. "New Models for Commercial Territory Design," Networks and Spatial Economics, Springer, vol. 11(3), pages 487-507, September.
    • Handle: RePEc:kap:netspa:v:11:y:2011:i:3:p:487-507
    DOI: 10.1007/s11067-010-9151-6
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11067-010-9151-6
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-010-9151-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bozkaya, Burcin & Erkut, Erhan & Laporte, Gilbert, 2003. "A tabu search heuristic and adaptive memory procedure for political districting," European Journal of Operational Research, Elsevier, vol. 144(1), pages 12-26, January.
    2. Sidney W. Hess & Stuart A. Samuels, 1971. "Experiences with a Sales Districting Model: Criteria and Implementation," Management Science, INFORMS, vol. 18(4-Part-II), pages 41-54, December.
    3. GARFINKEL, Robert S. & NEMHAUSER, Geroge L., 1970. "Optimal political districting by implicit enumeration techniques," LIDAM Reprints CORE 54, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. Andreas Drexl & Knut Haase, 1999. "Fast Approximation Methods for Sales Force Deployment," Management Science, INFORMS, vol. 45(10), pages 1307-1323, October.
    5. R. S. Garfinkel & G. L. Nemhauser, 1970. "Optimal Political Districting by Implicit Enumeration Techniques," Management Science, INFORMS, vol. 16(8), pages 495-508, April.
    6. Ricca, Federica & Simeone, Bruno, 2008. "Local search algorithms for political districting," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1409-1426, September.
    7. Anuj Mehrotra & Ellis L. Johnson & George L. Nemhauser, 1998. "An Optimization Based Heuristic for Political Districting," Management Science, INFORMS, vol. 44(8), pages 1100-1114, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Tobias Vlćek & Knut Haase & Malte Fliedner & Tobias Cors, 2024. "Police service district planning," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(4), pages 1029-1061, December.
    2. Bender, Matthias & Kalcsics, Jörg & Meyer, Anne, 2020. "Districting for parcel delivery services – A two-Stage solution approach and a real-World case study," Omega, Elsevier, vol. 96(C).
    3. Hyun Kim & Yongwan Chun & Kamyoung Kim, 2015. "Delimitation of Functional Regions Using a p-Regions Problem Approach," International Regional Science Review, , vol. 38(3), pages 235-263, July.
    4. Diglio, Antonio & Peiró, Juanjo & Piccolo, Carmela & Saldanha-da-Gama, Francisco, 2021. "Solutions for districting problems with chance-constrained balancing requirements," Omega, Elsevier, vol. 103(C).
    5. Diglio, Antonio & Peiró, Juanjo & Piccolo, Carmela & Saldanha-da-Gama, Francisco, 2023. "Approximation schemes for districting problems with probabilistic constraints," European Journal of Operational Research, Elsevier, vol. 307(1), pages 233-248.
    6. Alexander Butsch & Jörg Kalcsics & Gilbert Laporte, 2014. "Districting for Arc Routing," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 809-824, November.
    7. Zhou, Lin & Zhen, Lu & Baldacci, Roberto & Boschetti, Marco & Dai, Ying & Lim, Andrew, 2021. "A Heuristic Algorithm for solving a large-scale real-world territory design problem," Omega, Elsevier, vol. 103(C).
    8. Juan A. Díaz & Dolores E. Luna, 2017. "Primal and dual bounds for the vertex p-median problem with balance constraints," Annals of Operations Research, Springer, vol. 258(2), pages 613-638, November.
    9. Sebastián Moreno & Jordi Pereira & Wilfredo Yushimito, 2020. "A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution," Annals of Operations Research, Springer, vol. 286(1), pages 87-117, March.
    10. Ríos-Mercado, Roger Z. & López-Pérez, J. Fabián, 2013. "Commercial territory design planning with realignment and disjoint assignment requirements," Omega, Elsevier, vol. 41(3), pages 525-535.
    11. J. Fabián López-Pérez & Roger Z. Ríos-Mercado, 2013. "Embotelladoras ARCA Uses Operations Research to Improve Territory Design Plans," Interfaces, INFORMS, vol. 43(3), pages 209-220, May-June.
    12. Sandoval, M. Gabriela & Álvarez-Miranda, Eduardo & Pereira, Jordi & Ríos-Mercado, Roger Z. & Díaz, Juan A., 2022. "A novel districting design approach for on-time last-mile delivery: An application on an express postal company," Omega, Elsevier, vol. 113(C).
    13. M. Salazar-Aguilar & Roger Ríos-Mercado & José González-Velarde & Julián Molina, 2012. "Multiobjective scatter search for a commercial territory design problem," Annals of Operations Research, Springer, vol. 199(1), pages 343-360, October.
    14. Bender, Matthias & Meyer, Anne & Kalcsics, Jörg & Nickel, Stefan, 2016. "The multi-period service territory design problem – An introduction, a model and a heuristic approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 96(C), pages 135-157.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sebastián Moreno & Jordi Pereira & Wilfredo Yushimito, 2020. "A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution," Annals of Operations Research, Springer, vol. 286(1), pages 87-117, March.
    2. Swamy, Rahul & King, Douglas M. & Ludden, Ian G. & Dobbs, Kiera W. & Jacobson, Sheldon H., 2024. "A practical optimization framework for political redistricting: A case study in Arizona," Socio-Economic Planning Sciences, Elsevier, vol. 92(C).
    3. Balázs Fleiner & Balázs Nagy & Attila Tasnádi, 2017. "Optimal partisan districting on planar geographies," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(4), pages 879-888, December.
    4. Federica Ricca & Andrea Scozzari & Bruno Simeone, 2013. "Political Districting: from classical models to recent approaches," Annals of Operations Research, Springer, vol. 204(1), pages 271-299, April.
    5. Fernando Tavares-Pereira & José Figueira & Vincent Mousseau & Bernard Roy, 2007. "Multiple criteria districting problems," Annals of Operations Research, Springer, vol. 154(1), pages 69-92, October.
    6. Christian Haas & Lee Hachadoorian & Steven O Kimbrough & Peter Miller & Frederic Murphy, 2020. "Seed-Fill-Shift-Repair: A redistricting heuristic for civic deliberation," PLOS ONE, Public Library of Science, vol. 15(9), pages 1-34, September.
    7. Hyun Kim & Yongwan Chun & Kamyoung Kim, 2015. "Delimitation of Functional Regions Using a p-Regions Problem Approach," International Regional Science Review, , vol. 38(3), pages 235-263, July.
    8. M Blais & S D Lapierre & G Laporte, 2003. "Solving a home-care districting problem in an urban setting," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(11), pages 1141-1147, November.
    9. Tavares Pereira, Fernando & Figueira, José Rui & Mousseau, Vincent & Roy, Bernard, 2009. "Comparing two territory partitions in districting problems: Indices and practical issues," Socio-Economic Planning Sciences, Elsevier, vol. 43(1), pages 72-88, March.
    10. Eduardo Álvarez-Miranda & Camilo Campos-Valdés & Maurcio Morales Quiroga & Matías Moreno-Faguett & Jordi Pereira, 2020. "A Multi-Criteria Pen for Drawing Fair Districts: When Democratic and Demographic Fairness Matter," Mathematics, MDPI, vol. 8(9), pages 1-26, August.
    11. Rui Fragoso & Conceição Rego & Vladimir Bushenkov, 2016. "Clustering of Territorial Areas: A Multi-Criteria Districting Problem," Journal of Quantitative Economics, Springer;The Indian Econometric Society (TIES), vol. 14(2), pages 179-198, December.
    12. Xin Tang & Ameur Soukhal & Vincent T’kindt, 2014. "Preprocessing for a map sectorization problem by means of mathematical programming," Annals of Operations Research, Springer, vol. 222(1), pages 551-569, November.
    13. Baghersad, Milad & Emadikhiav, Mohsen & Huang, C. Derrick & Behara, Ravi S., 2023. "Modularity maximization to design contiguous policy zones for pandemic response," European Journal of Operational Research, Elsevier, vol. 304(1), pages 99-112.
    14. Alexander Butsch & Jörg Kalcsics & Gilbert Laporte, 2014. "Districting for Arc Routing," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 809-824, November.
    15. F Caro & T Shirabe & M Guignard & A Weintraub, 2004. "School redistricting: embedding GIS tools with integer programming," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(8), pages 836-849, August.
    16. Juan Carlos Duque & Raúl Ramos & Jordi Suriñach, 2007. "Supervised Regionalization Methods: A Survey," International Regional Science Review, , vol. 30(3), pages 195-220, July.
    17. Djordje Dugošija & Aleksandar Savić & Zoran Maksimović, 2020. "A new integer linear programming formulation for the problem of political districting," Annals of Operations Research, Springer, vol. 288(1), pages 247-263, May.
    18. Ricca, Federica & Simeone, Bruno, 2008. "Local search algorithms for political districting," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1409-1426, September.
    19. Ram Gopalan & Steven O. Kimbrough & Frederic H. Murphy & Nicholas Quintus, 2013. "The Philadelphia Districting Contest: Designing Territories for City Council Based Upon the 2010 Census," Interfaces, INFORMS, vol. 43(5), pages 477-489, October.
    20. Anderson Kenji Hirose & Cassius Tadeu Scarpin & José Eduardo Pécora Junior, 2020. "Goal programming approach for political districting in Santa Catarina State: Brazil," Annals of Operations Research, Springer, vol. 287(1), pages 209-232, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:kap:netspa:v:11:y:2011:i:3:p:487-507. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.