The intercity railway is subject to variation and fluctuation in demand both in time and space over a day to a large extent. In that case, more advanced line planning techniques are practically needed to match the non-equilibrium passenger demand. We propose an integer linear programming model for adapting to the fluctuating demand and improving rail line profit, in which the multi-period planning approach and flexible train composition mode are taken into consideration. In particular, we also consider the limitations of the carriage and the dynamic transfer of resources during a finite period to ensure the better implementation of the line planning and subsequent operation plans. Our purpose is to improve on previous line planning models by integrating the multi-period strategic-level line planning decision with resource constraints. Since the problem is computationally intractable for realistic size instances, an improved round heuristic algorithm that is based on linear relaxation is proposed and we compare the round heuristic performance with the commercial solver Gurobi on artificial instances. The numerical experiments that are based on an intercity railway in China certify the effectiveness and applicability of the proposed model and algorithm. We evaluate the impact of different optimization parameters and reserved carriages and the computation results show that in comparison to the fixed composition mode, the proposed approach can improve the utilization efficiency of carriage resources and increase the line profit by 1.9% under the same carriage resource conditions.
This paper presents a novel mathematical formulation in crew scheduling, considering real challenges most railway companies face such as roundtrip policy for crew members joining from different crew depots and stricter working time standards under a sustainable development strategy. In China, the crew scheduling is manually compiled by railway companies respectively, and the plan quality varies from person to person. An improved genetic algorithm is proposed to solve this large-scale combinatorial optimization problem. It repairs the infeasible gene fragments to optimize the search scope of the solution space and enhance the efficiency of GA. To investigate the algorithm’s efficiency, a real case study was employed. Results show that the proposed model and algorithm lead to considerable improvement compared to the original planning: (i) Compared with the classical metaheuristic algorithms (GA, PSO, TS), the improved genetic algorithm can reduce the objective value by 4.47%; and (ii) the optimized crew scheduling plan reduces three crew units and increases the average utilization of crew unit working time by 6.20% compared with the original plan.
In this study, we present a mathematical model and solution approach for addressing the robust integrated intercity railway depot location and line planning problem (RIDLLPP), which encompasses the initial two stages of the railway planning process. Our primary objective is to identify depot locations that exhibit robustness across a range of likely future scenarios, and this is achieved by incorporating line planning decisions. The model focuses on five critical strategic determinations, namely the depot location, depot storage capacity, line operation, passenger assignment, and fleet allocation. To tackle this complex problem, we propose an iterative solution framework that combines the Differential Evolution (DE) algorithm with improved rounding heuristics (DE-IRH). To evaluate the effectiveness of our framework, we conduct a comparative analysis with the Gurobi solver using multiple medium-sized artificial instances. The results demonstrate that our proposed framework achieves an optimality gap of 4.87% while requiring less computational time. Furthermore, we validate the robustness of the model’s location choices across various input scenarios, thereby providing valuable insights for transportation planning agencies and railway companies that can inform their decision-making processes.