A Multi-Start Granular Skewed Variable Neighborhood Tabu Search for the Roaming Salesman Problem

Basit Öğe Kaydı
dc.contributor.authorShahmanzari, M.
dc.contributor.authorAksen D.
dc.date.accessioned2021-01-25T21:48:03Z
dc.date.available2021-01-25T21:48:03Z
dc.date.issued2021
dc.departmentİstanbul Ticaret Üniversitesien_US
dc.description.abstractThis paper presents a novel hybrid metaheuristic algorithm for the Roaming Salesman Problem (RSP), called Multi-Start Granular Skewed Variable Neighborhood Tabu Search (MS-GSVNTS). The objective in RSP is to design daily tours for a traveling campaigner who collects rewards from activities in cities during a fixed planning horizon. RSP exhibits a number of exclusive features: It is selective which implies that not every node needs a visit. The rewards of cities are time-dependent. Daily tours can be either an open or a closed tour which implies the absence of a fixed depot. Instead, there is a campaign base that is to be attended frequently. Multiple visits are allowed for certain cities. The proposed method MS-GSVNTS is tested on 45 real-life instances from Turkey which are built with actual travel distances and times and on 10 large scale instances. Computational results suggest that MS-GSVNTS is superior to the existing solution methods developed for RSP. It produces 50 best known solutions including 18 ties and 32 new ones. The performance of MS-GSVNTS can be attributed to its multi-start feature, rich neighborhood structures, skewed moves, and granular neighborhoods. © 2020 Elsevier B.V.en_US
dc.description.sponsorshipThe authors gratefully acknowledge the constructive comments and suggestions of three anonymous reviewers as well as those of the handling editor which were shared promptly in a troublesome period of 2020 tarnished by the COVID-19 pandemic.en_US
dc.identifier.doi10.1016/j.asoc.2020.107024en_US
dc.identifier.scopus2-s2.0-85099253826en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.urihttps://doi.org/10.1016/j.asoc.2020.107024
dc.identifier.urihttps://hdl.handle.net/11467/4497
dc.identifier.volume102en_US
dc.identifier.wosWOS:000632599300001en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherElsevier Ltden_US
dc.relation.ispartofApplied Soft Computingen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectCampaign planningen_US
dc.subjectElection logisticsen_US
dc.subjectMetaheuristicsen_US
dc.subjectRoaming Salesman Problemen_US
dc.subjectVariable Neighborhood Searchen_US
dc.titleA Multi-Start Granular Skewed Variable Neighborhood Tabu Search for the Roaming Salesman Problemen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
İsim:
1-s2.0-S1568494620309637-main.pdf
Boyut:
2.04 MB
Biçim:
Adobe Portable Document Format
Açıklama:
İndir

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu
WoS İndeksli Yayınlar Koleksiyonu