An advanced hybrid meta-heuristic algorithm for the vehicle routing problem with backhauls and time windows

Simple item page
dc.contributor.buuauthorKüçükoğlu, İlker
dc.contributor.buuauthorÖztürk, Nursel
dc.contributor.departmentUludağ Üniversitesi/Mühendislik Fakültesi/Endüstri Mühendisliği Bölümü.tr_TR
dc.contributor.orcid0000-0002-5075-0876tr_TR
dc.contributor.researcheridD-8543-2015tr_TR
dc.contributor.researcheridAAG-9336-2021tr_TR
dc.contributor.scopusid55763879600tr_TR
dc.contributor.scopusid7005688805tr_TR
dc.date.accessioned2022-09-09T08:10:10Z
dc.date.available2022-09-09T08:10:10Z
dc.date.issued2015-08
dc.description.abstractThis paper presents an advanced hybrid meta-heuristic algorithm (HMA) to solve the vehicle routing problem with backhauls and time windows (VRPBTW). The VRPBTW is an extension of the vehicle routing problem with time windows (VRPTW) and the vehicle routing problem with backhauls (VRPB) that includes capacity, backhaul and time window constraints. In this problem, the customers are divided into two subsets consisting of linehaul and backhaul customers. Each vehicle starts from the depot, and goods are delivered from the depot to the linehaul customers. Goods are subsequently returned to the depot from the backhaul customers. The objective is to minimize the total distance that satisfies all of the constraints. The proposed meta-heuristic method is tested on a problem data set obtained from Solomon's VRPTW benchmark problems which includes 25, 50 and 100 demand nodes. The results of the computational studies show that the HMA outperforms the existing studies and provides better solutions than the best known solutions in practical computational times.tr_TR
dc.identifier.citationKüçükoğlu, İ. ve Öztürk, N. (2015). "An advanced hybrid meta-heuristic algorithm for the vehicle routing problem with backhauls and time windows". Computers and Industrial Engineering, 86, 60-68.en_US
dc.identifier.endpage68tr_TR
dc.identifier.issn0360-8352
dc.identifier.issn1879-0550
dc.identifier.scopus2-s2.0-84940654817tr_TR
dc.identifier.startpage60tr_TR
dc.identifier.urihttps://doi.org/10.1016/j.cie.2014.10.014
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S0360835214003453
dc.identifier.urihttp://hdl.handle.net/11452/28602
dc.identifier.volume86tr_TR
dc.identifier.wos000358804500007tr_TR
dc.indexed.scopusScopusen_US
dc.indexed.wosSCIEen_US
dc.language.isoenen_US
dc.publisherPergamon Elsevier Scienceen_US
dc.relation.journalComputers and Industrial Engineeringen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergitr_TR
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectComputer scienceen_US
dc.subjectEngineeringen_US
dc.subjectVehicle routing problemen_US
dc.subjectHybrid meta-heuristic algorithmen_US
dc.subjectSimulated annealingen_US
dc.subjectTabu searchen_US
dc.subjectScheduling Problemsen_US
dc.subjectOptimizationen_US
dc.subjectDeliveryen_US
dc.subjectPickupen_US
dc.subjectAlgorithmsen_US
dc.subjectHeuristic algorithmsen_US
dc.subjectHybrid vehiclesen_US
dc.subjectNetwork routingen_US
dc.subjectRouting algorithmsen_US
dc.subjectSalesen_US
dc.subjectSimulated annealingen_US
dc.subjectHeuristic methodsen_US
dc.subjectVehicle routingen_US
dc.subjectVehiclesen_US
dc.subjectBench-mark problemsen_US
dc.subjectComputational studiesen_US
dc.subjectComputational timeen_US
dc.subjectHybrid meta-heuristicen_US
dc.subjectMeta-heuristic methodsen_US
dc.subjectTime window constrainten_US
dc.subjectVehicle routing problem with time windowsen_US
dc.subjectVehicle routing problemsen_US
dc.subject.scopusTime Windows; Pickup and Delivery; Dynamic Routingen_US
dc.subject.wosComputer science, interdisciplinary applicationsen_US
dc.subject.wosEngineering, industrialen_US
dc.titleAn advanced hybrid meta-heuristic algorithm for the vehicle routing problem with backhauls and time windowsen_US
dc.typeArticle
dc.wos.quartileComputer science, interdisciplinary applications (Q2)en_US
dc.wos.quartileEngineering, industrial (Q1)en_US

Files

License bundle
Now showing 1 - 1 of 1
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Web of Science
Scopus