A control theoretic formulation of green driving strategies based on inter-vehicle communications

Various green driving strategies have been proposed to smooth traffic flow and lower pollutant emissions and fuel consumption in stop-and-go traffic. In this paper, we present a control theoretic formulation of distributed, cooperative green driving strategies based on inter-vehicle communications (IVCs). The control variable is the advisory speed limit, which is designed to smooth a following vehicle’s speed profile without changing its average speed. We theoretically analyze the performance of a constant independent and three simple cooperative green driving strategies and present three rules for effective and robust strategies. We then develop a distributed cooperative green driving strategy, in which the advisory speed limit is first independently calculated by each individual vehicle and then averaged among green driving vehicles through IVC. By simulations with Newell’s car-following model and the Comprehensive Modal Emissions Model (CMEM), we demonstrate that such a strategy is effective and robust independently as well as cooperatively for different market penetration rates of IVC-equipped vehicles and communication delays. In particular, even when 5% of the vehicles implement the green driving strategy and the IVC communication delay is 60 s, the fuel consumption can be reduced by up to 15%. Finally we discuss some future extensions.     

Online distributed cooperative model predictive control of energy-saving trajectory planning for multiple high-speed train movements

The cooperative energy-efficient trajectory planning for multiple high-speed train movements is considered in this paper. We model all the high-speed trains as the agents that can communicate with others and propose a local trajectory planning control model using the Model Predictive Control (MPC) theory. After that we design an online distributed cooperative optimization algorithm for multiple train trajectories planning, under which each train agent can regulate the trajectory planning procedure to save energy using redundancy trip time through tuning ACO’s heuristic information parameter. Compared to the existing literature, the vital distinctions of our work lies not only on the online cooperative trajectory planning but also on the distributed mechanism for multiple high-speed trains. Experimental studies are given to illustrate the effectiveness of the proposed methods with the practical operational data of Wuhan-Guangzhou High-speed Railway in China.     

A multi-agent architecture for cooperative inter-jurisdictional traffic congestion management

This paper describes , an innovative multi-agent architecture for the provision of real-time decision support to Traffic Operations Center personnel for coordinated, inter-jurisdictional traffic congestion management on freeway and surface street (arterial) networks. is composed of two interacting knowledge-based systems that perform cooperative reasoning and resolve conflicts, for the analysis of non-recurring congestion and the on-line formulation of integrated control plans. The two agents support incident management operations for a freeway and an adjacent arterial subnetwork and interact with human operators, determining control recommendations in response to the occurrence of incidents. The multi-decision maker approach adopted by reflects the spatial and administrative organization of traffic management agencies in US cities, providing a cooperative solution that exploits the agencies’ willingness to cooperate and unify their problem-solving capabilities, yet preserves the different levels of authority and the inherent distribution of data and expertise. The interaction between the agents is based on the functionally accurate, cooperative paradigm, a distributed problem solving approach aimed at producing consistent solutions without requiring the agents to have shared access to all globally available information. The cornerstone of this approach is the assumption that effective solutions can be efficiently obtained even when complete and up-to-date information is not directly available to the agents, thus reducing the need for complex data communication networks and synchronization time delays. The simulation-based evaluation of the system performance validates this assumption. The paper focuses on the distributed architecture of the agents and on their communication and decision making characteristics.     

Short-term planning of liquefied natural gas deliveries

The ability of a supplier of liquefied natural gas (LNG) to deliver cargoes at desired times, while effectively managing a fleet of cryogenic vessels can significantly impact its profits. We investigate in this paper an LNG short-term delivery planning problem by considering mandatory cargoes as well as optional cargoes to select, along with the scheduling of a heterogeneous vessel fleet with controllable cruising speeds. Several technical constraints are accommodated including time windows, berth availability, bunkering restrictions, inventory, liquefaction terminal storage capacity, maximum waiting time, and planned maintenance restrictions. The objective is to maximize the net profit.We propose a mixed-integer programming formulation that includes a polynomial number of variables and constraints and accommodates all of the problem features. Also, we describe an optimization-based variable neighborhood search procedure that embeds the proposed compact formulation. To assess the quality of the generated solutions, we propose a second valid formulation with an exponential number of decision variables and we solve its linear programming relaxation using column generation. We provide the results of extensive computational results that were carried out on a set of large-scale set of realistic instances, with up to 62 vessels and 160 cargoes, provided by a major LNG producer. These results provide evidence that the proposed improvement procedure yields high-quality solutions.     

