Freight Empty Cars Allocation in Railway Networks with Dynamic Demand
This paper investigates the freight empty cars allocation problem in railway networks with the dynamic demand, in which the storage cost, unit transportation cost and demand in each stage are considered.Under the constraints of capacity and demand, a stage-based optimization model for allocating freight empty cars in railway networks is formulated.The objective of the model is to minimize the total cost incurred by transferring and storing empty cars in different stages.Moreover, a genetic algorithm is designed to obtain the optimal empty cars distribution strategies in railway networks.Finally, numerical experiments are given to show the effectiveness of the proposed model and algorithm.
freight empty cars dynamic demand railway networks genetic algorithm
Ce Zhao Lixing Yang Shukai Li
School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing 100044
国内会议
桂林
英文
217-226
2013-05-17（万方平台首次上网日期，不代表论文的发表时间）