Skip to content
naulon
Not checkedNot checked for notices yet.

An integrated approach for dynamic traffic routing and ramp metering using sliding mode control

Hirsh Majid, Chao Lu, Hardy Karim

Journal of Traffic and Transportation Engineering (English ed. Online) · 2018

doi:10.1016/j.jtte.2017.08.002 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

The problem of designing integrated traffic control strategies for highway networks with the use of route guidance, ramp metering is considered. The highway network is simulated using a first order macroscopic model called LWR model which is a mathematical traffic flow model that formulates the relationships among traffic flow characteristics in terms of density, flow, and mean speed of the traffic stream. An integrated control algorithm is designed to solve the proposed problem, based on the inverse control technique and variable structure control (super twisting sliding mode). Three case studies have been tested in the presence of an on-ramp at each alternate route and where there is a capacity constraint in the network. In the first case study, there is no capacity constraint at either upstream or downstream of the alternate routes and the function of the proposed algorithm is only to balance the traffic flow on the alternate routes. In the second case study, there is capacity constraint at downstream of alternate routes. The proposed algorithm aims to avoid congestion on the main road and balance the traffic flow on the alternate routes. In the last case study, there is capacity constraint at upstream of alternate routes. The objective of proposed algorithm is to avoid congestion on the main road and to balance the traffic flow on the alternate routes. The obtained results show that the proposed algorithms can establish user equilibrium between two alternate routes even when the on-ramps, located at alternate routes, have different traffic demands.

Abstract licence: CC BY-NC-ND

References35

    35 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.