📄 method.html
字号:
<html>
<head>
<meta http-equiv="Content-Language" content="en-us">
<meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
<title>Description of the method used in TSP by GA</title>
<style>
<!--
table.MsoNormalTable
{mso-style-parent:"";
font-size:10.0pt;
font-family:"Times New Roman";
}
-->
</style>
</head>
<body>
<p align="center"><b><font face="Arial" size="5">Traveling Salesman Problem by
Genetic Algorithm</font></b></p>
<b><font face="Times New Roman"><span style="background-color: #FFFF66">
Definition of the problem:</span></font></b><font face="Times New Roman"><br>
A salesman wants to visit <i>n</i> cities
cyclically. He wants to visit each city once and return to the city where he
starts. In which way should he visit the cities so that the distance traveled by
him will be minimum?</font><p><font face="Times New Roman">This is a simple combinatorial problem. For a small value of
<i>n,</i> one can easily
find the solution by having a permutation of the cities which is the minimum
distance tour. But for larger <i>n,</i> it would be impracticable as there are <i>(n-1)!/2
</i>ways to visit the cities. </font></p>
<p><font face="Times New Roman">Many approaches have been proposed for the problem. Of these, Genetic Algorithms
can produce reasonable solutions in a short span of time.</font></p>
<p><font face="Times New Roman"><b><span style="background-color: #FFFF66">
Genetic Algorithm:<br>
</span></b>Genetic Algorithm (GA) is based on the famous theory ⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -