年龄结构、接触模式和接种对手足口病传播机制的影响

为进一步揭示手足口病的传播机制和优化免疫决策,提出了一类具有年龄结构、接触模式和疫苗接种的手足口病传染病模型.首先运用下一代生成矩阵求解模型基本再生数;然后利用稳定性和动力学的有关理论证明无病平衡点和地方病平衡点的存在性以及全局稳定性;最后通过数值模拟分析模型参数的影响权重.研究发现,年龄分组、接触矩阵和疫苗使用会极大地影响传播,其中年龄结构的异质性可能会恶化疫情,而隔离病人、提高疫苗的覆盖率和接种率均能够有效控制疾病传播.该文工作对于如何有效预防和控制手足口病的传播具有科学指导意义.     

公共教育影响的SIR传染病斑块模型性态分析

建立了考虑公共卫生教育影响的SIR斑块模型.通过分析模型动力学性态,给出模型平衡点存在条件,并证明了无病平衡点和地方病平衡点的稳定性.通过数值模拟分析公共卫生教育和斑块间的传播对模型疾病传播的影响,发现媒体的传播和公众之间的交流可以促进疾病防护意识,进而降低传染及传播疾病的几率.当疾病爆发时,应尽量减少人口流通,当疾病爆发后,应加强疾病防护意识的传播,尤其是医疗水平较低的地区.     

一类具有直接和间接传播的SIV传染病模型

传染病的传播途径是多种多样的,如:直接传播和间接传播等.在以往的传染病模型中,大多是只考虑直接传播对疾病的影响,而忽略了环境作用对疾病的影响,即间接传播的影响.其实,间接传播在传染病的传播中同样起着重要的作用,忽略间接传播的影响会低估基本再生数,从而错估传染病爆发的规模,给人类的健康带来更大的威胁.研究了一个既有直接传播又有间接传播的SⅣ传染病模型,通过研究模型的动力学行为,给出了无病平衡点和地方病平衡点全局渐近稳定的条件,并用数值模拟证实了该结果.     

考虑媒体报道效应的谣言传播模型研究

结合媒体正面宣传报道和负面报道对信息传播的影响,建立了一类新的社交网络谣言传播模型.利用常微分方程稳定性理论,分别讨论了无谣言传播和有谣言传播平衡点的存在性以及全局稳定性.数值仿真验证了理论分析的正确性.研究结果为政府管理部门在舆情监控和危机决策方面提供相应的对策建议.     

一类具有离散双时滞的SEIR传染病模型的稳定性与持久性

针对一类潜伏期和恢复期描述为离散双时滞的SEIR传染病模型,给出无病平衡点和地方病平衡点存在条件,证明了无病平衡点和地方病平衡点的稳定性,以及疾病的持久性.应用数值模拟验证了疾病的持久性与灭绝性,分析了接触率对疾病流行趋势的影响.     

疾病在食饵中流行的捕食与被捕食模型的分析

分析并建立了疾病在食饵中传播的生态-传染病模型,同时考虑到两种群都受密度制约因素的影响,讨论了模型解的有界性和各平衡点的存在性,利用Routh-Hurwitz判据证明了各平衡点的局部渐进稳定性,通过构造Lyapunov函数分析了各平衡点的全局渐进稳定性,得到了疾病存在与否的充分性条件.     

疾病在食饵中传播的具有时滞的捕食被捕食模型的分析

研究了一个疾病在食饵中传播的捕食与被捕食模型.在未引入时滞时,利用Routh-Hurwitz定理证明了正平衡点的局部渐近稳定性.在引入时滞后,主要讨论了正平衡点的稳定性,得到了当经过一系列临界条件时发生Hopf分支.     

基于存在基础病史易感者的SEIR模型对COVID-19传播的研究

该文基于经典的SEIR传染病模型建立了一类含有基础疾病历史人群的新冠肺炎传播模型,得到了其传播的基本再生数,确定了模型平衡点的存在性,并通过构造Lyapunov函数和利用LaSalle不变性原理论证了平衡点的全局稳定性,用数值模拟对所得理论研究结果进行了有效验证.同时,讨论了由无基础病向有基础病转化的速率系数对疾病传播的影响,发现不考虑基础病的数学模型会低估疾病传播的基本再生数和感染规模,数值模拟也显示了由无基础病向有基础病转化的速率系数对感染者人数峰值的影响.     

带有标准发生率和信息干预的时滞SIRS传染病模型的稳定性分析

