A modified genetic algorithm initializing for location-routing problems

This paper proposed an improvement of genetic algorithm for solving the location-routing problem (LRP). In this study, tournament selection technique is applied to create customer routing in each depot. The algorithm is tested on four benchmark problems and compared with other three algorithms. The computation results illustrate that the proposed algorithm can produce optimal solutions similar to other methods: nearly same depots but different routes. The findings prove that the algorithm for solving LRP should be improved in routing step for minimizing the total cost of distribution network.