Skip to main content
SpringerLink
Log in

Multiple criteria districting problems

The public transportation network pricing system of the Paris region

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Districting problems are of high importance in many different fields. Multiple criteria models seem a more adequate representation of districting problems in real-world situations. Real-life decision situations are by their very nature multidimensional. This paper deals with the problem of partitioning a territory into “homogeneous” zones. Each zone is composed of a set of elementary territorial units. A district map is formed by partitioning the set of elementary units into connected zones without inclusions. When multiple criteria are considered, the problem of enumerating all the efficient solutions for such a model is known as being NP-hard, which is why we decided to avoid using exact methods to solve large-size instances. In this paper, we propose a new method to approximate the Pareto front based on an evolutionary algorithm with local search. The algorithm presents a new solution representation and the crossover/mutation operators. Its main features are the following: it deals with multiple criteria; it allows to solve large-size instances in a reasonable CPU time and generates high quality solutions. The algorithm was applied to a real-world problem, that of the Paris region public transportation. Results will be used for a discussion about the reform of its current pricing system.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Bergey, P. K., Ragsdale, C. T., & Hoskote, M. (2003a). A decision support system for the electrical power districting problem. Decision Support Systems, 36, 1–17.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Bourjolly, J. M., Laporte, G., & Rousseau, J. M. (1981). Découpage electoral automatisé: application á l’Île de Montréal. INFOR: Information Systems and Operational Research, 19, 113–124.

    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, 12–26.

    Article  Google Scholar 

  • Chance, C. W. (1965). Representation and reapportionment. Political studies: number 2, Dept. of Political Science, Ohio State University, Columbus.

  • Cortona, P. G., Manzi, C., Pennisi, A., Ricca, F., & Simeone, B. (1999). Evaluation and optimization of electoral systems. SIAM monographs on discrete mathematics and applications. Philadelphia: SIAM.

    Google Scholar 

  • 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, 667–684.

    Article  Google Scholar 

  • Deckro, R. F. (1979). Multiple objective districting: a general heuristic approach using multiple criteria. Operational Research Quarterly, 28, 953–961.

    Google Scholar 

  • Easingwood, C. (1973). A heuristic approach to selecting sales regions and territories. Operational Research Quarterly, 24(4), 527–534.

    Google Scholar 

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

    Google Scholar 

  • Fleischmann, B., & Paraschis, J. N. (1988). Solving a large scale districting problem: a case report. Computers & Operations Research, 15(6), 521–533.

    Article  Google Scholar 

  • Forrest, E. (1964). Apportionment by computer. American Behavioral Scientist, 7, 23–25.

    Article  Google Scholar 

  • Garfinkel, R. S., & Nemhauser, G. L. (1970). Optimal political districting by implicit enumeration techniques. Management Science, 16(8), 495–508.

    Google Scholar 

  • Hess, S. W., & Samuels, S. A. (1971). Experiences with a sales districting model: criteria and implementation. Management Science, 18(4), 41–54.

    Google Scholar 

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

    Google Scholar 

  • Hojati, M. (1996). Optimal political districting. Computers & Operations Research, 23(12), 1147–1161.

    Article  Google Scholar 

  • Mehrotra, A. (1992). Constrained graph. PhD thesis, Georgia Institute of Technology.

  • Mehrotra, A., Johnson, E. L., & Nemhauser, G. L. (1998). An optimization based heuristic for political districting. Management Science, 44(8), 1100–1114.

    Google Scholar 

  • Mousseau, V., Roy, B., & Sommerlatt, I. (2001). Development of a decision aiding tool for the evolution of public transport ticket pricing in the Paris region. In M. Paruccini, A. Colorni & B. Roy (Eds.), A-MCD-A aide multicritère à la décision—multiple criteria decision aiding (pp. 213–230). Luxembourg: Joint Research Center, European Commission.

    Google Scholar 

  • Muyldermans, L., Cattrysse, D., Oudheusden, D. V., & Lotan, T. (2002). Districting for salt spreading operations. European Journal of Operational Research, 139, 521–532.

    Article  Google Scholar 

  • Nygreen, B. (1988). European assembly constituencies for wales. Comparing of methods for solving a political districting problem. Mathematical Programming, 42, 159–169.

    Article  Google Scholar 

  • Park, K., Lee, K., Park, S., & Lee, H. (2000). Telecommunication node clustering with node compatibility and network survivability requirements. Management Science, 46(3), 363–374.

    Article  Google Scholar 

  • Preux, P., & Talbi, E. G. (1999). Towards hybrid evolutionary algorithms. International Transactions in Operational Research, 6, 557–570.

    Article  Google Scholar 

  • Reeves, C. R. (1997). Genetic algorithms for the operations researcher. INFORMS Journal on Computing, 9(3), 231–250.

    Article  Google Scholar 

  • Ross, P. (1997). What are genetic algorithms good at? INFORMS Journal on Computing, 9(3), 260–262.

    Google Scholar 

  • Shanker, R. J., Turner, R. E., & Zoltners, A. A. (1975). Sales territory design: an integrated approach. Management Science, 22(3), 309–320.

    Google Scholar 

  • Srinivas, N., & Deb, K. (1995). Multiobjective optimization using nondominated sorting genetic algorithms. Evolutionary Computation, 2/3, 221–248.

    Google Scholar 

  • Steuer, R. E. (1986). Multiple criteria optimization: theory, computation and application. New York: Wiley.

    Google Scholar 

  • Tavares-Pereira, F., Figueira, J., Mousseau, V., & Roy, B. (2004). Multiple criteria districting problems, models, algorithms, and applications: the public transportation Paris region pricing system. Research report no. 21/2004, INESC—Coimbra, Portugal.

  • Van Veldhuizen, D. A. (1999). Multiobjective evolutionary algorithms: classifications, analyses, and new innovations. PhD thesis, Department of Electrical and Computer Engineering, Graduate School of Engineering, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.

  • Vickrey, W. (1961). On the preventions of gerrymandering. Political Science Quarterly, 76(1), 105–110.

    Article  Google Scholar 

  • Zoltners, A. A., & Sinha, P. (1983). Sales territory alignment: a review and model. Management Science, 29(3), 1237–1256.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Matemática, Universidade da Beira Interior, Rua Marquês D’Ávila e Bolama, 6201-001, Covilha, Portugal

    Fernando Tavares-Pereira

  2. INESC—Coimbra, Rua Antero de Quental, 199, 3000-033, Coimbra, Portugal

    Fernando Tavares-Pereira

  3. CEG-IST, Center for Management Studies, Departamento de Engenharia e Gestão, Instituto Superior Técnico, Universidade Técnica de Lisboa, Tagus Park, Av. Prof. Cavaco Silva, 2780-990, Porto Salvo, Portugal

    Fernando Tavares-Pereira & José Rui Figueira

  4. LAMSADE, Université Paris-Dauphine, Place du Maréchal De Lattre de Tassigny, 75 775, Paris Cedex 16, France

    Fernando Tavares-Pereira, José Rui Figueira, Vincent Mousseau & Bernard Roy

Authors
  1. Fernando Tavares-Pereira
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José Rui Figueira
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vincent Mousseau
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bernard Roy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fernando Tavares-Pereira.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tavares-Pereira, F., Figueira, J.R., Mousseau, V. et al. Multiple criteria districting problems. Ann Oper Res 154, 69–92 (2007). https://doi.org/10.1007/s10479-007-0181-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-007-0181-5

Keywords

Search

Navigation