A linear programming based decentralized routing controller for congested highways

Iftar A.

AUTOMATICA, vol.35, no.2, pp.279-292, 1999 (SCI-Expanded) identifier identifier identifier

  • Publication Type: Article / Article
  • Volume: 35 Issue: 2
  • Publication Date: 1999
  • Doi Number: 10.1016/s0005-1098(98)00146-0
  • Journal Name: AUTOMATICA
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.279-292
  • Keywords: transportation systems, traffic control, traffic networks, routing control, optimization, decentralized control, TRAFFIC NETWORKS
  • Anadolu University Affiliated: No


A decentralized controller for dynamic routing in multidestination trasportation networks is presented. The proposed algorithm is especially suited for congested networks, where the traffic demand is close to or more than (at least for some duration of time, e.g., during a rush hour) the total capacity of the network. The basic aim of the introduced approach is to avoid queue build-up for as large external arrival rates as possible. It is shown that this problem can be formulated as a linear programming problem, and can be solved off-line. The proposed controller is decentralized in the sense that all the on-line computations are done locally at the nodes without any information transfer from the other nodes. Furthermore, no synchronization among the nodes is needed. The controller guarantees stability and clears the queues of the network in finite time assuming that the external arrival rates do not become larger than a maximum value. The controller also avoids looping. (C) 1999 Elsevier Science Ltd. All rights reserved.