|
For Full-Text PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
|
A New Fitness Function of a Genetic Algorithm for Routing Applications
Jun INAGAKI Miki HASEYAMA Hideo KITAJIMA
Publication
IEICE TRANSACTIONS on Information and Systems
Vol.E84-D
No.2
pp.277-280 Publication Date: 2001/02/01 Online ISSN:
DOI: Print ISSN: 0916-8532 Type of Manuscript: LETTER Category: Artificial Intelligence, Cognitive Science Keyword: routing, genetic algorithm, Dijkstra's algorithm, designated points, building block hypothesis,
Full Text: PDF>>
Summary:
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.
|
|