Publication:
A hybrid meta-heuristic algorithm for vehicle routing and packing problem with cross-docking

dc.contributor.authorKüçükoğlu, İlker
dc.contributor.authorÖztürk, Nursel
dc.contributor.buuauthorKÜÇÜKOĞLU, İLKER
dc.contributor.buuauthorÖZTÜRK, NURSEL
dc.contributor.departmentMühendislik Fakültesi
dc.contributor.departmentEndüstri Mühendisliği Bölümü
dc.contributor.orcid0000-0002-5075-0876
dc.contributor.orcid0000-0002-9835-0783
dc.contributor.researcheridAAG-9336-2021
dc.contributor.researcheridD-8543-2015
dc.date.accessioned2024-07-17T05:17:52Z
dc.date.available2024-07-17T05:17:52Z
dc.date.issued2019-12-01
dc.description.abstractCross-docking is a relatively new logistics strategy that has a great potential to eliminate storage cost and speed up the product flows. This paper considers the vehicle routing and packing problem with cross-docking and presents a mixed integer linear mathematical model. In the model, a set of trucks are used to transport products from suppliers to customers through cross-docking centers. Each supplier and customer node can be visited only once and directly shipping is not allowed from suppliers to customers. Moreover, truck capacities are identified with physical dimensional limits on the contrary of weight or amount of load. The objective of the study is to determine the vehicle routes that minimize the total distance. Due to the complexity of the mathematical model, a hybrid meta-heuristic algorithm (HMA), which integrates tabu search (TS) algorithm within simulated annealing (SA) algorithm, is proposed to solve the problem. Proposed HMA is tested on a well-known benchmark problem data set and compared with the SA and TS solutions. Results show that proposed HMA can produce effective solutions and outperforms the SA and TS especially for the large-sized problems.
dc.identifier.doi10.1007/s10845-015-1156-z
dc.identifier.eissn1572-8145
dc.identifier.endpage2943
dc.identifier.issn0956-5515
dc.identifier.issue8
dc.identifier.startpage2927
dc.identifier.urihttps://doi.org/10.1007/s10845-015-1156-z
dc.identifier.urihttps://link.springer.com/article/10.1007/s10845-015-1156-z
dc.identifier.urihttps://hdl.handle.net/11452/43295
dc.identifier.volume30
dc.identifier.wos000496662600009
dc.indexed.wosWOS.SCI
dc.language.isoen
dc.publisherSpringer
dc.relation.journalJournal of Intelligent Manufacturing
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectTabu search
dc.subjectScheduling problem
dc.subjectParallel machines
dc.subjectTime
dc.subjectOptimization
dc.subjectFlowshop
dc.subjectHybrid meta-heuristic algorithm
dc.subjectCross-docking
dc.subjectVehicle routing
dc.subject2-dimensional vehicle loading
dc.subjectScience & technology
dc.subjectTechnology
dc.subjectComputer science, artificial intelligence
dc.subjectEngineering, manufacturing
dc.subjectComputer science
dc.subjectEngineering
dc.titleA hybrid meta-heuristic algorithm for vehicle routing and packing problem with cross-docking
dc.typeArticle
dspace.entity.typePublication
local.contributor.departmentMühendislik Fakültesi/Endüstri Mühendisliği Bölümü
relation.isAuthorOfPublication3715d274-af41-48cd-a5d7-8b2b7cd50a1a
relation.isAuthorOfPublication87300a81-21ba-4066-b79e-9393c516973f
relation.isAuthorOfPublication.latestForDiscovery3715d274-af41-48cd-a5d7-8b2b7cd50a1a

Files

Collections