|
| Paper | Objectives | Demand | Methodology |
|
| G. Laporte et al. (2004) | Trip covering | Mode choice depended | Conventional (CPLEX) |
| W. Fan et al. (2008) | The sum of operator cost, user cost, and unsatisfied demand costs | Mode choice depended | Heuristic (systematic tabu search) |
| Á. Marín et al. (2009) | Travel cost, attractiveness | Mode choice depended | Conventional (piecewise linearization) |
| B. García-Archilla et al. (2011) | Trip coverage | Mode choice depended | Heuristic (GRASP algorithms) |
| G. Gutiérrez-Jarpa et al. (2013) | Travel cost, traffic capture | Attraction depended between OD pairs | Conventional (branch-and-cut method with CPLEX) |
| J. S. C. Chew et al. (2013) | Travel cost, operation cost | Fixed | Heuristic/matheuristic (genetic algorithm) |
| M. Nikolić et al. (2013) | The number of satisfied passengers, transfers, and travel time | Fixed | Metaheuristic (bee colony optimization) |
| D. Canca et al. (2014) | Net profit of the railway network | Mode choice depended | Heuristic (combination of branch-and-bound and local nonlinear optimization) |
| G. Gutiérrez-Jarpa et al. (2017) | Construction cost, time savings, patronage | Mode choice depended | Conventional (-constraint method with CPLEX) |
| F. López-Ramos et al. (2017) | Travel cost, costs related to construction and exploitation | Fixed | Heuristic/matheuristic (corridor generation algorithm and line splitting algorithm) |
| D. Canca et al. (2017) | Discounted profit | Mode choice depended | Matheuristic (adaptive large neighborhood search algorithm) |
| A. T. Buba et al. (2018) | Passenger cost, unmet demand | Fixed | Matheuristic (differential evolution) |
| X. Feng et al. (2019) | Travel time | Fixed | Heuristic/matheuristic (genetic algorithm) |
| S. Bhushan Jha et al. (2019) | Travel time, operation cost | Fixed | Heuristic/matheuristic (genetic algorithm, particle swarm optimization) |
|
