空车调配是铁路运输组织的重要环节。本文分析空车供给和需求量的不确定性、车种代用状况,给出空车到达时刻满意度定义。以空车走行公里最短、到达时刻满意度最大和车种代用成本最低为优化目标,构建铁路枢纽空车调配的随机机会约束规划模型。通过将机会约束转化为确定性的等价类,将模型转换为对应的确定性模型,利用和声搜索算法进行求解。设计适合求解的编码方法,基于该编码的初始化方法和微调方法能够保证解的可行性。算例证明,设计的模型与算法有效且可行,与确定性情况比较,空车走行公里下降19.34%,总体到达时刻满意度增加0.66%,车种代用成本降低32%。 Empty car deployment is an important part of the railway transport organization. This article analyzes the uncertainty of empty supply and demand, the status of substitute of vehicles, and gives the definition of satisfaction of empty arrival time. Taking the shortest distance of empty train, the satisfaction of arrival time and the lowest cost of vehicle type as the optimization objectives, a random chance constrained planning model of empty train deployment in railway hub is constructed. By transforming the chance constraint into a deterministic equivalence class, the model is transformed into a corresponding deterministic model and solved using a harmonic search algorithm. Design coding method suitable for solving, based on the coding of the initialization method and fine-tuning method to ensure the feasibility of the solution. The examples show that the designed models and algorithms are effective and feasible. Compared with the deterministic case, the empty kilometers traveled kilometers decreased by 19.34%, the satisfaction of the overall arrival time increased by 0.66% and the vehicle substitution cost decreased by 32%.