Vehicle routing with compartments under product incompatibility constraints

Basit Öğe Kaydı
dc.authoridEliiyi, Deniz Tursel / 0000-0001-7693-3980
dc.authoridKandiller, Levent / 0000-0002-7300-5561
dc.authoridTasar, Bahar / 0000-0001-8004-852X
dc.authorscopusid57207948778
dc.authorscopusid14521079300
dc.authorscopusid6506822666
dc.authorwosidEliiyi, Deniz Tursel/J-9518-2014
dc.authorwosidKandiller, Levent/B-3392-2019
dc.contributor.authorTaşar, Bahar
dc.contributor.authorEliiyi, Deniz Türsel
dc.contributor.authorKandiller, Levent
dc.date.accessioned2022-02-15T16:58:37Z
dc.date.available2022-02-15T16:58:37Z
dc.date.issued2019
dc.departmentBakırçay Ü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.en_US
dc.identifier.doi10.7307/ptt.v31i1.2670
dc.identifier.endpage36en_US
dc.identifier.issn0353-5320
dc.identifier.issn1848-4069
dc.identifier.issue1en_US
dc.identifier.scopus2-s2.0-85063329211en_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/20.500.14034/440
dc.identifier.volume31en_US
dc.identifier.wosWOS:000462346600003en_US
dc.identifier.wosqualityQ4en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherSvenciliste U Zagrebu, Fakultet Prometnih Znanostien_US
dc.relation.journalPromet-Traffic & Transportationen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectmultiple-compartment vehicle routing problemen_US
dc.subjectincompatible productsen_US
dc.subjectsplit deliveryen_US
dc.subjectmultiple tripsen_US
dc.subjectmathematical modelen_US
dc.subjectheuristic algorithmsen_US
dc.subjectHybrid Genetic Algorithmen_US
dc.subjectHeterogeneous Fleeten_US
dc.subjectMemetic Algorithmen_US
dc.subjectDelivery Problemen_US
dc.subjectSplit Deliveryen_US
dc.subjectTabu Searchen_US
dc.subjectClassificationen_US
dc.subjectCollectionen_US
dc.subjectDepoten_US
dc.subjectOilen_US
dc.titleVehicle routing with compartments under product incompatibility constraintsen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
Vehicle routing with compartments under product incompatibility constraints.pdf
Boyut:
727.12 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam Metin / Full Text
İndir

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Endüstri Mühendisliği Bölümü Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu