Skip to main content
Springer Nature Link
Log in

Towards a stochastic programming modeling framework for districting

  • Original - OR Modeling/Case Study
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

A Correction to this article was published on 08 June 2020

This article has been updated

Abstract

In this paper a stochastic districting problem is investigated. Demand is assumed to be represented by a random vector with a given joint probability distribution function. A two-stage mixed-integer stochastic programming model is proposed. The first stage comprises the decision about the initial territory design: the districts are defined and all the territory units assigned to one and exactly one of them. In the second stage, i.e., after demand becomes known, balancing requirements are to be met. This is ensured by means of two recourse actions: outsourcing and reassignment of territory units. The objective function accounts for the total expected cost that includes the cost for the first-stage territory design plus the expected cost incurred at the second stage by outsourcing and reassignment. The (re)assignment costs are associated with the distances between territory units, i.e., the focus is put on the compactness of the solution. The model is then extended in different ways to account for aspects of practical relevance such as a maximum desirable dispersion, reallocation constraints, or similarity of the second-stage solution w.r.t. the first-stage one. The new modeling framework proposed is tested computationally using instances built using real geographical data.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Change history

  • 08 June 2020

    Third authors’ name should appear as: Francisco Saldanha-da-Gama.

References

  • Akdoğan, M. A., Bayındır, Z. P., & Iyigun, C. (2018). Locating emergency vehicles with an approximate queuing model and a meta-heuristic solution approach. Transportation Research Part C: Emerging Technologies, 90, 134–155.

    Google Scholar 

  • Bard, J. F., & Jarrah, A. I. (2009). Large-scale constrained clustering for rationalizing pickup and delivery operations. Transportation Research Part B: Methodological, 43(5), 542–561.

    Google Scholar 

  • Bender, M., Kalcsics, J., Nickel, S., & Pouls, M. (2018). A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design. European Journal of Operational Research, 269(1), 382–396.

    Google Scholar 

  • Bender, M., Meyer, A., Kalcsics, J., & Nickel, S. (2016). The multi-period service territory design problem-an introduction, a model and a heuristic approach. Transportation Research Part E: Logistics and Transportation Review, 96, 135–157.

    Google Scholar 

  • Benzarti, E., Sahin, E., & Dallery, Y. (2013). Operations management applied to home care services: Analysis of the districting problem. Decision Support Systems, 55(2), 587–598.

    Google Scholar 

  • Bergey, B. K., Ragsdale, C. T., & Hoskote, M. (2003). A simulated annealing genetic algorithm for the electrical power districting problem. Annals of Operations Research, 121(1–4), 33–55.

    Google Scholar 

  • Bianchi, G., Bruni, R., Reale, A., & Sforzi, F. (2016). A min-cut approach to functional regionalization, with a case study of the italian local labour market areas. Optimization Letters, 10(5), 955–973.

    Google Scholar 

  • Birge, J. R., & Louveaux, F. V. (2011). Introduction to Stochastic Programming (2nd ed.). New York: Springer.

    Google Scholar 

  • Blais, M., Lapierre, S. D., & Laporte, G. (2003). Solving a home-care districting problem in an urban setting. Journal of the Operational Research Society, 54(11), 1141–1147.

    Google Scholar 

  • Bozkaya, B., Erkut, E., & Laporte, G. (2003). A tabu search heuristic and adaptive memory procedure for political districting. European Journal of Operational Research, 144(1), 12–26.

    Google Scholar 

  • Bruno, G., Diglio, A., Melisi, A., & Piccolo, C. (2017a). A districting model to support the redesign process of Italian provinces. In A. Sforza & C. Sterle (Eds.), International Conference on Optimization and Decision Science (pp. 245–256). Cham: Springer.

    Google Scholar 

  • Bruno, G., Esposito, E., Genovese, A., & Piccolo, C. (2016a). Institutions and facility mergers in the italian education system: Models and case studies. Socio-Economic Planning Sciences, 53, 23–32.

    Google Scholar 

  • Bruno, G., Genovese, A., & Piccolo, C. (2016b). Capacity management in public service facility networks: A model, computational tests and a case study. Optimization Letters, 10(5), 975–995.

    Google Scholar 

  • Bruno, G., Genovese, A., & Piccolo, C. (2017b). Territorial amalgamation decisions in local government: Models and a case study from Italy. Socio-Economic Planning Sciences, 57, 61–72.

    Google Scholar 

  • Bruno, G., & Laporte, G. (2002). An interactive decision support system for the design of rapid public transit networks. INFOR: Information Systems and Operational Research, 40(2), 111–118.

    Google Scholar 

  • Camacho-Collados, M., & Liberatore, F. (2015). A decision support system for predictive police patrolling. Decision Support Systems, 75, 25–37.

    Google Scholar 

  • Camacho-Collados, M., Liberatore, F., & Angulo, J. M. (2015). A multi-criteria police districting problem for the efficient and effective design of patrol sector. European Journal of Operational Research, 246(2), 674–684.

    Google Scholar 

  • Carlsson, J. G. (2012). Dividing a territory among several vehicles. INFORMS Journal on Computing, 24(4), 565–577.

    Google Scholar 

  • Carlsson, J. G., & Delage, E. (2013). Robust partitioning for stochastic multivehicle routing. Operations Research, 61(3), 727–744.

    Google Scholar 

  • Caro, F., Shirabe, T., Guignard, M., & Weintraub, A. (2004). School redistricting: Embedding gis tools with integer programming. Journal of the Operational Research Society, 55(8), 836–849.

    Google Scholar 

  • Correia, I., & Saldaha-da-Gama, F. (2019). Facility location under uncertainty. In: Laporte G, Nickel S, Saldanha-da-Gama F (Eds.) Location Science, 2nd edn. Cham: Springer, Chapter 8, pp. 185–213.

  • D’Amico, S. J., Wang, S. J., Batta, R., & Rump, C. M. (2002). A simulated annealing approach to police district design. Computers & Operations Research, 29(6), 667–684.

    Google Scholar 

  • De Assis, L. S., Franca, P. M., & Usberti, F. L. (2014). A redistricting problem applied to meter reading in power distribution networks. Computers & Operations Research, 41, 65–75.

    Google Scholar 

  • De Fréminville, P. D. L. P., Desaulniers, G., Rousseau, L. M., & Perron, S. (2015). A column generation heuristic for districting the price of a financial product. Journal of the Operational Research Society, 66(6), 965–978.

    Google Scholar 

  • ESPAS. (2015). Global Trends to 2030: Can the EU meet the challenges ahead? www.ec.europa.eu. Retrieved September 2018.

  • Ferland, J., & Guénette, G. (1990). Decision support system for the school districting problem. Operations Research, 38(1), 15–21.

    Google Scholar 

  • García-Ayala, G., González-Velarde, J. L., Ríos-Mercado, R. Z., & Fernández, E. (2016). A novel model for arc territory design: Promoting Eulerian districts. International Transactions in Operational Research, 23(3), 433–458.

    Google Scholar 

  • Haugland, D., Ho, S. C., & Laporte, G. G. (2007). Designing delivery districts for the vehicle routing problem with stochastic demands. European Journal of Operational Research, 180(3), 997–1010.

    Google Scholar 

  • Hess, S. W., Weaver, J. B., Siegfeldt, H. J., Whelan, J. N., & Zitlau, P. A. (1965). Nonpartisan political redistricting by computer. Operations Research, 13(6), 998–1006.

    Google Scholar 

  • ISTAT. (2011). Dati del censimento generale della popolazione italiana (italian national census data). www.istat.it. Retreived September 2018.

  • Kalcsics, J., Nickel, S., & Schröder, M. (2005). Towards a unified territorial design approach—Applications, algorithms and GIS integration. TOP, 13, 1–56.

    Google Scholar 

  • Kalcsics, J., & Ríos-Mercado, R. (2019). Districting problems. In: G. Laporte, S. Nickel, F. Saldanha-da-Gama (Eds.), Location science, 2nd edn., Chapter 25. Cham: Springer, pp. 705–743.

  • Kim, K., Chun, Y., & Kim, H. (2017). \(p\)-Functional clusters location problem for detecting spatial clusters with covering approach. Geographical Analysis, 49(1), 101–121.

    Google Scholar 

  • Lei, H., Laporte, G., & Guo, B. (2012). Districting for routing with stochastic customers. EURO Journal on Transportation and Logistics, 1(1–2), 67–85.

    Google Scholar 

  • Lei, H., Laporte, G., Liu, Y., & Zhang, T. (2015). Dynamic design of sales territories. Computers & Operations Research, 56, 84–92.

    Google Scholar 

  • Lei, H., Wang, R., & Laporte, G. (2016). Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm. Computers & Operations Research, 67, 12–24.

    Google Scholar 

  • Lin, M., Chin, K. S., Fu, C., & Tsui, K. L. (2017). An effective greedy method for the meals-on-wheels service districting problem. Computers & Industrial Engineering, 106, 1–19.

    Google Scholar 

  • Mourão, M. C., Nunes, A. C., & Prins, C. (2009). Heuristic methods for the sectoring arc routing problem. European Journal of Operational Research, 196(3), 856–868.

    Google Scholar 

  • Ricca, F., & Simeone, B. (2008). Local search algorithms for political districting. European Journal of Operational Research, 189(3), 1049–1426.

    Google Scholar 

  • Ricca, F., Scozzari, A., & Simeone, B. (2013). Political districting: From classical models to recent approaches. Annals of Operations Research, 204(1), 271–299.

    Google Scholar 

  • Ríos-Mercado, R. Z. (2016). Assessing a metaheuristic for large-scale commercial districting. Cybernetics and Systems, 47(4), 321–338.

    Google Scholar 

  • Ríos-Mercado, R. Z., & Escalante, H. J. (2016). GRASP with path relinking for commercial districting. Expert Systems with Applications, 44, 102–113.

    Google Scholar 

  • Ríos-Mercado, R. Z., & López-Pérez, J. F. (2013). Commercial territory design planning with realignment and disjoint assignment requirements. Omega, 41(3), 525–535.

    Google Scholar 

  • Schoepfle, O., & Church, R. (1991). A new network representation of a classic school districting problem. Socio-Economic Planning Sciences, 25(3), 189–197.

    Google Scholar 

  • Tavares, P., Figueira, F., Mousseau, J., & Roy, V. (2007). Multiple criteria districting problems. The public transportation network pricing system of the Paris region. Annals of Operations Research, 154, 69–9.

    Google Scholar 

  • Xie, S., & Ouyang, Y. (2016). Railroad caller districting with reliability, contiguity, balance, and compactness considerations. Transportation Research Part C: Emerging Technologies, 63, 65–76.

    Google Scholar 

  • Yanık, S., Sürer, Ö., & Öztayşi, B. (2016). Designing sustainable energy regions using genetic algorithms and location-allocation approach. Energy, 97, 161–172.

    Google Scholar 

  • Zhong, H., Hall, R. W., & Dessouky, M. (2007). Territory planning and vehicle dispatching with driver learning. Transportation Science, 41(1), 74–89.

    Google Scholar 

  • Zoltners, A. A., & Sinha, P. (2005). Sales territory design: Thirty years of modeling and implementation. Marketing Science, 24(3), 313–331.

    Google Scholar 

