We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Araç Rotalama Probleminin Genetik Algoritma ile Çözümü.
- Authors
OKUR, Ebru; ATLAS, Üyesi Mahmut
- Abstract
In this study, vehicle routing problem which is in the class of hard to solve problems is addressed. The vehicle routing problem is, in short, the problem of designing optimal routes for product distribution to meet customer demands. The main objective of the problem is to minimize the total distance traveled. In today's business world, product distribution costs constitute an important part of total logistics costs. In this study, it is aimed to improve vehicle route distance to meet all customer demands of Eskişehir Public Bread Company Company using genetic algorithm, which is one of the meta-heuristic solution techniques. For this purpose, by using the genetic algorithm to solve difficult and large-scale problems effectively and to produce solutions that are close to optimum in a short time, Eskişehir Public Bread Company distribution vehicles are searched for the optimum solution for the route calculation to the sales points from the shortest distance and a comparison was made with the current situation. Breads are produced in a single production center and delivered to the public through 51 sales buffets. The distances of the production facility from the sales buffets are determined from their location on "Google Maps". The genetic algorithm was run 2000 times for the problem under consideration, and the result was reached in a short period of approximately 25 seconds (sec). As a result of the vehicle routing process determined by the genetic algorithm, a better result was obtained by improving the rotation used by Eskişehir Public Bakery Company. Before the study, it is seen that Eskişehir Public Bread Company determined the total distance traveled by 3 vehicles as 236.54 km, benefiting from 17 years of experience in the creation of routes. Considered on a monthly basis, it provides an improvement of approximately 790 km for a month. On the basis of cost, the vehicles used consume 1.6 TL / lt of fuel per km traveled in the city, and when considered monthly, a reduction in cost is achieved with a fuel saving of 1.264 TL for the business. As a result of this study, a solution was created to meet all demands for 51 sales buffets belonging to the enterprise, thus saving both time and cost for their vehicles.
- Publication
Anadolu University Journal of Social Sciences / Anadolu Üniversitesi Sosyal Bilimler Dergisi, 2020, Vol 20, Issue 3, p227
- ISSN
1303-0876
- Publication type
Article
- DOI
10.18037/ausbd.801768