Y型交叉口绿灯释放初期电动自行车对机动车的影响

Y型道路交叉口属异形交叉口,趋于行驶车流角度,从而使灵活多变的电动自行车对机动车的影响较为突出.为研究Y型交叉口绿灯周期电动自行车对机动车的影响程度,统计了307组绿灯期电动自行车流量分布,确定了绿灯期0-10s为电动自行车释放初期,建立了基于Logistic逐步回归的电动自行车对机动车影响模型,通过实例验证了模型的有效性.结果表明,释放初期电动自行车的流量、占道间隙停车行为、自进口机动车第1车道驶入出口第2车道及自进口非机动车道驶入出口机动车第1车道的入侵行为对机动车影响显著,其中占道间隙停车行为对机动车影响最大.研究成果可为提高异形交叉口混合交通流通行效率、交叉口渠化设计及交通组织管理提供理论参考.     

信号交叉口车辆的延误分析

针对路段上交通流的特性,以及信号交叉口交通流的动态流通特征,分析了车辆到达信号交叉口的规律以及车辆越过停车线的特点,从而建立了停车延误模型;又分析了单个相位停车线的长度与交叉口几何特征的关系,及车辆在通过信号交叉口之间的路段过程中的运行特性,建立了相位延误模型;从而得到一个在信号交叉口处适用任何饱和度的排队延误模型,使得结果更贴近车辆在信号交叉口的实际延误时间.     

Moving mesh method for a reaction-diffusion equation with traveling heat source on unbounded domain

对无界区域上带移动热源的反应扩散方程提出了局部吸收边界条件.移动网格方法对导出的有界区域问题进行了求解.数值例子显示了当热源移动的速度比较慢的时候,方程会在有限时间内发生爆破现象.而当热源移动的速度足够快时,爆破现象不会发生.数值例子验证了新方法的有效性和精确性.     

你能让汽车跑得更远吗?

李叔叔新买了一辆小汽车,车上配有4个新轮胎,另外还有一个备用的新轮胎.按照轮胎厂家的生产说明,一个新轮胎的使用寿命是行驶10000千米路程.如果李叔叔的这辆汽车行驶时每一个轮胎的磨损是均匀的,那么,使用这些新轮胎,汽车最多能行驶多少千米?     

径向低渗非Darcy渗流动边界半解析模型

低渗油藏渗流过程中普遍存在启动压力梯度(TPG).考虑低渗渗流特征,建立了平面径向低渗非Darcy渗流动边界数学模型,给出了计算动边界移动速度的公式,通过Laplace变换结合无穷级数方法求得了模型的半解析解,并进行了Stehfest数值反演.详细讨论与分析了动边界问题特性、动边界变化和传播情况,解释了启动压力梯度导致动边界不断向外扩展的现象.计算了启动压力梯度对井底压力、压力导数的影响,并给出不同条件下的地层压力分布曲线和Gringarten-Bourdet图版,同时给出了实例分析.研究发现:低渗渗流模型与常规渗流模型有着显著不同,低渗非Darcy渗流压力降是随时间扩展的,在动边界外的地层压力降为零,压力分布曲线呈现紧支性.针对具有动边界的低渗透问题,需充分考虑启动压力梯度与动边界的影响,该模型为低渗油藏渗流机理和开采动态、解释与数值模拟提供了一定的理论基础.     

基于延误模型的定时信号交叉口配时方案研究

信号交叉口配时方案的最优策略是平衡关键车道组的v/c比和所有车辆延误最小化.本文在研究已有控制延误模型的基础上,提出一种新的随机控制延误计算模型.根据不同地区各城市信号交叉口的交通流运行特性,在信号优化策略基础上兼顾考虑其通行能力,给出实时实地的信号配时方案策略.实例说明该定时信号交叉口配时方案.     

离散时间Markov链的几何遍历速度

