2003•Unpublished venueRequires access

SOLVING TSP BASED ON AN IMPROVED GENETIC ALGORITHM

Ruan Huai

Abstract

TSP(Traveling Salesman Problem)is a typical NP complete problem,genetic algorithm is the perfect method for solving NP complete problem.This paper proposes a new genetic algorithm using the maintaining variety mechanism to design the selection mechanism of the algorithm in order to improve the algorithm capability. We also use this algorithm to resolve the TSP and get the perfect results.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 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

Key concepts: Travelling salesman problem, Genetic algorithm, Algorithm, Mathematical optimization, Selection (genetic algorithm), Computer science, Population-based incremental learning, Variety (cybernetics)