유전 알고리즘의 연산처리를 통한 개선된 경로 탐색 기법

• Published in: 전기학회 논문지 P권, 64(4) Vol. 64P; no. 4; pp. 315 - 320
• Main Authors: 지홍일(Hong-il Ji), 서창진(Chang-jin Seo)
• Format: Journal Article
• Language: Korean
• Published: 대한전기학회 2015
• Subjects: 전기공학; Networks; Mobile agent; Route search; Genetic algorithm
• ISSN: 1229-800X; 2586-7792

Proposal algorithm in this paper introduced cells, units of router group, for distributed processing of previous genetic algorithm. This paper presented ways to reduce search delay time of overall network through cell-based genetic algorithm. As a result of performance analysis comparing with existing genetic algorithm through experiments, the proposal algorithm was verified superior in terms of costs and delay time. Furthermore, time for routing an alternative path was reduced in proposal algorithm, in case that a network was damaged in existing optimal path algorithm, Dijkstra algorithm, and the proposal algorithm was designed to route an alternative path faster than Dijkstra algorithm, as it has a 2nd shortest path in cells of the damaged network. The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.