Research Article
Determining Optimal Link Capacity Expansions in Road Networks Using Cuckoo Search Algorithm with Lévy Flights
Table 2
The compared algorithms on all test networks.
| | Methods | Sources |
| | Hooke-Jeeves algorithm (HJ) | Abdulaal and LeBlanc [3] | | Equilibrium Decomposed Optimization (EDO) | Suwansirikul et al. [4] | | Modular In-core Nonlinear Optimization System (MINOS) | Suwansirikul et al. [4] | | Genetic Algorithm (GA) |
Mathew and Sharma [20] | | Iterative Optimization Assignment algorithm (IOA) | Allsop [42] | | Simulated Annealing algorithm (SA) | Friesz et al. [11] | | Sensitivity Analysis Based algorithm (SAB) | Yang and Yagar [43] | | Augmented Lagrangian algorithm (AL) | Meng et al. [14] | | Path based Mixed Integer Linear Program (MILP) | Wang and Lo [21] | | Link based Mixed Integer Linear Program (LMILP) | Luathep et al. [44] | | Penalty with MultiCutting plane method (PMC) | Li et al. [22] | | Gradient projection method (GP) | Chiou [15] | | Conjugate gradient projection method (CG) | Chiou [15] | | Quasi-Newton projection method (QNEW) | Chiou [15] | | PARATAN version of gradient projection method (PT) | Chiou [15] | | Cuckoo search (CS) algorithm with Lévy flights | This paper |
|
|
