A variable neighbourhood descent algorithm with tabu mechanism for the time-constrained family travelling salesman problem.
Saved in:
| 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ünesen1 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 |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 194421181 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A variable neighbourhood descent algorithm with tabu mechanism for the time-constrained family travelling salesman problem. – Name: TitleAlt Label: Alternate Title Group: TiAlt Data: Süre kısıtlı aile gezgin satıcı problemi için tabu mekanizmalı değişken komşu iniş algoritması. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Akansu%2C+Beyza+Günesen%22">Akansu, Beyza Günesen</searchLink><relatesTo>1</relatesTo><i> beyza.gunesen@gmail.com</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Pamukkale+University+Journal+of+Engineering+Sciences%22">Pamukkale University Journal of Engineering Sciences</searchLink>. 2026, Vol. 32 Issue 3, p459-467. 9p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Traveling+salesman+problem%22">Traveling salesman problem</searchLink><br /><searchLink fieldCode="DE" term="%22Tabu+search+algorithm%22">Tabu search algorithm</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+optimization%22">Mathematical optimization</searchLink><br /><searchLink fieldCode="DE" term="%22Perturbation+theory%22">Perturbation theory</searchLink><br /><searchLink fieldCode="DE" term="%22Scheduling%22">Scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+models%22">Mathematical models</searchLink><br /><searchLink fieldCode="DE" term="%22Metaheuristic+algorithms%22">Metaheuristic algorithms</searchLink> – Name: Abstract Label: Abstract (English) Group: Ab Data: 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] – Name: Abstract Label: Abstract (Turkish) Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=194421181 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.65206/pajes.34901 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 9 StartPage: 459 Subjects: – SubjectFull: Traveling salesman problem Type: general – SubjectFull: Tabu search algorithm Type: general – SubjectFull: Mathematical optimization Type: general – SubjectFull: Perturbation theory Type: general – SubjectFull: Scheduling Type: general – SubjectFull: Mathematical models Type: general – SubjectFull: Metaheuristic algorithms Type: general Titles: – TitleFull: A variable neighbourhood descent algorithm with tabu mechanism for the time-constrained family travelling salesman problem. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Akansu, Beyza Günesen IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 04 Text: 2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 13007009 Numbering: – Type: volume Value: 32 – Type: issue Value: 3 Titles: – TitleFull: Pamukkale University Journal of Engineering Sciences Type: main |
| ResultId | 1 |
