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.     

An improved Dial's algorithm for logit-based traffic assignment within a directed acyclic network

Abstract

Dial's algorithm is one of the most effective and popular procedures for a logit-type stochastic traffic assignment, as it does not require path enumeration over a network. However, a fundamental problem associated with the algorithm is its simple definition of ‘efficient paths’, which sometimes produces unrealistic flow patterns. In this paper, an improved algorithm based on the route extension coefficient is proposed in order to circumvent this problem, in which ‘efficient paths’ simultaneously consider link travel cost and minimum travel cost. Path enumeration is still not required and a similar computing efficiency with the original algorithm is guaranteed. A limitation of the algorithm is that it can only be applied to a directed acyclic network because a topological sorting algorithm is used to decide the order of the sequential calculation. A numerical example based on the Beijing subway network illustrates the effectiveness of the proposed algorithm. It is found that it is able to exclude most unrealistic paths, but include all reasonable paths when compared with path enumeration and the original Dial's algorithm.     

Connectivity-based optimization of vehicle route and speed for improved fuel economy

Traditionally, vehicle route planning problem focuses on route optimization based on traffic data and surrounding environment. This paper proposes a novel extended vehicle route planning problem, called vehicle macroscopic motion planning (VMMP) problem, to optimize vehicle route and speed simultaneously using both traffic data and vehicle characteristics to improve fuel economy for a given expected trip time. The required traffic data and neighbouring vehicle dynamic parameters can be collected through the vehicle connectivity (e.g. vehicle-to-vehicle, vehicle-to-infrastructure, vehicle-to-cloud, etc.) developed rapidly in recent years. A genetic algorithm based co-optimization method, along with an adaptive real-time optimization strategy, is proposed to solve the proposed VMMP problem. It is able to provide the fuel economic route and reference speed for drivers or automated vehicles to improve the vehicle fuel economy. A co-simulation model, combining a traffic model based on SUMO (Simulation of Urban MObility) with a Simulink powertrain model, is developed to validate the proposed VMMP method. Four simulation studies, based on a real traffic network, are conducted for validating the proposed VMMP: (1) ideal traffic environment without traffic light and jam for studying the fuel economy improvement, (2) traffic environment with traffic light for validating the proposed traffic light penalty model, (3) traffic environment with traffic light and jam for validating the proposed adaptive real-time optimization strategy, and (4) investigating the effect of different powertrain platforms to fuel economy using two different vehicle platforms. Simulation results show that the proposed VMMP method is able to improve vehicle fuel economy significantly. For instance, comparing with the fastest route, the fuel economy using the proposed VMMP method is improved by up to 15%.     

Understanding the variability of speed distributions under mixed traffic conditions caused by holiday traffic

Understanding the variability of speed patterns and congestion characteristics of interstate freeway systems caused by holiday traffic is beneficial because appropriate countermeasures for safety improvement and congestion mitigation can be prepared and drivers can avoid traffic congestion and change their holiday travel schedules. This study evaluated the traffic congestion patterns during the Thanksgiving holiday period in 2006 using a Gaussian mixture speed distribution estimated by the Expectation–Maximization (EM) algorithm. This mathematical approach showed the potential of improving freeway operational performance evaluation schemes for holiday periods (even non-holiday periods). This study suggested that a Gaussian mixture model using the EM algorithm could be used to properly characterize the severity and the variability of congestion on certain interstate roadway systems. However, this study also pointed out that the fundamental limitations of the mixture model and the statistical significance test about the mixture components should be well understood and need to be further investigated. In addition, because this study investigated the changing patterns of speed distributions with only one interstate freeway system, I-95 northbound, other freeway systems with both directions need to be evaluated so that a more broad and confident analysis on holiday traffic can be achieved.     

The treatment of uncertainty in the dynamic origin–destination estimation problem using a fuzzy approach

