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

Author

Wenyuan Tao ; Yijiao Huang

Author_Institution

Sch. of Software Eng., Tianjin Univ., Tianjin, China

fYear

2013

fDate

21-23 June 2013

Firstpage

1897

Lastpage

1900

Abstract

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.

Keywords

computational complexity; facility location; genetic algorithms; simulated annealing; vehicles; Matlab; NP-complete problem; disposal station location problem; genetic algorithm; hybrid algorithm; hybrid heuristic algorithm; mathematical model; premature convergence problem; scrap vehicle disposal station; simulated annealing algorithm; Algorithm design and analysis; Annealing; Genetic algorithms; Genetics; Mathematical model; Simulated annealing; Vehicles; disposal station location problem; genetic annealing algorithm; vehicle network;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational and Information Sciences (ICCIS), 2013 Fifth International Conference on

Conference_Location

Shiyang

Type

conf

DOI

10.1109/ICCIS.2013.496

Filename

6643415