Research Article
Analysis of Feeder Bus Network Design and Scheduling Problems
Table 1
Feeder route generation methods in the literature.
| References | Initial building methods | Specify |
|
Kuah and Perl [6] | H | Sequential savings |
Martins and Pato [1] | H | Sequential savings and two-phase |
Shrivastav and Dhingra [7] | H | HFRGA, Dijkstra’s algorithm |
Chien et al. [9] | Me | GA |
Kuan et al. [10] | H | Delimiter algorithm, Breedam [12] |
Kuan et al. [11] | H | Delimiter algorithm, Breedam [12] |
Shrivastava and O’mahony [41] | H | K-path algorithm, Eppstein [46] |
Shrivastava and O’mahony [43] | H | K-path algorithm, Eppstein [46] |
Shrivastava and O’mahony [44] | H | K-path algorithm, Eppstein [46] |
Shrivastava and O’mahony [29] | H | Dijkstra’s algorithm |
Mohaymany and Gholami [31] | Me | ACO |
Gholami and Mohaymany [47] | Me | ACO |
|
|