A DECENTRALIZED ROUTE GUIDANCE ALGORITHM IN URBAN TRANSPORTATION NETWORKS

Ludovica Adacher, Gaia Nicosia

Abstract

In the last decades, due to the increasing car traffic and the limited capacity of urban networks, algorithms for traffic management and route guidance are becoming more and more important. GPS technology can be used for fleet monitoring in urban or suburban areas, from a central monitoring station and may provide useful information concerning the movement of all vehicles. Current route guidance systems are simple from an algorithmic point of view (they compute shortest paths to the destination), but they have to deal with huge size networks. For this reason, a decentralized approach, in which each vehicle independently calculates its own route, is desirable. Naturally, to limit the congestion due the vehicles decisions, an estimate on the different possible routes is required. Hence, we propose a decentralized algorithm in which each vehicle computes its own route on the basis of the traffic information provided by the reference station. Moreover, we propose a method for forcing vehicles to choose different paths and for informing the reference station on the routes of all vehicles, so that traffic forecast is updated.

References

  1. Adler J. L., Blue V. J., 1998. Toward the design of intelligent traveller information systems. Transportation Research C, 6:157-172.
  2. Adler J. L., Blue V. J, 2002. A cooperative Multi-agent transportation management and route guidance system. Transportation Research C. 433-454.
  3. Ben-Akiva M. E., De Palma A. , and Kaysi I., 1991. Dynamic network models and driver . Transportation Research A, 25:251-266.
  4. Ford L. R., Fulkerson D. R., 1958. Constructing maximal dynamic flows from static flows. Operations Research 6: 418-433.
  5. Fresz T. L., 1985. Transportation network equilibrium design and aggregation: key development and research opportunities. Transportation Research A., 19:413-427.
  6. Jahn O., Möhring R. H., Schulz A. S., Stier Moses N. E., 2002. System Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion, Technical Report 754/2002 Technische Universität Berlin.
  7. Jahn O., Möhring R. H., Schulz A. S., 1999. Optimal Routing of Traffic flows with length restrictions in networks with congestion. Technical Report 658/1999 Technische Universität Berlin.
  8. Lee C. K., 1994. A multiple-path routing strategy for route guidance systems. Transportation research C, 2:185- 195.
  9. Rilett L.R., van Aerde M. W., 1991. Modeling distributed real-time guidance strategies in a traffic network that exhibits the Braess paradox. In proceedings of IEEE Vehicle Navigation and Information Systems Conference.
  10. Roughgarden T., Tardos E., 2000. How bad is selfish routing?. In proc. of the 41st annual IEEE, symposium on foundation of computer science FOX'00.
  11. Wardrop J. G., 1952. Some theoretical aspects of road traffic research ,Proceeding of the Institution of civil engineers.
Download


Paper Citation


in Harvard Style

Adacher L. and Nicosia G. (2004). A DECENTRALIZED ROUTE GUIDANCE ALGORITHM IN URBAN TRANSPORTATION NETWORKS . In Proceedings of the First International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 972-8865-12-0, pages 318-321. DOI: 10.5220/0001145603180321


in Bibtex Style

@conference{icinco04,
author={Ludovica Adacher and Gaia Nicosia},
title={A DECENTRALIZED ROUTE GUIDANCE ALGORITHM IN URBAN TRANSPORTATION NETWORKS},
booktitle={Proceedings of the First International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2004},
pages={318-321},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001145603180321},
isbn={972-8865-12-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the First International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - A DECENTRALIZED ROUTE GUIDANCE ALGORITHM IN URBAN TRANSPORTATION NETWORKS
SN - 972-8865-12-0
AU - Adacher L.
AU - Nicosia G.
PY - 2004
SP - 318
EP - 321
DO - 10.5220/0001145603180321