Research Article
Genetic Algorithm for Biobjective Urban Transit Routing Problem
Table 9
The average and the best solutions found in terms of number of generations, number of runs, and CPU time.
| Case | Average | Objective | The best solution | Generations | CPU time (second) | Runs | Generations | CPU time (second) |
| I | 112 | 57.66 | Passenger | 6 | 21 | 12.52 | Operator | 2 | 11 | 3.73 |
| II | 116 | 70.07 | Passenger | 16 | 31 | 31.47 | Operator | 24 | 59 | 23.92 |
| III | 123 | 102.91 | Passenger | 1 | 61 | 73.20 | Operator | 28 | 46 | 25.82 |
| IV | 124 | 129.68 | Passenger | 9 | 63 | 98.90 | Operator | 22 | 41 | 25.12 |
|
|