TY  - JOUR
T1  - OTEL SEÇİMLİ GEZGİN SATICI PROBLEMİ İÇİN  DEĞİŞKEN KOMŞU İNİŞ SEZGİSELİ
TT  - VARIABLE NEIGHBORHOOD DESCENT  FOR TRAVELLING SALESPERSON PROBLEM WITH HOTEL SELECTION
AU  - Akpınar, İpek Damla
AU  - Keçeci, Barış
PY  - 2020
DA  - June
Y2  - 2020
JF  - Journal of Turkish Operations Management
JO  - JTOM
PB  - METE GÜNDOĞAN
WT  - DergiPark
SN  - 2630-6433
SP  - 324
EP  - 335
VL  - 4
IS  - 1
LA  - tr
AB  - OtelSeçimli Gezgin Satıcı Problemi (OSGSP) Gezgin Satıcı Probleminin (GSP) bir çeşididir.OSGSP'nde çalışma süresi/mesafesi kısıtından dolayı tüm noktalar tek bir gündeziyaret edilememektedir. Bu problem NP-zor problem sınıfına girdiği içinsezgisel yöntem kullanılması çözüm zamanı açısından avantaj sağlamıştır. İlkolarak En Yakın Komşu Prensibi (EYKP) kullanılarak başlangıç çözüm eldeedilmiştir. Sonrasında bulunan bu çözümü iyileştirmek amacıyla Değişken Komşu İnişAlgoritması (DKİA)'ndan faydalanılmıştır. Algoritmalar Python dili ilekodlanmıştır. Literatürde var olan test problemleri üzerinde çeşitli ölçütlerkullanılarak denemeler yapılmıştır ve elde edilen sonuçlar var olan en iyiçözümler ile karşılaştırılarak algoritmanın performansı değerlendirilmiştir.
KW  - Gezgin satıcı problemi
KW  - otel seçimi
KW  - sezgisel algoritmalar
KW  - değişken komşu arama
N2  - TheTravelling Salesperson Problem with Hotel Selection (TSPHS) is a variant of TheTravelling Salesperson Problem (TSP). In case of TSPHS problem, all pointscannot be visited in a single day due to the restriction of working time /distance. Since this problem belongs to the NP-hard problem class, the use ofheuristic method has an advantage in terms of the solution time. The initialsolution is obtained using The Nearest Neighbor Algorithm (NN). In order toimprove this solution, the Variable Neighborhood Descent (VND) is used. Pythonlanguage is used for coding. The algorithms experiments are made on the testproblems in the literature using various criteria and the results obtained arecompared with the best available solutions and the performance of algorithm isevaluated.
CR  - Baltz, A., Ouali, M.E., Jӓger, G., Sauerland, V., Srivastav, A., "Exact And Heuristic Algorithms For The Travelling Salesman Problem With Multiple Time Windows And Hotel Selection", Journal Of The Operational Research Society, 66(4):615-626, (2014).
CR  - Castro, M., Sörensen, K., Vansteenwegen, P., Goos, P., "A Simple GRASP+VND For The Travelling Salesperson Problem With Hotel Selection", Technical Report, University of Antwerp, Faculty of Applied Economics, 024, (2012).
CR  - Castro, M., Sörensen, K., Vansteenwegen, P., Goos, P., "A Memetic Algorithm For The Travelling Salesperson Problem With Hotel Selection", Computers Operations Research, 40(7): 1716-1728, (2013).
CR  - Castro, M., Sörensen, K., Vansteenwegen, P., Goos, P., "A Fast Metaheuristic For The Travelling Salesperson problem With Hotel Selection", 4OR, 13(1): 15-34, (2014).
CR  - Divsalar, A., Vansteenwegen, P., Sörensen, K., Cattrysse, D., "A Memetic Algorithm For The Orienteering Problem With Hotel Selection", European Journal Of Operational Research, 237(1): 29-49, (2014).
CR  - Gencel, C.A., "Otel Seçimli Gezgin Satıcı Problemi İçin Yeni Matematiksel Modeller", Yüksek Lisans Tezi, Başkent Üniversitesi Fen Bilimleri Enstitüsü, Ankara, 2019.
CR  - Gencel, E., "Otel Seçimli Oryantiring Problemi İçin Yeni Matematiksel Modeller", Yüksek Lisans Tezi, Başkent Üniversitesi Fen Bilimleri Enstitüsü, Ankara, 2019.
CR  - Hansen, P. and N. Mladenovic, "A Tutorial On Variable Neighborhood Search", Technical Report G-2003-46, Les Cahiers du GERAD, HEC Montreal and GERAD, Canada (2003).
CR  - Hoek, S.V., "Tabu Search For The Orienteering Problem With Hotel Selection", Econometrics and Operations Research, (2016).
CR  - Lu, Y., Benlic, U., Wu, Q., "A Hybrid Dynamic programming And Memetic Algorithm To The Travelling Salesman Problem With Hotel Selection", Computers and Operations Research, 193-207, (2017).
CR  - Radmanesh, M., Kumar, M., Nemati, A., Sarim, M., "Solution Of  Traveling Salesman Problem With Hotel Selection In The Framework Of MILP-Tropical Optimization", American Control Conference (ACC), 6-8, (2016).
CR  - Sousa, M.M., Ochi, L.S., Martins, S.L., "An Efficient Heuristic To The Travelling Salesperson Problem With Hotel Selection", Hybrid Metaheuristics Conference, 31-45, (2019).
CR  - Toledo, A., Riff, M.C., "HOPHS: A Hyperheuristic That Solves Orienteering Problem With Hotel Selection", International Conference on Digital Information Processing and Communications (ICDIPC), (2015).
CR  - Vansteenwegen, P., Souffriau, W., Sörensen, K., "The Travelling Salesperson Problem With Hotel Selection", Journal Of The Operational Research Society, 63(2): 207–17, (2011).
UR  - https://dergipark.org.tr/tr/pub/jtom/issue//618165
L1  - https://dergipark.org.tr/tr/download/article-file/1201047
ER  -