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
A Novel Class of Multi-Agent Algorithms for Highly Dynamic Transport Planning Inspired by Honey Bee Behavior
ETFA ’07 - Proceedings of the 12th conference on emerging technologies and factory automation, IEEE Press, Patras, 2007-09


Commercial transport planning as well as individual intra-city or inter-city traffic in densely populated regions, both in Europe and the US, increasingly suffer from congestion problems, to an extent which e.g. affects predictable transport planning substantially (except – so far – for overnight tours). Due to the highly dynamic character of congestion forming and dissolving, no static approach like shortest path finding, applied globally or individually in car navigators, is adequate here: Its use even makes things worse as can be frequently observed. In this paper we present a completely decentralized multi-agent approach (termed BeeJamA) on multiple layers where car or truck routing are handled through algorithms adapted from the BeeHive algorithms which in turn have been derived from honey bee behavior. We report on extensive distributed simulation experiments in the BeeJamA project which demonstrate a very substantial improvement over traditional congestion handling.