Research Article
Allocating Freight Empty Cars in Railway Networks with Dynamic Demands
Table 1
The detailed features of different studies.
| | Misra [1] | Kikuchi [4] | Lei et al. [10] | Joborn et al. [17] | This Paper |
| Problem description | A simple transportation problem | A transshipment problem | A balanced transportation problem | A network flow problem | A time-stage network flow problem | Formulation | A linear programming model | An improved linear programming model | A stochastic programming model | A capacitated network design model | A dynamic network flow model | Network | Physical network | Physical network | Physical network | Time-space network | Time-space network | Characteristics | — | Single-stage demand | Single-stage demand | Single-stage demand | Multi-stage demand | Algorithm | The simplex method | — | GA (genetic algorithm) | TS (tabu search) | GA (genetic algorithm) |
|
|