本文研究一般状态空间离散时间几何遍历Markov链的收敛速度.当状态空间中含有原子时,本文采用与可数状态空间类似的方法,即采用谱理论法研究几何遍历速度.对于不含原子的Markov链,先利用Nummelin分裂技术构造出含有原子的新Markov链,再建立新Markov链与原Markov链几何遍历速度的关系,最后由最小化条件和首次回返时的几何阶矩得到原Markov链几何遍历的收敛速度.进一步,本文将所得结果应用于研究Metropolis-Hastings算法.     

开车省油有技巧

汽车是颇受人们青睐的交通工具.汽车行驶时要消耗汽油.因此,人们平时开车时也尽量想办法省油.怎样开车才能真正省油呢?其中固然有“尽量少踩油门”、“尽量不要重复启动车”等诀窍,而更重要的便是掌握时速与油耗的关系,使车行速度尽量保持在所谓“经济时速”的范围内.下面就针对汽车时速与油耗的关系,作一些简要的数学分析.     

一种电力变压器铁芯柱截面优化设计的模型

首先分析了电力变压器铁心柱制造的特点,以铁心柱外接圆为650毫米时建立了非线性的数学规划模型.并用Lingo10.0软件求解了该模型,从而得到了电力变压器铁心柱截面的优化设计方案,方案有模型简单和计算速度快等特点.     

空间变系数分层自相关模型的截面似然估计及应用

非参数空间动态模型作为一类能同时处理回归分析中的空间非平稳性和空间依赖性现象的建模技术,在多类问题的研究中得到了广泛的应用.本篇将重点讨论当因变量中存在分层结构情形时的空间变系数模型.通过截面极大似然方法给出模型估计,并通过AIC准则将模型参数和非参数分量加以识别.证明了估计量的一致性和渐近正态性,蒙特卡洛数值模拟表明:在有限样本时该模型及方法是有效的.在对我国地方经济社会发展集聚性与差异的应用研究中,省内城市之间的经济发展空间溢出效应大于省边界城市之间的溢出效应,这两种空间溢出效应都是不可忽视的;此外,对外贸易和城镇化率对经济发展的影响不随着空间位置而发生变化,而其他影响因素,包括:人口密度、人力资本、储蓄水平、产业结构、政府干预、社会需求和公路密度对经济发展的影响存在显著的空间异质性.     

基于遗传算法的交易中心停车场优化设计

根据某交易中心大型停车场的实际情况 ,并利用大型客车和轿车的长度、宽度、最小转弯半径等数据 ,建立了停车场优化停车设计模型 ,采用遗传算法进行求解 ,得到了停车场的最优停放布局和车位排列角度的优化结果 .本文优化设计的思想、方法和结果对其他大型停车场优化设计也有一定的参考价值 .     

Scanline algorithms on a grid

A number of important problems in computational geometry are solved efficiently on 2- or 3-dimensional grids by means of scanline techniques. In the time complexity of solutions to the maximal elements and closure problems, a factor logn is substituted by loglogn, wheren is the number of elements. Next, by using a data structure introduced in the paper, the interval trie, previous solutions to the rectangle intersection and connected component problems are improved upon. Finally, a fast intersection finding algorithm for arbitrarily oriented line segments is presented.     

Generating the family of all traffic signal light cycles coordinated with pedestrian crosswalks

In this paper, the problem of setting traffic light cycles at crossroads and intersections is considered in order to reduce traffic congestion by minimizing total vehicle waiting time. In general, a signal light cycle should have the least number of phases. A method to determine the family \(\wp \) of all discrete cycle phasing systems with the minimum number of phases is presented. The aim is to detect from among all the components of \(\wp \) the most appropriate phasing sequence for traffic control corresponding to a current traffic situation, taking into account the activity of all pedestrian crosswalks at the intersection. The method is applied to both a typical and a complex multi-cross intersection. The problem, dealing with traffic movements and the conflicting relations that arise, is stated within the framework of graph theory.     

The intersection operation in light of joint observables and Bell inequalities in operational probability theory

