Presentation 2002/8/28
An Actualization of a Genetic Algorithm for Routing with an Upper Bound Constraint
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 via several designated points with a genetic algorithm. By applying this method, this paper proposes a method of searching for the shortest route via the most designated points among the routes whose lengths are less than the upper bound. However, this kind of routing has a drawback of making optimization accuracy deteriorate when using a method of simply screening individuals whose route lengths are more than the upper bound. In order to solving this proplem, two new methods are proposed and their validity is verified by several experiments.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) genetic algorithm / routing / upper bound / building block
Paper # NLP2002-53
Date of Issue

Conference Information
Committee NLP
Conference Date 2002/8/28(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 Nonlinear Problems (NLP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) An Actualization of a Genetic Algorithm for Routing with an Upper Bound Constraint
Sub Title (in English)
Keyword(1) genetic algorithm
Keyword(2) routing
Keyword(3) upper bound
Keyword(4) building block
1st Author's Name Jun INAGAKI
1st Author's Affiliation Faculty of Engineering, Hokkaido Tokai University()
2nd Author's Name Miki HASEYAMA
2nd Author's Affiliation School of Engineering, Hokkaido University
3rd Author's Name Hideo KITAJIMA
3rd Author's Affiliation School of Engineering, Hokkaido University
Date 2002/8/28
Paper # NLP2002-53
Volume (vol) vol.102
Number (no) 298
Page pp.pp.-
#Pages 6
Date of Issue