交通网络中关键路径算法的动态实现

本文介绍了关键路径算法及AOE网的有关理论,建立城市交通网络路径的优化模型,给出交通网络中有向图每条边权值的数学模型,并以Visual c++作为编程工具实现交通网络关键路径算法的动态演示。

Bayesian network model for traffic flow estimation using prior link flows

In order to estimate traffic flow a Bayesian network BN model using prior link flows is proposed.This model sets link flows as parents of the origin-destination OD flows. Under normal distribution assumptions the model considers the level of total traffic flow the variability of link flows and the violation of the conservation law.Using prior link flows the prior distribution of all the variables is determined. By updating some observed link flows the posterior distribution is given.The variances of the posterior distribution normally decrease with the progressive update of the link flows. Based on the posterior distribution point estimations and the corresponding probability intervals are provided. To remove inconsistencies in OD matrices estimation and traffic assignment a combined BN and stochastic user equilibrium model is proposed in which the equilibrium solution is obtained through iterations.Results of the numerical example demonstrate the efficiency of the proposed BN model and the combined method.

Lazy loading algorithm for traffic assignment of road networks under fixed charge condition

The measures of path charge are important considerations in traffic assignment of road networks. Factors, such as travel time, fixed charge and traffic congestion which affect road users＇ choices of trip paths, are analyzed. Travelers usually decide their trip paths based on their personal habits, preferences and the information at hand. By considering both deterministic and stochastic factors which affect the value of time （VOT） during the process of path choosing, a variational inequality model is proposed to describe the problem of traffic assignment. A lazy loading algorithm for traffic assignment is designed to solve the proposed model, and the calculation steps are given. Numerical experiment results show that compared with the all-or-nothing assignment, the proposed model and the algorithm can provide more optimal traffic assignments for road networks. The results of this study can be used to optimize traffic planning and management.

Analysis of Strategies to Improve Traffic Conditions in the Ancient Urban Area of Suzhou

In this paper, the authors first analyse the problems existing in the situation of land use, structure of travel mode and road network by applying the basic principle of traffic engineering and system engineering methods. Then, the authors make it clear the strategies to be adopted for solving the existing traffic problems in the ancient urban area of Suzhou(AUAS), namely insisting on the goal based strategy; the strategy to develop the public transit system in priority and decreasing the demand on cars from the view point of land use strategy. On the basis of such analysis the authors put forth proposals about major measures to be taken to improve traffic conditions of the AUAS, such as construction of express artery ring around the ancient city, appropriate transformation of the roads in the AUAS and rational distribution of car parking areas at the outskirt, which are of positive significance in guiding the protection of the AUAS and transportation construction. In this paper, specialized software is used to establish criteria for the construction scale and extent analysis and evaluation of the ancient city construction project, which is of some reference significance to the transformation of old urban areas in other cities.

Influential Node Ranking and Invulnerability of Air Traffic Cyber Physical System

To ensure flight safety,the complex network method is used to study the influence and invulnerability of air traffic cyber physical system(CPS)nodes.According to the rules of air traffic management,the logical coupling relationship between routes and sectors is analyzed,an air traffic CPS network model is constructed,and the indicators of node influence and invulnerability are established.The K-shell algorithm is improved to identify node influence,and the invulnerability is analyzed under random and selective attacks.Taking Airspace in Eastern China as an example,its influential nodes are sorted by degree,namely,K-shell,the improved K-shell(IKS)and betweenness centrality.The invulnerability of air traffic CPS under different attacks is analyzed.Results show that IKS can effectively identify the influential nodes in the air traffic CPS network,and IKS and betweenness centrality are the two key indicators that affect the invulnerability of air traffic CPS.

Allocation optimization of bicycle-sharing stations at scenic spots

