Dynamic activity-travel assignment in multi-state supernetworks

The integration of activity-based modeling and dynamic traffic assignment for travel demand analysis has recently attracted ever-increasing attention. However, related studies have limitations either on the integration structure or the number of choice facets being captured. This paper proposes a formulation of dynamic activity-travel assignment (DATA) in the framework of multi-state supernetworks, in which any path through a personalized supernetwork represents a particular activity-travel pattern (ATP) at a high level of spatial and temporal detail. DATA is formulated as a discrete-time dynamic user equilibrium (DUE) problem, which is reformulated as an equivalent variational inequality (VI) problem. A generalized dynamic link disutility function is established with the accommodation of different characteristics of the links in the supernetworks. Flow constraints and non-uniqueness of equilibria are also investigated. In the proposed formulation, the choices of departure time, route, mode, activity sequence, activity and parking location are all unified into one time-dependent ATP choice. As a result, the interdependences among all these choice facets can be readily captured. A solution algorithm based on the route-swapping mechanism is adopted to find the user equilibrium. A numerical example with simulated scenarios is provided to demonstrate the advantages of the proposed approach.     

Stability of transportation networks under adaptive routing policies

Growing concerns regarding urban congestion, and the recent explosion of mobile devices able to provide real-time information to traffic users have motivated increasing reliance on real-time route guidance for the online management of traffic networks. However, while the theory of traffic equilibria is very well-known, fewer results exist on the stability of such equilibria, especially in the context of adaptive routing policy. In this work, we consider the problem of characterizing the stability properties of traffic equilibria in the context of online adaptive route choice induced by GPS-based decision making. We first extend the recent framework of “Markovian Traffic Equilibria” (MTE), in which users update their route choice at each intersection of the road network based on traffic conditions, to the case of non-equilibrium conditions, while preserving consistency with known existence and uniqueness results on MTE. We then exhibit sufficient conditions on the network topology and the latency functions for those MTEs to be stable in the sense of Lyapunov for a single destination problem. For various more restricted classes of network topologies motivated by the observed properties of travel patterns in the Singapore network, under certain assumptions we prove local exponential stability of the MTE, and derive analytical results on the sensitivity of the characteristic time of convergence to network and traffic parameters. The results proposed in this work are illustrated and validated on synthetic toy problems as well as on the Singapore road network with real demand and traffic data.     

Application of Lagrangian relaxation approach to α-reliable path finding in stochastic networks with correlated link travel times

This study investigates the important problem of determining a reliable path in a stochastic network with correlated link travel times. First, the distribution of path travel time is quantified by using trip records from GPS probe vehicles. Second, the spatial correlation of link travel time is explicitly considered by using a correlation coefficient matrix, which is incorporated into the α-reliable path problem by Cholesky decomposition. Third, the Lagrangian relaxation based framework is used to handle the α-reliable path problem, by which the intractable problem with a non-linear and non-additive structure can be decomposed into several easy-to-solve problems. Finally, the path-finding performance of this approach is tested on a real-world network. The results show that 15 iterations of calculation can yield a small relative gap between upper and lower bounds of the optimal solution and the average running time is about 5 s for most OD settings. The applicability of α-reliable path finding is validated by a case study.     

大吨位异形钢桥塔施工支架设计研究

为研究不同支架方案对异形钢桥塔施工过程的影响,以新首钢大桥为背景工程做了对比分析,进而分析桥塔施工过程对桥塔-支架整体耦合模型内力、位形的影响,研究支架设计过程中的一些细部问题.结果表明:格构式支架受力明确、合理,施工方便且用钢量小,建议采用该支架方案;桥塔采用反变形的施工方案,可以很好地满足桥梁结构设计线形要求;在格构式支架设计中应避免多个斜撑相贯于立柱同一节点造成支架立柱受力不均匀、部分立柱受力急剧增大的问题;在有限元模拟中支架顶部与高塔连接建议采用铰接方式进行简化处理..     

数控车削加工仿真系统的研究与实现

介绍一个数控车床加工仿真系统,系统实现了对数控代码的词法、语法检验并将代码翻译成动画仿真所需的数据格式．通过在计算机上动画演示加工过程来检验数控代码的正确性．使用该系统可以实现高效率、低成本的培训．     

多目标最短路径模型及算法

为获得满足决策者需要的多目标最短路径问题的有效路径,建立了多目标最短路径模型,并提出了综合k-最短路径算法和多目标格序决策方法的多项式算法.该算法根据决策者可以接受的各单目标的上限,用k-最短路径算法,分别确定各单目标的可行路径集及其交集.再用多目标格序决策方法,比较交集中的有效路径,最终获得决策者满意的路径.     

变权值加快收敛的路径寻优实时算法

为获得满意解为目标的最优路径选择问题，给出了一种加权的LRTA^*(Learning Real-TimeA^*)算法，通过改变估价函数值更新规则与解时间和解质量的相对折中，加快算法收敛速度。实例应用表明，该方法比LRTA^*算法更快地收敛于满意解，是一种求解大城市稠密路网两点间最优路径的有效方法。     

粗糙集代数与格蕴涵代数

讨论粗糙集代数与格蕴涵代数的关系以及由粗糙集代数构造格蕴涵代数的方法．借助近似代数上的原子及同余关系，证明了在适当选取蕴涵算子及余运算之后，粗糙集代数就成为格蕴涵代数。     

对多路径交通分配的节点分配算法的讨论

针对文[1]中的多路径交通分配的节点分配算法存在的问题进行了讨论,提出了合理的修正方法,该方法需要路径的列举.最后给出了修正方法的应用实例并与Dial算法进行了比较.     

格值时态命题逻辑LTP(X)的语义问题

在格值命题逻辑系统LP(X)中引入时态算子E(曾经)和F(将会)以及它们的对偶算子H(曾经总是)和G(将会总是)，建立了一个以时轴为语境的格值时态命题逻辑系统LTP(X)，讨论了LTP(X)与时间相关的一系列性质及时态词的重叠问题，证明了MP语义规则和HS语义规则在该系统中成立。