铁路空车调配问题的随机机会约束模型及遗传算法  

Stochastic Chance-constrained Model and Genetic Algorithm for Empty Car Distribution in Railway Transportation

作　　者：雷中林[1] 何世伟[1] 宋瑞[1] 蔡靖[2] 

机构地区：[1]北京交通大学交通运输学院,北京100044 [2]北京铁路局德州站,山东德州253000

出　　处：《铁道学报》2005年第5期1-5,共5页Journal of the China Railway Society

基　　金：国家自然科学基金资助项目(70171036;70371014);高等学校博士学科点专项科研基金资助项目(20040004012)

摘　　要：提出一类特殊的随机机会约束模型来求解铁路空车调配问题。这类随机机会约束可转化为相应的确定性等价类,应用遗传算法求解。通过对实际空车调配问题的数值计算和分析,表明了不确定性优化模型和所设计遗传算法的有效性并在铁路运输中有广泛的应用前景。The paper describes a class of special stochastic chance-constrained programming models used in empty car distribution in railway transportation. The chance constraints can be converted to their respective deterministic equivalents, then the equivalent deterministic models can be obtained. The genetic algorithm has been designed for resolution, and an instance is developed. Practical empty-car distribution computation demonstrates uncertain optimal models and the genetic algorithm are effective and have wide application in future railway transportation.

关 键 词：不确定性 随机机会约束规划 空车调配 遗传算法 

分 类 号：U292.45[交通运输工程—交通运输规划与管理]