Bicycle-sharing system is considered as a green option to provide a better connection between scenic spots and nearby metro/bus stations. Allocating and optimizing the layout of bicycle-sharing system inside the scenic spot and around its influencing area are focused on. It is found that the terrain, land use, nearby transport network and scenery point distribution have significant impact on the allocation of bicycle-sharing system. While the candidate bicycle-sharing stations installed at the inner scenic points, entrances/exits and metro stations are fixed, the ones installed at bus-stations and other passenger concentration buildings are adjustable. Aiming at minimizing the total cycling distance and overlapping rate, an optimization model is proposed and solved based on the idea of cluster concept and greedy heuristic. A revealed preference/stated preference （RP/SP） combined survey was conducted at Xuanwu Lake in Nanjing, China, to get an insight into the touring trip characteristics and bicycle-sharing tendency. The results reveal that 39.81% visitors accept a cycling distance of 1-3 km and 62.50% respondents think that the bicycle-sharing system should charge an appropriate fee. The sttrvey indicates that there is high possibility to carry out a bicycle-sharing system at Xuanwu Lake. Optimizing the allocation problem cluster by cluster rather than using an exhaustive search method significantly reduces the computing amount from O（2^43） to O（43 2）. The 500 m-radius-coverage rate for the alternative optimized by 500 m-radius-cluster and 800 m-radius-cluster is 89.2% and 68.5%, respectively. The final layout scheme will provide decision makers engineering guidelines and theoretical support.

Mitigation Strategy against Cascading Failures on Social Networks

Cascading failures are common phenomena in many of real-world networks,such as power grids,Internet,transportation networks and social networks.It's worth noting that once one or a few users on a social network are unavailable for some reasons,they are more likely to influence a large portion of social network.Therefore,an effective mitigation strategy is very critical for avoiding or reducing the impact of cascading failures.In this paper,we firstly quantify the user loads and construct the processes of cascading dynamics,then elaborate the more reasonable mechanism of sharing the extra user loads with considering the features of social networks,and further propose a novel mitigation strategy on social networks against cascading failures.Based on the realworld social network datasets,we evaluate the effectiveness and efficiency of the novel mitigation strategy.The experimental results show that this mitigation strategy can reduce the impact of cascading failures effectively and maintain the network connectivity better with lower cost.These findings are very useful for rationally advertising and may be helpful for avoiding various disasters of cascading failures on many real-world networks.

A simulation model for estimating train and passenger delays in large-scale rail transit networks

A simulation model was proposed to investigate the relationship between train delays and passenger delays and to predict the dynamic passenger distribution in a large-scale rail transit network. It was assumed that the time varying original-destination demand and passenger path choice probability were given. Passengers were assumed not to change their destinations and travel paths after delay occurs. CapaciW constraints of train and queue rules of alighting and boarding were taken into account. By using the time-driven simulation, the states of passengers, trains and other facilities in the network were updated every time step. The proposed methodology was also tested in a real network, for demonstration. The results reveal that short train delay does not necessarily result in passenger delays, while, on the contrary, some passengers may get benefits from the short delay. However, large initial train delay may result in not only knock-on train and passenger delays along the same line, but also the passenger delays across the entire rail transit network.

A mixed stochastic user equilibrium model considering influence of advanced traveller information systems in degradable transport network

Advanced traveler information systems （ATIS） can not only improve drivers＇ accessibility to the more accurate route travel time information, but also can improve drivers＇ adaptability to the stochastic network capacity degradations. In this paper, a mixed stochastic user equilibrium model was proposed to describe the interactive route choice behaviors between ATIS equipped and unequipped drivers on a degradable transport network. In the proposed model the information accessibility of equipped drivers was reflected by lower degree of uncertainty in their stochastic equilibrium flow distributions, and their behavioral adaptability was captured by multiple equilibrium behaviors over the stochastic network state set. The mixed equilibrium model was formulated as a fixed point problem defined in the mixed route flows, and its solution was achieved by executing an iterative algorithm. Numerical experiments were provided to verify the properties of the mixed network equilibrium model and the efficiency of the iterative algorithm.

Rescue vehicle allocation problem based on optimal reliable path under uncertainty

Consideration of the travel time variation for rescue vehicles is significant in the field of emergency management research.Because of uncertain factors,such as the weather or OD(origin-destination)variations caused by traffic accidents,travel time is a random variable.In emergency situations,it is particularly necessary to determine the optimal reliable route of rescue vehicles from the perspective of uncertainty.This paper first proposes an optimal reliable path finding(ORPF)model for rescue vehicles,which considers the uncertainties of travel time,and link correlations.On this basis,it investigates how to optimize rescue vehicle allocation to minimize rescue time,taking into account travel time reliability under uncertain conditions.Because of the non-additive property of the objective function,this paper adopts a heuristic algorithm based on the K-shortest path algorithm,and inequality techniques to tackle the proposed modified integer programming model.Finally,the numerical experiments are presented to verify the accuracy and effectiveness of the proposed model and algorithm.The results show that ignoring travel time reliability may lead to an over-or under-estimation of the effective travel time of rescue vehicles on a particular path,and thereby an incorrect allocation scheme.