Collision avoidance support in roads with lateral and longitudinal maneuver prediction by fusing GPS/IMU and digital maps

Collision avoidance in roads can be addressed in several ways, being cooperative systems one of the most promising options. In cooperative collision avoidance support systems (CCASS) the vehicles which constitute a scene share by means of communication links information that can be useful to detect a potentially risky situation. Typically, this information describes the kinematic state of each vehicle and can be complemented with a prediction of its next state. Indeed, the timely prediction of the next maneuver of a vehicle results beneficial to estimate the risk factor of a scene. This article presents a solution to the problem of maneuver prediction which employs a reduced number of sensors: a Global Navigation Satellite System (GNSS) receiver, one gyro, one accelerometer and the odometry. Predictions are made by a bi-dimensional interactive multiple model (2D-IMM) filter in which longitudinal and lateral motions of the vehicle are distinguished and maneuvering states are described by different kinematic models. A number of experiments were carried out with two vehicle prototypes in several circuits. The results achieved prove the suitability of the proposed method for the problem under consideration.     

Robust flight-to-gate assignment using flight presence probabilities

In this paper we present a novel method to improve the robustness of solutions to the Flight-to-Gate Assignment Problem (FGAP), with the aim to reduce the need for gate re-planning due to unpredicted flight schedule disturbances in the daily operations at an airport. We propose an approach in which the deterministic gate constraints are replaced by stochastic gate constraints that incorporate the inherent stochastic flight delays in such a way so as to ensure that the expected gate conflict probability of two flights assigned to the same gate at the same time does not exceed a user-specified value. The novel approach is integrated into an existing multiple time slot FGAP model that relies on a binary integer programming formulation and is tested using real-life data pertaining to Amsterdam Airport Schiphol. The results confirm that the proposed approach holds out great promise to improve the robustness of the FGAP solutions.     

Robust supply vessel routing and scheduling

We solve the problem of tactical supply vessel planning arising in the upstream offshore petroleum logistics. Supply vessels deliver all the necessary materials and equipment to offshore installations from an onshore supply base according to a delivery schedule. The planning of supply vessels should be done so that their number is minimized and at the same time provide a reliable flow of supplies from the base. The execution of a weekly sailing plan is affected by weather conditions, especially in winter time. Harsh weather conditions increase the number of vessels required to perform the operations as well as the service times at the installations, and thus disrupt the schedule, leading to additional costs and reduced service level. We present a methodology for robust supply vessel planning enabling a trade-off analysis to be made between the schedules’ service level and vessels’ cost. The methodology involves the generation of multiple vessel schedules with different level of robustness using an adaptive large neighbourhood search metaheuristic and a subsequent discrete event simulation procedure for the assessment of the service level. To control the level of robustness we developed a concept of slacks and incorporated it into the metaheuristic algorithm.     

Analysis of a cooperative variable speed limit system using microscopic traffic simulation

Variable speed limit systems where variable message signs are used to show speed limits adjusted to the prevailing road or traffic conditions are installed on motorways in many countries. The objectives of variable speed limit system installations are often to decrease the number of accidents and to increase traffic efficiency. Currently, there is an interest in exploring the potential of cooperative intelligent transport systems including communication between vehicles and/or vehicles and the infrastructure. In this paper, we study the potential benefits of introducing infrastructure to vehicle communication, autonomous vehicle control and individualized speed limits in variable speed limit systems. We do this by proposing a cooperative variable speed limit system as an extension of an existing variable speed limit system. In the proposed system, communication between the infrastructure and the vehicles is used to transmit variable speed limits to upstream vehicles before the variable message signs become visible to the drivers. The system is evaluated by the means of microscopic traffic simulation. Traffic efficiency and environmental effects are considered in the analysis. The results of the study show benefits of the infrastructure to vehicle communication, autonomous vehicle control and individualized speed limits for variable speed limit systems in the form of lower acceleration rates and thereby harmonized traffic flow and reduced exhaust emissions.     

Complementarity formulations for the cell transmission model based dynamic user equilibrium with departure time choice, elastic demand and user heterogeneity