Regardless of existing types of transportation and traffic model and their applications, the essential input to these models is travel demand, which is usually described using origin–destination (OD) matrices. Due to the high cost and time required for the direct development of such matrices, they are sometimes estimated indirectly from traffic measurements recorded from the transportation network. Based on an assumed demand profile, OD estimation problems can be categorized into static or dynamic groups. Dynamic OD demand provides valuable information on the within-day fluctuation of traffic, which can be employed to analyse congestion dissipation. In addition, OD estimates are essential inputs to dynamic traffic assignment (DTA) models. This study presents a fuzzy approach to dynamic OD estimation problems. The problems are approached using a two-level model in which demand is estimated in the upper level and the lower level performs DTA via traffic simulation. Using fuzzy rules and the fuzzy C-Mean clustering approach, the proposed method treats uncertainty in historical OD demand and observed link counts. The approach employs expert knowledge to model fitted link counts and to set boundaries for the optimization problem by defining functions in the fuzzification process. The same operation is performed on the simulation outputs, and the entire process enables different types of optimization algorithm to be employed. The Box-complex method is utilized as an optimization algorithm in the implementation of the approach. Empirical case studies are performed on two networks to evaluate the validity and accuracy of the approach. The study results for a synthetic network and a real network demonstrate the robust performance of the proposed method even when using low-quality historical demand data.     

A network equilibrium approach for modelling activity-travel pattern scheduling problems in multi-modal transit networks with uncertainty

An understanding of the interaction between individuals’ activities and travel choice behaviour plays an important role in long-term transit service planning. In this paper, an activity-based network equilibrium model for scheduling daily activity-travel patterns (DATPs) in multi-modal transit networks under uncertainty is presented. In the proposed model, the DATP choice problem is transformed into a static traffic assignment problem by constructing a new super-network platform. With the use of the new super-network platform, individuals’ activity and travel choices such as time and space coordination, activity location, activity sequence and duration, and route/mode choices, can be simultaneously considered. In order to capture the stochastic characteristics of different activities, activity utilities are assumed in this study to be time-dependent and stochastic in relation to the activity types. A concept of DATP budget utility is proposed for modelling the uncertainty of activity utility. An efficient solution algorithm without prior enumeration of DATPs is developed for solving the DATP scheduling problem in multi-modal transit networks. Numerical examples are used to illustrate the application of the proposed model and the solution algorithm.     

Optimization of headways with stop‐skipping control: a case study of bus rapid transit system

Bus rapid transit system is designed to provide high‐quality and cost‐efficient passenger transportation services. In order to achieve this design objective, effective scheduling strategies are required. This research aims at improving the operation efficiency and service quality of a BRT system through integrated optimization of its service headways and stop‐skipping strategy. Based on cost analysis for both passengers and operation agencies, an optimization model is established. A genetic algorithms based algorithm and an application‐oriented solution method are developed. Beijing BRT Line 2 has been chosen as a case study, and the effectiveness of the optimal headways with stop‐skipping services under different demand levels has been analyzed. The results has shown that, at a certain demand level, the proposed operating strategy can be most advantageous for passengers with an accepted increase of operating costs, under which the optimum headway is between 3.5 and 5.5 min for stop‐skipping services during the morning peak hour depending on the demand with the provision of stop‐skipping services. The effectiveness of the optimal headways with stop‐skipping services is compared with those of existing headways and optimal headways without stop‐skipping services. The results show that operating strategies under the optimal headways with stop‐skipping services outperforms the other two operating strategies with respect to total costs and in‐vehicle time for passengers. Copyright © 2014 John Wiley & Sons, Ltd.     

Robust optimization for emergency logistics planning: Risk mitigation in humanitarian relief supply chains

This paper proposes a methodology to generate a robust logistics plan that can mitigate demand uncertainty in humanitarian relief supply chains. More specifically, we apply robust optimization (RO) for dynamically assigning emergency response and evacuation traffic flow problems with time dependent demand uncertainty. This paper studies a Cell Transmission Model (CTM) based system optimum dynamic traffic assignment model. We adopt a min–max criterion and apply an extension of the RO method adjusted to dynamic optimization problems, an affinely adjustable robust counterpart (AARC) approach. Simulation experiments show that the AARC solution provides excellent results when compared to deterministic solution and sampling based stochastic programming solution. General insights of RO and transportation that may have wider applicability in humanitarian relief supply chains are provided.     

Integrating mobile agent technology with multi-agent systems for distributed traffic detection and management systems

