双模式交通网络中的ATIS信息定价研究

先进的出行者信息系统(ATIS)是一种服务商品,已有的研究多从提高市场占有率的角度对单模式交通网络中的ATIS进行信息定价。多模式交通网络中影响ATIS市场占有率的因素众多,而且ATIS的提供成本往往与信息质量和使用规模同时相关。因此,信息定价问题应从ATIS服务提供商利润最大化的角度进行研究。本文把ATIS信息的单次使用费用和ATIS的信息质量同时作为决策变量,将双模式路网中ATIS的定价问题描述为一个双层规划模型。其中,混合用户均衡模型为下层模型,收益模型为上层模型。然后,基于上海市虹口区的路网数据,对下层模型进行了数值分析,并讨论了相关经济效益问题。此外,本文提出了求解下层模型的MSAF算法,并进一步嵌套了粒子群(PSO)算法,最终得到ATIS服务提供商的最优ATIS信息定价和信息质量提供方案。     

A Multi-Class Dynamic User Equilibrium Model for Queuing Networks with Advanced Traveler Information Systems

This paper presents a formulation and solution algorithm for a composite dynamic user-equilibrium assignment problem with multi-user classes, in order to assess the impacts of Advanced Traveler Information Systems (ATIS) in general networks with queues. Suppose that users equipped with ATIS will receive complete information and hence be able to choose the best departure times and routes in a deterministic manner, while users not equipped with ATIS will have incomplete information and hence may make decisions on departure times and routes in a stochastic manner. This paper proposes a discrete-time, finite-dimensional variational inequality formulation that involves two criteria regarding the route and departure time choice behaviors, i.e., the deterministic dynamic user equilibrium and the nested logit-based stochastic dynamic user equilibrium. The formulation is then converted to an equivalent “zero-extreme value” minimization problem. A heuristic algorithm based on route/time-swapping process is proposed, which iteratively adjusts the route and departure time choices to reach closely to an extreme point of the minimization problem. A numerical example is used to demonstrate the effectiveness of the proposed approach for assessing the ATIS impacts such as changes in individual travel costs, departure times, route inflows, queuing peaks and total network travel cost. This revised version was published online in July 2006 with corrections to the Cover Date.     

A stochastic network with mobile users in heavy traffic

We consider a stochastic network with mobile users in a heavy traffic regime. We derive the scaling limit of the multidimensional queue length process and prove a form of spatial state space collapse. The proof exploits a recent result by Lambert and Simatos (preprint, 2012), which provides a general principle to establish scaling limits of regenerative processes based on the convergence of their excursions. We also prove weak convergence of the sequences of stationary joint queue length distributions and stationary sojourn times.     

Computation of the optimal tolls on the traffic network

The present paper is devoted to the computation of optimal tolls on a traffic network that is described as fuzzy bilevel optimization problem. As a fuzzy bilevel optimization problem we consider bilinear optimization problem with crisp upper level and fuzzy lower level. An effective algorithm for computation optimal tolls for the upper level decision-maker is developed under assumption that the lower level decision-maker chooses the optimal solution as well. The algorithm is based on the membership function approach. This algorithm provides us with a global optimal solution of the fuzzy bilevel optimization problem.     

Well-posedness of a parametric traffic network problem

We define kinds of approximate solutions of a traffic network problem and obtain relations to approximate solutions of the corresponding quasivariational inequality. Using these results we establish sufficient conditions for the Tikhonov well-posedness in the sense of Levitin–Polyak of our traffic network problem.     

On the stability of the solution mapping for parametric traffic network problems

In this paper, we introduce the parametric traffic network problems. Afterward, a key hypothesis is introduced by virtue of a parametric gap function to considered problems, and we prove that this hypothesis is not only sufficient but also necessary for the Hausdorff lower semicontinuity and Hausdorff continuity of the solution mapping for parametric traffic network problems.     

An efficient algorithm for optimal design of area traffic control with network flows

An equilibrium network design (EQND) is a problem of finding the optimal design parameters while taking into account the route choice of users. This problem can be formulated as an optimization by taking the user equilibrium traffic assignment as a constraint. In this paper, the methods solving the EQND problem with signal settings are investigated via numerical calculations on two example road networks. An efficient algorithm is proposed in which improvement on a locally optimal search by combining the technique of parallel tangents with the gradient projection method is presented. As it shows, the method combines the locally optimal search and globally search heuristic achieved substantially better performance than did those other approaches.     

User equilibrium traffic network assignment with stochastic travel times and late arrival penalty

