Tasar, BaharEliiyi, Deniz TurselKandiller, Levent2019-10-272019-10-2720190353-53201848-40690353-53201848-4069https://doi.org/10.7307/ptt.v31i1.2670https://hdl.handle.net/11454/29546This 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.en10.7307/ptt.v31i1.2670info:eu-repo/semantics/openAccessmultiple-compartment vehicle routing problemincompatible productssplit deliverymultiple tripsmathematical modelheuristic algorithmsArticle3112536WOS:000462346600003Q4