The TS metaheuristic firstly proposed by Glover (1990) was extensively used to solve hard constrained optimization problems, especially routing problems. Due to its capability in escaping local optima by the use a tabu list and the neighborhood generation, it performs well in generating promising solutions in a reasonable computation time (see Table 1).