本文考虑一类具有标准发生率和信息干预的时滞SIRS传染病模型.通过分析模型的特征方程,讨论无病平衡点和地方病平衡点局部渐近稳定性.应用Halanay不等式对无病平衡点的全局渐近稳定性进行证明.通过构造适当的Lyapunov函数讨论地方病平衡点全局渐近稳定性.最后通过数值模拟分析一些重要参数对疾病传播的影响.     

一类基于集合种群网络的传染病模型研究

研究了一类基于集合种群网络的传染病模型.针对在疾病传播过程中,随着染病者数量的增加,被感染的人数会达到饱和,研究了带有饱和发生率的传染病模型,建立了不同集合种群之间扩散模式,并分析了模型动力学的性态,给出了无病平衡点及其稳定性和正平衡点的存在性.最后用数值模拟验证了理论结果的正确性.     

Braess's Paradox in large random graphs

Braess's Paradox is the counterintuitive fact that removing edges from a network with “selfish routing” can decreasethe latency incurred by traffic in an equilibrium flow. We prove that Braess's Paradox is likely to occur in a natural random network model: with high probability, there is a traffic rate and a set of edges whose removal improves the latency of traffic in an equilibrium flow by a constant factor. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 2010     

交通网络建设序列的动态规划方法

交通网络建设序列优化是交通规划中一个重要问题。文章对交通网络设计及其建设序列问题的研究现状进行了分析。按照网络建设中规划者和用户间的关系,以交通网络建设序列下的各阶段系统总费用作为上层规划,以各阶段的交通流用户平衡模型作为下层规划,建立了双层规划模型。并依照问题的特点,采用动态规划的求解方法进行探讨,而下层模型则采用了基于路径搜索的GP算法进行求解。并针对网络规划算例进行了计算,针对固定和变动客流OD两种情况下的结果进行了分析。计算的结果表明,问题的双层规划模型和动态规划求解算法能够为路网规划决策提供支持。     

基于Stackelberg博弈的时变双层交通分配模型

提出一个时变双层交通分配模型,其中上层网络管理者设立了一个路段的最大排队长度,其目标是使由网络流和排队长度定义的总出行时间最小.目标函数在离散时段内以路段流量和排队长度作为决策变量,同时考虑不同类型的信号交叉口延误的影响.下层网络用户的反应依赖于上层管理者的决策,其选择是使自身感知阻抗最小的路径,服从一个基于成对组合Logit的路径选择模型,构成一个成对组合Logit的均衡分配问题.结合了交通分配和流传播方法,将其表示为一个均衡约束下的双层数学规划问题,形成了一个Stackelberg非合作博弈.使用遗传算法求解该双层规划问题,并采用实证分析来表现模型的特征和算法的计算表现.结果表明路径重叠、路段流量、路段排队长度等因素对网络均衡流分布均有显著影响.     

Chaos in a dynamic model of urban transportation network flow based on user equilibrium states

In this study, we investigate the dynamical behavior of network traffic flow. We first build a two-stage mathematical model to analyze the complex behavior of network flow, a dynamical model, which is based on the dynamical gravity model proposed by Dendrinos and Sonis [Dendrinos DS, Sonis M. Chaos and social-spatial dynamic. Berlin: Springer-Verlag; 1990] is used to estimate the number of trips. Considering the fact that the Origin–Destination (O–D) trip cost in the traffic network is hard to express as a functional form, in the second stage, the user equilibrium network assignment model was used to estimate the trip cost, which is the minimum cost of used path when user equilibrium (UE) conditions are satisfied. It is important to use UE to estimate the O–D cost, since a connection is built among link flow, path flow, and O–D flow. The dynamical model describes the variations of O–D flows over discrete time periods, such as each day and each week. It is shown that even in a system with dimensions equal to two, chaos phenomenon still exists. A “Chaos Propagation” phenomenon is found in the given model.     

Sensitivity analysis for the asymmetric network equilibrium problem

We consider the asymmetric continuous traffic equilibrium network model with fixed demands where the travel cost on each link of the transportation network may depend on the flow on this as well as other links of the network and we perform stability and sensitivity analysis. Assuming that the travel cost functions are monotone we first show that the traffic equlibrium pattern depends continuously upon the assigned travel demands and travel cost functions. We then focus on the delicate question of predicting the direction of the change in the traffic pattern and the incurred travel costs resulting from changes in the travel cost functions and travel demands and attempt to elucidate certain counter intuitive phenomena such as ‘Braess' paradox’. Our analysis depends crucially on the fact that the governing equilibrium conditions can be formulated as a variational inequality. This work was supported by the Program of University Research, U.S. Department of Transportation (Project number DTRS 5680-C-00007).     

