New Modifications of Selection Operator in Genetic Algorithms for the Traveling Salesman Problem

被引：0

作者：

Radovic, Marija ^{[1
]}

Milutinovic, Veljko ^{[2
]}

机构：

[1] Univ Belgrade, Fac Math, Belgrade, Serbia

[2] Univ Belgrade, Fac Elect Engn, Belgrade, Serbia

来源：

IPSI BGD TRANSACTIONS ON INTERNET RESEARCH | 2006年 / 2卷 / 02期

关键词：

Genetic Algorithms; Selection; Traveling Salesman Problem; Semantic Web; Data mining;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

One of the algorithms used for solving Traveling Salesman Problem is the genetic algorithm. It consists of three important parts: Selection, Crossover, and Mutation. In this paper some of the important concepts and methods of Selection are described. The paper is divided in two sections. In the first one, some of the most popular selection methods are described and in the second one, some new ideas about improving selection methods using the Internet knowledge are presented.

引用

页码：53 / 58

页数：6