• Aucun résultat trouvé

Tactical optimization strategies to adapt urban transport networks

N/A
N/A
Protected

Academic year: 2021

Partager "Tactical optimization strategies to adapt urban transport networks"

Copied!
2
0
0

Texte intégral

(1)

HAL Id: hal-02301946

https://hal.archives-ouvertes.fr/hal-02301946

Submitted on 9 Oct 2019

HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Tactical optimization strategies to adapt urban transport networks

Andréa Cynthia Santos, Christophe Duhamel, Christian Prins

To cite this version:

Andréa Cynthia Santos, Christophe Duhamel, Christian Prins. Tactical optimization strategies to adapt urban transport networks. Transport Research Arena (TRA 2014), Apr 2014, Paris, France.

29, pp.298 - 300, 2013. �hal-02301946�

(2)

Introduction

According to the Global Health Observatory (GHO), more than half of the total population lived in urban areas in 2010. This proportion is expected to reach 60% by 2030 and 70% by 2050. The increasing concentration of population and the unplanned extension of urban areas raise several challenges, among which the management of the urban network infrastructures.

The TOAST project (Tactical OptimizAtion Strategies to adapt urban Transportation networks) aims at investigating a new set of emerging tactical optimization problem [1]. It consists in setting directions on each street to improve the global transport system. This research has been funded in 2013 by the DRRT (Délégation Régionale à la Recherche et à la Technologie, Champagne-Ardennes region, France).

Decision Making System

An optimization framework core has been developed to deal with a class of tactical optimization problems [2], where two objectives are optimized independently:

(i) Allow fast origin-destination transportation requests

(ii) Prevent drivers from entering critical areas such as city centers or touristic points.

The ongoing work will include the computation of the global congestion and address several other settings (such as lanes) to deal with promising applications. The optimization core can be embedded in a support decision systems as shown in Figure 1.

The core TOAST encloses sophisticated heuristics and metaheuristics such as Iterated Local Search (ILS) and Relaxed ILS (RILS), Evolutionary Local Search (ELS) and Relaxed ESL (RELS), Variable Neighborhood Search (VNS) and Intelligent VNS (IVNS), applied to produce high quality results for different networks structures.

Results

The methods were tested on Manhattan graphs (grid structure) instances, as well as on real instances from the Clermont-Ferrand and Troyes cities, France. The first results are presented in [3].

Figure 2 illustrates the relation between the convergence and the trade- off between the solutions quality and the running time, using a medium- sized instance for the Clermont-Ferrand city, France.

Figure 3 shows a typical output from our solver for the center of Troyes, France.

TACTICAL OPTIMIZATION STRATEGIES TO ADAPT URBAN TRANSPORT NETWORKS

Santos, Andréa C *., Université de Technologie de Troyes, France Duhamel, Christophe, Université Blaise Pascal , France

Prins, Christian, Université de Technologie de Troyes , France

* andrea.duhamel@utt.fr

Database

Support decision system Interfaces, data treatment, …

Optimization solver PROJET TOAST Optimized solutions

Simulation Real time

Figure 1 : Overview on the positioning of the TOAST Project

Figure 3: Center city of Troyes, France.

Figure 2: Convergence and time-quality trade-off.

Conclusions

The proposed framework is able to solve the core problem of setting directions and evaluating the global impact on an urban network for the goals (i) and (ii). We are currently extending it:

• To manage the global congestion

• To quickly provide good traffic redirections when some streets are blocked due to maintenance, natural perils (freezing rain, hail storm, flood, fire, etc), road accidents, manifestations (fairs, etc.), …

Main references

1. R. Z. Farahani, E. Miandoabchi, W. Y. Szeto, and H. Rashidi. A review of urban transportation network design problems. European Journal of Operational Research, vol. 29 (2), 281–302, 2013.

2. R. E. Burkard, K. Faldbacher, B. Klinz, and G. J. Woeginger. Minimum- cost strong network orientation problems: classification, complexity and algorithms. Networks, vol. 33 (1), 57-70, 1999.

3. A. C. Santos, C. Duhamel, C. Prins. Heuristics for setting directions in

urban networks. In proceedings of the X Metaheuristics International

Conference, Singapore, 298-300, 2013.

Références

Documents relatifs

In the present paper, rather than trying to ”repair” the Hurwicz criterion in an algorithmic way, we are looking for new qualitative criteria which can take into account the

2) Getting Initial Solution: In the initial solution, we con- sider that all farms are selected. In this situation, the problem can be considered equivalent to a

We address in this chapter a new city logistics problem called the Multicommodity-Ring Location Routing Problem (MRLRP), based on publicly held depots called Urban Distribution

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

Based on these modelling approaches, sev- eral algorithms (Simulated Annealing, Genetic Algorithm and Parallel SGS) are developed to solve the Fuzzy Rough Cut Capacity Problem

The Lasserre hierarchy is known to provide the best bounds to hard combinatorial problems, so it makes sense to try to apply real and complex hierarchies to the optimal power

The define-type-predicate function returns the name of a named closure which the calling function can use to construct a type spec- ifier. The name and function binding are generated

cité des drogues végétales utilisées d‘après l‘enquête .... Résumés Bibliographie Annexes.. Tout au long des âges, les hommes et les femmes ont sans cesse recherché par