A parallel tabu search approach based on genetic crossover operation

Author

Yi, He ; Yuhui, Qiu ; Guangyuan, Liu ; Kaiyou, Lei

Author_Institution

Fac. of Comput. & Inf. Sci., Southwest-China Normal Univ., Chongqing, China

Volume

2

fYear

2005

fDate

28-30 March 2005

Firstpage

467

Abstract

TS (tabu search) is one of the meta-heuristic algorithms that can solve the combinatorial optimization problems, which is NP-hard such as TSPs (traveling salesman problems), satisfied. With the requirement of solving large-scale problems, we proposed a new parallel tabu search (PTS) approach, which was cooperated with genetic crossover operation for TSPs. In addition, a novel adaptive search strategy of intensification and diversification was proposed to improve the solution quality and efficiency in TS. Taking TSPs as sample, some simulation experiments were implemented. It was shown that our proposed PTS approach was feasible and effective.

Keywords

computational complexity; genetic algorithms; parallel algorithms; search problems; travelling salesman problems; NP-hard problem; TSP; adaptive search strategy; combinatorial optimization problems; diversification; genetic crossover operation; intensification; metaheuristic algorithm; parallel tabu search; traveling salesman problems; Cities and towns; Costs; Electronic mail; Engineering management; Genetics; Information science; Large-scale systems; NP-complete problem; Traveling salesman problems; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

Advanced Information Networking and Applications, 2005. AINA 2005. 19th International Conference on

ISSN

1550-445X

Print_ISBN

0-7695-2249-1

Type

conf

DOI

10.1109/AINA.2005.45

Filename

1423735