Baris KaradenizMehmet Serdar ErdoganYigit KazancogluErdogan, Mehmet SerdarKazancoglu, YigitKaradeniz, BarisNM DurakbasaMG Gencyilmaz2025-10-062022978-3-030-90421-0, 978-3-030-90420-3978303090421097830309042032195-43562195-436410.1007/978-3-030-90421-0_702-s2.0-85119888858http://dx.doi.org/10.1007/978-3-030-90421-0_70https://gcris.yasar.edu.tr/handle/123456789/5735https://doi.org/10.1007/978-3-030-90421-0_70In this study we designed a vehicle routing problem model for chocolate manufacturer company to optimize their distribution system. Our model includes 3 warehouses heterogenous fleet multi period and about two dozen customers. We got our customer data directly from company. We considered distance between the customers their demands and vehicle capacities. Sensitivity analysis was made to make sure that it is effective. In the model that we designed we compared 10-15-20 customer cases with 3 depot 1 depot heterogeneous and homogeneous fleet scenarios. According to results of the study homogeneous fleet scenarios are costly. In addition using single depot is costly than using multiple depots.Englishinfo:eu-repo/semantics/closedAccessVehicle routing problem, Optimization, Mixed-integer linear programming, Multi depot, Heterogeneous fleetALGORITHMVehicle Routing ProblemOptimizationMixed-Integer Linear ProgrammingMulti DepotHeterogeneous FleetConference Object