A self adaptive new crossover operator to improve the efficiency of the genetic algorithm to find the shortest path
Route planning is an important part of road network. To select an optimized route several factors such as flow of traffic, speed limits of road. are concerned. Total cost of such a network depends on the number of junctions between the source and the destination. Due to the growth of the nodes in th...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | EJournal Article |
| Published: |
Institute of Advanced Engineering and Science,
2021-08-01.
|
| Subjects: | |
| Online Access: | Get fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Route planning is an important part of road network. To select an optimized route several factors such as flow of traffic, speed limits of road. are concerned. Total cost of such a network depends on the number of junctions between the source and the destination. Due to the growth of the nodes in the network it becomes a tough job to determine the exact path using deterministic algorithms so in such cases genetic algorithms (GA) plays a vital role to find the optimized route. Crossover is an important operator ingenetic algorithm. The efficiency of thegenetic algorithmis directlyinfluenced by the time of a crossover operation. In this paper a new crossoveroperator closest-node pairing crossover (CNPC) is recommended which is explicitly designed to improve the performance of the genetic algorithm compared to other well-known crossover operators such as point based crossover and order crossover. The distance aspect of the network problem has been exploited in this crossover operator. This proposed technique gives a better result compared to the other crossover operator with the fitness value of 0.0048. The CNPC operator gives better rate of convergence compared to the other crossover operators. |
|---|---|
| Item Description: | https://ijeecs.iaescore.com/index.php/IJEECS/article/view/24420 |