Research Article
Genetic Algorithm for Biobjective Urban Transit Routing Problem
| Parent 1: (1 2 3 5 0 5 6 0 4 6 7 0) | Parent 2: (3 4 6 7 0 1 3 4 0 2 3 5 7 0) | Crossover route: 2 | Crossover route: 1 | Offspring 1: (1 2 3 5 0 3 4 6 7 0 4 6 7 0) | Offspring 2: (5 6 0 1 3 4 0 2 3 5 7 0) |
|
|