Authors:
Hiroshi Masuyama
1
;
Tetsuo Ichimori
2
and
Toshihiko Sasama
1
Affiliations:
1
Information and knowledge Engineering, Tottori University, Japan
;
2
Information Systems, Osaka Institute of Technology, Japan
Keyword(s):
Orthogonal design, Genetic algorithm, Chinese postman problem, Postman’s route.
Related
Ontology
Subjects/Areas/Topics:
Algorithms and Data Structures
;
Programming Languages
;
Software Engineering
Abstract:
The well known Chinese Postman Problem has many applications, and this problem has been proved to be NP-hard in graphs where directed and non-directed edges are mixed. In this paper, in order to investigate the salient feature of orthogonal design, we designed a genetic algorithm adopting an orthogonal crossover seoperation to solve this (mixed Chinese Postman) problem and evaluate the salient ability. The results indicate that for problems of small sizes, the orthogonal genetic algorithm can find near-optimal solutions within a moderate number of generations. We confirmed that the orthogonal design shows better performance, even for graph scales where simple genetic algorithms almost never find the solution. However, only the introduction of orthogonal design is not yet effective for the Chinese Postman Problem of practical size where a solution can be obtained in less than 104 generations. This paper concludes that the optimal design scale of orthogonal array to this mixed Chinese
Postman Problem does not conform to the same scale as the multimedia multicast routing problem.
(More)