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

Saved in:

Bibliographic Details
Title:	A variable neighbourhood descent algorithm with tabu mechanism for the time-constrained family travelling salesman problem.
Alternate Title:	Süre kısıtlı aile gezgin satıcı problemi için tabu mekanizmalı değişken komşu iniş algoritması.
Authors:	Akansu, Beyza Günesen¹ beyza.gunesen@gmail.com
Source:	Pamukkale University Journal of Engineering Sciences. 2026, Vol. 32 Issue 3, p459-467. 9p.
Subjects:	Traveling salesman problem, Tabu search algorithm, Mathematical optimization, Perturbation theory, Scheduling, Mathematical models, Metaheuristic algorithms
Abstract (English):	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 of the proposed problem was adapted accordingly, and a metaheuristic method was developed to produce high-quality solutions in shorter computation times. This method is a Variable Neighbourhood Descent algorithm, which uses four different neighbourhood structures and allows for more efficient searching of the solution space by adding a tabu list in some neighbourhood movements. A perturbation operator was also applied, diversifying the search by making huge modifications on the current solution. The proposed algorithm was compared with the results of the mathematical model and demonstrated better performance on the sample sets used. [ABSTRACT FROM AUTHOR]
Abstract (Turkish):	Bu çalışmada, Aile Gezgin Satıcı Problemi ele alınmış ve gerçek yaşam uygulamalarını daha doğru yansıtabilmek için modele zaman kısıtları dâhil edilmiştir. Önerilen problemin matematiksel modeli gerektiği şekilde uyarlanmış ve daha kısa sürelerde iyi çözümler elde edebilmek amacıyla bir meta-sezgisel yöntem geliştirilmiştir. Bu yöntem, dört farklı komşuluk yapısı kullanan ve bazı komşuluk hareketlerinde tabu listesi eklenerek çözüm uzayının daha verimli taranmasını sağlayan Değişken Komşu İniş algoritmasıdır. Ayrıca, çözüm üzerinde büyük değişiklikler yaparak aramayı çeşitlendiren bir bozulma operatörü de uygulanmıştır. Önerilen algoritma, matematiksel modelin sonuçlarıyla karşılaştırılmış ve kullanılan örnek setlerinde daha iyi performans göstermiştir. [ABSTRACT FROM AUTHOR]
	Copyright of Pamukkale University Journal of Engineering Sciences is the property of Pamukkale University Journal of Engineering Sciences (PAJES) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	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 of the proposed problem was adapted accordingly, and a metaheuristic method was developed to produce high-quality solutions in shorter computation times. This method is a Variable Neighbourhood Descent algorithm, which uses four different neighbourhood structures and allows for more efficient searching of the solution space by adding a tabu list in some neighbourhood movements. A perturbation operator was also applied, diversifying the search by making huge modifications on the current solution. The proposed algorithm was compared with the results of the mathematical model and demonstrated better performance on the sample sets used. [ABSTRACT FROM AUTHOR]
ISSN:	13007009
DOI:	10.65206/pajes.34901