By Topic

Ant colony inspired algorithm for adaptive traffic routing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Pavel Krömer ; Department of Computer Science, V B - Technical University of Ostrava, 17. listopadu 15, 708 33, Ostrava-Poruba, Czech Republic ; Jan Martinovič ; Michal Radecký ; Radek Tomis
more authors

In this paper we present a new dynamic nature inspired algorithm for the enhancement of routing in problematic parts of the road network affected by traffic jams, accidents and so on. The algorithm is intended to improve the quality of navigation in the critical sections of road network or in its parts affected by accidents. By the Ant Colony Algorithm we search for new up-to-date information characterizing each road in the network in or near the problematic area. We select start and end points and process the roads between them. The result of the optimization can be used for dynamic adaptation of the map information in traditional navigation systems.

Published in:

Nature and Biologically Inspired Computing (NaBIC), 2011 Third World Congress on

Date of Conference:

19-21 Oct. 2011