Vehicle routing with compartments under product incompatibility constraints [Ürün karişmama kisitlari altinda çok kompartimanli araç rotalama]

Basit Öğe Kaydı
dc.contributor.authorTaşar B.
dc.contributor.authorTürsel Eliiyi D.
dc.contributor.authorKandiller L.
dc.date.accessioned2019-10-27T08:01:11Z
dc.date.available2019-10-27T08:01:11Z
dc.date.issued2019
dc.departmentEge Üniversitesien_US
dc.description.abstractThis 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.en_US
dc.identifier.doi10.7307/ptt.v31i1.2670
dc.identifier.endpage36en_US
dc.identifier.issn0353-5320
dc.identifier.issn0353-5320en_US
dc.identifier.issue1en_US
dc.identifier.scopusqualityQ2en_US
dc.identifier.startpage25en_US
dc.identifier.urihttps://doi.org/10.7307/ptt.v31i1.2670
dc.identifier.urihttps://hdl.handle.net/11454/24931
dc.identifier.volume31en_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherFaculty of Transport and Traffic Engineeringen_US
dc.relation.ispartofPromet - Traffic - Trafficoen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectHeuristic algorithmsen_US
dc.subjectIncompatible productsen_US
dc.subjectMathematical modelen_US
dc.subjectMultiple tripsen_US
dc.subjectMultiple-compartment vehicle routing problemen_US
dc.subjectSplit deliveryen_US
dc.titleVehicle routing with compartments under product incompatibility constraints [Ürün karişmama kisitlari altinda çok kompartimanli araç rotalama]en_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu