Bi-objective optimization genetic algorithm for locating concrete mixing plants

The location of the concrete mixing plants (LCMP) is a kind of combinatorial optimization problem. The reasonable locations will significantly improve the quality and reduce costs of the construction companies. LCMP has two objectives. One is to optimize the number of mixing plants, and the other is to optimize the distance between the mixing plants and the construction areas. In this paper, a location model based on concrete mixing plants has been built. A hybrid algorithm combining genetic algorithm (GA) and local search strategy has been applied to solving the proposed problem. We designed the implementation steps of the hybrid algorithm according to the objectives and constrains of LCMP, including the coding of the solution, the cross over operation, the mutation operation and the local search strategy. The simulation experiment shows that our proposed algorithm achieves better solution than greedy algorithm and GA.