Download references

Acknowledgements

This work was partially supported by National Funding from FCT - Fundação para a Ciância e a Tecnologia, under the project: UIDB/04561/2020. The authors would like to thank the anonymous reviewer for his/her detailed comments on our work, which helped us improving the manuscript.

Author information

Authors and Affiliations

  1. Department of Industrial Engineering (DII), Università degli Studi di Napoli Federico II, Piazzale Tecchio, 80, 80125, Naples, Italy

    Antonio Diglio

  2. Institute of Operations Research, Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany

    Stefan Nickel

  3. Department of Logistics and Supply Chain Optimization, Research Center for Information Technology (FZI), Karlsruhe, Germany

    Stefan Nickel

  4. Dept. Estatística e Investigação Operacional, Faculdade de Ciências da Universidade de Lisboa, 1749-016, Lisbon, Portugal

    Francisco Saldanha-da-Gama

  5. Centro de Matemática, Aplicações Fundamentais e Investigação Operacional, Faculdade de Ciências da Universidade de Lisboa, 1749-016, Lisbon, Portugal

    Francisco Saldanha-da-Gama

Authors
  1. Antonio Diglio
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Stefan Nickel
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Francisco Saldanha-da-Gama
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Antonio Diglio.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

The research of the third author was supported by the Portuguese Science Foundation (FCT—Fundação para a Ciência e Tecnologia) under the Projects UID/MAT/ 04561/2013 (CMAF-CIO/FCUL) and SFRH/BSAB/130291/2017.