The classical Wardrop User Equilibrium (UE) assignment model assumes traveller choices are based on fixed, known travel times, yet these times are known to be rather variable between trips, both within and between days; typically, then, only mean travel times are represented. Classical Stochastic User Equilibrium (SUE) methods allow the mean travel times to be differentially perceived across the population, yet in a conventional application neither the UE or SUE approach recognises the travel times to be inherently variable. That is to say, there is no recognition that drivers risk arriving late at their destinations, and that this risk may vary across different paths of the network and according to the arrival time flexibility of the traveller. Recent work on incorporating risky elements into the choice process is seen either to neglect the link to the arrival constraints of the traveller, or to apply only to restricted problems with parallel alternatives and inflexible travel time distributions. In the paper, an alternative approach is described based on the ‘schedule delay’ paradigm, penalising late arrival under fixed departure times. The approach allows flexible travel time densities, which can be fitted to actual surveillance data, to be incorporated. A generalised formulation of UE is proposed, termed a Late Arrival Penalised UE (LAPUE). Conditions for the existence and uniqueness of LAPUE solutions are considered, as well as methods for their computation. Two specific travel time models are then considered, one based on multivariate Normal arc travel times, and an extended model to represent arc incidents, based on mixture distributions of multivariate Normals. Several illustrative examples are used to examine the sensitivity of LAPUE solutions to various input parameters, and in particular its comparison with UE predictions. Finally, paths for further research are discussed, including the extension of the model to include elements such as distributed arrival time constraints and penalties.     

Solving the logit-based stochastic user equilibrium problem with elastic demand based on the extended traffic network model

This paper proposes a novel extended traffic network model to solve the logit-based stochastic user equilibrium (SUE) problem with elastic demand. In this model, an extended traffic network is established by properly adding dummy nodes and links to the original traffic network. Based on the extended traffic network, the logit-based SUE problem with elastic demand is transformed to the SUE problem with fixed demand. Such problem is then further converted to a linearly constrained convex programming and addressed by a predictor–corrector interior point algorithm with polynomial complexity. A numerical example is provided to compare the proposed model with the method of successive averages (MSA). The numerical results indicate that the proposed model is more efficient and has a better convergence than the MSA.     

Some general models of traffic flow in an isolated network

Starting form basic principles, we obtain mathematical models that describe the traffic of material objects in a network represented by a graph. We analyze existence, uniqueness, and positivity of solutions for some implicit models. Also, some linear models and their equilibria are analyzed. Copyright © 2017 John Wiley & Sons, Ltd.     

A network evolution model for the anisotropic Mullins effect

