An Improvement of Genetic Algorithm for Location-routing Problem

摘要

This paper proposed an improvement of genetic algorithm for solving the location-routing problem (LRP). In this study, tournament selection technique and k-mean clustering are applied to create customer routing in each depot. The algorithm is tested on benchmark problems set by data and compared with former algorithm. The computation results illustrate that the proposed algorithm can produce optimal solutions better than comparative method. The findings prove that the proposed algorithm can solve LRP effectively which lead to minimize the total cost of network distribution in real world business.