Applying Tabu Search Algorithm in Public Transport: A Case Study for University Students in Mauritius

Authors: J. Cheeneebash, S. Jugee

Abstract:

In this paper, the Tabu search algorithm is used to solve a transportation problem which consists of determining the shortest routes with the appropriate vehicle capacity to facilitate the travel of the students attending the University of Mauritius. The aim of this work is to minimize the total cost of the distance travelled by the vehicles in serving all the customers. An initial solution is obtained by the TOUR algorithm which basically constructs a giant tour containing all the customers and partitions it in an optimal way so as to produce a set of feasible routes. The Tabu search algorithm then makes use of a search procedure, a swapping procedure and the intensification and diversification mechanism to find the best set of feasible routes.

Keywords: Tabu Search, Vehicle Routing, Transport.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1060609

References:

[1] B. E. Gillet, and L.R. Miller, "A heuristic algorithm for the vehicle dispatch problem", Journal of Operations Research, 1974, 22, pp. 340- 349.
[2] F. Glover, and M. Laguna, "Tabu Search: Modern heuristic techniques for combinatorial problems", R.C Reeves, 1995, pp. 70-150.
[3] B. Golden et al, "The fleet size and mix vehicle routing problem", Computers and Operations Research, 1984, 11, pp. 49-66
[4] F.H. Liu, and S.Y. Shen, "The fleet size and mix vehicle routing problem with time windows", Journal of the Operational Research Society, 1999, 50, pp. 721- 732.