The Application of Crisscross Optimization Algorithm to Dynamic Traffic Assignment Problem

Abstract

Obtaining the optimal travel time on dynamic traffic assignment(DTA) is very important for intelligent traffic system (ITS). A lot of approaches have been applied for DTA to make the travel time costing least, but current algorithms cannot be solved to guarantee optimality. In this paper, a method based on crisscross optimization algorithm(CSO) is introduced to solve DTA problem. This novel algorithm adopts a double-crisscross search mechanism. It differs from algorithms given in introduction. It uses crisscross programming to enhance performance. This paper aims at time-varying flows in dynamic system optimal model and using CSO algorithm to solve it. At last, we obtain traffic flow distribution data by designing a numerical example and employing simulation. We realized this algorithm converges to the optimal final solution.