Design for Two-degree-of-freedom PID Regulator Based on Improved Generalized Extremal Optimization Algorithm

A kind of new design method for two-degree-of-freedom(2DOF)PID regulator was presented,in which,a new global search heuristic--improved generalized extremal optimization(GEO)algorithm is applied to the parameter optimization design of 2DOF PID regulator.The simulated results show that very good dynamic response performance of both command tracking and disturbance rejection characteristics can be achieved simultaneously.At the same time,the comparisons of simulation results with the improved GA,the basic GEO and the improved GEO were given.From the comparisons,it is shown that the improved GEO algorithm is competitive in performance with the GA and basic GEO and is an attractive tool to be used in the design of two-degree-of-freedom PID regulator.     

用微粒群算法求解多元非线性方程组

分析了将多元非线性方程组的求解问题转化为求多元函数极值的优化问题的原理和方法;利用微粒群算法在连续空间中的优化能力求得极值点,得到方程组的近似解;给出了优化算法的具体流程;通过两个算例说明算法的可行性和有效性,实验结果表明此算法具有较高的效率和精度．     

北美航线——海上丝绸之路的最远端

北美航线是近代以广州为起点的海上丝绸之路的一部分,开端于美国独立后不久的1784年美国商船“中国皇后号”中国广州之旅．通过北美航线,美国商人以北美的人参、皮货交换中国的茶叶、丝绸和瓷器,在大洋彼岸的这两个国家互通有无、平等相处了整整60年光景．并通过分析北美航线的开端、繁盛和衰落,古为今用,说明了“北美航线”的历史作用．     

Cellpath: Fusion of cellular and traffic sensor data for route flow estimation via convex optimization

A new convex optimization framework is developed for the route flow estimation problem from the fusion of vehicle count and cellular network data. The issue of highly underdetermined link flow based methods in transportation networks is investigated, then solved using the proposed concept of cellpaths for cellular network data. With this data-driven approach, our proposed approach is versatile: it is compatible with other data sources, and it is model agnostic and thus compatible with user equilibrium, system-optimum, Stackelberg concepts, and other models. Using a dimensionality reduction scheme, we design a projected gradient algorithm suitable for the proposed route flow estimation problem. The algorithm solves a block isotonic regression problem in the projection step in linear time. The accuracy, computational efficiency, and versatility of the proposed approach are validated on the I-210 corridor near Los Angeles, where we achieve 90% route flow accuracy with 1033 traffic sensors and 1000 cellular towers covering a large network of highways and arterials with more than 20,000 links. In contrast to long-term land use planning applications, we demonstrate the first system to our knowledge that can produce route-level flow estimates suitable for short time horizon prediction and control applications in traffic management. Our system is open source and available for validation and extension.     

A modified reinforcement learning algorithm for solving coordinated signalized networks

This study proposes Reinforcement Learning (RL) based algorithm for finding optimum signal timings in Coordinated Signalized Networks (CSN) for fixed set of link flows. For this purpose, MOdified REinforcement Learning algorithm with TRANSYT-7F (MORELTRANS) model is proposed by way of combining RL algorithm and TRANSYT-7F. The modified RL differs from other RL algorithms since it takes advantage of the best solution obtained from the previous learning episode by generating a sub-environment at each learning episode as the same size of original environment. On the other hand, TRANSYT-7F traffic model is used in order to determine network performance index, namely disutility index. Numerical application is conducted on medium sized coordinated signalized road network. Results indicated that the MORELTRANS produced slightly better results than the GA in signal timing optimization in terms of objective function value while it outperformed than the HC. In order to show the capability of the proposed model for heavy demand condition, two cases in which link flows are increased by 20% and 50% with respect to the base case are considered. It is found that the MORELTRANS is able to reach good solutions for signal timing optimization even if demand became increased.     

Multi-objective optimization for asphalt pavement maintenance plans at project level: Integrating performance,cost and environment

Traditionally, asphalt pavement maintenance mainly considers pavement performance and cost and largely ignores the environment while substantial amount of environmental burdens are released in the process. In this study, a multi-objective optimization model was developed integrating the three elements in order to optimize the asphalt pavement maintenance plans at the project level. Pavement performance element was decided as the multiplier of pavement serviceability index and traffic volume. Cost element was represented by the net present value, including components of agency cost, vehicle operation cost and salvage value. Environmental element, integrating energy consumption, global warming potential, acidification potential and respiratory effects potential, was measured by the life cycle assessment model. A hypothetic asphalt pavement maintenance case study was conducted using the developed multi-objective optimization model and harvested 103 sets of feasible combinations of maintenance plans, each of which is non-dominated by the others. Trade-offs analysis was performed among the three objectives and visualized in both two- and three-dimension forms. It is found there is an opportunity of reducing the cost and environmental impacts to 80.3% and 77.8% and increasing the pavement performance to 146.6% compared to the base case. However, they are mutually compromised and cannot be reached simultaneously. The developed model reveals the quantitatively interactive relationship of the three objectives and helps optimize the asphalt pavement maintenance plans.     

