Download Now Free registration required
In this paper, the authors want to implement the solution of combinatorial problem, based on the heuristic behavior of ant. This paper focuses on a highly developed solution procedure using ACO algorithm. This helps to solve routing problems easily. It also reflects the method considering flow, distance, cost, and emergency etc. Here, a new algorithm named UVTR (Update Vehicle Traffic Routing) is represented to overcome the complexity of the previous algorithm. It yields the typical process for removing traffic problems in case of flow, distance and cost, etc. This formulation is represented with systematic rules based case study for the Dhaka City.
- Format: PDF
- Size: 166.84 KB