An online information system to balance traffic flows in urban areas

In this paper, we study the problem offinding the Origin-Destination (0-0) shortest path in intermodal transportation networks, aiming at minimizing the travel time. The transportation network and the corresponding data are modeled by means of a multi-label graph. The intermodal shortest path problem and its definition are briefly described. The algorithm developed to find the path is presented, especially by detailing o label correcting approach that updotes some labels associated with the graph nodes. The implementafion of this approach and the results it provides show its va1idiQ.

show abstract

A Distributed Approach based on Transition Graph for Resolving Multimodal Urban Transportation Problem

Moufid¹,

Nadir²,

Boukhdir³

et al. 2019

IJACSA

View full text Add to dashboard Cite

All over the world, many research studies focus on developing and enhancing real-time communications between various transport stakeholders in urban environments. Such motivation can be justified by the growing importance of pollution caused by the transport sector in urban areas. In this work, we propose an approach of assistance for displacement in urban environment taking advantages of multimodal urban transportation means, where several modes of public transports are available. In addition, we also consider the possibility of using both private modes of transport and cities parking. The proposed distributed approach described in this paper is based on an abstraction of a city multimodal graph according to the available modes of public transport and road traffic and transition graph approach to move from a mode to the other mode. Numerical results are developed to justify the effectiveness of our approach.

show abstract

An online information system to balance traffic flows in urban areas

Cited by 3 publications

References 4 publications

A new time-dependent shortest path algorithm for multimodal transportation network

A new time-dependent shortest path algorithm for multimodal transportation network

An exact method to find the intermodal shortest path (ISP)

A Distributed Approach based on Transition Graph for Resolving Multimodal Urban Transportation Problem

Contact Info

Product

Resources

About