An Efficient Approach to Real-Time Traffic Routeing for Telephone Network Management

When contingencies occur in the telephone network the proper traffic control actions for rearranging the traffic flow must be promptly taken in a short period of time, otherwise, the congestion will soon spread to other parts of the network. In this paper, a multicommodity maximal flow model is proposed to formulate the problem, and an efficient approach is proposed to find the solution within a short time period. The node pairs are first sorted by the traffic demand into decreasing order and the capacity of links is allocated to the node pair with largest demand. The traffic allocation is then iteratively reallocated on those routes which share the same links to find a better solution, until that solution is obtained. The advantages of this approach are: (1) a feasible solution can be obtained within a short time period; (2) the affected traffic can be rerouted on paths with more than two links; (3) an acceptable solution can be found once the period has expired.     

Day-to-day evolution of the traffic network with Advanced Traveler Information System

Since the notion of user equilibrium (UE) was proposed by Wardrop [13], it has become a cornerstone for traffic assignment analysis. But, it is not sufficient to only ask whether equilibrium exists or not; it is equally important to ask whether and how the system can achieve equilibrium. Meanwhile, stability is an important performance in the sense that if equilibrium is unsustainable, both the equilibrium and the trajectory are sensitive to disturbances, even a small perturbation will result in the system evolution away from the equilibrium point. These incentive a growing interest in day-to-day dynamics. In this paper, we develop a dynamical system with Advanced Traveler Information System (ATIS) and study the stability of the network with ATIS. A simple network is used to simulate the model, and the results show that there exist periodic attractors in the traffic network in some cases (for example, the market penetration level of ATIS is 0.25 and traffic demand is 2 unit). It is found that the logit parameter of the dynamical model and the traffic demand can also affect the stability of the traffic network. More periodic attractors appear in the system when the traffic demand is large and the low logit parameter can delay the appearance of periodic attractors. By simulation, it can be concluded that if the range of the periodic attractors’ domain of the simple network is known, the road pricing based on the range of the attraction domain is effective to alleviate the instability of the system.     

基于网络等级特征与VMS的交叉巢式Logit模型

基于等级特征与可变信息板(VMS)研究了交叉巢式Logit(CNL)模型及网络交通流分配。综合幂函数与指数函数表示方法给出新的信息效用衰减因子,结合道路等级特征表示VMS对车流的影响系数及CNL模型的分配系数;给出等级结构道路网络的随机用户均衡条件下的交叉巢式Logit路径选择模型及其等价数学规划,并设计网络流分配算法。通过实例网络的计算与分析,得到一些有意义的结论:等级结构越显著的路网总出行时间费用越低且其分散参数(θ)弹性绝对值越大;对具有较强随机性的实际路网,若增加一定的确定性则节省更多网络总出行时间;道路网络中设置了VMS时总出行时间受分散参数的影响更小。     

主路多车道无信号交叉口混合交通流的通行能力

Highway capacity is defined as maximum volume of traffic flow through the particular highway section under given traffic conditions,road conditions and so on.Highway construction and management is judged by capacity standard.The reasonable scale and time of highway construction,rational network structure and optimal management mode of highway network can be determined by analyzing the fitness between capacity and traffic volume.All over the world,highway capacity is studied to different extent in different country. Based on the gap acceptance theory,the mixed traffic flow composed of two representative vehicle types heavy and light vehicles is analyzed with probability theory.Capacity model of the minor mixed traffic flows crossing m major lanes,on which the traffic flows fix in with M3 distributed headway,on the unsignalized intersection is set up,and it is an extension of minor lane capacity theory for one vehicle-type and one major-lane traffic flow.     

双模式网络停车限制交通需求管理模型与方法研究

在轨道网和公路网并存的双模式交通网络, 合理设计出行终点的停车容量可优化汽车出行需求, 改善路网交通环境。本文通过分析私家车与城市轨道两种交通模式的出行需求, 并考虑私家车模式的终点停车收费服务, 建立了一种带路段环境容量和终点停车需求容量共同约束的交通需求管理模型。模型中路网使用者的出行模式采用二元Logit模型来计算, 而私家车的路线选择行为服从Logit随机用户均衡, 因此该模型是一个带不动点约束的数学规划问题。针对模型求解困难, 文中采用灵敏度分析来获取各路段流量和需求量关于终点容量波动的梯度信息, 进而设计了一种新的灵敏度分析求解算法.最后通过数值仿真实验, 验证了算法的有效性, 同时分析了不同停车收费参数对模型各指标变化趋势的影响。