Recherche de chemins dans un graphe à pondération
dynamique : application à l'optimisation d'itinéraires dans les réseaux routiers

Abstract : This thesis aims to develop algorithms and models for optimizing itineraries in road networks. The first part of this work treats the problem of intercepting a mobile in a graph. In this context, the goal is to compute the optimal path to reach a moving target with a known itinerary. This problem is studied for different situations (one pursuer/one target and several pursuers/several targets) and for different types of graphs (time-independent graphs and FIFO graphs). For each case, an algorithm is suggested and its optimality is proven. Moreover, simulations are conducted to check the algorithms efficiency in terms of execution time. In the second part of this thesis, a new class of time-dependent graphs is defined : the time-dependent interval graphs. The distinctive feature of these graphs is that the edge weight is time-dependent and it is defined by an interval. For this new class of graphs, the shortest path problem is studied. This problem can be viewed either as mono-objective optimization problem or as a multi-objective optimization problem. For each case, the problem is formulated and approaches for resolution are proposed.
Document type :
Theses
Automatic. Ecole Centrale de Lille, 2008. French


https://tel.archives-ouvertes.fr/tel-00344958
Contributor : Mohamed Mejdi Hizem <>
Submitted on : Sunday, December 7, 2008 - 10:18:35 PM
Last modification on : Monday, December 8, 2008 - 11:30:41 AM

Identifiers

  • HAL Id : tel-00344958, version 1

Collections

Citation

Mohamed Mejdi Hizem. Recherche de chemins dans un graphe à pondération
dynamique : application à l'optimisation d'itinéraires dans les réseaux routiers. Automatic. Ecole Centrale de Lille, 2008. French. <tel-00344958>

Export

Share

Metrics

Consultation de
la notice

237

Téléchargement du document

473