Improvement and Implementation of Genetic Algorithm for Location Scheme in Location-Routing Problem

Location-Routing Problem is a logistics transportation optimization problem, which includes two coupling sub problems of “location scheme” and “path planning”. The optimal path is determined by the location scheme, therefore, it is important to choose appropriate methods to solve the location problem. Location problem is a kind of resource allocation problem, so, on the basis of giving full play to the advantages of genetic algorithm in solving “allocation problem”, the improved genetic algorithm is proposed to solve the location problem through a series of improvement strategies such as the subsection coding strategy based on classification rules of transportation nodes, population initialization based on Halton sequence, multi-point sequential crossover strategy, and the mutation strategy based on gene-sequence. Finally, the case study demonstrates the feasible and superiority of the proposed methodologies.