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.     

Integrated operations planning and revenue management for rail freight transportation

In the rail industry, profit maximization relies heavily on the integration of logistics activities with an improved management of revenues. The operational policies chosen by the carrier have an important impact on the network yield and thus on global profitability. This paper bridges the gap between railroad operations planning and revenue management. We propose a new bilevel mathematical formulation which encompasses pricing decisions and network planning policies such as car blocking and routing as well as train make-up and scheduling. An exact solution approach based on a mixed integer formulation adapted to the problem structure is presented, and computational results are reported on randomly generated instances.     

Real time detection of driver attention: Emerging solutions based on robust iconic classifiers and dictionary of poses

Real time monitoring of driver attention by computer vision techniques is a key issue in the development of advanced driver assistance systems. While past work mostly focused on structured feature-based approaches, characterized by high computational requirements, emerging technologies based on iconic classifiers recently proved to be good candidates for the implementation of accurate and real-time solutions, characterized by simplicity and automatic fast training stages.In this work the combined use of binary classifiers and iconic data reduction, based on Sanger neural networks, is proposed, detailing critical aspects related to the application of this approach to the specific problem of driving assistance. In particular it is investigated the possibility of a simplified learning stage, based on a small dictionary of poses, that makes the system almost independent from the actual user.On-board experiments demonstrate the effectiveness of the approach, even in case of noise and adverse light conditions. Moreover the system proved unexpected robustness to various categories of users, including people with beard and eyeglasses. Temporal integration of classification results, together with a partial distinction among visual distraction and fatigue effects, make the proposed technology an excellent candidate for the exploration of adaptive and user-centered applications in the automotive field.     

Effect of variable message signs on driver speed behavior on a section of expressway under adverse fog conditions—A driving simulator approach

Variable message signs (VMS) are used to provide dynamic information and one current application is to show different speed limits under different conditions. As speed is an important contributor to road accidents and also affects driver speed behavior, the present study focuses on how effective traffic advisory information is when helping drivers to divert from potentially dangerous conditions. Graphical representation of an Expressway section made it easy to isolate the effects of speed etc. by drivers with information provided through VMS under adverse fog conditions. Understanding and reacting to the VMS system by drivers is essential for its success. If drivers do not react by changing speed behavior then the VMS system will fail and further implementation may cease. In this paper an Analysis of Variance model, which is appropriate to the proposed experimental conditions, is used to study how subjects (drivers) will perceive provided information and also to find the effect of VMS on driver speed behavior on the simulated Expressway section.     

Crash prediction with behavioral and physiological features for advanced vehicle collision avoidance system

Real-time crash prediction is the key component of the Vehicle Collision Avoidance System (VCAS) and other driver assistance systems. The further improvements of predictability requires the systemic estimation of crash risks in the driver-vehicle-environment loop. Therefore, this study designed and validated a prediction method based on the supervised learning model with added behavioral and physiological features. The data samples were extracted from 130 drivers’ simulator driving, and included various features generated from synchronized recording of vehicle dynamics, distance metrics, driving behaviors, fixations and physiological measures. In order to identify the optimal configuration of proposed method, the Discriminant Analysis (DA) with different features and models (i.e. linear or quadratic) was tested to classify the crash samples and non-crash samples. The results demonstrated the significant improvements of accuracy and specificity with added visual and physiological features. The different models also showed significant effects on the characteristics of sensitivity and specificity. These results supported the effectiveness of crash prediction by quantifying drivers’ risky states as inputs. More importantly, such an approach also provides opportunities to integrate the driver state monitoring into other vehicle-mounted systems at the software level.     

A branch-and-price approach for solving the train unit scheduling problem

We propose a branch-and-price approach for solving the integer multicommodity flow model for the network-level train unit scheduling problem (TUSP). Given a train operator’s fixed timetable and a fleet of train units of different types, the TUSP aims at determining an assignment plan such that each train trip in the timetable is appropriately covered by a single or coupled train units. The TUSP is challenging due to its complex nature. Our branch-and-price approach includes a branching system with multiple branching rules for satisfying real-world requirements that are difficult to realize by linear constraints, such as unit type coupling compatibility relations and locations banned for coupling/decoupling. The approach also benefits from an adaptive node selection method, a column inheritance strategy and a feature of estimated upper bounds with node reservation functions. The branch-and-price solver designed for TUSP is capable of handling instances of up to about 500 train trips. Computational experiments were conducted based on real-world problem instances from First ScotRail. The results are satisfied by rail practitioners and are generally competitive or better than the manual ones.     

Environmental analyses of land transportation systems in The Netherlands

