A dynamic traffic assignment model for a continuum transportation system

A predictive continuum dynamic user-optimal (PDUO-C) model is formulated in this study to investigate the dynamic characteristics of traffic flow and the corresponding route-choice behavior of travelers within a region with a dense urban road network. The modeled region is arbitrary in shape with a single central business district (CBD) and travelers continuously distributed over the region. Within this region, the road network is represented as a continuum and travelers patronize a two-dimensional continuum transportation system to travel to the CBD. The PDUO-C model is solved by a promising solution algorithm that includes elements of the finite volume method (FVM), the finite element method (FEM), and the explicit total variation diminishing Runge-Kutta (TVD-RK) time-stepping method. A numerical example is given to demonstrate the utility of the proposed model and the effectiveness of the solution algorithm in solving this PDUO-C problem.     

Robust optimization for emergency logistics planning: Risk mitigation in humanitarian relief supply chains

This paper proposes a methodology to generate a robust logistics plan that can mitigate demand uncertainty in humanitarian relief supply chains. More specifically, we apply robust optimization (RO) for dynamically assigning emergency response and evacuation traffic flow problems with time dependent demand uncertainty. This paper studies a Cell Transmission Model (CTM) based system optimum dynamic traffic assignment model. We adopt a min–max criterion and apply an extension of the RO method adjusted to dynamic optimization problems, an affinely adjustable robust counterpart (AARC) approach. Simulation experiments show that the AARC solution provides excellent results when compared to deterministic solution and sampling based stochastic programming solution. General insights of RO and transportation that may have wider applicability in humanitarian relief supply chains are provided.     

Robust Wardrop’s user equilibrium assignment under stochastic demand and supply: Expected residual minimization approach

Various models of traffic assignment under stochastic environment have been proposed recently, mainly by assuming different travelers’ behavior against uncertainties. This paper focuses on the expected residual minimization (ERM) model to provide a robust traffic assignment with an emphasis on the planner’s perspective. The model is further extended to obtain a stochastic prediction of the traffic volumes by the technique of path choice approach. We show theoretically the existence and the robustness of the ERM solution. In addition, we employ an improved solution algorithm for solving the ERM model. Numerical experiments are carried out to illustrate the characteristics of the proposed model, by comparing with other existing models.     

Multiple equilibria in a dynamic traffic network

This study provides an example in which the dynamic user equilibrium (DUE) assignment of a congested road network with bottlenecks is non-unique. In previous studies, the uniqueness of DUE assignments with the bottleneck model has been shown in limited cases such as single-origin and single-destination networks. Consequently, it is still an important issue whether or not uniqueness is a general property of DUE assignments. The present study describes a network in which multiple patterns of link travel time are found, thus providing a negative answer to this question. The network has a loopy structure with multiple bottlenecks and multiple origin-destination (OD) pairs. Given a certain demand pattern of departure times for vehicles leaving their origins, a non-convex set of equilibria with a non-unique pattern of link travel times is shown to exist.     

一种CGF动态协作模型研究

针对CGF动态协作性能要求,借鉴CPS方式,引入分层决策思想,突出了对突发事件处理的自主协调性,建立了一种团队分层协作框架模型,根据CGF实际能力适时分配任务,同时对协作过程进行详细描述并给出了基于BDI模型的行为实现,为动态智能推理提供基础,较好地实现CGF动态协作。     

基于期望效用准则战场目标分配决策研究

文章通过分析影响目标价值的指标,构建火力分配决策模型,研究基于期望效用准则的战场目标分配决策方案模型,提出其分析步骤和方法,科学计算期望效用,较大程度上降低了决策的风险程度,具有一定的科学性和实用性,该方法为战场目标分配决策方案的选择提供理论依据。     

中国南极中山站的海堤道路建设

南极中山站鸳鸯群岛拟建设卸货码头工程,按计划首先建设受潮汐、波浪影响的海堤道路。由于工程基础资料贫乏,施工条件特殊,中国第22次南极考察队项目组,行前进行了充分的技术准备,对土工材料进行模拟南极自然条件的性能试验研究。现场实施中结合实际解决了关键性技术问题并优化了设计实施方案,按计划完成建设任务。     

最短路-最大流交通分配法

为确定公路网各路段交通量,在最短路交通分配法的基础上,引入了求最短路上最大流的分析技术,提出了最短路上最大流交通分配计算方法。依据对公路网中不同路段初定的技术等级所具备的最大服务交通量和拥挤度的要求,确定出该路段的容许交通量,当路段所分配到的交通量累计达到这一量值时,及时地对路段技术等级进行调整,进而对该路段的路权与容许交通量进行适时的调整。算例表明:该计算方法有效地提高了交通分配过程中有关路权处理的整体质量,较现行的最短路交通分配法和交通容量限制分配法的分配结果更趋合理。     

基于DTA的OD估计方法的交通检测器优化布置模型研究

论文在探讨了动态交通分配和动态0D估计背景下的交通检测器优化问题的基础上，提出了基于DTA的动态OD估计方法的交通检测器布置原则；从预算，对路网中交通流量信息的覆盖程度，对关键路段的检测、对重复检测器的剔除等方面对路网交通检测方案进行约束，建立了交通检测器优化布置模型；最后将遗传算法用于交通检测器优化布置模型的求解，证明了基于DTA的动态0D估计方法的交通检测器优化布置模型的有效性。论文方法概念清楚、操作简单，是交通检测器优化布置的一种可行方法。     

交通管制条件下城市道路网络模型及分配算法研究

城市道路网络模型及其算法是城市道路网络分析和分配的基础。本文首先分析了交通管制条件下原有城市道路网络模型和算法的不足,在此基础上提出一种改进模型和算法,并给出算例。这种改进的模型和算法能较好地满足实际分配的要求,在交通规划、交通管理和交通流模拟中都有着十分广阔的应用前景,且已经被成功地应用于郑州市综合交通规划中。