A Genetic Algorithm Method for Location Routing Problem

Mahsa Ahmadi¹ Mohammad Vahid Sebt² Hojat Allah Salehi³

1) Iran University of Kharazmi
2) Iran University of Kharazmi
3) Shrif University of Technology

Publication : 2nd International Congress On Engineering, Technology and Innovation(eticong.com/2nd)
Abstract :
One of the relatively complicated and high-level optimization problems is the location routing problem (LRP). LRP is of crucial importance in today’s industries, especially in transportation and distributive logistics systems. This paper presents a genetic optimization algorithm to solve LRP problem. In this problem, the positions and demands of costumers are pre-defined. For distribution centers, some feasible positions are considered and the cost of constructing a distribution center in that position is known. The goal of this problem is to minimize the cost index which is the sum of construction cost, number of utilized cars in each center and servicing costs. At the same time, all customers receive the requested service. The solution consists of the number of distribution centers, position of the distribution centers, number of cars in each center and the route that each car should pass to service all costumers. In this research, a genetic algorithm method is considered to solve this problem. The LRP modelled as a nonlinear integer programming (NLP) problem and solved by genetic algorithm. The validity and the efficiency of genetic algorithm to solve this problem is proved by an example.
Keywords : Location-Routing Meta-heuristic Genetic Algorithm Supply Chain Vehicle Routing Problem (VRP)