Environmental analyses of the impact of transportation systems on the environment from the cradle to the grave are rare. This article makes a comparison of various Dutch passenger transportation systems by studying their complete life-cycle energy use. Moreover, systems are compared according to their use of space, costs and travel time. Although the results indicate that no one transportation system out performs others in all of the characteristics, in a multi-criteria analysis of four aspects, the train and bicycle emerge as superior options. This holds regardless of the travel distance considered. Interestingly, the train and bicycle are complementary systems, that together operate within a comprehensive distance range.     

A stochastic model for the integrated optimization on metro timetable and speed profile with uncertain train mass

The integrated timetable and speed profile optimization model has recently attracted more attention because of its good achievements on energy conservation in metro systems. However, most previous studies often ignore the spatial and temporal uncertainties of train mass, and the variabilities of tractive force, braking force and basic running resistance on energy consumption in order to simplify the model formulation and solution algorithm. In this paper, we develop an integrated metro timetable and speed profile optimization model to minimize the total tractive energy consumption, where these real-world operating conditions are explicitly considered in the model formulation and solution algorithm. Firstly, we formulate a two-phase stochastic programming model to determine the timetable and speed profile. Given the speed profile, the first phase determines the timetable by scheduling the arrival and departure times for each station, and the second phase determines the speed profile for each inter-station with the scheduled arrival and departure times. Secondly, we design a simulation-based genetic algorithm procedure incorporated with the optimal train control algorithm to find the optimal solution. Finally, we present a simple example and a real-world example based on the operation data from the Beijing Metro Yizhuang Line in Beijing, China. The results of the real-world example show that, during peak hours, off-peak hours and night hours, the total tractive energy consumptions can be reduced by: (1) 10.66%, 9.94% and 9.13% in comparison with the current timetable and speed profile; and (2) 3.35%, 3.12% and 3.04% in comparison with the deterministic model.     

Advanced Driver Assistance Systems from Autonomous to Cooperative Approach

Abstract

Advanced Driver Assistance Systems (ADAS) have been one of the most active areas of ITS studies in the last two decades. ADAS aim to support drivers by either providing warning to reduce risk exposures, or automating some of the control tasks to relieve a driver from manual control of a vehicle. ADAS functions can be achieved through an autonomous approach with all instrumentation and intelligence on board the vehicle, or through a cooperative approach, where assistance is provided from roadways and/or from other vehicles. In this article, recent research and developments of longitudinal control assistance systems are reviewed including adaptive cruise control, forward collision warning and avoidance, and platooning assistants. The review focuses on comparing between autonomous systems and cooperative systems in terms of technologies used, system impacts and implementation. The main objective is to achieve common understanding on ADAS functional potentials and limitations and to identify research needs for further studies.     

Equity-oriented skip-stopping schedule optimization in an oversaturated urban rail transit network

In this study, we focus on improving system-wide equity performance in an oversaturated urban rail transit network based on multi-commodity flow formulation. From the system perspective, an urban rail transit network is a distributed system, where a set of resources (i.e., train capacity) is shared by a number of users (i.e., passengers), and equitable individuals and groups should receive equal shares of resources. However, when oversaturation occurs in an urban rail transit network during peak hours, passengers waiting at different stations may receive varying shares of train capacity leading to the inequity problem under train all-stopping pattern. Train skip-stopping pattern is an effective operational approach, which holds back some passengers at stations and re-routes their journeys in the time dimension based on the available capacity of each train. In this study, the inequity problem in an oversaturated urban rail transit network is analyzed using a multi-commodity flow modeling framework. In detail, first, discretized states, corresponding to the number of missed trains for passengers, are constructed in a space-time-state three-dimensional network, so that the system-wide equity performance can be viewed as a distribution of all passengers in different states. Different from existing flow-based optimization models, we formulate individual passenger and train stopping pattern as commodity and network structure in the multi-commodity flow-modeling framework, respectively. Then, we aim to find an optimal commodity flow and well-designed network structure through the proposed multi-commodity flow model and simultaneously achieve the equitable distribution of all passengers and the optimal train skip-stopping pattern. To quickly solve the proposed model and find an optimal train skip-stopping pattern with preferable system-wide equity performance, the proposed linear programming model can be effectively decomposed to a least-cost sub-problem with positive arc costs for each individual passenger and a least-cost sub-problem with negative arc costs for each individual train under a Lagrangian relaxation framework. For application and implementation, the proposed train skip-stopping optimization model is applied to a simple case and a real-world case based on Batong Line in the Beijing Subway Network. The simple case demonstrates that our proposed Lagrangian relaxation framework can obtain the approximate optimal solution with a small-gap lower bound and a lot of computing time saved compared with CPLEX solver. The real-world case based on Batong Line in the Beijing Subway Network compares the equity and efficiency indices under the operational approach of train skip-stopping pattern with those under the train all-stopping pattern to state the advantage of the train skip-stopping operational approach.     

