Presentation 1997/12/11
A Note on Searching the Shortest Route through Several Designated Points
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 searching the shortest route through several designated points using a genetic algorithm. The proposed method not only searches the shortest route but also selects the, shortest route through several designated points. Current methods, such as the Dijkstra's method, are the algorithms only for routing the shortest route. If the shortest route through several designated points is searched by these methods, its computational cost is O (N^2) where N is the number of the designated points. Therefore, the more the designated points increase, the more the routing demands computational cost. The proposed algorithm can obtain the shortest route through the points by an only search, and is more useful for this kind of routing than the other methods.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) genetic algorithm / routing / designated points
Paper # IE97-110
Date of Issue

Conference Information
Committee IE
Conference Date 1997/12/11(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 Image Engineering (IE)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Note on Searching the Shortest Route through Several Designated Points
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 1997/12/11
Paper # IE97-110
Volume (vol) vol.97
Number (no) 429
Page pp.pp.-
#Pages 6
Date of Issue