A variable neighbourhood descent algorithm with tabu mechanism for the time-constrained family travelling salesman problem

In this study, the Family Travelling Salesman Problem is considered and time constraints are included in the model to better represent real-life applications. The mathematical model for the proposed problem has been adjusted as necessary and a metaheuristic method has been developed in order to achieve good solutions in shorter times. The method is a Variable Neighbour Descent algorithm using four different neighbourhood structures and a tabu list is added to the algorithm to be used in some neighbourhood movements to make the solution space search more efficient. The perturbation operator also diversifies the search by making large changes on the solution. The proposed algorithm was compared with the mathematical model results and performed better on the sample sets used.