Presentation 2000/7/17
A Note on Convergence of a Genetic Algorithm for Routing Application
Jun Inagaki, Miki Haseyama, Hideo Kitajima,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The authors have proposed a method of searching the shortest route through several designated points with a genetic algorithm. It uses a fitness function including weight parameters which are controlled based on a building block hypothesis. This function makes it possible to reduce the calculation cost by letting good schemata even in the lethal chromosomes survive. This paper proposes a method which can converge to the optimum more efficiently by using a new approach: each weight parameter is varied independently in a GA process according to the number of designated points of individuals; and some chromosomes with many designated points are added to an initial population generated at random. This paper also verifies its validity by several experiments.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) genetic algorithm / routing / designated points
Paper # DSP2000-74,SST2000-33
Date of Issue

Conference Information
Committee DSP
Conference Date 2000/7/17(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 Digital Signal Processing (DSP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Note on Convergence of a Genetic Algorithm for Routing Application
Sub Title (in English)
Keyword(1) genetic algorithm
Keyword(2) routing
Keyword(3) designated points
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 2000/7/17
Paper # DSP2000-74,SST2000-33
Volume (vol) vol.100
Number (no) 209
Page pp.pp.-
#Pages 6
Date of Issue