ScholarLens Back to search
2005•Unpublished venueRequires access

A Parallel Tabu Search Approach Based on Genetic Crossover Operation

Yi He, Yuhui Qiu, Guangyuan Liu, Kaiyou Lei

Open publisher page 4 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Tabu search, Crossover, Computer science, Genetic algorithm, Guided Local Search, Mathematical optimization, Parallel computing, Algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Parallel Tabu Search Approach Based on Genetic Crossover Operation — Research Paper | ScholarLens