Akademik Veri Yönetim Sistemi
Ekoist journal of econometrics and statistics (Online), cilt.0, sa.40, ss.183-198, 2024 (Hakemli Dergi)
The vehicle routing problem (VRP), which is a type of traveling salesman problem (TSP), is a combinatorial optimization problem which determines the shortest route distribution from a central warehouse to customer points in certain locations. Today, global climate change resulting from high greenhouse gas emissions and the rapid decrease in natural resources have begun to threaten life as well as the sustainability of our economic structures. For this purpose, businesses have begun to prioritize to the concept of green logistics, which is based on the strategy of environmentally friendly activities in the production of goods and services. In this study, a mathematical model is proposed to solve the green vehicle routing problem with capacity limited and heterogeneous fleet (CHFGVRP), which is a type of vehicle routing problem under the green logistics strategy.Metaheuristic approaches produce successful solutions when solving routing problems with an NP-hard class problem structure. The presented model was developed by Ekol Inc., with the help of the Genetic Algorithm (GA) and Tabu Search (TS) metaheuristic solution approaches. It has been optimized as a real distribution operation for logistics businesses. The main purpose of the present study is assigning vehicles of different capacities of a logistics company to the most suitable loads for two different order sets, to determine the most appropriate customer point route. Thus, as transportation costs decrease thanks to fuel savings, the amount of carbon emissions released into the environment will also decrease. The results of this research will contribute to businesses which seek environmental and economic sustainability, as well as to the developing scientific literature on the subject.