A solution proposal to whicle routing problem with integer linear programming: A distributor company sample

In today's industrial world, distribution is an increasingly important field in terms of businesses. Therefore, businesses want to meet customer demands with the distribution network in the fastest and least costly manner. But when businesses meet these needs, they usually identify routes based on their past experience. Random selection of routes can also bring extra costs to businesses. This is a crucial problem that needs to be solved because of the competitiveness of most businesses with rival businesses. From here, it is aimed to minimize the total distance of the routes under the capacity constraint of the routes that a distributor company has drawn in the direction of the demands. To this end, a route to Gebze-based steel production and distribution was drawn up to meet all the demands of a fabrication plant. In order to determine the minimum total distance routes, the Solution Recommendation by adapting the Capacity Constrained Vehicle Routing Problem (CVRP) which is one of the basic route problems using Branch and Cut algorithm of 0-1 Integer Linear Programming (ILP) was introduced. Distances between the nodes that make up the route are measured via Google Maps. Optimal solutions were obtained by using LINDO computer software to solve the problem.