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)

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.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

Masuyama H.; Ichimori T.; Sasama T. and (2006). ON ABILITY OF ORTHOGONAL GENETIC ALGORITHMS FOR THE MIXED CHINESE POSTMAN PROBLEM.In Proceedings of the First International Conference on Software and Data Technologies - Volume 1: ICSOFT, ISBN 978-972-8865-69-6, pages 39-45. DOI: 10.5220/0001314600390045

@conference{icsoft06, author={Hiroshi Masuyama and Tetsuo Ichimori and Toshihiko Sasama}, title={ON ABILITY OF ORTHOGONAL GENETIC ALGORITHMS FOR THE MIXED CHINESE POSTMAN PROBLEM}, booktitle={Proceedings of the First International Conference on Software and Data Technologies - Volume 1: ICSOFT,}, year={2006}, pages={39-45}, publisher={SciTePress}, organization={INSTICC}, doi={10.5220/0001314600390045}, isbn={978-972-8865-69-6}, }

TY - CONF

JO - Proceedings of the First International Conference on Software and Data Technologies - Volume 1: ICSOFT, TI - ON ABILITY OF ORTHOGONAL GENETIC ALGORITHMS FOR THE MIXED CHINESE POSTMAN PROBLEM SN - 978-972-8865-69-6 AU - Masuyama, H. AU - Ichimori, T. AU - Sasama, T. PY - 2006 SP - 39 EP - 45 DO - 10.5220/0001314600390045