有超车规则的交通流的元胞自动机模型

分析和评论了2014年美国大学生数学建模竞赛（MCM）A题,以及获得outstanding winner奖的6篇论文。首先对试题进行分析,并结合已有文献指出A题的主要解题思路;然后,通过评述获奖论文,指出学生论文的优点及存在的问题;最后,对今年赛题的某些问题进行讨论。     

Optimal Decentralized Regulation for a Class of Flow Networks

Optimal decentralized regulation is considered for a class of flow networks where, at each intersection, a selective switch links a single input–output pair at anytime. It is shown that a special case of the above is an urban traffic network with signalized intersection. We analyze first the traffic situation of an isolated intersection based on the point-queuing model of traffic and model the intersection dynamics via two states: either unsaturated or saturated. According to the different traffic characteristics of the two states, we design two intersection controllers and then combine them into one hybrid controller. This hybrid controller is extended to the multi-intersection case and becomes a decentralized hybrid intersection controller. A simulation study is given in this paper and it shows that this decentralized hybrid intersection control method can improve the performance of traffic networks and by extension the performance of more general flow networks.     

紧急网络中的最小饱和流问题

网络N中的一个流,如果沿前向已无法再增流,则称为饱和流,在交通拥挤或紧急疏散时,网络往往被一饱和流所堵塞。显然,这饱和流的值越小,网络的性能就越差。于是从网络分析的观点就提出最小饱和流问题。本文首先证明此问题NP－困难的。然后给出关于最小饱和流与最大流的关系及算法方面的结果。     

Domain Decomposition of Optimal Control Problems for Dynamic Networks of Elastic Strings

We consider optimal control problems related to exact- and approximate controllability of dynamic networks of elastic strings. In this note we concentrate on problems with linear dynamics, no state and no control constraints. The emphasis is on approximating target states and velocities in part of the network using a dynamic domain decomposition method (d³m) for the optimality system on the network. The decomposition is established via a Uzawa-type saddle-point iteration associated with an augmented Lagrangian relaxation of the transmission conditions at multiple joints. We consider various cost functions and prove convergence of the infinite dimensional scheme for an exemplaric choice of the cost. We also give numerical evidence in the case of simple exemplaric networks.     

对换网络和乘积循环网络的超连通性

本文证明了对换网络和乘积循环网络是超连通的。     

A secular equation for the Jacobian matrix of certain multispecies kinematic flow models

Multispecies kinematic flow models lead to nonlinear systems of conservation laws with a possibly large number of unknowns, the concentrations or the densities of the different species. In recent years, the hyperbolic character of several of these models has been analyzed by considering the characteristic polynomial of the Jacobian matrix of the system. This analysis can be considerably simplified by realizing that the fluxes in these models have a particular algebraic structure that can be exploited within a systematic algebraic framework. The framework can serve to determine the eigenvalues, and even the eigenvectors, of the Jacobian matrix of the system, which allows the use of characteristic‐based high‐resolution shock capturing schemes in numerical simulations.© 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

交通流非参数回归模型

交通流宏观参数流量、速度和占有率在交通工程和管理中具有非常重要的作用 ,对这三者关系的刻划反映了道路本身特性和交通流的规律。到目前为止 ,基本上采用线性或非线性的参数模型来描述 ,此类模型在应用中具有一定的局限性 ,并交通变量时间序列进行预测 ,数据拟合表明 ,选择适当的核函数或邻近数以及窗宽 ,可以达到比较满意的效果     

一个交通模型的行波解的渐近稳定性

主要考虑下面的交通模型的行波解的渐近稳定性.{vt-ux=0 (E)ut+p(v)x=1/ε(f(v)-u+μuxx 其中初始值为 (v,u)(x,0)=(v0(x),u0(x))→(v±,u±),v±＞0,as x→±∞.(Ⅰ)在允许流函数f不是凹函数以及初始值在无穷远处的极限不满足平衡方程的条件下,我们得到了稳定性...     

一类具有年龄分布的非线性种群系统的最优控制

研究了一类非线性种群系统的最优控制问题.利用Ekeland变分原理和共轭系统证明了最优收获的存在性,并借助于法锥概念得到了最优控制的必要性条件.     

Blow-up for hyperbolic systems in diagonal form

We prove a blow-up result for classical solutions of the Cauchy problem for a nonlinear hyperbolic system in one space dimension. The initial conditions are periodic and the system is supposed to be in diagonal form. We give an estimate of the lifespan of the classical solutions. Received May 2000     

Instantaneous control for traffic flow

The solution methods for optimal control problems with coupled partial differential equations as constraints are computationally costly and memory intensive; in particular for problems stated on networks, this prevents the methods from being relevant. We present instantaneous control problems for the optimization of traffic flow problems on road networks. We derive the optimality conditions, investigate the relation to the full optimal control problem and prove that certain properties of the optimal control problem carry over to the instantaneous one. We propose a solution algorithm and compare quality of the computed controls and run‐times. Copyright © 2006 John Wiley & Sons, Ltd.     

On the linearization of systems of conservation laws for fluids at a material contact discontinuity

In order to investigate the linearized stability or instability of compressible flows, as it occurs for instance in Rayleigh–Taylor or Kelvin–Helmholtz instabilities, we consider the linearization at a material discontinuity of a flow modeled by a multidimensional nonlinear hyperbolic system of conservation laws. Restricting ourselves to the plane-symmetric case, the basic solution is thus a one-dimensional contact discontinuity and the normal modes of pertubations are solutions of the resulting linearized hyperbolic system with discontinuous nonconstant coefficients and source terms. While in Eulerian coordinates, the linearized Cauchy problem has no solution in the class of functions, we prove that for a large class of systems of conservation laws written in Lagrangian coordinates and including the Euler and the ideal M.H.D. systems, there exists a unique function solution of the problem that we construct by the method of characteristics.     

复杂网络混沌系统的最优控制

考虑到控制系统能量限制的要求,确定了一个二次目标函数,基于最优控制理论给出了复杂网络混沌系统的最优控制律,利用Lyapunov稳定性理论证明了闭环系统的稳定性,数值结果证明了该方法的有效性.     

一类非线性随机种群动力学模型的最优收获控制

研究了一类非线性随机种群动力学模型的最优收获控制问题,得出了在外界环境对系统产生影响的条件下,最优控制所满足的必要条件及其最优性组,所得到的结论是确定性种群系统的扩展.     

2族3-紧优的有向双环网络无限族

该文给出一种寻找k-紧优的双环网络无限族(k≥0)的方法,利用此方法得到了2族 3-紧优的有向双环网络无限族．     

Improved Noniterative Algorithm for Solving the Traffic Equilibrium Problem

We provide an equivalent formulation of a previously proposed noniterative algorithm (see A. Maugeri, Appl. Math. Optim. 16, 169–185, 1987) for the traffic equilibrium problem. Moreover, under the strict monotonicity assumption, we provide an improved algorithm which enlarges the range of applicability of the previous algorithm and decreases considerably its computational effort. Our algorithm is based on a general algorithm for variational inequalities (see O. Mancino, G. Stampacchia, J. Optim. Theory Appl. 9, 3–23, 1972), which we further develop and adapt to the traffic equilibrium problem. Both our proofs and the algorithm exploit directly the equilibrium conditions which characterize our problem.     

Poisson Traffic Processes in RGSMP and Generalized Networks

1.Introductiontrafficprocessesinqueueingnetworksareanimportantoperatingfacetofsuchmodels,aswellasvaluableinthestudyofvaliddecompositionsofnetworks.IfwefindsometrafficprocessesinanetworkPoisson,thenitoftenrendersthemathematicalanalysistractable.Generalized…     

Three‐layer flows in the shallow water limit

We formulate and discuss the shallow water limit dynamics of the layered flow with three layers of immiscible fluids of different densities bounded above and below by horizontal walls. We obtain a resulting system of four equations, which may be nonlocal in the non‐Boussinesq case. We provide a systematic way to pass to the Boussinesq limit, and then study those equations, which are first‐order PDEs of mixed type, more carefully. We show that in a symmetric case the solutions remain on an invariant surface and using simple waves we illustrate that this is not the case for nonsymmetric cases. Reduced models consisting of systems of two equations are also proposed and compared to the full system.     

Locating Active Sensors on Traffic Networks

Sensors are used to monitor traffic in networks. For example, in transportation networks, they may be used to measure traffic volumes on given arcs and paths of the network. This paper refers to an active sensor when it reads identifications of vehicles, including their routes in the network, that the vehicles actively provide when they use the network. On the other hand, the conventional inductance loop detectors are passive sensors that mostly count vehicles at points in a network to obtain traffic volumes (e.g., vehicles per hour) on a lane or road of the network.This paper introduces a new set of network location problems that determine where to locate active sensors in order to monitor or manage particular classes of identified traffic streams. In particular, it focuses on the development of two generic locational decision models for active sensors, which seek to answer these questions: (1) “How many and where should such sensors be located to obtain sufficient information on flow volumes on specified paths?”, and (2) “Given that the traffic management planners have already located count detectors on some network arcs, how many and where should active sensors be located to get the maximum information on flow volumes on specified paths?”The problem is formulated and analyzed for three different scenarios depending on whether there are already count detectors on arcs and if so, whether all the arcs or a fraction of them have them. Location of an active sensor results in a set of linear equations in path flow variables, whose solution provide the path flows. The general problem, which is related to the set-covering problem, is shown to be NP-Hard, but special cases are devised, where an arc may carry only two routes, that are shown to be polynomially solvable. New graph theoretic models and theorems are obtained for the latter cases, including the introduction of the generalized edge-covering by nodes problem on the path intersection graph for these special cases. An exact algorithm for the special cases and an approximate one for the general case are presented.     

ATM Routing Algorithms for Multimedia Traffic in Private ATM Networks

The goal of this paper is to recommend a good Private Network-to-Network Interface (PNNI) routing algorithm for private ATM networks. A good routing algorithm has to work well with multimedia traffic with several quality of service (QoS) requirements (such as cell loss ratio, cell delay and its variation etc.) in different networks under various traffic conditions. The multiplicity of QoS requirements makes the routing problem NP-complete, so our approach to the problem is based on large scale simulations involving several empirical algorithms (compliant with the PNNI routing specification) which have been tested for different network topologies and traffic scenarios. Based on analysis of tradeoffs involving performance metrics (such as blocking rate, complexity, load distribution) we recommend a consistently good routing algorithm for single domain ATM networks.