Agent technology is rapidly emerging as a powerful computing paradigm to cope with the complexity in dynamic distributed systems, such as traffic control and management systems. However, while a number of agent-based traffic control and management systems have been proposed and the multi-agent systems have been studied, to the best of our knowledge, the mobile agent technology has not been applied to this field. In this paper, we propose to integrate mobile agent technology with multi-agent systems to enhance the ability of the traffic management systems to deal with the uncertainty in a dynamic environment. In particular, we have developed an IEEE FIPA compliant mobile agent system called Mobile-C and designed an agent-based real-time traffic detection and management system (ABRTTDMS). The system based on Mobile-C takes advantages of both stationary agents and mobile agents. The use of mobile agents allows ABRTTDMS dynamically deploying new control algorithms and operations to respond unforeseen events and conditions. Mobility also reduces incident response time and data transmission over the network. The simulation of using mobile agents for dynamic algorithm and operation deployment demonstrates that mobile agent approach offers great flexibility in managing dynamics in complex systems.     

Berth assignment planning for multi‐line bus stops

In this paper, we study an important problem that arises with the fast development of public transportation systems: when a large number of bus lines share the same bus stop, a long queue of buses often forms when they wait to get into the stop in rush hours. This causes a significant increase of bus delay and a notable drop of traffic capacity near the bus stop. Various measures had been proposed to relieve the congestions near bus stops. However, all of them require considerable financial budgets and construction time costs. In this paper, with the concept of berth assignment redesign, a simulation‐based heuristic algorithm is proposed to make full use of exiting bus berths. In this study, a trustable simulation platform is designed, and the major influencing factors for bus stop operations are considered. The concept of risk control is also introduced to better evaluate the performance of different berth arrangement plans and makes an appropriate trade‐off between the system's efficiency and stability. Finally, a heuristic algorithm is proposed to find a sub‐optimal berth assignment plan. Tests on a typical bus stop show that this algorithm is efficient and fast. The sub‐optimal berth assignment plan obtained by this algorithm could make remarkable improvements to an actual bus stop. Copyright © 2013 John Wiley & Sons, Ltd.     

A chance-constrained based stochastic dynamic traffic assignment model: Analysis, formulation and solution algorithms

This paper is concerned with the system optimum-dynamic traffic assignment (SO-DTA) problem when the time-dependent demands are random variables with known probability distributions. The model is a stochastic extension of a deterministic linear programming formulation for SO-DTA introduced by Ziliaskopoulos (Ziliaskopoulos, A.K., 2000. A linear programming model for the single destination system optimum dynamic traffic assignment problem, Transportation Science, 34, 1–12). The proposed formulation is chance-constrained based and we demonstrate that it provides a robust SO solution with a user specified level of reliability. The model provides numerous insights and can be a useful tool in producing robust control and management strategies that account for uncertainty in applications where SO-DTA is relevant (e.g. evacuation modeling, computing alternate routes around freeway incidents and establishing lower bounds on network performance).     

A trajectory smoothing method at signalized intersection based on individualized variable speed limits with location optimization

Traffic signals on urban highways force vehicles to stop frequently and thus causes excessive travel delay, extra fuel consumption and emissions, and increased safety hazards. To address these issues, this paper proposes a trajectory smoothing method based on Individual Variable Speed Limits with Location Optimization (IVSL-LC) in coordination with pre-fixed traffic signals. This method dynamically imposes speed limits on some identified Target Controlled Vehicles (TCVs) with Vehicle to Infrastructures (V2I) communication ability at two IVSL points along an approaching lane. According to real-time traffic demand and signal timing information, the trajectories of each approaching vehicle are made to run smoothly without any full stop. Essentially, only TCVs’ trajectories need to be controlled and the other vehicles just follow TCVs with Gipps’ car-following model. The Dividing RECTangles (DIRECT) algorithm is used to optimize the locations of the IVSLs. Numerical simulation is conducted to compare the benchmark case without vehicle control, the individual advisory speed limits (IASL) and the proposed IVSL-LC. The result shows that compared with the benchmark, the IVSL-LC method can greatly increase traffic efficiency and reduce fuel consumption. Compared with IASL, IVSL-LC has better performance across all traffic demand levels, and the improvements are the most under high traffic demand. Finally, the results of compliance analysis show that the effect of IVSL-LC improves as the compliance rate increases.     

Categorizing bicycling environments using GPS-based public bicycle speed data

