Optimal design and benefits of a short turning strategy for a bus corridor

We develop a short turning model using demand information from station to station within a single bus line-single period setting, aimed at increasing the service frequency on the more loaded sections to deal with spatial concentration of demand considering both operators’ and users’ costs. We find analytical expressions for optimal values of the design variables, namely frequencies (inside and outside the short cycle), capacity of vehicles and the position of the short turn limit stations. These expressions are used to analyze the influence of different parameters in the final solution. The design variables and the corresponding cost components for operators and users (waiting and in-vehicle times) are compared against an optimized normal operation scheme (single frequency). Applications on actual transit corridors exhibiting different demand profiles are conducted, calculating the optimal values for the design variables and the resulting benefits for each case. Results show the typical demand configurations that are better served using a short turn strategy.     

Macroscopic relations of urban traffic variables: Bifurcations, multivaluedness and instability

Recent experimental work has shown that the average flow and average density within certain urban networks are related by a unique, reproducible curve known as the Macroscopic Fundamental Diagram (MFD). For networks consisting of a single route this MFD can be predicted analytically; but when the networks consist of multiple overlapping routes experience shows that the flows observed in congestion for a given density are less than those one would predict if the routes were homogeneously congested and did not overlap. These types of networks also tend to jam at densities that are only a fraction of their routes’ average jam density.This paper provides an explanation for these phenomena. It shows that, even for perfectly homogeneous networks with spatially uniform travel patterns, symmetric equilibrium patterns with equal flows and densities across all links are unstable if the average network density is sufficiently high. Instead, the stable equilibrium patterns are asymmetric. For this reason the networks jam at lower densities and exhibit lower flows than one would predict if traffic was evenly distributed.Analysis of small idealized networks that can be treated as simple dynamical systems shows that these networks undergo a bifurcation at a network-specific critical density such that for lower densities the MFDs have predictably high flows and are univalued, and for higher densities the order breaks down. Microsimulations show that this bifurcation also manifests itself in large symmetric networks. In this case though, the bifurcation is more pernicious: once the network density exceeds the critical value, the stable state is one of complete gridlock with zero flow. It is therefore important to ensure in real-world applications that a network’s density never be allowed to approach this critical value.Fortunately, analysis shows that the bifurcation’s critical density increases considerably if some of the drivers choose their routes adaptively in response to traffic conditions. So far, for networks with adaptive drivers, bifurcations have only been observed in simulations, but not (yet) in real life. This could be because real drivers are more adaptive than simulated drivers and/or because the observed real networks were not sufficiently congested.     

On the macroscopic stability of freeway traffic

A simple model of traffic flow is used to analyze the spatio-temporal distribution of flow and density on closed-loop homogeneous freeways with many ramps, which produce inflows and allow outflows. As we would expect, if the on-ramp demand is space-independent then this distribution tends toward uniformity in space if the freeway is either: (i) uncongested; or (ii) congested with queues on its on-ramps and enough inflow to cause the average freeway density to increase with time. In all other cases, however, including any recovery phase of a rush hour where the freeway’s average density declines, the distribution of flow and density quickly becomes uneven. This happens even under conditions of perfect symmetry, where the percentage of vehicles exiting at every off ramp is the same. The flow-density deviations from the average are shown to grow exponentially in time and propagate backwards in space with a fixed wave speed. A consequence of this type of instability is that, during recovery, gaps of uncongested traffic will quickly appear in the unevenly congested stream, reducing average flow. This extends the duration of recovery and invariably creates clockwise hysteresis loops on scatter-plots of average system flow vs. density during any rush hour that oversaturates the freeway. All these effects are quantified with formulas and verified with simulations. Some have been observed in real networks. In a more practical vein, it is also shown that the negative effects of instability diminish (i.e., freeway flows increase) if (a) some drivers choose to exit the freeway prematurely when it is too congested and/or (b) freeway access is regulated in a certain traffic-responsive way. These two findings could be used to improve the algorithms behind VMS displays for driver guidance (finding a), and on-ramp metering rates (finding b).     

Managing evacuation networks

This paper proposes a non-anticipative, adaptive, decentralized strategy for managing evacuation networks. The strategy is non-anticipative because it does not rely on demand forecasts, adaptive because it uses real-time traffic information, and decentralized because all the information is available locally. It can be used with a failed communication network.The strategy pertains to networks in which no links backtrack in the direction of increased risk. For these types of networks, no other strategy exists that can evacuate more people in any given time, or finish the evacuation in less time. The strategy is also shown to be socially fair, in the sense that the time needed to evacuate all the people exceeding any risk level is, both, the least possible, and the same as if less-at-risk individuals did not participate in the evacuation. The strategy can be proven optimal even when backflows happen due to driver gaming.     

