计算机基础知识细讲.docVIP

遗传算法及其在问题中的应用Traveling Salesman Problem Using Genetic Algorithms Liu xiao ru (Department of Computer Science and Technology, ChaoHu College, ChaoHu AnHui, 238000) Abstract: This paper has carried on the summary to the simple genetic algorithms. It expounds the genetic algorithms, includes the basic concept, the basic theory, GA integrant part in detail separately. For example, chromosome code method, initial population, individual fitness function, runtime parameters etc. The introduction of some basic genetic operation, for example selection operator, crossover operator, mutation operator can be found in this paper, as well as how to determine algorithm terminating conditions, and how to design genetic algorithms to solve problems. The mathematic model of TSP has also been introduced in this paper. I also collect some useful information from TSP standard library. I implemented the genetic algorithms to solve TSP problem. Since the performance of GA is dependent on the parameter set, the parameter should be chosen very carefully. I observed the influence of different parameter set on the result. At last, it proved that GA has the ability of solving NP complete problems by designing GA program. The main function of GA procedure includes: proposed the format of TSP input files, a simple user graphics interface is provided used for choosing parameters, generation number, selection probability, mutation probability, the number of run time used for avoiding partial optimization. Otherwise, I made an executable file with exe4j tool. This system was developed under java environment. Keywords: genetic algorithms (GA); traveling Salesman Problem (TSP); NP complete Problem (NPC) 目录前言 1 第一章 引言 2 1.1、项目开发的背景 2 1.2、项目开发的目标 2 1.3、项目开发的意义 2 1.4、项目所用工具简介 2 第二章 遗传算法概述 3 2.1、遗传算法的发展简介 3 2.2、遗传算法的特点 4 2.3、遗传算法的研究内容： 5 2.4、遗传算法的发展 5 2.5、遗传算法的应用 6 第三章 简单遗传算法 8 3.1、什么是简单遗传算法 8 3.2、遗传算法的基本概念 8 3.3、遗传算法的组成要素 9 3.4、遗传算法的基本步骤: 13 3.5、编程实现的简单遗传算法的流程图 14 3.6、遗传算法的进化过程 15 第四章 TSP问题 17 4.1、TS