A promising alternative transportation mode to address growing transportation and environmental issues is bicycle transportation, which is human-powered and emission-free. To increase the use of bicycles, it is fundamental to provide bicycle-friendly environments. The scientific assessment of a bicyclist’s perception of roadway environment, safety and comfort is of great interest. This study developed a methodology for categorizing bicycling environments defined by the bicyclist’s perceived level of safety and comfort. Second-by-second bicycle speed data were collected using global positioning systems (GPS) on public bicycles. A set of features representing the level of bicycling environments was extracted from the GPS-based bicycle speed and acceleration data. These data were used as inputs for the proposed categorization algorithm. A support vector machine (SVM), which is a well-known heuristic classifier, was adopted in this study. A promising rate of 81.6% for correct classification demonstrated the technical feasibility of the proposed algorithm. In addition, a framework for bicycle traffic monitoring based on data and outcomes derived from this study was discussed, which is a novel feature for traffic surveillance and monitoring.     

Modeling measurement errors and missing initial values in freeway dynamic origin–destination estimation systems

Most existing dynamic origin–destination (O–D) estimation approaches are grounded on the assumption that a reliable initial O–D set is available and traffic volume data from detectors are accurate. However, in most traffic systems, both types of critical information are either not available or subjected to some level of measurement errors such as traffic counts and speed measurement from sensors. To contend with those critical issues, this study presents two robust algorithms, one for estimation of an initial O–D set and the other for tackling the input measurement errors with an extended estimation algorithm. The core concept of the initial O–D estimation algorithm is to decompose the target network in a number of sub-networks based on proposed rules, and then execute the estimation of the initial O–D set iteratively with the observable information at the first time interval. To contend with the inevitable detector measurement error, this study proposes an interval-based estimation algorithm that converts each model input data as an interval with its boundaries being set based on some prior knowledge. The performance of both proposed algorithms has been tested with a simulated system, the I-95 freeway corridor between I-495 and I-695, and the results are quite promising.     

Time of day intervals partition for bus schedule using GPS data

Time of day partition of bus operating hours is a prerequisite of bus schedule design. Reasonable partition plan is essential to improve the punctuality and level of service. In most mega cities, bus vehicles have been equipped with global positioning system (GPS) devices, which is convenient for transit agency to monitor bus operations. In this paper, a new algorithm is developed based on GPS data to partition bus operating hours into time of day intervals. Firstly, the impacts of passenger demand and network traffic state on bus operational performance are analyzed. Then bus dwell time at stops and inter-stop travel time, which can be attained based on GPS data, are selected as partition indexes. For buses clustered in the same time-of-day interval, threshold values of differences in dwell time at stops and inter-stop travel time are determined. The buses in the same time-of-day interval should have adjacent dispatching numbers, which is set as a constraint. Consequently, a partition algorithm with three steps is developed. Finally, a bus route in Suzhou China is taken as an example to validate the algorithm. Three partition schemes are given by setting different threshold values for the two partition indexes. The present scheme in practice is compared with the three proposed schemes. To balance the number of ToD intervals and partition precision, a Benefit Evaluation Index is proposed, for a better time-of-day interval plan.     

Optimization method of alternate traffic restriction scheme based on elastic demand and mode choice behavior

As a countermeasure to urban traffic congestion, alternate traffic restriction (ATR) involves a certain proportion of automobiles being prohibited from entering pre-determined ATR districts during specific time periods. The present study introduces an optimization method for ATR schemes in terms of both their restriction districts and the proportion of restricted automobiles. As a Stackelberg game between traffic policy makers and road users, the ATR scheme optimization problem is established using a bi-level programming model, with the upper-level examining an ATR scheme aimed at consumers’ surplus maximization under the condition of overload flow minimization, and the lower-level synthetically optimizing elastic demand, mode choice (private car, public transit and park-and-ride) and multi-class user equilibrium assignment. A genetic algorithm based on the graph theory is also proposed to solve the bi-level programming model with a gradient project algorithm for solving the lower-level model. To our knowledge, this study represents the first attempt to theoretically optimize an ATR scheme using a systematic approach with mathematical model specification.     

Development of realistic shortest path algorithm considering lane changes

