GENIIS, a New Hybrid Algorithm for Solving the Mixed Chinese Postman Problem

초록

Mixed Chinese Postman Problem (MCPP) is a practical generalization of the classical Chinese Postman Problem (CPP) and it could be applied in many real world. Although MCPP is useful in terms of reality, MCPP has been proved to be a NP-complete problem. To find optimal solutions efficiently in MCPP, we can reduce searching space to be small effective searching space containing optimal solutions. We propose GENIIS methodology, which is a kind of hybrid algorithm combines the approximate algorithms and genetic algorithm. To get good solutions in the effective searching space, GENIIS uses approximate algorithm and genetic algorithm. This paper validates the usefulness of the proposed approach in a simulation. The results of our paper could be utilized to increase the efficiencies of network and transportation in business.

키워드

Hybrid Algorithm; Search Space; GENIIS; Mixed Chinese Postman Problem; Genetic Algorithm; Approximate Algorithm
제목
GENIIS, a New Hybrid Algorithm for Solving the Mixed Chinese Postman Problem
저자
최명길; 응우엔만탕; 황원주
발행일
2008
저널명
정보시스템연구
권
17
호
3
페이지
39 ~ 58