Downloads: 112 | Views: 245

Research Paper | Computer Science & Engineering | China | Volume 7 Issue 3, March 2018 | Popularity: 6.8 / 10

Rate This Article!      

Multi-Agent Genetic Algorithm for One Criteria Network Routing Optimization

Kabengele Mpunga Yannick

Abstract: Network design is widely used in practice in an ever wider range of applications. The shortest path models is one of the core models of network design and as we know well in one of NP-complete Problem in network design. This paper presents a multi-agent genetic algorithm to the shortest path routing problem, this algorithm is named MAGA-Rout. Priority-based encoding and decoding have been used for encoding the chromosome (strings). In this algorithm, we design a variant of weight mapping crossover operator based on neighborhood so as to obtain useful information from its neighbors and avoid random recombination. Results after experimentation for a sample test network have been presented to demonstrate the capabilities of the proposed approach to generate a much better quality of solution (route optimality) and much higher rate of convergence than other algorithms.

Keywords: Multi-genetic algorithm, neighborhood weight mapping crossover, shortest path, multi-agent system

Edition: Volume 7 Issue 3, March 2018

Pages: 1934 - 1939

Make Sure to Disable the Pop-Up Blocker of Web Browser

Click to Cite this Article