Vehicle routing with compartments under product incompatibility constraints [Ürün karişmama kisitlari altinda çok kompartimanli araç rotalama]
Küçük Resim Yok
Tarih
2019
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Faculty of Transport and Traffic Engineering
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
This study focuses on a distribution problem involving incompatible products which cannot be stored in a compartment of a vehicle. To satisfy different types of customer demand at minimum logistics cost, the products are stored in different compartments of fleet vehicles, which requires the problem to be modeled as a multiple-compartment vehicle routing problem (MCVRP). While there is an extensive literature on the vehicle routing problem (VRP) and its numerous variants, there are fewer research papers on the MCVRP. Firstly, a novel taxonomic framework for the VRP literature is proposed in this study. Secondly, new mathematical models are proposed for the basic MCVRP, together with its multiple-trip and split-delivery extensions, for obtaining exact solutions for small-size instances. Finally, heuristic algorithms are developed for larger instances of the three problem variants. To test the performance of our heuristics against optimum solutions for larger instances, a lower bounding scheme is also proposed. The results of the computational experiments are reported, indicating validity and a promising performance of an approach. © 2019, Faculty of Transport and Traffic Engineering. All rights reserved.
Açıklama
Anahtar Kelimeler
Heuristic algorithms, Incompatible products, Mathematical model, Multiple trips, Multiple-compartment vehicle routing problem, Split delivery
Kaynak
Promet - Traffic - Traffico
WoS Q Değeri
Scopus Q Değeri
Q2
Cilt
31
Sayı
1
