A Genetic Algorithm for Routing with an Upper Bound Constraint(Biocybernetics, Neurocomputing)

スポンサーリンク

概要

• 論文の詳細を見る

• This paper presents a method of searching for the shortest route via the most designated points with the length not exceeding the preset upper bound. The proposed algorithm can obtain the quasi-optimum route efficiently and its effectiveness is verified by applying the algorithm to the actual map data.

• 社団法人電子情報通信学会の論文
• 2005-03-01

著者

• Inagaki Jun

  The Author Is With The Dept. Of Information Science Hokkaido Tokai University

• HASEYAMA Miki

  The author is with the Graduate School of Information and Technology, Hokkaido University

• Haseyama Miki

  The Author Is With The Graduate School Of Information And Technology Hokkaido University

関連論文

• A Genetic Algorithm for Routing with an Upper Bound Constraint(Biocybernetics, Neurocomputing)

スポンサーリンク