Please use this identifier to cite or link to this item: https://hdl.handle.net/11499/56257
Title: Heuristic algorithms for solving the multi-compartment vehicle routing problem with time windows and heterogeneous fleet
Authors: Topaloğlu, Duygu
Polat, Olcay
Kalaycı, Can Berk
Keywords: Logistics
Routing
Split delivery
Multi-compartment
Time window
Heuristic algorithms
Variable Neighborhood Search
Bee Colony Algorithm
Tabu Search
Simultaneous Pickup
Memetic Algorithm
Depot
Delivery
Publisher: Pamukkale Univ
Abstract: The use of multi-compartment vehicles is an efficient solution for distributing different products that cannot be transported in the same compartment. In this study, the vehicle routing problem with time windows is addressed by considering the use of a heterogeneous fleet and multi-compartment vehicles. The variant of the problem discussed in this study is known as the Heterogeneous Fleet Multi-Compartment Vehicle Routing Problem (MCVRPTWHF). In this study, the Variable Neighborhood Search algorithm (VNS) and the Artificial Bee Colony Algorithm (ABCA) have been adapted to solve the problem. Well-known datasets have been adapted to fit the problem structure in order to analyze the performance of the algorithms. Comparative results reveal that the developed algorithms effectively solve the generated datasets. It has been observed that the DKA algorithm has significant numerical superiority compared to YAKA.
URI: https://doi.org/10.5505/pajes.2023.50280
https://hdl.handle.net/11499/56257
ISSN: 1300-7009
2147-5881
Appears in Collections:Honaz Meslek Yüksekokulu Koleksiyonu
Mühendislik Fakültesi Koleksiyonu
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Files in This Item:
File SizeFormat 
PAJES-50280-RESEARCH_ARTICLE-TOPALOGLU.pdf821.11 kBAdobe PDFView/Open
Show full item record



CORE Recommender

Page view(s)

126
checked on Aug 24, 2024

Download(s)

64
checked on Aug 24, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.