摘要
对全过程时间限制车流协调优化问题进行描述。基于该问题随机动态特性,将计划周期划分为若干决策时隙区间,并以决策时隙区间为单位进行建模求解。定义运输任务即时成本和未来成本,并构建决策时隙区间内最优分配网络。通过决策时隙区间逆向滑动过程设计,逐步估计各决策时隙区间内相应运输任务的未来成本,并将其引入模型构建车流组织协调优化问题异构模型。最后设计试验演进问题求解过程,验证方法的有效性。
The problem of car flow coordinated optimization with whole-procedure time limited is described. Based on stochastic and dynamic characteristics, the planning horizon is divided into a number of decision slot intervals. The modeling and solving are focused on single decision slot interval. The immediate cost and future cost of transport task are defined. The distribution network model based on single decision slot interval is given. The inverse sliding decision slot interval is given. The future cost of transport task in decision slot interval is gradually estimated. The parameters on the estimated value of transport task future cost are introduced into model. So the heterogeneous model is given. Finally, the evolution of modeling and solving is shown for exam- ple. It tests and verifies the whole solving scheme.
出处
《运筹与管理》
CSSCI
CSCD
北大核心
2016年第4期69-77,共9页
Operations Research and Management Science
基金
国家自然科学基金项目(71001091
71001090)
教育部人文社会科学研究项目(15YJC630148)
郑州大学优秀青年教师发展基金项目(1421326092)
关键词
决策时隙区间
决策缓区间
空费时间
逆向滑动
异构模型
decision slot interval
decision buffer interval
leisure time
inverse sliding
heterogeneous model
