Coordinated platooning with multiple speeds

In a platoon, vehicles travel one after another with small intervehicle distances; trailing vehicles in a platoon save fuel because they experience less aerodynamic drag. This work presents a coordinated platooning model with multiple speed options that integrates scheduling, routing, speed selection, and platoon formation/dissolution in a mixed-integer linear program that minimizes the total fuel consumed by a set of vehicles while traveling between their respective origins and destinations. The performance of this model is numerically tested on a grid network and the Chicago-area highway network. We find that the fuel-savings factor of a multivehicle system significantly depends on the time each vehicle is allowed to stay in the network; this time affects vehicles’ available speed choices, possible routes, and the amount of time for coordinating platoon formation. For problem instances with a large number of vehicles, we propose and test a heuristic decomposed approach that applies a clustering algorithm to partition the set of vehicles and then routes each group separately. When the set of vehicles is large and the available computational time is small, the decomposed approach finds significantly better solutions than does the full model.     

Adding a new station and a road link to a road–rail network in the presence of modal competition

In this paper we study the problem of locating a new station on an existing rail corridor and a new junction on an existing road network, and connecting them with a new road segment under a budget constraint. We consider three objective functions and the corresponding optimization problems, which are modeled by means of mixed integer non-linear programs. For small instances, the models can be solved directly by a standard solver. For large instances, an enumerative algorithm based on a discretization of the problem is proposed. Computational experiments show that the latter approach yields high quality solutions within short computing times.     

Locating inspection facilities in traffic networks: an artificial intelligence approach

Abstract

In order for traffic authorities to attempt to prevent drink driving, check truck weight limits, driver hours and service regulations, hazardous leaks from trucks, and vehicle equipment safety, we need to find answers to the following questions: (a) What should be the total number of inspection stations in the traffic network? and (b) Where should these facilities be located? This paper develops a model to determine the locations of uncapacitated inspection stations in a traffic network. We analyze two different model formulations: a single-objective optimization problem and a multi-objective optimization problem. The problems are solved by the Bee Colony Optimization (BCO) method. The BCO algorithm belongs to the class of stochastic swarm optimization methods, inspired by the foraging habits of bees in the natural environment. The BCO algorithm is able to obtain the optimal value of objective functions in all test problems. The CPU times required to find the best solutions by the BCO are found to be acceptable.     

Optimal scheduling of a taxi fleet with mixed electric and gasoline vehicles to service advance reservations

This study addresses the problem of scheduling a fleet of taxis that are appointed to solely service customers with advance reservations. In contrast to previous studies that have dealt with the planning and operations of a taxi fleet with only electric vehicles (EVs), we consider that most taxi companies may have to operate with fleets comprised of both gasoline vehicles (GVs) and plug-in EVs during the transition from GV to (complete) EV taxi fleets. This paper presents an innovative multi-layer taxi-flow time-space network which effectively describes the movements of the taxis in the dimensions of space and time. An optimization model is then developed based on the time-space network to determine an optimal schedule for the taxi fleet. The objective is to minimize the total operating cost of the fleet, with a set of operating constraints for the EVs and GVs included in the model. Given that the model is formulated as an integer multi-commodity network flow problem, which is characterized as NP-hard, we propose two simple but effective decomposition-based heuristics to efficiently solve the problem with practical sizes. Test instances generated based on the data provided by a Taiwan taxi company are solved to evaluate the solution algorithms. The results show that the gaps between the objective values of the heuristic solutions and those of the optimal solutions are less than 3%, and the heuristics require much less time to obtain the good quality solutions. As a result, it is shown that the model, coupled with the algorithms, can be an effective planning tool to assist the company in routing and scheduling its fleet to service reservation customers.     

Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots

Dial-a-ride problems are concerned with the design of efficient vehicle routes for transporting individual persons from specific origin to specific destination locations. In real-life this operational planning problem is often complicated by several factors. Users may have special requirements (e.g. to be transported in a wheelchair) while service providers operate a heterogeneous fleet of vehicles from multiple depots in their service area. In this paper, a general dial-a-ride problem in which these three real-life aspects may simultaneously be taken into account is introduced: the Multi-Depot Heterogeneous Dial-A-Ride Problem (MD-H-DARP). Both a three- and two-index formulation are discussed. A branch-and-cut algorithm for the standard dial-a-ride problem is adapted to exactly solve small problem instances of the MD-H-DARP. To be able to solve larger problem instances, a new deterministic annealing meta-heuristic is proposed. Extensive numerical experiments are presented on different sets of benchmark instances for the homogeneous and the heterogeneous single depot dial-a-ride problem. Instances for the MD-H-DARP are introduced as well. The branch-and-cut algorithm provides considerably better results than an existing algorithm which uses a less compact formulation. All seven previously unsolved benchmark instances for the heterogeneous dial-a-ride problem could be solved to optimality within a matter of seconds. While computation times of the exact algorithm increase drastically with problem size, the proposed meta-heuristic algorithm provides near-optimal solutions within limited computation time for all instances. Several best known solutions for unsolved instances are improved and the algorithm clearly outperforms current state-of-the-art heuristics for the homogeneous and heterogeneous dial-a-ride problem, both in terms of solution quality and computation time.     

Platooning for sustainable freight transportation: an adoptable practice in the near future?

ABSTRACT

Platooning is an emerging transportation practice that has the potential to solve the problems of the burgeoning transportation industry. A platoon is a group of vehicles, with vehicle to vehicle communication, that travel closely behind one another such that the platoon can accelerate, brake and cruise together. Platoons can improve road safety, be energy efficient and reduce costs. Its complete socio-economic benefits include congestion mitigation, smoother traffic flow, better lane usage and throughput, incentives for green logistics and driver safety. The long-term effect of platooning on road transportation, if extensively deployed, would be better organised traffic flow and efficient tracking of vehicles on the road ushering a multilevel positive impact on the industry. In this study, we attempt to answer the critical question of whether platooning is an adoptable practice in the near future and discuss an agenda to take platooning closer to implementation on the ground by highlighting the opportunities for future research. We also present a conceptual framework to help researchers, academicians, policy makers and practitioners for the adoption of platooning into the transportation industry.     

The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery

Once limited to the military domain, unmanned aerial vehicles are now poised to gain widespread adoption in the commercial sector. One such application is to deploy these aircraft, also known as drones, for last-mile delivery in logistics operations. While significant research efforts are underway to improve the technology required to enable delivery by drone, less attention has been focused on the operational challenges associated with leveraging this technology. This paper provides two mathematical programming models aimed at optimal routing and scheduling of unmanned aircraft, and delivery trucks, in this new paradigm of parcel delivery. In particular, a unique variant of the classical vehicle routing problem is introduced, motivated by a scenario in which an unmanned aerial vehicle works in collaboration with a traditional delivery truck to distribute parcels. We present mixed integer linear programming formulations for two delivery-by-drone problems, along with two simple, yet effective, heuristic solution approaches to solve problems of practical size. Solutions to these problems will facilitate the adoption of unmanned aircraft for last-mile delivery. Such a delivery system is expected to provide faster receipt of customer orders at less cost to the distributor and with reduced environmental impacts. A numerical analysis demonstrates the effectiveness of the heuristics and investigates the tradeoffs between using drones with faster flight speeds versus longer endurance.     

The time-dependent pollution-routing problem

The Time-Dependent Pollution-Routing Problem (TDPRP) consists of routing a fleet of vehicles in order to serve a set of customers and determining the speeds on each leg of the routes. The cost function includes emissions and driver costs, taking into account traffic congestion which, at peak periods, significantly restricts vehicle speeds and increases emissions. We describe an integer linear programming formulation of the TDPRP and provide illustrative examples to motivate the problem and give insights about the tradeoffs it involves. We also provide an analytical characterization of the optimal solutions for a single-arc version of the problem, identifying conditions under which it is optimal to wait idly at certain locations in order to avoid congestion and to reduce the cost of emissions. Building on these analytical results we describe a novel departure time and speed optimization algorithm for the cases when the route is fixed. Finally, using benchmark instances, we present results on the computational performance of the proposed formulation and on the speed optimization procedure.     

An integrated modeling approach for facilitating emission estimations of alternative fueled vehicles

This paper develops an integrated model for reliable estimation of daily vehicle fuel savings and emissions using an integrated traffic emission modeling approach created by incorporating the US Environmental Protection Agency’s vehicle emission model, MOVES, and the PARAMICS microscopic traffic simulation package. A case study is conducted to validate the model using a well-calibrated road network in Greenville, South Carolina. For each transportation fuel considered, both emission and fuel consumption impacts are evaluated based on market shares.     

A methodology for assessing eco-cruise control for passenger vehicles

