A New Fitness Function of a Genetic Algorithm for Routing Applications

• INAGAKI Jun

  the Graduate School of Engineering, Hokkaido University

• HASEYAMA Miki

  the Graduate School of Engineering, Hokkaido University

• KITAJIMA Hideo

  the Graduate School of Engineering, Hokkaido University

抄録

This paper presents a method of determining a fitness function in a genetic algorithm for routing the shortest route via several designated points. We can search for the optimum route efficiently by using the proposed fitness function and its validity is verified by applying it to the actual map data.

収録刊行物

• IEICE transactions on information and systems

  IEICE transactions on information and systems 84 (2), 277-280, 2001-02-01

  一般社団法人電子情報通信学会

キーワード

• routing
• genetic algorithm
• Dijkstra's algorithm
• designated points
• building block hypothesis

詳細情報

• CRID: 1572543027347774208
• NII論文ID: 110003210475
• NII書誌ID: AA10826272
• ISSN: 09168532
• 本文言語コード: en
• データソース種別:
  • CiNii Articles