Vehicular emissions and concentrations in school zones: A case study

Recent research has revealed that human exposure to air pollutants such as CO, NO_x, and particulates can lead to respiratory diseases, especially among school-age children. Towards understanding such health impacts, this work estimates local-scale vehicular emissions and concentrations near a highway traffic network, where a school zone is located in. In the case study, VISSIM traffic micro-simulation is used to estimate the source of vehicular emissions at each roadway segment. The local-scale emission sources are then used as inputs to the California line source dispersion model(CALINE4) to estimate concentrations across the study area. To justify the local-scale emissions modeling approach, the simulation experiment is conducted under various traffic conditions. Different meteorological conditions are considered for emission dispersion. The work reveals that emission concentrations are usually higher at locations closer to the congested segments, freeway ramps and major arterial intersections. Compared to the macroscopic estimation(i.e. using network-average emission factors), the results show significantly different emission patterns when the local-scale emission modeling approach is used. In particular, it is found that the macroscopic approach over-estimates emission concentrations at freeways and under-estimations are observed at arterials and local streets. The results of the study can be used to compare to the US environmental protection agency(EPA) standards or any other air quality standard to further identify health risk in a fine-grained manner.

Anomaly-based model for detecting HTTP-tunnel traffic using network behavior analysis

Increasing time-spent online has amplified users＇ exposure to tile tilreat oI miormanon leakage. Although existing security systems （such as firewalls and intrusion detection systems） can satisfy most of the security requirements of network administrators, they are not suitable for detecting the activities of applying the HTTP-tunnel technique to steal users＇ private information. This paper focuses on a network behavior-based method to address the limitations of the existing protection systems. At first, it analyzes the normal network behavior pattern over HTI＇P traffic and select four features. Then, it pres- ents an anomaly-based detection model that applies a hierarchical clustering technique and a scoring mechanism. It also uses real-world data to validate that the selected features are useful. The experiments have demonstrated that the model could achieve over 93% hit-rate with only about 3% false- positive rate. It is regarded confidently that the approach is a complementary technique to the existing security systems.

Synchronous hybrid transport network design

Delay,as an inevitable real-world phenomenon,is usually ignored in transport network design.A model of urban hybrid transport system with stochastic delay was created on the basis of the idealized public transport system design.After formulating the total trip time cost composed of accessing time in the sub-region of the city,waiting time at the public transport station,and in-vehicle time in the public transit network,the analytical properties of the total trip time cost function were investigated.The results show that in the urban hybrid transport network design,the total trip time cost reaches its approximate minimum in a δ-neighbourhood of buffer time of 1.5 min,and that through modelling optimal delay in hybrid transport system,the maximal synchronization can be achieved and operational efficiency and passenger satisfaction can be improved.The proposed modelling and analytical investigations are attempts to contribute to more realistic modelling of future idealized public transport system that involves more practical constraints.

Modified origin-based algorithm for traffic equilibrium assignment problems

Key tactics of origin-based user equilibrium (OUE) algorithm was studied,which involved the algorithm procedure and several implementation issues.To speed up the convergence,update policies of flows,costs and bushes were proposed.The methods of step-size searching and bush construction are proved to be practical.The modified OUE algorithm procedure was also optimized to take the advantage of multi-thread process.Convergence performances were compared with those of other algorithms by different sizes of urban transportation networks.The result shows this modified OUE algorithm is more efficient and consumes less time to achieve the reasonable relative gap in practical applications.

Optimal paths planning in dynamic transportation networks with random link travel times

A theoretical study was conducted on finding optimal paths in transportation networks where link travel times were stochastic and time-dependent(STD). The methodology of relative robust optimization was applied as measures for comparing time-varying, random path travel times for a priori optimization. In accordance with the situation in real world, a stochastic consistent condition was provided for the STD networks and under this condition, a mathematical proof was given that the STD robust optimal path problem can be simplified into a minimum problem in specific time-dependent networks. A label setting algorithm was designed and tested to find travelers' robust optimal path in a sampled STD network with computation complexity of O(n2+n·m). The validity of the robust approach and the designed algorithm were confirmed in the computational tests. Compared with conventional probability approach, the proposed approach is simple and efficient, and also has a good application prospect in navigation system.

