Georgios Papadomarkakis, "Tabu Search algorithm for vehicle routing problems", Diploma Work, School of Production Engineering and Management, Technical University of Crete, Chania, Greece, 2018
https://doi.org/10.26233/heallink.tuc.80948
Given seven data sets containing clients' characteristics in combination with the constraints of vehicle's capacity and vehicle's permissible stay duration on the road we attempt to reach a optimized cost for the procedure. Firstly, using nearest neighbour algorithm we form initial solution. To continue, local serach algorithms of relocate 1-0 and exchange 1-1 try to give us a better result from the initial cost. Finaly, the final result is exported from the Tabu Search algorithm in combination with the procedures of intensification and diversification.