When using a heuristic for combinational problems, local
search is always considered as a efficient way to improve the solution.
In this study, a neighborhood search algorithm is introduced
to enlarge the local search ability of the ACO. The 2-opt exchange
(Bullnheimer et al., 1999) is also used to improve the solution.