Traffic Signals Control with Adaptive Fuzzy Controller in Urban Road Network

An adaptive fuzzy logic controller (AFC) is presented for the signal control of the urban traffic network. The AFC is composed of the signal control system-oriented control level and the signal controller-oriented fuzzy rules regulation level. The control level decides the signal timings in an intersection with a fuzzy logic controller. The regulation level optimizes the fuzzy rules by the Adaptive Rule Module in AFC according to both the system performance index in current control period and the traffic flows in the last one. Consequently the system performances are improved. A weight coefficient controller (WCC) is also developed to describe the interactions of traffic flow among the adjacent intersections. So the AFC combined with the WCC can be applied in a road network for signal timings. Simulations of the AFC on a real traffic scenario have been conducted. Simulation results indicate that the adaptive controller for traffic control shows better performance than the actuated one.

Modeling and Characterizing Internet Backbone Traffic

With enormous growth of the number of Internet users and appearance of new applications, characterization of Internet traffic has attracted more and more attention and has become one of the major challenging issues in telecommunication network over the past few years. In this paper, we study the network traffic pattern of the aggregate traffic and of specific application traffic, especially the popular applications such as P2P, VoIP that contribute most network traffic. Our study verified that majority Internet backbone traffic is contributed by a small portion of users and a power function can be used to approximate the contribution of each user to the overall traffic. We show that P2P applications are the dominant traffic contributor in current Internet Backbone of China. In addition, we selectively present the traffic pattern of different applications in detail.

Dynamic Routing Combined to Forecast the Behavior of Traffic in the City of Sao Paulo Using Neuro Fuzzy Network

The challenge of keeping and getting new customers drives the development of new practices to meet the consumption needs of increasingly tends to micro-segmentation of product and consumer market. The new consumption habits of brazilians brought new prospects for market. The objective of this paper is to develop of a dynamic vehicle routing system supported by the behavior of urban traffic in the city ofSao Paulo using Neuro Fuzzy Network. The methodology of this paper consists in the capture of relevant events that interfere with the flow of traffic of the city of Sao Paulo and implementation of a Fuzzy Neural Network trained with these events in order to foresee the traffic behavior. The system offers three labels of hierarchical routing, thus is possible to consider not only the basic factors of routing, but too external factors that directly influence on the flow of traffic and the disruption which may be avoided in large cities, through alternative routes （dynamic vehicle routing）. Predicting the behavior of traffic represents the strategic level routing, dynamic vehicle routing is the tactical level, and routing algorithms to the operational level. This paper will not be discussed the operational level.

Energy-efficient Traffic Grooming Under Sliding Scheduled Traffic Model for IP over WDM Optical Networks

In this paper,we investigate on the problem of energy-efficient traffic grooming under sliding scheduled traffic model for IP over WDM optical networks,so as to minimize the total energy consumption of the core network.We present a two-layer auxiliary graph model and propose a new energyefficient traffic grooming heuristic named Two-Dimension Green Traffic Grooming(TDGTG) algorithm,which takes both space and time factors into consideration for network energy efficiency.We compare our proposed TDGTG algorithm with the previous traffic grooming algorithms for scheduled traffic model in terms of total energy consumption and blocking probability.The simulation results in three typical carrier topologies show the efficiency of our proposed TDGTD algorithm.

Simultaneous optimization of transit network and public bicycle station network

The traditional manner to design public transportation system is to sequentially design the transit network and public bicycle network. A new public transportation system design problem that simultaneously considers both bus network design and public bicycle network design is proposed. The chemical reaction optimization(CRO) is designed to solve the problem. A shortcoming of CRO is that, when the two-molecule collisions take place, the molecules are randomly picked from the container.Hence, we improve CRO by employing different mating strategies. The computational results confirm the benefits of the mating strategies. Numerical experiments are conducted on the Sioux-Falls network. A comparison with the traditional sequential modeling framework indicates that the proposed approach has a better performance and is more robust. The practical applicability of the approach is proved by employing a real size network.