This paper compares and assesses fuel consumption models, cost functions, and solution methods, as they all have an influence on the resulting profile and associated fuel savings of an eco-cruise control system for passenger vehicles. An eco-cruise control system uses road topographical data obtained from a high-resolution digital map to control the vehicle velocity to optimize its fuel consumption. The optimal velocity profile is the result of an optimal control problem.     

A conceptualization of vehicle platoons and platoon operations

Vehicle platooning, a coordinated movement strategy, has been proposed to address a range of current transport challenges such as traffic congestion, road safety, energy consumption and pollution. But in order to form platoons in an ad-hoc manner the vehicles have to ‘speak the same language’, which is in current practice limited to vehicles of particular manufacturers. There is no standard language yet. Also in research, while the current literature focuses on platoon control strategies, intra-platoon communication, or platooning impacts on traffic, the conceptualization of platooning objects and their operations remained unattended. This paper aims to fill this fundamental gap by developing a formal model of platooning concepts. The paper proposes an ontological model of platooning objects and properties and abstract basic building blocks of platoon operations that can then be aggregated to complex platooning behavior. The presented ontological model provides the logical reasoning to support vital decision-making during platoon lifecycles. The ontological model is implemented and demonstrated.     

Scheduling of airport runway operations using stochastic branch and bound methods

In this paper we present a solution methodology based on the stochastic branch and bound algorithm to find optimal, or close to optimal, solutions to the stochastic airport runway scheduling problem. The objective of the scheduling problem is to find a sequence of aircraft operations on one or several runways that minimizes the total makespan, given uncertain aircraft availability at the runway. Enhancements to the general stochastic branch and bound algorithm are proposed and we give the specific details pertaining to runway scheduling. We show how the algorithm can be terminated early with solutions that are close to optimal, and investigate the impact of the uncertainty level. The computational experiment indicates that the sequences obtained using the stochastic branch and bound algorithm have, on average, 5–7% shorter makespans than sequences obtained using deterministic sequencing models. In addition, the proposed algorithm is able to solve instances with 14 aircraft using less than 1 min of computation time.     

Dynamic charging infrastructure deployment for plug-in hybrid electric trucks

Inspired by the rapid development of charging-while-driving (CWD) technology, plans are ongoing in government agencies worldwide for the development of electrified road freight transportation systems through the deployment of dynamic charging lanes. This en route method for the charging of plug-in hybrid electric trucks is expected to supplement the more conventional charging technique, thus enabling significant reduction in fossil fuel consumption and pollutant emission from road freight transportation. In this study, we investigated the optimal deployment of dynamic charging lanes for plug-in hybrid electric trucks. First, we developed a multi-class multi-criteria user equilibrium model of the route choice behaviors of truck and passenger car drivers and the resultant equilibrium flow distributions. Considering that the developed user equilibrium model may have non-unique flow distributions, a robust deployment of dynamic charging lanes that optimizes the system performance under the worst-case flow distributions was targeted. The problem was formulated as a generalized semi-infinite min-max program, and a heuristic algorithm for solving it was proposed. This paper includes numerical examples that were used to demonstrate the application of the developed models and solution algorithms.     

Application of multiple criteria decision making for network improvement

In this paper we propose application of multiple criteria decision making to problems of a metropolitan network improvement plan. Initially, a bilevel multiple objective network design model is considered in two objectives which are minimal government budget and minimal total travel time of road users. We seek feasible improvement alternatives among those bottleneck links in an existing road network structure and travel demand. We present an effective heuristic algorithm to obtain noninferior solutions; then ELECTRE III multiple criteria decision making and group decision making are used to evaluate and to select a compromise solution among those noninferior solutions. From the design phase in multiple criteria decision making, multiple objective mathematical programming is used to formulate a continuous network design model. However, from the phase of evaluation, multiple criteria decision making to solve the discrete network design problem. The network of metropolitan Taipei is taken as an example to illustrate the operation of this model.     

Dynamic pricing for managed lanes with multiple entrances and exits

