Answers are grounded in this paper and cite their sources.
The distribution of empty railcars is a critical challenge in railway operations, as inefficient distribution can undermine system-wide economic performance. This study develops a multi-constraint mixed-integer linear programming (MILP) model that integrates railcar-type substitution and carbon emission costs within a low-carbon optimization framework. Unlike conventional models with fixed supply–demand classifications, the model allows station roles to change dynamically according to previous distribution decisions, and substitution relationships among seven car types are explicitly considered. Using real operational data from 17 stations of the Jinan Railway Bureau over a 7-day period, exact solutions obtained via C#-invoked CPLEX are compared with those from a genetic algorithm (GA), a traditional microevolution algorithm (MEA), and an improved MEA. Results show that CPLEX yields the lowest objective value, while the improved MEA achieves solutions within 1.14% of the CPLEX objective value and reduces computation time to 145.87 s, corresponding to a computation time reduction of approximately 15.47%, consistently outperforming the traditional MEA. Carbon emission costs account for approximately 4.8% of the total cost for the improved MEA under the current pricing scheme, providing a low-carbon cost incentive with a moderate impact on distribution structures. Reliability tests based on 50 independent runs confirm the robustness of the improved MEA. Overall, the proposed approach offers a practical and scalable decision-support tool for empty railcar distribution under increasingly stringent carbon regulation.
No takes yet. Share an insight, caveat, or question.
Hu et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: