• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Multiple criteria districting problems. The public transportation network pricing system of the Paris region

Thumbnail
Date
2007
Dewey
Recherche opérationnelle
Sujet
Combinatorial optimization; Local search; Evolutionary algorithms; Districting problems; Multiple criteria
Journal issue
Annals of Operations Research
Volume
154
Number
1
Publication date
10-2007
Article pages
69-92
Publisher
Springer
DOI
http://dx.doi.org/10.1007/s10479-007-0181-5
URI
https://basepub.dauphine.fr/handle/123456789/3703
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Tavares Pereira, Fernando
Figueira, José
Mousseau, Vincent
Roy, Bernard
Type
Article accepté pour publication ou publié
Abstract (EN)
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.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.