Browsing by Author "Taşar, Bahar"

Now showing 1 - 2 of 2

Karışamayan ürünler için çok kompartımanlı araç rotalama problemi
(2016) Taşar, Bahar; Kandiller, Levent; Eliiyi, Deniz Türsel
This thesis focuses on a special category of distribution problems for the case of incompatible products. To satisfy different type of demands with minimum logistics costs, incompatible products are carried on the same vehicle but in different compartments. The scope of this study is to explore new mathematical models for the corresponding Multi-Compartment Vehicle Routing Problem (MCVRP) and its variants. While there exists a vast amount of Vehicle Routing Problem (VRP) literature covering several variants, the MCVRP is still open for research. Our study is motivated by a real life instance of a livestock feed distribution system, where each livestock farm demands one type of feed from a single depot. We consider some variants of the MCVRP, as multiple trips of vehicles and the splitting of demand. A taxonomic framework for VRP literature is also suggested. A general mathematical model, and its variants are formulated. A computational experiment is designed for testing the performance of the developed models. Exact solution schemes are evaluated for small sized problem instances, whereas heuristic algorithms are proposed for larger instances. Our results indicate that the proposed methodology is applicable to real life logistics problems such as food, fuel and other chemical distribution.
Citation - WoS: 7
Citation - Scopus: 8
Vehicle routing with compartments under product incompatibility constraints, Ürün karişmama kisitlari altinda çok kompartimanli araç rotalama
(Faculty of Transport and Traffic Engineering, 2019) Bahar Taşar; D. T. Eliiyi; Levent Kandiller; Taşar, Bahar; Kandiller, Levent; Türsel Eliiyi, Deniz; Eliiyi, Deniz Tursel
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. © 2024 Elsevier B.V. All rights reserved.