Article ID: | iaor20071378 |
Country: | Singapore |
Volume: | 21 |
Issue: | 4 |
Start Page Number: | 543 |
End Page Number: | 560 |
Publication Date: | Dec 2004 |
Journal: | Asia-Pacific Journal of Operational Research |
Authors: | Ong H.L., Ng K.M., Kuan S.N. |
Keywords: | heuristics: tabu search, vehicle routing & scheduling |
This paper proposes the design and analysis of two metaheuristics, simulated annealing (SA) and tabu search (TS), for solving the feeder bus network design problem. The results are compared to those published in the literature. A comparative study is also carried out on several test problems generated at random to evaluate the performance of these heuristics in terms of their computational efficiency and solution quality. Computational experiments have shown that TS is a more effective metaheuristic in solving the problem than SA.