Research on Disposal Station Location Problem Based on Genetic and Simulated Annealing Algorithm

This paper introduces a mathematical model for locating the scrap vehicle disposal station. This model involves an NP-complete problem. A hybrid heuristic algorithm is used to solve the problem. The main idea is to combine a Genetic Algorithm with a Simulated Annealing Algorithm component. The combination of two algorithms can solve the premature convergence problem caused by genetic algorithm and improve the efficiency of operation. Computational experience, based on comparative results obtained from MATLAB, shows the efficiency of the hybrid algorithm.