In this paper we formulate the dynamic user equilibrium problem with an embedded cell transmission model on a network with a single OD pair, multiple parallel paths, multiple user classes with elastic demand. The formulation is based on ideas from complementarity theory. The travel time is estimated based on two methods which have different transportation applications: (1) maximum travel time and (2) average travel time. These travel time functions result in linear and non-linear complementarity formulations respectively. Solution existence and the properties of the formulations are rigorously analyzed. Extensive computational experiments are conducted to demonstrate the benefits of the proposed formulations on various test networks.     

Optimal planning of liquefied natural gas deliveries

We investigate the problem of designing an optimal annual delivery plan for Liquefied Natural Gas (LNG). This problem requires determining the long-term cargo delivery dates and the assignment of vessels to the cargoes while accommodating several constraints, including berth availability, liquefaction terminal inventory, planned maintenance, and bunkering requirements. We describe a novel mixed-integer programming formulation that captures important industry requirements and constraints with the objective of minimizing the vessel fleet size. A peculiar property of the proposed formulation is that it includes a polynomial number of variables and constraints and is, in our experience, computationally tractable for large problem instances using a commercial solver. Extensive computational runs demonstrate the efficacy of the proposed model for real instances provided by a major energy company that involve up to 118 cargoes and a 373-day planning horizon.     

Distributed MPC for cooperative highway driving and energy-economy validation via microscopic simulations

Traffic congestion and energy issues have set a high bar for current ground transportation systems. With advances in vehicular communication technologies, collaborations of connected vehicles have becoming a fundamental block to build automated highway transportation systems of high efficiency. This paper presents a distributed optimal control scheme that takes into account macroscopic traffic management and microscopic vehicle dynamics to achieve efficiently cooperative highway driving. Critical traffic information beyond the scope of human perception is obtained from connected vehicles downstream to establish necessary traffic management mitigating congestion. With backpropagating traffic management advice, a connected vehicle having an adjustment intention exchanges control-oriented information with immediately connected neighbors to establish potential cooperation consensus, and to generate cooperative control actions. To achieve this goal, a distributed model predictive control (DMPC) scheme is developed accounting for driving safety and efficiency. By coupling the states of collaborators in the optimization index, connected vehicles achieve fundamental highway maneuvers cooperatively and optimally. The performance of the distributed control scheme and the energy-saving potential of conducting such cooperation are tested in a mixed highway traffic environment by the means of microscopic simulations.     

Optimal competitive freight network design as hierarchical variational inequalities programming problems

Freight networks are a case of systems that multiple participants are composing interrelations along the complete supply chain. Their interrelations correspond to alternative behavior, namely, cooperation, non-cooperation and competition, while they are large-scale spatially distributed systems combining multiple means of transportation and the infrastructure and equipment typically utilized for servicing demand, results to a complex system integration. In this paper, the case of the optimal design of freight networks is investigated, aiming to highlight the particularities emerging in this case of transportation facilities strategic and/or operational planning and the multiple game-theoretic and equilibrium problems that are structured in cascade and in hierarchies. The application that is investigated here focuses in the design of a significant ‘player’ of the freight supply chain, namely container terminals, while the proposed framework will aim on analyzing investment strategies built on integrated demand–supply models and the optimal network design format. The approach will build on the multilevel Mathematical Programming with Equilibrium Constraints (MPECs) formulation, but is further extended to cope with the properties introduced by the ‘designers’ (infrastructure authorities), shippers and carriers competition in all levels of MPECs. Since container terminals are typically competing each other, the nomenclature used here for formulating appropriate MPECs problems are based on hierarchies of Variational Inequalities (VI) problems, able to capture the alternative relationships emerging in realistic freight supply chains. The proposed formulations of the competitive network design case is addressed by a novel approach of co-evolutionary agents, which can be regarded as new in equilibrium estimation. Finally, the results are compared with alternative network design cases, namely the centralized cooperative and exchanging design. Under this analysis it is able to highlight the differences among alternative design cases, but moreover an estimation of the ‘price of anarchy’ in transportation systems design is offered, an element of both theoretical as well as practical relevance.     

A hybrid Genetic Algorithm approach to minimize the total joint cost of a single-vendor multi-customer integrated scheduling problem

