2006•Jisuanji fangzhenRequires access

An Improved Genetic Algorithm Based on Case Base for Traveling Salesman Problem

Liu Gao-hang

Abstract

Traveling Salesman Problem(TSP) is a typical nondeterministic polynomial time problem which is described easily but solved difficultly.Solving TSP efficiently and fast is of great significance in theory and practice.An improved Genetic Algorithm is put forward to solve TSP in this paper.The algorithm which combines the Genetic Algorithm with Case Base,can solve the TSP problem more effectively with strong global search capability of Genetic Algorithm and memory storage functionality of Case Base.The experimental results of simple Genetic Algorithm and the improved Genetic Algorithm are compared secondly.And the result shows the feasibility and effectiveness of the improved Genetic Algorithm.Finally,this paper points out the problem of the improved Genetic Algorithm and the new research direction.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

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

Key concepts: Travelling salesman problem, Genetic algorithm, Nondeterministic algorithm, NP, 2-opt, Base (topology), Mathematical optimization, Algorithm