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.

[1]  J. Krarup,et al.  The simple plant location problem: Survey and synthesis , 1983 .

[2]  Horst A. Eiselt,et al.  Location analysis: A synthesis and survey , 2005, Eur. J. Oper. Res..

[3]  J. Kratica,et al.  Fine Grained Tournament Selection for the Simple Plant Location Problem , 2002 .

[4]  Jozef Kratica,et al.  Improvement of Simple Genetic Algorithm for Solving the Uncapacitated Warehouse Location Problem , 1999 .

[5]  Andreas Drexl,et al.  Facility location models for distribution system design , 2005, Eur. J. Oper. Res..

[6]  J. Galletly.  An Overview of Genetic Algorithms , 1992 .

[7]  Mauricio G. C. Resende,et al.  A hybrid multistart heuristic for the uncapacitated facility location problem , 2006, Eur. J. Oper. Res..

[8]  David B. Beasley,et al.  An overview of genetic algorithms: Part 1 , 1993 .

[9]  Søren Kruse Jacobsen,et al.  Heuristics for the capacitated plant location model , 1983 .

[10]  Alena Rybickova,et al.  Application of genetic algorithms to vehicle routing problem , 2014 .

[11]  Minghe Sun.  Solving the uncapacitated facility location problem using tabu search , 2006, Comput. Oper. Res..

[12]  Francisco de Assis Corrêa,et al.  LAGRANGEAN RELAXATION WITH CLUSTERS FOR THE UNCAPACITATED FACILITY LOCATION PROBLEM , 2006 .

[13]  A. Volgenant,et al.  Facility location: a survey of applications and methods , 1996 .

[14]  Said Salhi,et al.  Discrete Location Theory , 1991 .

[15]  David Beasley,et al.  An overview of genetic algorithms: Part 1 , 1993 .

[16]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[17]  R. D. Galvão,et al.  A method for solving to optimality uncapacitated location problems , 1990 .