Autor: |
S. K. Bhagat, Devnath Shah, Debashish Pal |
Rok vydání: |
2019 |
Předmět: |
|
Zdroj: |
2019 IEEE International Conference on Electrical, Computer and Communication Technologies (ICECCT). |
DOI: |
10.1109/icecct.2019.8869243 |
Popis: |
An efficient optimization technique for shortest route determination in routing has been proposed through this work which makes use of genetic algorithm (GA) employing effective mutation techniques. The techniques embraced here gives good convergence and diversity. A proficient way is utilized for initialization of path from source to the destination node that also helps us to get mutant solution. A productive way for dispensing with infeasible solutions generated at the time of initialization, crossover and mutation are aptly consolidated. Results obtained through simulations shows the effectiveness of this algorithm when compared to other methods in terms of parameters such as average and standard deviation of simulation time and number of iterations to reach the optimum value. |
Databáze: |
OpenAIRE |
Externí odkaz: |
|