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 Genetic Algorithm for Routing with an Upper Bound Constraint
Jun INAGAKI Miki HASEYAMA
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2005/03/01
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Biocybernetics, Neurocomputing
routing, genetic algorithm, designated points, upper bound constraint, building block hypothesis,
Full Text: PDF(427.3KB)
>>Buy this Article
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.