| Title |
Improved Route Search Method Through the Operation Process of the Genetic Algorithm |
| Authors |
지홍일(Ji, Hong-il) ; 서창진(Seo, Chang-jin) |
| DOI |
https://doi.org/10.5370/KIEEP.2015.64.4.315 |
| Keywords |
Genetic algorithm ; Mobile agent ; Route search ; Networks |
| Abstract |
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. |