摘要
本文同时考虑了成本约束和允许等待情形,研究了最小化风险的车辆运输调度问题,其中运输风险是随时间不同而变化的,即研究在时间依赖网络中基于风险的有约束的运输路径选择问题,以及在选定路径的顶点上决定的出发和等待时间的综合问题。建立了相应的混合整数规划模型,设计了相应的算法,并分析了算法复杂性,最后通过算例验证了该算法的有效性和可行性。
This paper studies the vehicle scheduling problem of minimization of the transportation risks varied with time, taking into account the case of the cost constraints and allowing for waiting at the nodes of the network. That is, an integrated risk-based path-selection problem together with the determination of the departure and waiting time each node on the selected path in the time-dependent networks. After a mixed integer programming model is proposed, a novel algorithm is given. The computational complexity of the algorithm is also analyzed. Finally, a numerical example is presented to show the effectiveness and feasibility of this algorithm.
出处
《中国管理科学》
CSSCI
北大核心
2009年第3期87-92,共6页
Chinese Journal of Management Science
基金
教育部高等学校博士点基金项目(20050422043)
关键词
车辆运输调度
交通网络
风险
算法
vehicle scheduling problem
transportation network
risk
algorithm
