Please use this identifier to cite or link to this item: http://hdl.handle.net/11452/29969
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDewil, Reginald-
dc.contributor.authorCattrysse, Dirk-
dc.date.accessioned2022-12-20T06:11:33Z-
dc.date.available2022-12-20T06:11:33Z-
dc.date.issued2019-05-27-
dc.identifier.citationKüçükoğlu, İ. vd. (2019). ''Hybrid simulated annealing and tabu search method for the electric travelling salesman problem with time windows and mixed charging rates''. Expert Systems with Applications, 134, 279-303.en_US
dc.identifier.issn0957-4174-
dc.identifier.issn1873-6793-
dc.identifier.urihttps://doi.org/10.1016/j.eswa.2019.05.037-
dc.identifier.urihttp://hdl.handle.net/11452/29969-
dc.description.abstractThe electric travelling salesman problem with time windows (ETSPTW) is an extension of the well-known travelling salesman problem with time windows (TSPTW). The ETSPTW additionally considers recharging operations of the electric vehicle at identical charging stations. However, different charging technologies used at public or private stations result in different charging times of the electric vehicles. Therefore, this study extends the ETSPTW by additionally considering charging operations at customer locations with different charging rates, called hereafter the electric travelling salesman problem with time windows and mixed charging rates (ETSPTW-MCR). To the best of our knowledge, this is the first study that considers both private and public charging stations for the ETSPTW. In addition to the extended version of the ETSPTW, this paper introduces a new and effective hybrid Simulated Annealing/Tabu Search (SA/TS) algorithm to solve the ETSPTW-MCR problem efficiently. Distinct from the existing hybridization of SA and TS, the proposed hybrid SA/TS algorithm employs efficient search procedures based on the TSPTW restrictions, a modified solution acceptance criterion, and an advanced tabu list structure. Moreover, an improved dynamic programming procedure is integrated to optimally find the charging station visits in shorter computational times. The proposed hybrid SA/TS is tested on several TSPTW and ETSPTW benchmark problems and compared with well-known solution approaches. Results of these experiments show that the proposed algorithm outperforms the other considered competitor algorithms both with regard to solution quality and computational time. Furthermore, 26 new best results are obtained for the ETSPTW instances. In addition, the hybrid algorithm is applied to a new problem set generated for the ETSPTW-MCR by extending the ETSPTW problems found in the literature. Comparisons with the ETSPTW results show that significant distance savings are found for most of the instances by charging the electric vehicle at customer locations. As a result of the computational studies, it should be concluded that the proposed algorithm is capable of finding efficient and more realistic route plans for the electric vehicles.en_US
dc.language.isoenen_US
dc.publisherPergamon-Elsevier Scienceen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rightsAtıf Gayri Ticari Türetilemez 4.0 Uluslararasıtr_TR
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectTravelling salesmanen_US
dc.subjectElectric vehiclesen_US
dc.subjectMetaheuristicsen_US
dc.subjectDynamic programmingen_US
dc.subjectVehicle-Routing problemen_US
dc.subjectOptimizationen_US
dc.subjectAlgorithmsen_US
dc.subjectStationen_US
dc.subjectFormulationen_US
dc.subjectComputer scienceen_US
dc.subjectEngineeringen_US
dc.subjectOperations research & management scienceen_US
dc.subjectCharging timeen_US
dc.subjectComputational efficiencyen_US
dc.subjectDynamic programmingen_US
dc.subjectElectric vehiclesen_US
dc.subjectSimulated annealingen_US
dc.subjectTabu searchen_US
dc.subjectVehiclesen_US
dc.subjectAcceptance criteriaen_US
dc.subjectBench-mark problemsen_US
dc.subjectComputational studiesen_US
dc.subjectComputational timeen_US
dc.subjectHybrid simulated annealingen_US
dc.subjectMeta heuristicsen_US
dc.subjectTraveling salesman problemen_US
dc.titleHybrid simulated annealing and tabu search method for the electric travelling salesman problem with time windows and mixed charging ratesen_US
dc.typeArticleen_US
dc.typePreprinten_US
dc.identifier.wos000475997000023tr_TR
dc.identifier.scopus2-s2.0-85067174155tr_TR
dc.relation.tubitakTÜBİTAKtr_TR
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergitr_TR
dc.contributor.departmentBursa Uludağ Üniversitesi/Mühendislik Fakültesi/Endüstri Mühendisliği Bölümü.tr_TR
dc.contributor.orcid0000-0002-5075-0876tr_TR
dc.identifier.startpage279tr_TR
dc.identifier.endpage303tr_TR
dc.identifier.volume134tr_TR
dc.relation.journalExpert Systems with Applicationsen_US
dc.contributor.buuauthorKüçükoğlu, İlker-
dc.contributor.researcheridD-8543-2015tr_TR
dc.relation.collaborationYurt dışıtr_TR
dc.subject.wosComputer science, artificial intelligenceen_US
dc.subject.wosEngineering, electrical & electronicen_US
dc.subject.wosOperations research & management scienceen_US
dc.indexed.wosSCIEen_US
dc.indexed.wosSSCIen_US
dc.indexed.scopusScopusen_US
dc.wos.quartileQ1en_US
dc.contributor.scopusid55763879600tr_TR
dc.subject.scopusElectric Vehicles; Charging; Stationen_US
Appears in Collections:Scopus
Web of Science

Files in This Item:
File Description SizeFormat 
Küçükoğlu_vd_2019.pdf787.65 kBAdobe PDFThumbnail
View/Open


This item is licensed under a Creative Commons License Creative Commons