检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:夏明[1] 周磊山[1] 乐逸祥[1] 周艳芳[1] 周妍[1]
出 处:《物流技术》2010年第8期54-58,共5页Logistics Technology
基 金:北京市自然科学基金(9082012);铁道联合基金重点项目(60736047)
摘 要:在考虑到发线运用过程中不确定性因素的基础上,研究旅客列车停站时间和接续时间随机变动情况下客专大站到发线运用优化问题,以提高车站作业效率和方便旅客乘降为优化目标,建立了到发线运用的随机机会约束规划模型。通过将模型中的随机机会约束转化为相应的确定性等价形式,从而将随机规划模型转化为确定性模型,并设计了解决该问题的蚁群算法。算例表明该随机机会约束规划模型能取得可靠性更高的到发线运用计划。Considering the factors of uncertainty in the utilization of arrival-and-departure tracks, the paper studies its optimization with random variation of train dwell time and connecting time in large passenger stations. Aiming at improving the station working efficiency and passenger convenience, it establishes a stochastic chance constrained programming model of the arrival-and-departure track utilization and, by converting the constraints of stochastic chances of the model into corresponding deterministic equivalents, it turns the stochastic programming model into a deterministic model and designs an ant colony algorithm for its solution, with reults showing the ability of the model to yield more reliable track utilization plans.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.70