Presentation 1997/6/26
A Note on Deciding Various Solutions by Genetic Algorithm for Routing Applications
Jun Inagaki, Miki Haseyama, Hideo Kitajima,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper proposes a method of routing with Genetic Algorithm. The proposed method not only selects the shortest route but also decides several semi-shortest routes utilizing the feature of Genetic Algorithm. By using this method, another short route can be presented without re-routing if it is demanded. The existent methods cannot present any other short routes, therefore the proposed algorithm is useful for this kind of routing. Moreover, since the proposed genotype structure has a weighting factor which controls route length, the method can select suitable routes depending on geographical conditions.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) genetic algorithm / routing
Paper # CAS97-6
Date of Issue

Conference Information
Committee VLD
Conference Date 1997/6/26(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To VLSI Design Technologies (VLD)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Note on Deciding Various Solutions by Genetic Algorithm for Routing Applications
Sub Title (in English)
Keyword(1) genetic algorithm
Keyword(2) routing
1st Author's Name Jun Inagaki
1st Author's Affiliation Faculty of Engineering, Hokkaido University()
2nd Author's Name Miki Haseyama
2nd Author's Affiliation Faculty of Engineering, Hokkaido University
3rd Author's Name Hideo Kitajima
3rd Author's Affiliation Faculty of Engineering, Hokkaido University
Date 1997/6/26
Paper # CAS97-6
Volume (vol) vol.97
Number (no) 138
Page pp.pp.-
#Pages 6
Date of Issue