An SNN Ontology Based Environment Monitoring Method for Intelligent Irrigation System

In order to realize high precision of environment parameters detection in irrigation applications, a sensor and sensor network (SSN) ontology based data fusion method is proposed. An SSN sub-ontology for soilstate monitoring is revised, which includes the sensing devices hierarchies and measurement properties selection according to the detection feature interests. As for sensor data processing, a tuning data method by data pool filtering and clustering is adopted, as well as a useful data fusion method for multi-sensor system. The testing results show that both the accuracy and efficiency of the proposed method are higher after related filtering and clustering process, which enables a thorough monitoring for intelligent irrigation systems and can be extended into environment monitoring and control applications.     

Discretization Algorithm Based on Particle Swarm Optimization and Its Application in Attributes Reduction for Fault Data

In order to increase the fault diagnosis efficiency and make the fault data mining be realized, the decision table containing numerical attributes must be discretized for further calculations. The discernibility matrix-based reduction method depends on whether the numerical attributes can be properly discretized or not. So a discretization algorithm based on particle swarm optimization (PSO) is proposed. Moreover, hybrid weights are adopted in the process of particles evolution. Comparative calculations for certain equipment are completed to demonstrate the effectiveness of the proposed algorithm. The results indicate that the proposed algorithm has better performance than other popular algorithms such as class-attribute interdependence maximization (CAIM) discretization method and entropy-based discretization method.     

Inspection-Based Policy Considering Human Errors for Three-Stage Delay Time Degradation Systems

A periodic inspection policy for a single component system based on a three-stage failure process is proposed, and two different kinds of failures covering “hard” and “human” are considered in the proposed policy. The system is periodically inspected and inspections are perfect so that they can identify the intended defect. If the severe defect is detected by an inspection, an immediate repair is needed. However, once the system is identified to be in the minor defective state, there are two options. The first is to do nothing till the arrival of identifying the severe defect or hard failure, and the second is to repair immediately. Repair for any defect can renew the system with a limited probability such that the system may fail after repair due to human errors, which is common in many industrial applications. Two models are constructed by minimizing the expected cost per unit time and compared. We provide a numerical example to demonstrate the proposed model.     

Reliability Analysis of Systems with Common Cause Failure Based on Stress-Strength Interference Model

Many mechanical systems have the characteristics of multiple failure modes and complex failure mechanisms. On the basis of stress-strength interference (SSI) model, this paper takes the mechanical system with common cause failure (CCF) as the research object. The relationship between the stress distribution and the strength distribution is studied, and the failures of components are independent of each other under the deterministic stress. Then, the concept of conditional reliability is introduced to build the system reliability models under the action of one-stress and multi-stress for both series and parallel systems. Finally, the corresponding properties of the proposed methods are discussed to show their advantages.     

A New Fusion Chemical Reaction Optimization Algorithm Based on Random Molecules for Multi-Rotor UAV Path Planning in Transmission Line Inspection

A fusion chemical reaction optimization algorithm based on random molecules (RMCRO) is proposed to meet the special demand of power transmission line inspection. This new algorithm improves the shortcomings of chemical reaction algorithm by merging the idea of repellent-attractant rule and accelerates convergence by using difference algorithm. The molecules in this algorithm avoid obstacles and search optimal path of transmission line inspection by using sensors on multi-rotor unmanned aerial vehicle (UAV). The option of optimal path is based on potential energy of molecules and cost function without repeated parameter adjustment and complicated computation. By compared with an improved particle swarm optimization (IMPSO) in different circumstances of simulation, it can be concluded that the new algorithm presented not only can obtain more optimal path and avoid to trap in local minimum, but also can keep related sensors in a more stable status.     

Economic Dispatch of Islanded Microgrid Considering a Cooperative Strategy Between Diesel Generator and Battery Energy Storage System

For the impact of intermittent resources’ high penetration on the economic dispatch of islanded microgrid, a new economic dispatch method is presented to minimize the overall generating cost for islanded microgrid, considering a cooperative strategy between diesel generator (hereinafter referred to as DE) and battery energy storage system (BESS). The optimum economic operation range of DE and the optimal set-point between DE and BESS are presented in the cooperative dispatch strategy, in which BESS is used fully to enable DE in a lower cost and higher efficient way. The results are analyzed under various operation conditions and also prove the validity of the proposed method.