铁路空车调配问题的区间线性规划模型及算法  

Interval Linear Programming Model and Algorithm for Railway Empty Car Distribution

作　　者：曲思源[1] 

机构地区：[1]上海铁路局运输处,上海200071

出　　处：《华东交通大学学报》2015年第3期6-11,共6页Journal of East China Jiaotong University

摘　　要：铁路空车调配问题是合理解决空车需求与供应之间的不平衡问题。在借鉴空车调配问题模型已有成果的基础上,围绕空车供应与需求量的不确定性、空车调配的时效性、路段通过能力的限制性3个方面,对区间数运用于空车调配问题加以适应性分析,以空车总走行公里最少和到达时间满足空车需求限定时间可信度加权和最大为目标,提出利用线性区间规划理论解决空车调配问题的模型和算法,并结合算例验证了区间规划的灵活性和简便性,使得空车调整模型符合运输生产实际并具有普遍意义,该模型的采用对路网上空车调整问题将起到很好的借鉴作用。Railway empty car distribution is a solution to the demand and supply imbalance of empty cars. On the ba- sis of the empty car distribution model, centering on three aspects including the supply and demand uncertainty of empty cars, the deployment timeliness and the limit of interval capability, this paper conducts adaptive analysis of the empty car distribution. To achieve minimum kilometers of the total empty mileage and the maximum weighted credibility of the empty demand for limited time in terms of arrival time, the paper proposes linear interval planning theory to obtain the model and algorithm of empty car distribution. Combined with examples to verify the flexibility and simplicity of the interval planning, it concludes the proposed empty distribution model can meet the practical transportation and production demands, providing reference and significance for the distribution of railway empty car.

关 键 词：铁路运输 区间规划 空车调配 模型 

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