Eco-driving advisory strategies for a platoon of mixed gasoline and electric vehicles in a connected vehicle system

As electric vehicles (EVs) have gained an increasing market penetration rate, the traffic on urban roads will tend to be a mix of traditional gasoline vehicles (GVs) and EVs. These two types of vehicles have different energy consumption characteristics, especially the high energy efficiency and energy recuperation system of EVs. When GVs and EVs form a platoon that is recognized as an energy-friendly traffic pattern, it is critical to holistically consider the energy consumption characteristics of all vehicles to maximize the energy efficiency benefit of platooning. To tackle this issue, this paper develops an optimal control model as a foundation to provide eco-driving suggestions to the mixed-traffic platoon. The proposed model leverages the promising connected vehicle technology assuming that the speed advisory system can obtain the information on the characteristics of all platoon vehicles. To enhance the model applicability, the study proposes two eco-driving advisory strategies based on the developed optimal control model. One strategy provides the lead vehicle an acceleration profile, while the other provides a set of targeted cruising speeds. The acceleration-based eco-driving advisory strategy is suitable for platoons with an automated leader, and the speed-based advisory strategy is more friendly for platoons with a human-operated leader. Results of numerical experiments demonstrate the significance when the eco-driving advisory system holistically considers energy consumption characteristics of platoon vehicles.     

Evaluation of the effect of cooperative infrastructure-to-vehicle systems on driver behavior

In-vehicle technologies and co-operative services have potential to ease congestion problems and improve traffic safety. This paper investigates the impact of infrastructure-to-vehicle co-operative systems, case of CO-OPerative SystEms for Intelligent Road Safety (COOPERS), on driver behavior. Thirty-five test drivers drove an instrumented vehicle, twice, with and without the system. Data related to driving behavior, physiological measurements, and user acceptance was collected. A macro-level approach was used to evaluate the potential impact of such systems on driver behavior and traffic safety. The results in terms of speeds, following gaps, and physiological measurements indicate a positive impact. Furthermore, drivers’ opinions show that the system is in general acceptable and useful.     

Optimizing train stopping patterns and schedules for high-speed passenger rail corridors

High-speed railway (HSR) systems have been developing rapidly in China and various other countries throughout the past decade; as a result, the question of how to efficiently operate such large-scale systems is posing a new challenge to the railway industry. A high-quality train timetable should take full advantage of the system’s capacity to meet transportation demands. This paper presents a mathematical model for optimizing a train timetable for an HSR system. We propose an innovative methodology using a column-generation-based heuristic algorithm to simultaneously account for both passenger service demands and train scheduling. First, we transform a mathematical model into a simple linear programming problem using a Lagrangian relaxation method. Second, we search for the optimal solution by updating the restricted master problem (RMP) and the sub-problems in an iterative process using the column-generation-based algorithm. Finally, we consider the Beijing–Shanghai HSR line as a real-world application of the methodology; the results show that the optimization model and algorithm can improve the defined profit function by approximately 30% and increase the line capacity by approximately 27%. This methodology has the potential to improve the service level and capacity of HSR lines with no additional high-cost capital investment (e.g., the addition of new tracks, bridges and tunnels on the mainline and/or at stations).     

Timetable optimization models and methods for minimizing passenger waiting time at public transit terminals

This paper focuses on developing mathematical optimization models for the train timetabling problem with respect to dynamic travel demand and capacity constraints. The train scheduling models presented in this paper aim to minimize passenger waiting times at public transit terminals. Linear and non-linear formulations of the problem are presented. The non-linear formulation is then improved through introducing service frequency variables. Heuristic rules are suggested and embedded in the improved non-linear formulation to reduce the computational time effort needed to find the upper bound. The effectiveness of the proposed train timetabling models is illustrated through the application to an underground urban rail line in the city of Tehran. The results demonstrate the effectiveness of the proposed demand-oriented train timetabling models, in terms of decreasing passenger waiting times. Compared to the baseline and regular timetables, total waiting time is reduced by 6.36% and 10.55% respectively, through the proposed mathematical optimization models.     

Development and testing of a fully Adaptive Cruise Control system

Adaptive Cruise Control systems have been developed and introduced into the consumer market for over a decade. Among these systems, fully-adaptive ones are required to adapt their behaviour not only to traffic conditions but also to drivers’ preferences and attitudes, as well as to the way such preferences change for the same driver in different driving sessions. This would ideally lead towards a system where an on-board electronic control unit can be asked by the driver to calibrate its own parameters while he/she manually drives for a few minutes (learning mode). After calibration, the control unit switches to the running mode where the learned driving style is applied. The learning mode can be activated by any driver of the car, for any driving session and each time he/she wishes to change the current driving behaviour of the cruise control system.The modelling framework which we propose to implement comprises four layers (sampler, profiler, tutor, performer). The sampler is responsible for human likeness and can be calibrated while in learning mode. Then, while in running mode, it works together with the other modelling layers to implement the logic. This paper presents the overall framework, with particular emphasis on the sampler and the profiler that are explained in full mathematical detail. Specification and calibration of the proposed framework are supported by the observed data, collected by means of an instrumented vehicle. The data are also used to assess the proposed framework, confirming human-like and fully-adaptive characteristics.     

