An improved local branching approach for train formation planning |
| |
Authors: | Masoud Yaghini Mohsen Momeni Mohammadreza Sarmadi |
| |
Institution: | Department of Rail Transportation Engineering, Iran University of Science and Technology, Tehran, Iran |
| |
Abstract: | The train formation plan (TFP) determines routing and frequency of trains, and assigns the demands to trains. In this paper, an improved local branching algorithm is proposed for the TFP model in Iranian railway. This solution strategy is exact in nature, although it is designed to improve the heuristic behavior of the mixed integer programming (MIP) solver at hand. In the local branching algorithm, additional constraints are built in the model for the binary variables, but in the improved local branching algorithm, the additional constraints are built in the model for integer variables. A state-of-the-art method is applied for parameter tuning using design of experiments approach. To evaluate the proposed solution method, we have simulated and solved twenty test problems. The results show the efficiency and effectiveness of the proposed approach. The proposed algorithm is implemented for Iranian Railway network as a case study. |
| |
Keywords: | Rail transportation planning Train formation plan Local branching algorithm Capacitated service network design problem Metaheuristic Iranian railway |
本文献已被 ScienceDirect 等数据库收录! |
|