Priced managed lanes are increasingly being used to better utilize the existing capacity of the roadway to relieve congestion and offer reliable travel time to road users. In this paper, we investigate the optimization problem for pricing managed lanes with multiple entrances and exits which seeks to maximize the revenue and minimize the total system travel time (TSTT) over a finite horizon. We propose a lane choice model where travelers make online decisions at each diverge point considering all routes on a managed lane network. We formulate the problem as a deterministic Markov decision process and solve it using the value function approximation (VFA) method for different initializations. We compare the performance of the toll policies predicted by the VFA method against the myopic revenue policy which maximizes the revenue only at the current timestep and two heuristic policies based on the measured densities on the managed and general purpose lanes (GPLs). We test the results on four different test networks. The primary findings from our research suggest the usefulness of the VFA method for determining dynamic tolls. The best-found objective value from the method at its termination is better than other heuristics for all test networks with average improvements in the objective ranging between 10% and 90% for revenue maximization and 0–27% for TSTT minimization. Certain VFA initializations obtain best-found toll profiles within first 5–50 iterations which warrants computational time savings. Our findings also indicate that the revenue-maximizing optimal policies follow the “jam-and-harvest” behavior where the GPLs are pushed towards congestion in the earlier time steps to generate higher revenue in the later time steps, a characteristic not observed for the policies minimizing TSTT.     

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.     

Integrated optimal eco-driving on rolling terrain for hybrid electric vehicle with vehicle-infrastructure communication

This research presents an integrated optimal controller to maximize the fuel efficiency of a Hybrid Electric Vehicle (HEV) traveling on rolling terrain. The controller optimizes both the vehicle acceleration and the hybrid powertrain operation. It takes advantage of the emerging Connected Vehicle (CV) technology and utilizes present and future information as optimization input, which includes road topography, and dynamic speed limit. The optimal control problem was solved using Pontryagin’s Minimum Principle (PMP). Efforts were made to reduce the computational burden of the optimization process. The evaluation shows that the benefit of the proposed optimal controller is significant compared to regular HEV cruising at the speed limit on rolling terrain. The benefit ranges from 5.0% to 8.9% on mild slopes and from 15.7% to 16.9% on steep slopes. The variation is caused by the change of hilly road density.     

A bilevel flow model for hazmat transportation network design

In this work we consider the following hazmat transportation network design problem. A given set of hazmat shipments has to be shipped over a road transportation network in order to transport a given amount of hazardous materials from specific origin points to specific destination points, and we assume there are regional and local government authorities that want to regulate the hazmat transportations by imposing restrictions on the amount of hazmat traffic over the network links. In particular, the regional authority aims to minimize the total transport risk induced over the entire region in which the transportation network is embedded, while local authorities want the risk over their local jurisdictions to be the lowest possible, forcing the regional authority to assure also risk equity. We provide a linear bilevel programming formulation for this hazmat transportation network design problem that takes into account both total risk minimization and risk equity. We transform the bilevel model into a single-level mixed integer linear program by replacing the second level (follower) problem by its KKT conditions and by linearizing the complementary constraints, and then we solve the MIP problem with a commercial optimization solver. The optimal solution may not be stable, and we provide an approach for testing its stability and for evaluating the range of its solution values when it is not stable. Moreover, since the bilevel model is difficult to be solved optimally and its optimal solution may not be stable, we provide a heuristic algorithm for the bilevel model able to always find a stable solution. The proposed bilevel model and heuristic algorithm are experimented on real scenarios of an Italian regional network.     

Optimal offsets for traffic signal systems in urban networks

The paper proposes a binary integer programming model for the computation of optimal traffic signal offsets for an urban road network. The basic theoretical assumptions for the computation of delay on the network are those employed by the main models developed during the last few years. The set of input data coincides with that needed for the Combination Method and its extensions. The model is solved through a branch-and-backtrack method and allows the obtaining of optimal offsets for condensable or uncondensable networks without introducing any special assumption on delay-offset functions, contrary to what occurs within other mathematical programming formulations of the problem. A reduced memory dimension is required by the developed algorithm, which promptly supplies during the computation better and better sub-optimal solutions, very interesting in view of the possible application of the method to real-time control problems. The tests performed show that the method can be applied to networks of practical size.     

Analysis of Class 8 truck technologies for their fuel savings and economics

Non-electrification efficiency-improving technologies and powertrain technologies for reducing the heavy-duty truck fuel consumption are studied. The study indicates that improvements in engine efficiency, aerodynamic drag and rolling resistance will benefit fuel economy significantly over the day drive and over-the-road highway driving cycles; 6–13% in fuel savings can be expected from each technology. Hybridization can achieve fuel saving of 16% and is financially attractive for the day drive cycle. Compared to the baseline Class 8 conventional trucks, an improvement of 20–22% and 28–50% in fuel economy by 2020 can be expected using non-electrification efficiency-improving and a combination of non-electrification and hybrid technologies. Fuel economy improvements of a factor of four to five can be achieved by hybridizing the heavy-duty trucks used on ocean ports.