Research Information System
Thesis Type: Doctorate
Institution Of The Thesis: Gazi Üniversitesi, Fen Bilimleri Enstitüsü, Turkey
Approval Date: 2016
Student: AYŞE BAYRAK
Supervisor: BAHAR ÖZYÖRÜK
Abstract:Today, with the increasing competition, all companies have to plan and manage business processes. Especially, the distribution and collection process improvement increase performance of the Supply Chain. Thus, this study focuses on Split Delivery Simultaneous Pickup and Delivery Vehicle Routing Problem (SDSPDVRP) which is a generalized version of the Simultaneous Pickup and Delivery Vehicle Routing Problem (SPDVRP) and Split Delivery Vehicle Routing Problem (SDVRP). Unlike the SPDVRP, the SDSPDVRP allows to visit each customer than once and the demand of each customer can be more than the vehicle capacity. In this study, a general model for the SDSPDVRP is presented for the first time in this study. Two mathematical models are presented for the defined SDSPDVRP. The performance and efficiency of the models are compared with experimental studies for test problems derived from the literature. It has been reported that SDSPDVRP is a NP-hard problem and it is difficult to reach the best solution for medium and large scale problems which take a long time. Consequently, Tabu Search (TS) heuristic has been developed to solve SDSPDVRP. The efficiency of the developed algorithm has been evaluated for the situation to find or approach the solutions with GAMS CPLEX of better performance mathematical model.