基于技术站改编作业的集装箱空箱调运鲁棒优化  

Robust optimization on railway empty container allocation under reclassifying operation

作　　者：李永军[1] 段刚[2] 陈莉[1] 田丽娜[1] 苏旺辉[1] 

机构地区：[1]兰州城市学院数学学院,甘肃兰州730070 [2]兰州交通大学交通运输学院,甘肃兰州730070

出　　处：《铁道科学与工程学报》2016年第3期583-589,共7页Journal of Railway Science and Engineering

基　　金：国家自然科学基金资助项目(11261027;61364026);甘肃省财政厅基本科研业务费资助项目(213060);兰州交通大学青年科学研究基金资助项目(2011020);兰州城市学院校长科研创新基金资助项目(LZCU-XZ2014-05)

摘　　要：对一般的集装箱办理站,考虑到技术站改编时间和运输走行时间对空箱需求站时间窗的影响,以集结费用、技术站改编费用、车辆走行费用以及空箱早到库存成本或延误损失成本之和最小为目标,以车站作业能力和线路通过能力为约束条件,建立基于技术站改编作业的空箱调运模型。针对集装箱空箱运输过程中走行时间不确定的特点,建立鲁棒软时间窗组合优化模型。通过等价变换和对偶变换,将鲁棒软时间窗组合优化模型转换为线性规划模型,极大地简化了模型。然后构造基于技术站改编作业的空箱调运鲁棒优化模型,并将其转换为一般的整数线性规划模型。算例表明,该方法简单有效。最后对不确定走行时间的个数p进行灵敏度分析,结果表明其存在一个较小的上界。Taking the impact of reclassifying time and transport time on the time window of demand into consider-ation for common container terminal, an empty container allocation model based on reclassifying operation intechnique station is proposed for minimizing the sum of reclassifying cost, transport cost, accumulation cost andinventory cost for early arriving or loss cost for delaying and subjects to container operating ability and routingtransport ability, According to the uncertain transport time, a robust soft time window model of combinatorial op-timization is proposed. Equivalent transformation and dual transformation methods were used to simplify the ro-bust soft time window model to a linear programming one A robust optimization of empty container allocation withreclassifying operation in technique station was constructed for transforming it to integer linear programming mod-el. A numerical example demonstrates that the model is simple and effective for improving the efficiency of rail-way container transportation.

关 键 词：铁路运输 优化 鲁棒软时间窗 空箱调运 技术站改编作业 不确定走行时间 

分 类 号：U292[交通运输工程—交通运输规划与管理] U294[交通运输工程—道路与铁道工程]