Research Article
Improved Genetic Algorithm with Gene Recombination for Bus Crew-Scheduling Problem
Table 1
Part of #26 bus timetable and feasible connecting nodes with constraints.
| Trip number | Dep. depot | Dep. time | Dest. depot | Arr. time | Running time (minute) | Feasible connecting nodes |
| 1 | Erlizhuang | 5:30 | Xibianmen | 6:48 | 78 | 8, 9 | 2 | Erlizhuang | 5:40 | Xibianmen | 6:58 | 78 | 8, 9 | 3 | Erlizhuang | 7:19 | Xibianmen | 8:49 | 90 | 10 | 4 | Erlizhuang | 9:15 | Xibianmen | 10:45 | 90 | 11, 12 | 5 | Erlizhuang | 9:29 | Xibianmen | 10:59 | 90 | 12 | 6 | Erlizhuang | 11:06 | Xibianmen | 12:32 | 86 | — | 7 | Xibianmen | 5:30 | Erlizhuang | 6:46 | 76 | 3 | 8 | Xibianmen | 7:21 | Erlizhuang | 8:49 | 88 | 4, 5 | 9 | Xibianmen | 7:26 | Erlizhuang | 8:54 | 88 | 4, 5 | 10 | Xibianmen | 9:27 | Erlizhuang | 10:55 | 88 | 6 | 11 | Xibianmen | 11:00 | Erlizhuang | 12:24 | 84 | — | 12 | Xibianmen | 11:14 | Erlizhuang | 12:38 | 84 | — |
|
|