A New Ant Colony Routing Approach With a Trade-Off Between System and User Optimum
Dynamic Traffic Routing (DTR) refers to the process of (re)directing traffic at junctions in a traffic network corresponding to the evolving traffic conditions as time progresses. This paper considers the DTR problem for a traffic network defined as a directed graph, and deals with the mathematical aspects of the resulting optimization problem from the viewpoint of network flow theory. Traffic networks may have thousands of links and nodes, resulting in a sizable and computationally complex nonlinear, non-convex DTR optimization problem. To solve this problem Ant Colony Optimization (ACO) is chosen as the optimization method in this paper because of its powerful optimization heuristic for combinatorial optimization problems.