Abstract
This letter proposes a new tabu search heuristic to select the optimal traffic route. The traffic network is completely assumed to be covered by a mesh structure. The objective is to minimize total necessary time to the goals of all cars. In the other words, it can be resolved into the minimization of total stoppage time. Each car has been assigned some routes in advance, and then all routes are numbered. Tabu search gives the best route-numbers to all the cars so as to avoid congestion. The method makes use of not only usual tabu lists but also a move frequency-based memory and a residence measure memory.