Lane changing intention recognition based on speech recognition models

Poor driving habits such as not using turn signals when changing lanes present a major challenge to advanced driver assistance systems that rely on turn signals. To address this problem, we propose a novel algorithm combining the hidden Markov model (HMM) and Bayesian filtering (BF) techniques to recognize a driver’s lane changing intention. In the HMM component, the grammar definition is inspired by speech recognition models, and the output is a preliminary behavior classification. As for the BF component, the final behavior classification is produced based on the current and preceding outputs of the HMMs. A naturalistic data set is used to train and validate the proposed algorithm. The results reveal that the proposed HMM–BF framework can achieve a recognition accuracy of 93.5% and 90.3% for right and left lane changing, respectively, which is a significant improvement compared with the HMM-only algorithm. The recognition time results show that the proposed algorithm can recognize a behavior correctly at an early stage.     

Relaxation approaches to large scale bus driver scheduling problems

The bus driver scheduling (BDS) problem in a transit company consists of establishing, at minimum cost, a list of work-days in which a driver is assigned to each bus in the given time-table and all clauses of the union contract are respected. In this paper we present a general mathematical programming formulation for the BDS problem. Because, in general, the problem is too large to be solved directly, we introduce a relation of the problem and three different solution approaches. Computational results obtained on real life problems indicate that mathematical programming techniques can solve the BDS problem efficiently.     

Closing the loop in real-time railway control: Framework design and impacts on operations

Railway traffic is heavily affected by disturbances and/or disruptions, which are often cause of delays and low performance of train services. The impact and the propagation of such delays can be mitigated by relying on automatic tools for rescheduling traffic in real-time. These tools predict future track conflict based on current train information and provide suitable control measures (e.g. reordering, retiming and/or rerouting) by using advanced mathematical models. A growing literature is available on these tools, but their effects on real operations are blurry and not yet well known, due to the very scarce implementation of such systems in practice.In this paper we widen the knowledge on how automatic real-time rescheduling tools can influence train performance when interfaced with railway operations. To this purpose we build up a novel traffic control framework that couples the state-of-the art automatic rescheduling tool ROMA, with the realistic railway traffic simulation environment EGTRAIN, used as a surrogate of the real field. At regular times ROMA is fed with current traffic information measured from the field (i.e. EGTRAIN) in order to predict possible conflicts and compute (sub) optimal control measures that minimize the max consecutive delay on the network. We test the impact of the traffic control framework based on different types of interaction (i.e. open loop, multiple open loop, closed loop) between the rescheduling tool and the simulation environment as well as different combinations of parameter values (such as the rescheduling interval and prediction horizon). The influence of different traffic prediction models (assuming e.g. aggressive versus conservative driving behaviour) is also investigated together with the effects on traffic due to control delays of the dispatcher in implementing the control measures computed by the rescheduling tool.Results obtained for the Dutch railway corridor Utrecht–Den Bosch show that a closed loop interaction outperforms both the multiple open loop and the open loop approaches, especially with large control delays and limited information on train entrance delays and dwell times. A slow rescheduling frequency and a large prediction horizon improve the quality of the control measure. A limited control delay and a conservative prediction of train speed help filtering out uncertain traffic dynamics thereby increasing the effectiveness of the implemented measures.     

A delay propagation algorithm for large-scale railway traffic networks

In scheduled railway traffic networks a single delayed train may cause a domino effect of secondary delays over the entire network, which is a main concern to planners and dispatchers. This paper presents a model and an algorithm to compute the propagation of initial delays over a periodic railway timetable. The railway system is modelled as a linear system in max-plus algebra including zero-order dynamics corresponding to delay propagation within a timetable period. A timed event graph representation is exploited in an effective graph algorithm that computes the propagation of train delays using a bucket implementation to store the propagated delays. The behaviour of the delay propagation and the convergence of the algorithm is analysed depending on timetable properties such as realisability and stability. Different types of delays and delay behaviour are discussed, including primary and secondary delays, structural delays, periodic delay regimes, and delay explosion. A decomposition method based on linearity is introduced to deal with structural and initial delays separately. The algorithm can be applied to large-scale scheduled railway traffic networks in real-time applications such as interactive timetable stability analysis and decision support systems to assist train dispatchers.