Distributed Graphs for Solving Co-modal Transport Problems

Jeribi Karama (1) , Mejri Hinda (2) , Zgaya Hayfa (3) , Hammadi Slim (1)

1 LAGIS-OSL
2 LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal
3 ILIS - Institut Lillois d'Ingénierie de la Santé

The paper presents a new approach based on a special distributed graphs in order to solve co-modal transport problems. The co-modal transport system consists on combining different transport modes effectively in terms of economic, environmental, service and financial efficiency, etc. However, the problem is that these systems must deal with different distributed information sources stored in different locations and provided by different public and private companies. In order to resolve the co-modal transport problems, we propose a distributed co-modal approach based on special distributed graphs that adapts to the distributed nature of real world transport information.

Mots clés: Co-modal Transport; Distributed system; Transfer graph; Shortest path; Dijkstra Algorithm

Domaines: Recherche opérationnelle [math.OC]

Jeribi Karama, Mejri Hinda, Zgaya Hayfa, Hammadi Slim. Distributed Graphs for Solving Co-modal Transport Problems. International IEEE Conference on Intelligent Transportation Systems (ITSC), 2011, Oct 2011, Washington (DC), United States. pp.1150 - 1155, ⟨10.1109/ITSC.2011.6082906⟩. ⟨hal-00673792⟩