In this contribution, a micro-mechanical constitutive model for filled rubberlike materials is proposed. Rubber network is decomposed into two parts, elastic rubber network and polymer-filler network. As a consequence of filler contribution, the last one is subjected to damage. A non-Gaussian strain energy function for a single chain with a constant valence angle has been postulated. Damage in different directions is governed by the corresponding maximal micro-stretch and is considered as a result of network evolution. Directional network rearrangement as a consequence of network evolution has been employed in order to describe induced anisotropy and permanent set. The model shows good agreement with experimental data on uniaxial tension tests in two orthogonal directions. (© 2008 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Hölder continuity of solutions to elastic traffic network models

This paper aims to study stability and sensitivity analysis for quasi-variational inequalities which model traffic network equilibrium problems with elastic travel demand. In particular, we provide a Hölder stability result under parametric perturbations.     

A Performance evaluation of neural network models in traffic volume forecasting

Forecasting traffic volume is an important task in controlling urban highways, guiding drivers' routes, and providing real-time transportation information. Previous research on traffic volume forecasting has concentrated on a single forecasting model and has reported positive results, which has been frequently better than those of other models. In addition, many previous researchers have claimed that neural network models are better than linear statistical models in terms of prediction accuracy. However, the forecasting power of a single model is limited to the typical cases to which the model fits best. In other words, even though many research efforts have claimed the general superiority of a single model over others in predicting future events, we believe it depends on the data characteristics used, the composition of the training data, the model architecture, and the algorithm itself.In this paper, we have studied the relationship in forecasting traffic volume between data characteristics and the forecasting accuracy of different models, particularly neural network models. To compare and test the forecasting accuracy of the models, three different data sets of traffic volume were collected from interstate highways, intercity highways, and urban intersections. The data sets show very different characteristics in terms of volatility, period, and fluctuations as measured by the Hurst exponent, the correlation dimension. The data sets were tested using a back-propagation network model, a FIR model, and a time-delayed recurrent model.The test results show that the time-delayed recurrent model outperforms other models in forecasting very randomly moving data described by a low Hurst exponent. In contrast, the FIR model shows better forecasting accuracy than the time-delayed recurrent network for relatively regular periodic data described by a high Hurst exponent. The interpretation of these results shows that the feedback mechanism of the previous error, through the temporal learning technique in the time-delayed recurrent network, naturally absorbs the dynamic change of any underlying nonlinear movement. The FIR and back-propagation model, which have claimed a nonlinear learning mechanism, may not be very good in handling randomly fluctuating events.     

Modeling network traffic by a cluster Poisson input process with heavy and light-tailed file sizes

We consider a cluster Poisson model with heavy-tailed interarrival times and cluster sizes as a generalization of an infinite source Poisson model where the file sizes have a regularly varying tail distribution function or a finite second moment. One result is that this model reflects long-range dependence of teletraffic data. We show that depending on the heaviness of the file sizes, the interarrival times and the cluster sizes we have to distinguish different growths rates for the time scale of the cumulative traffic. The mean corrected cumulative input process converges to a fractional Brownian motion in the fast growth case. However, in the intermediate and the slow growth case we can have convergence to a stable Lévy motion or a fractional Brownian motion as well depending on the heaviness of the underlying distributions. These results are contrary to the idea that cumulative broadband network traffic converges in the slow growth case to a stable process. Furthermore, we derive the asymptotic behavior of the cluster Poisson point process which models the arrival times of data packets and the individual input process itself.     

Study on network traffic forecast model of SVR optimized by GAFSA

There are some problems, such as low precision, on existing network traffic forecast model. In accordance with these problems, this paper proposed the network traffic forecast model of support vector regression (SVR) algorithm optimized by global artificial fish swarm algorithm (GAFSA). GAFSA constitutes an improvement of artificial fish swarm algorithm, which is a swarm intelligence optimization algorithm with a significant effect of optimization. The optimum training parameters used for SVR could be calculated by optimizing chosen parameters, which would make the forecast more accurate. With the optimum training parameters searched by GAFSA algorithm, a model of network traffic forecast, which greatly solved problems of great errors in SVR improved by others intelligent algorithms, could be built with the forecast result approaching stability and the increased forecast precision. The simulation shows that, compared with other models (e.g. GA-SVR, CPSO-SVR), the forecast results of GAFSA-SVR network traffic forecast model is more stable with the precision improved to more than 89%, which plays an important role on instructing network control behavior and analyzing security situation.     

A path-based double projection method for solving the asymmetric traffic network equilibrium problem

In this paper we propose a new iterative method for solving the asymmetric traffic equilibrium problem when formulated as a variational inequality whose variables are the path flows. The path formulation leads to a decomposable structure of the constraints set and allows us to obtain highly accurate solutions. The proposed method is a column generation scheme based on a variant of the Khobotov’s extragradient method for solving variational inequalities. Computational experiments have been carried out on several networks of a medium-large scale. The results obtained are promising and show the applicability of the method for solving large-scale equilibrium problems. This work has been supported by the National Research Program FIRB/RBNE01WBBBB on Large Scale Nonlinear Optimization.     

基于改进熵权法的区间直觉模糊TOPSIS方法

本文对区间直觉模糊信息的TOPSIS多属性决策方法进行了研究。在属性权重信息完全未知的情况下,通过研究熵权法以及区间直觉模糊集本身的一些性质特点,将熵权法拓展到区间直觉模糊环境中来确定属性权重,进而提供了一种可直接利用评估信息的新的TOPSIS决策方法。该方法不仅拓展了传统熵权法的应用范围,而且不需要决策者事先给出权重信息,结果更加客观和可靠。应用实例表明该方法的可行性和有效性,具有推广应用价值。     

Analysis of a queueing system with a general service scheduling function,with applications to telecommunication network traffic control

In this paper we analyze a queueing system with a general service scheduling function. There are two types of customer with different service requirements. The service order for customers of each type is determined by the service scheduling function α_k(i, j) where α_k(i, j) is the probability for type-k customer to be selected when there are i type-1 and j type-2 customers. This model is motivated by traffic control to support traffic streams with different traffic characteristics in telecommunication networks (in particular, ATM networks). By using the embedded Markov chain and supplementary variable methods, we obtain the queue-length distribution as well as the loss probability and the mean waiting time for each type of customer. We also apply our model to traffic control to support diverse traffics in telecommunication networks. Finally, the performance measures of the existing diverse scheduling policies are compared. We expect to help the system designers select appropriate scheduling policy for their systems.     

高级排程计划APS发展综述

高级排程计划(APS)是二十世纪信息技术与现代管理思想相结合的产物。本回顾了APS从萌芽到与ERP／SCM结合的过程，总结了APS的主要特点，并对我国企业应用APS的前景进行了分析与展望。