IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v41y2013i3p525-535.html
   My bibliography  Save this article

Commercial territory design planning with realignment and disjoint assignment requirements

Author

Listed:
  • Ríos-Mercado, Roger Z.
  • López-Pérez, J. Fabián

Abstract

A territory design problem motivated by a bottled beverage distribution company is addressed. The problem consists of finding a partition of the entire set of city blocks into a given number of territories subject to several planning criteria. Each unit has three measurable activities associated to it, namely, number of customers, product demand, and workload. The plan must satisfy planning criteria such as territory compactness, territory balancing with respect to each of the block activity measures, and territory connectivity, meaning that there must exist a path between any pair of units in a territory totally contained in it. In addition, there are some disjoint assignment requirements establishing that some specified units must be assigned to different territories, and a similarity with existing plan requirement. An optimal design is one that minimizes a measure of territory dispersion and similarity with existing design. A mixed-integer linear programming model is presented. This model is unique in the commercial territory design literature as it incorporates the disjoint assignment requirements and similarity with existing plan. Previous methods developed for related commercial districting problems are not applicable. A solution procedure based on an iterative cut generation strategy within a branch-and-bound framework is proposed. The procedure aims at solving large-scale instances by incorporating several algorithmic strategies that helped reduce the problem size. These strategies are evaluated and tested on some real-world instances of 5000 and 10,000 basic units. The empirical results show the effectiveness of the proposed method and strategies in finding near optimal solutions to these very large instances at a reasonably small computational effort.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:jomega:v:41:y:2013:i:3:p:525-535
    DOI: 10.1016/j.omega.2012.08.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048312001090
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2012.08.002?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. 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.
    2. Andreas Drexl & Knut Haase, 1999. "Fast Approximation Methods for Sales Force Deployment," Management Science, INFORMS, vol. 45(10), pages 1307-1323, October.
    3. Ronen, David, 1983. "Sales territory alignment for sparse accounts," Omega, Elsevier, vol. 11(5), pages 501-505.
    4. Andris A. Zoltners & Prabhakant Sinha, 1983. "Sales Territory Alignment: A Review and Model," Management Science, INFORMS, vol. 29(11), pages 1237-1256, November.
    5. S. W. Hess & J. B. Weaver & H. J. Siegfeldt & J. N. Whelan & P. A. Zitlau, 1965. "Nonpartisan Political Redistricting by Computer," Operations Research, INFORMS, vol. 13(6), pages 998-1006, December.
    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. Verónica Arredondo & Miguel Martínez-Panero & Teresa Peña & Federica Ricca, 2021. "Mathematical political districting taking care of minority groups," Annals of Operations Research, Springer, vol. 305(1), pages 375-402, October.

    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. 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.
    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. Alexander Butsch & Jörg Kalcsics & Gilbert Laporte, 2014. "Districting for Arc Routing," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 809-824, November.
    4. 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.
    5. Mourão, Maria Cândida & Nunes, Ana Catarina & Prins, Christian, 2009. "Heuristic methods for the sectoring arc routing problem," European Journal of Operational Research, Elsevier, vol. 196(3), pages 856-868, August.
    6. 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.
    7. Johannes Habel & Sascha Alavi & Nicolas Heinitz, 2023. "A theory of predictive sales analytics adoption," AMS Review, Springer;Academy of Marketing Science, vol. 13(1), pages 34-54, June.
    8. Haase, Knut & Müller, Sven, 2014. "Upper and lower bounds for the sales force deployment problem with explicit contiguity constraints," European Journal of Operational Research, Elsevier, vol. 237(2), pages 677-689.
    9. 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.
    10. 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.
    11. 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).
    12. Haase, Knut, 1999. "Sales force deployment by mathematical programming," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 508, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    13. Han, Jialin & Hu, Yaoguang & Mao, Mingsong & Wan, Shuping, 2020. "A multi-objective districting problem applied to agricultural machinery maintenance service network," European Journal of Operational Research, Elsevier, vol. 287(3), pages 1120-1130.
    14. 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.
    15. 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.
    16. Sommer Gentry & Eric Chow & Allan Massie & Dorry Segev, 2015. "Gerrymandering for Justice: Redistricting U.S. Liver Allocation," Interfaces, INFORMS, vol. 45(5), pages 462-480, October.
    17. 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.
    18. Sprecher, Arno, 1999. "Sales force deployment by genetic concepts," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 514, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    19. 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.
    20. 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.

    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:eee:jomega:v:41:y:2013:i:3:p:525-535. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.