Jump label

Service navigation

Main navigation

You are here:

Sub navigation

Main content


Horst F. Wedde, Sebastian Lehnhoff, Bernhard van Bonn, Z. Bay, S. Becker, S. Boettcher, C. Brunner, A. Buescher, T. Fuerst, A. M. Lazarescu, E. Rotaru, S. Senge, B. Steinbach, F. Yilmaz und T. Zimmermann
Highly Dynamic and Adaptive Traffic Congestion Avoidance in Real-Time Inspired by Honey Bee Behavior
PEARL 2007 - Informatik Aktuell - Mobilitaet und Echtzeit, Springer, Boppard, Germany, 2007-12


Traffic congestions have become a major problem in metropolitan areas world-wide, within and between cities, to an extent where they make driving and transportation times largely unpredictable in such densely populated areas. Due to the highly dynamic character of congestion building and dissolving this phenomenon appears even to resist a formal treatment. Static approaches, and even more their global management, have proven counterproductive in practice. Given the latest progress in VANET technology and the remarkable commercially driven efforts like in the European C2C consortium, or the VSC Project in the US, allow meanwhile to tackle various aspects of traffic regulation through VANET communication. In this paper we introduce a novel, completely decentralized multi-agent routing algorithm (termed BeeJamA) which we have derived from the foraging behavior of honey bees. It is highly dynamic, adaptive, robust, and scalable, and it allows for both avoiding congestions, and minimizing traveling times to individual destinations. Vehicle guidance is provided well ahead of every intersection, depending on the individual speeds. Thus strict deadlines are imposed on, and respected by, the BeeJamA algorithm. We report on extensive simulation experiments which show the superior performance of BeeJamA over conventional approaches.