DocumentCode
1744786
Title
A new genetic algorithm for routing the shortest route via several designated points
Author
Inagaki, Jun ; Haseyama, Miki ; Kitajima, Hideo
Author_Institution
Sch. of Eng., Hokkaido Univ., Sapporo, Japan
Volume
2
fYear
2001
fDate
6-9 May 2001
Firstpage
217
Abstract
This paper presents a method of routing the shortest route via several designated points using a genetic algorithm and its effectiveness verified by applying the algorithm to map data. The proposed algorithm uses a fitness function which includes weight parameters based on the building block hypothesis. By using this function, the optimum is efficiently obtained. This kind of routing is difficult in the case of using existing methods such as Dijkstra´s method. Also, the proposed method is more useful
Keywords
circuit layout CAD; genetic algorithms; network routing; building block hypothesis; designated points; fitness function; genetic algorithm; map data; routing; shortest route; weight parameters; Algorithm design and analysis; Biological cells; Cost function; Data engineering; Design engineering; Genetic algorithms; Genetic engineering; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on
Conference_Location
Sydney, NSW
Print_ISBN
0-7803-6685-9
Type
conf
DOI
10.1109/ISCAS.2001.921046
Filename
921046
Link To Document