Optimization of a spare parts distribution system using a genetic algorithm

In this paper we focus on the system of the spare parts distribution for authorised garages in the Czech republic and its optimization based on genetic algorithm. Real world problem of garages supply consists of the design of the optimal location of distribution depots and the design of routes that are used for everyday delivery of spare parts. Both of these sub-problems that belong to NP-hard problems are solved separately using genetic algorithm. In the facility location problem, the set of customers, set of potential locations of facilities and distances for all their combinations are given and our goal is to select location of facilities with the minimum costs based on chosen criterion. In the second part of the optimization the vehicle routing problem is solved where the goal is to determine the routes described as a sequence of customers visited on this route. Every route starts and ends in the depot and is limited by capacity of the vehicle. Homogeneous fleet was used in this problem.