This paper addresses the scheduling of supply chains with interrelated factories consisting of a single vendor and multiple customers. In this research, one transporter is available to deliver jobs from vendor to customers, and the jobs can be processed by batch. The problem studied in this paper focuses on a real-case scheduling problem of a multi-location hospital supplied with a central pharmacy. The objective of this work is to minimize the total cost, while satisfying the customer’s due dates constraints. A mathematical formulation of the problem is given as a Mixed Integer Programming model. Then, a Branch-and-Bound algorithm is proposed as an exact method for solving this problem, a greedy local search is developed as a heuristic approach, and a hybrid Genetic Algorithm is presented as a meta-heuristic. Computation experiments are conducted to highlight the performance of the proposed methods.     

Dynamic system-optimal traffic assignment using a state space model

We propose a new mathematical formulation for the problem of optimal traffic assignment in dynamic networks with multiple origins and destinations. This problem is motivated by route guidance issues that arise in an Intelligent Vehicle-Highway Systems (IVHS) environment. We assume that the network is subject to known time-varying demands for travel between its origins and destinations during a given time horizon. The objective is to assign the vehicles to links over time so as to minimize the total travel time experienced by all the vehicles using the network. We model the traffic network over the time horizon as a discrete-time dynamical system. The system state at each time instant is defined in a way that, without loss of optimality, avoids complete microscopic detail by grouping vehicles into platoons irrespective of origin node and time of entry to network. Moreover, the formulation contains no explicit path enumeration. The state transition function can model link travel times by either impedance functions, link outflow functions, or by a combination of both. Two versions (with different boundary conditions) of the problem of optimal traffic assignment are studied in the context of this model. These optimization problems are optimal control problems for nonlinear discrete-time dynamical systems, and thus they are amenable to algorithmic solutions based on dynamic programming. The computational challenges associated with the exact solution of these problems are discussed and some heuristics are proposed.     

Global optimization methods for the discrete network design problem

This paper addresses the discrete network design problem (DNDP) with multiple capacity levels, or multi-capacity DNDP for short, which determines the optimal number of lanes to add to each candidate link in a road network. We formulate the problem as a bi-level programming model, where the upper level aims to minimize the total travel time via adding new lanes to candidate links and the lower level is a traditional Wardrop user equilibrium (UE) problem. We propose two global optimization methods by taking advantage of the relationship between UE and system optimal (SO) traffic assignment principles. The first method, termed as SO-relaxation, exploits the property that an optimal network design solution under SO principle can be a good approximate solution under UE principle, and successively sorts the solutions in the order of increasing total travel time under SO principle. Optimality is guaranteed when the lower bound of the total travel time of the unexplored solutions under UE principle is not less than the total travel time of a known solution under UE principle. The second method, termed as UE-reduction, adds the objective function of the Beckmann-McGuire-Winsten transformation of UE traffic assignment to the constraints of the SO-relaxation formulation of the multi-capacity DNDP. This constraint is convex and strengthens the SO-relaxation formulation. We also develop a dynamic outer-approximation scheme to make use of the state-of-the-art mixed-integer linear programming solvers to solve the SO-relaxation formulation. Numerical experiments based on a two-link network and the Sioux-Falls network are conducted.     

Stochastic eco-routing in a signalized traffic network

In this paper, an eco-routing algorithm is developed for vehicles in a signalized traffic network. The proposed method incorporates a microscopic vehicle emission model into a Markov decision process (MDP). Instead of using GPS-based vehicle trajectory data, which are used by many existing eco-routing algorithm, high resolution traffic data including vehicle arrival and signal status information are used as primary inputs. The proposed method can work with any microscopic vehicle model that uses vehicle trajectories as inputs and gives related emission rates as outputs. Furthermore, a constrained eco-routing problem is proposed to deal with the situation where multiple costs present. This is done by transferring the original MDP based formulation to a linear programming formulation. Besides the primary cost, additional costs are considered as constraints. Two numerical examples are given using the field data obtained from City of Pasadena, California, USA. The eco-routing algorithm for single objective is compared against the traditional shortest path algorithm, Dijkstra’s algorithm. Average reductions of CO emission around 20% are observed.     

Design,analysis and performance evaluation of a third order distributed protocol for platooning in the presence of time-varying delays and switching topologies

