Published May 1, 2018 | Version v1
Figure Open

Using the Genetic Algorithm for the Optimization of Dynamic School Bus Routing Problem-Figure 6. Mutation process

  • 1. Department of Computer Engineering, Süleyman Demirel University, Turkey

Description

The individuals obtained at the end of crossing over might not provide the desired level of variability. In that case, the produced individuals are mutated independently from another individual in such a way that their own gene sequence will change. The mutation process is performed in the event that the mutation possibility that is specified in the beginning comes true. The results obtained from mutation can enhance the outcome or make it worse. It is of utmost importance to specify the most suitable mutation possibility. This possibility should be high enough to prevent the method from becoming stuck at a local point, but at the same time, low enough to allow the best results produced by crossing over and multiplexing. In this study, the mutation possibility was selected as 10%, and the locations of two randomly selected bus stops were changed during the mutation process. As in the crossing over, also during this process, the limitations regarding producing a new individual (route) were adapted. Figure 6 shows an example to mutation process.

Notes

https://www.edusoft.ro/brain/index.php/brain/article/view/803/909

Files

Using the Genetic Algorithm for the Optimization of Dynamic School Bus fig (6).png