A Genetic Algorithm for Routing with an Upper Bound Constraint

Jun INAGAKI  Miki HASEYAMA  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E88-D   No.3   pp.679-681
Publication Date: 2005/03/01
Online ISSN: 
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Biocybernetics, Neurocomputing
Keyword: 
routing,  genetic algorithm,  designated points,  upper bound constraint,  building block hypothesis,  

Full Text: PDF(427.3KB)
>>Buy this Article


Summary: 
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.