Andere Kunden interessierten sich auch für
![A Study of Route Planning Algorithms for Travelling Salesman Problem]( "A Study of Route Planning Algorithms for Travelling Salesman Problem")
A Study of Route Planning Algorithms for Travelling Salesman Problem26,99 €![Route Optimization With Ant Colony Optimization (ACO)]( "Route Optimization With Ant Colony Optimization (ACO)")
Route Optimization With Ant Colony Optimization (ACO)32,99 €![Electronic Ticket Machine]( "Electronic Ticket Machine")
Electronic Ticket Machine26,99 €![Me hacker - you script kiddy !]( "Me hacker - you script kiddy !")
Me hacker - you script kiddy !7,99 €![Pretty Good Privacy]( "Pretty Good Privacy")
Pretty Good Privacy25,99 €![Watchman Route Problem]( "Watchman Route Problem")
Watchman Route Problem19,99 €![Identification of Optimum Route Alignment in LS areas Using GIS & RS]( "Identification of Optimum Route Alignment in LS areas Using GIS & RS")
Identification of Optimum Route Alignment in LS areas Using GIS & RS44,99 €
Dynamic routing algorithms play an important role in avoiding congestion over road traffic routing. The application of Dynamic Routing algorithm provides the best routes that minimize traffic congestion. The utilization of Ants algorithms in road network routing has been studied extensively by many researchers. One of the popular algorithms which are widely adopted in road traffic routing is the AntNet algorithm. In this work, the utilization of AntNet routing algorithm has been further enhanced and applied for the dynamic routing of road traffic network. This enhanced algorithm, not only, reduces computation which, consequently, decreases the computational complexity; but also, discovers an agile good solution and dynamically conserves the discovered good route. The enhancement of the algorithm is accomplished, by introducing a new type of ants called check ants and defining a new data updating strategy for the backward ant.