Operational probability theory appears as a smooth extension of classical probability theory that fulfills quantum physics needs. In this paper, we, first, explain the need to extend the concept of the intersection operation in the light of the concept of joint observables. Then, we tried to determine the basic features that characterize any possible definition of the intersection operation. Furthermore, we tried to know if there is a relation between the definitions of the intersection operation of both fuzzy and operational probability theories. These relations are used, first, to find a suitable suggestion to define the intersection operation. Second, they are used, besides the studies made on Bell inequalities in fuzzy probability theory, to find the conditions that should be satisfied by the intersection operation to ensure the possibility of the violation of Bell inequalities in operational probability theory.     

Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths

We study the multicommodity network flow problem with fixed costs on paths, with specific application to the empty freight car distribution process of a rail operator. The classification costs for sending a group of cars do not depend on the number of cars in the group, as long as the group is kept together as one unit. Arcs correspond to trains, so we have capacity restrictions on arcs but fixed costs on the paths corresponding to routes for groups of cars. As solution method, we propose a Lagrangian based heuristic using dual subgradient search and primal heuristics based on path information of the Lagrangian subproblem solutions. The method illustrates several ways of exploiting the specific structures of the problem. Computational tests indicate that the method is able to generate fairly good primal feasible solutions and lower bounds on the optimal objective function value.     

A solution method for a car fleet management problem with maintenance constraints

The problem retained for the ROADEF’99 international challenge was an inventory management problem for a car rental company. It consists in managing a given fleet of cars in order to satisfy requests from customers asking for some type of cars for a given time period. When requests exceed the stock of available cars, the company can either offer better cars than those requested, subcontract some requests to other providers, or buy new cars to enlarge the available stock. Moreover, the cars have to go through a maintenance process at a regular basis, and there is a limited number of workers that are available to perform these maintenances. The problem of satisfying all customer requests at minimum cost is known to be NP-hard. We propose a solution technique that combines two tabu search procedures with algorithms for the shortest path, the graph coloring and the maximum weighted independent set problems. Tests on benchmark instances used for the ROADEF’99 challenge give evidence that the proposed algorithm outperforms all other existing methods (thirteen competitors took part to this contest).     

Iterated tabu search for the car sequencing problem

This paper introduces an iterated tabu search heuristic for the daily car sequencing problem in which a set of cars must be sequenced so as to satisfy requirements from the paint shop and the assembly line. The iterated tabu search heuristic combines a classical tabu search with perturbation operators that help escape from local optima. The resulting heuristic is flexible, easy to implement, and fast. It has produced very good results on a set of test instances provided by the French car manufacturer Renault.     

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.     

驾驶者行为选择对十字路口通行能力的影响

考虑通过十字路口时左转车辆和直行车辆发生路权冲突时的不同驾驶者行为,将驾驶者分为跟随型驾驶者和谦让型驾驶者,并建立了左转车辆通过十字路口的模型,研究不同的驾驶者行为选择对十字路口通行能力的影响。结果表明,随着交通流量逐渐增加,驾驶者的行为越趋向于跟随时,十字路口的通行能力将会急剧降低;而当驾驶者的行为趋向于谦让时,十字路口的通行能力甚至优于有交警指挥的情形。该结果很好地解释了在行车高峰期中国十字路口堵塞的原因,即驾驶者的行为选择,可以通过改变驾驶者的行为选择和在交通流量达到一定的饱和度时派出交警来改善十字路口的通行能力。     

Electric vehicles: effect of the availability threshold on the transportation cost

This paper addresses the transportation problem using public electric cars. The management of this new form of transportation means considering two issues: the redistribution of the cars among the stations (in this paper, we assume that this issue is perfectly settled, the number of cars needed at each station being available at any time), and the recharge problem that we describe in this paper. At each station, a decision concerning the cars which should become available to customers, has to be taken. We assume that a vehicle is available when its charge is greater than a given threshold. Our goal is to optimize this threshold. Copyright © 1999 John Wiley & Sons, Ltd.