An algorithm of lane change using two-lane NaSch model in traffic networks

Few researches focus on lane change decisions achieving space or time optimality. In order to improve traffic efficiency, this paper studies the lane change problem. The goal of the lane change problem is to reduce the additional road space before all vehicles change to their target lanes. The widely adopted Nagel-Schreckenberg (NaSch) model is utilized, which reflects plenty of natural characteristics of actual traffic. An optimal lane change algorithm is proposed. Simulation shows that our approach outperforms the random lane change method. Typically, the performance is improved by 77.4% when the density of vehicles is 80% and the percentage of vehicles that requires lane change is 100%.