Lane changes occur as many times as turning movements are needed while following a designated path. The cost of a route with many lane changes is likely to be more expensive than that with less lane changes, and unrealistic paths with impractical lane changes should be avoided for drivers' safety. In this regard, a new algorithm is developed in this study to find the realistic shortest path considering lane changing. The proposed algorithm is a modified link‐labeling Dijkstra algorithm considering the effective lane‐changing time that is a parametric function of the prevailing travel speed and traffic density. The parameters were estimated using microscopic traffic simulation data, and the numerical test demonstrated the performance of the proposed algorithm. It was found that the magnitude of the effect of the effective lane‐changing time on determining the realistic shortest path is nontrivial, and the proposed algorithm has capability to exclude links successfully where the required lane changes are practically impossible. Copyright © 2015 John Wiley & Sons, Ltd.     

Length-based vehicle classification using event-based loop detector data

Length-based vehicle classification is an important topic in traffic engineering, because estimation of traffic speed from single loop detectors usually requires the knowledge of vehicle length. In this paper, we present an algorithm that can classify vehicles passing by a loop detector into two categories: long vehicles and regular cars. The proposed algorithm takes advantage of event-based loop detector data that contains every vehicle detector actuation and de-actuation “event”, therefore time gaps between consecutive vehicles and detector occupation time for each vehicle can be easily derived. The proposed algorithm is based on an intuitive observation that, for a vehicle platoon, longer vehicles in the platoon will have relatively longer detector occupation time. Therefore, we can identify longer vehicles by examining the changes of occupation time in a vehicle platoon. The method was tested using the event-based data collected from Trunk Highway 55 in Minnesota, which is a high speed arterial corridor controlled by semi-actuated coordinated traffic signals. The result shows that the proposed method can correctly classify most of the vehicles passing by a single loop detector.     

Continuous approximation for skip-stop operation in rail transit

Operating speed of a transit corridor is a key characteristic and has many consequences on its performance. It is generally accepted that an increased operating speed for a given fleet leads to reduced operating costs (per kilometer), travel and waiting times (three changes that can be computed precisely), an improved comfort and level of service, which can attract new passengers who are diverted from automobile (items harder to estimate precisely). That is why several operation schemes which aim to increase the operating speed are studied in the literature, such as deadheading, express services, and stop skipping.A novel category of solutions to this problem for one-way single-track rail transit is to perform accelerated transit operations with fixed stopping schedules. The concept is quite simple: as the time required for stopping at each station is an important part of travel time, reducing it would be a great achievement. Particular operations that take advantage of this idea already exist. This paper focuses on one of them: the skip-stop operation for rail transit lines using a single one-way track. It consists in defining three types of stations: AB stations where all the trains stop, and A and B stations where only half of the trains stop (stations type A and B are allocated interchangeably). This mode of operation is already described in the literature (Vuchic, 1973, Vuchic, 1976, Vuchic, 2005) and has been successfully implemented in the Metro system of Santiago, Chile.This work tackles the problem with a continuous approximation approach. The problem is described with a set of geographically dependent continuous parameters like the density of stations for a given line. Cost functions are built for a traditional (all-stop) operation and for skip-stop operation as described above. A simple example is presented to support this discussion. Finally, a discussion about the type of scenarios in which skip-stop operations are more beneficial is presented.     

Analysis of Work Zone Traffic Behavior for Planning Applications

Abstract

Understanding work zone traffic behavior is important for the planning and operation of work zones. The objective of this paper is to develop a mathematical model of work zone traffic flow elements by analyzing the relationships between speed, flow, and density that can be used to estimate the capacity of work zones. Traffic flow data were collected from 22 work zone sites on South Carolina interstate highways. The scatter plots of the collected data demonstrate that the relationship between speed and density does not follow Greenshields’ linear model. A non-linear hyperbolic model was developed to describe the relationship between speed and density. Using this model the capacity of a work zone was estimated to be 1550 passenger cars per hour for 2-lane to 1-lane closures. Adjustments to this capacity value to consider other types of vehicle as well as the work zone intensity are provided. Highway agencies can use this estimated capacity along with anticipated traffic demand to schedule work zone operations to avoid long periods of over-saturation.

The tapered approach to work zone lane closures used by South Carolina is similar to methods used in work zones throughout the world. The authors believe that the methodology described in this paper for modeling work zone traffic as well as estimating work zone capacity is transferable to other countries. The conversion of actual volumes to passenger car equivalents may have to be modified due to the significant differences in traffic makeup between the United States and other countries.