Appendix

Appendix

In this Appendix we details the information concerning the test data used to realize our computational experiments and we present the detailed results that were reported in Sect. 6.

For each TU, Table 5 reports the generated demand vector and the coordinates of the respective centroid. The original code assigned by ISTAT to uniquely identify TUs (i.e. PRO_COM) is also reported. TUs constituting each of the considered instances are indicated in Table 6.

Table 5 Demands and coordinates of the centroids (Coordinate Reference System: ED50 / UTM Zone 32N EPSG:23032)
Full size table
Table 6 TUs that are part of each instance
Full size table
Table 7 Computational results for the 88-TU instances, \(p=4\)
Full size table
Table 8 Computational results for the 88-TU instances, \(p=6\)
Full size table
Table 9 CPU time (seconds)—for all the instances with \(p=4\)
Full size table
Table 10 CPU time (seconds)—for all the instances with \(p=6\)
Full size table

For each tested instance, Tables 7 and 8 contain the realtive values of VSS and EVPI w.r.t. SP as well as the CPU time in seconds required by the general purpose solver to solve the instance to optimality. Tables 7 refers to the instances with 4 districts and Tables 8 to instances with 6 districts.

Finally, Tables 9 and 10 contain the CPU time (seconds) required to solve the instances to proven optimalty for different values of |I| (40, 60, 88, and 120).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Diglio, A., Nickel, S. & Saldanha-da-Gama, F. Towards a stochastic programming modeling framework for districting. Ann Oper Res 292, 249–285 (2020). https://doi.org/10.1007/s10479-020-03631-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-020-03631-7

Keywords