This paper is concerned with the problem of designing a decentralized consensus protocol for platooning of non-identical vehicles in the presence of heterogeneous time-varying communication delays. The proposed control protocol makes use of a state feedback and to this aim drivetrain dynamics are modeled as third-order linear systems. Necessary and sufficient conditions for convergence and exponential stability, derived by using an appropriate Krasovskii functional, demonstrate the ability of the platoon in reaching the required regime with an exponentially bounded behavior. The proposed LMI-based approach allows to estimate both delay margin and decay rate. Moreover, convergence is proven under switching communication network topologies by means of a Lyapunov-Razumikhin function, and the assessment of a string stable behavior has been also theoretically investigated. High-fidelity simulations with Plexe show the effectiveness of the theoretical results in different driving conditions and in the presence of external disturbances and communication impairment. Different communication channel models are used in the validation stage to further prove robustness of the proposed methodology with respect hard delay and packets losses.     

Inland waterway transport in the federal Republic of Germany: Situation and problems

Inland waterway transport in the Federal Republic of Germany, interconnecting 54 out of the 80 big cities, is mainly structured into small-scale enterprises. Organisation of transport, however, is mainly accommodated by a few large shipping firms. The increasing interest in inland waterway transport is due to increasing infrastructural bottlenecks in rail and road transport caused by integration, whereas waterways still have high capacity reserves. Furthermore, they are environmentally beneficial. Future problems, on the one hand, will arise from fundamental market and relating changes inland waterway transport has to adapt to within the scope of transport chain optimisation. On the other hand, the abolishment of fare regulation and the commercialisation of the railway companies will change the internal and external competitive conditions. An additional problem arises from future competition of inland vessels from Eastern European countries.     

Rolling horizon control framework for driver assistance systems. Part II: Cooperative sensing and cooperative control

This contribution furthers the control framework for driver assistance systems in Part I to cooperative systems, where equipped vehicles can exchange relevant information via vehicle-to-vehicle communication to improve the awareness of the ambient situation (cooperative sensing) and to manoeuvre together under a common goal (cooperative control). To operationalize the cooperative sensing strategy, the framework is applied to the development of a multi-anticipative controller, where an equipped vehicle uses information from its direct predecessor to predict the behaviour of its pre-predecessor. To operationalize the cooperative control strategy, we design cooperative controllers for sequential equipped vehicles in a platoon, where they collaborate to optimise a joint objective. The cooperative control strategy is not restricted to cooperation between equipped vehicles. When followed by a human-driven vehicle, equipped vehicles can still exhibit cooperative behaviour by predicting the behaviour of the human-driven follower, even if the prediction is not perfect.The performance of the proposed controllers are assessed by simulating a platoon of 11 vehicles with reference to the non-cooperative controller proposed in Part I. Evaluations show that the multi-anticipative controller generates smoother behaviour in accelerating phase. By a careful choice of the running cost specification, cooperative controllers lead to smoother decelerating behaviour and more responsive and agile accelerating behaviour compared to the non-cooperative controller. The dynamic characteristics of the proposed controllers provide new insights into the potential impact of cooperative systems on traffic flow operations, particularly at the congestion head and tail.     

Enhanced cooperative car-following traffic model with the combination of V2V and V2I communication

Vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication are emerging components of intelligent transport systems (ITS) based on which vehicles can drive in a cooperative way and, hence, significantly improve traffic flow efficiency. However, due to the high vehicle mobility, the unreliable vehicular communications such as packet loss and transmission delay can impair the performance of the cooperative driving system (CDS). In addition, the downstream traffic information collected by roadside sensors in the V2I communication may introduce measurement errors, which also affect the performance of the CDS. The goal of this paper is to bridge the gap between traffic flow modelling and communication approaches in order to build up better cooperative traffic systems. To this end, we aim to develop an enhanced cooperative microscopic (car-following) traffic model considering V2V and V2I communication (or V2X for short), and investigate how vehicular communications affect the vehicle cooperative driving, especially in traffic disturbance scenarios. For these purposes, we design a novel consensus-based vehicle control algorithm for the CDS, in which not only the local traffic flow stability is guaranteed, but also the shock waves are supposed to be smoothed. The IEEE 802.11p, the defacto vehicular networking standard, is selected as the communication protocols, and the roadside sensors are deployed to collect the average speed in the targeted area as the downstream traffic reference. Specifically, the imperfections of vehicular communication as well as the measured information noise are taken into account. Numerical results show the efficiency of the proposed scheme. This paper attempts to theoretically investigate the relationship between vehicular communications and cooperative driving, which is needed for the future deployment of both connected vehicles and infrastructure (i.e. V2X).