Privacy-preserving MaaS fleet management

On-demand traffic fleet optimization requires operating Mobility as a Service (MaaS) companies such as Uber, Lyft to locally match the offer of available vehicles with their expected number of requests referred to as demand (as well as to take into account other constraints such as driver’s schedules and preferences). In the present article, we show that this problem can be encoded into a Constrained Integer Quadratic Program (CIQP) with block independent constraints that can then be relaxed in the form of a convex optimization program. We leverage this particular structure to yield a scalable distributed optimization algorithm corresponding to computing a gradient ascent in a dual space. This new framework does not require the drivers to share their availabilities with the operating company (as opposed to standard practice in today’s mobility as a service companies). The resulting parallel algorithm can run on a distributed smartphone based platform.     

Balancing energy consumption and risk of delay in high speed trains: A three-objective real-time eco-driving algorithm with fuzzy parameters

Eco-driving is an energy efficient traffic operation measure that may lead to important energy savings in high speed railway lines. When a delay arises in real time, it is necessary to recalculate an optimal driving that must be energy efficient and computationally efficient.In addition, it is important that the algorithm includes the existing uncertainty associated with the manual execution of the driving parameters and with the possible future traffic disturbances that could lead to new delays.This paper proposes a new algorithm to be executed in real time, which models the uncertainty in manual driving by means of fuzzy numbers. It is a multi-objective optimization algorithm that includes the classical objectives in literature, running time and energy consumption, and as well a newly defined objective, the risk of delay in arrival. The risk of delay in arrival measure is based on the evolution of the time margin of the train up to destination.The proposed approach is a dynamic algorithm designed to improve the computational time. The optimal Pareto front is continuously tracked during the train travel, and a new set of driving commands is selected and presented to the driver when a delay is detected.The algorithm evaluates the 3 objectives of each solution using a detailed simulator of high speed trains to ensure that solutions are realistic, accurate and applicable by the driver. The use of this algorithm provides energy savings and, in addition, it permits railway operators to balance energy consumption and risk of delays in arrival. This way, the energy performance of the system is improved without degrading the quality of the service.     

Integrating mesoscopic dynamic traffic assignment with agent-based travel behavior models for cumulative land development impact analysis

A number of approaches have been developed to evaluate the impact of land development on transportation infrastructure. While traditional approaches are either limited to static modeling of traffic performance or lack a strong travel behavior foundation, today’s advanced computational technology makes it feasible to model an individual traveler’s response to land development. This study integrates dynamic traffic assignment (DTA) with a positive agent-based microsimulation travel behavior model for cumulative land development impact studies. The integrated model not only enhances the behavioral implementation of DTA, but also captures traffic dynamics. It provides an advanced yet practical approach to understanding the impact of a single or series of land development projects on an individual driver’s behavior, as well as the aggregated impacts on the demand pattern and time-dependent traffic conditions. A simulation-based optimization (SBO) approach is proposed for the calibration of the modeling system. The SBO calibration approach enhances the transferability of this integrated model to other study areas. Using a case study that focuses on the cumulative land development impact along a congested corridor in Maryland, various regional and local travel behavior changes are discussed to show the capability of this tool for behavior side estimations and the corresponding traffic impacts.     

The symmetric intersection design and traffic control optimization

It is well recognized that the left-turning movement reduces the intersection capacity significantly, because exclusive left turn phases are needed to discharge left turn vehicles only. This paper proposes the concept of Left-Hand Traffic (LHT) arterial, on where vehicles follow left-hand traffic rules as in England and India. The unconventional intersection where a LHT arterial intersects with a Right-Hand Traffic (RHT) arterial is named as symmetric intersection. It is only need three basic signal phases to separate all conflicts at symmetric intersection, while it at least need four signal phases at a conventional intersection. So, compared with the conventional intersection, the symmetric intersection can provide longer green time for the left-turning and the through movement, which can increase the capacity significantly. Through-movement waiting areas (TWAs) can be set at the symmetric intersection effectively, which can increase the capacity and short the cycle length furthermore. And the symmetric intersection is Channelized to improve the safety of TWAs. The Binary-Mixed-Integer-Linear-Programming (BMILP) model is employed to formulate the capacity maximization problem and signal cycle length minimization problem of the symmetric intersection. The BMILP model can be solved by standard branch-and-bound algorithms efficiently and outputs the lane allocation, signal timing decisions, and other decisions. Experiments analysis shows that the symmetric intersection with TWAs can increase the capacity and short the signal cycle length.