01629796

Component

https://doi.org/10.3141/2667-02

Platooning allows vehicles to travel with a small intervehicle distance in a coordinated fashion because of vehicle-to-vehicle connectivity. When applied at a larger scale, platooning creates significant opportunities for energy savings because of reduced aerodynamic drag, as well as increased road capacity and a reduction in congestion resulting from shorter vehicle headways. These potential savings are maximized, however, if platooning-capable vehicles spend most of their travel time within platoons. Ad hoc platoon formation may not ensure a high rate of platoon driving. This paper considers the problem of central coordination of platooning-capable vehicles. Coordination of their routes and departure times can maximize the fuel savings afforded by platooning vehicles. The resulting problem is a combinatorial optimization problem that considers the platoon coordination and vehicle routing problems simultaneously. The methodology is demonstrated through evaluation of the benefits of a coordinated solution and comparison with the uncoordinated case when platoons form only in an ad hoc manner. The coordinated and uncoordinated scenarios are compared on a grid network with various assumptions about demand and the time vehicles are willing to wait.

01658386

17-06389

English

pp 10–16

2017

Transportation Research Record: Journal of the Transportation Research Board

9780309460446

Digital/other

Figures (6) ; References (36)

Advanced driver information systems; Departure time; Fuel consumption; Mixed integer programming; Programming (Mathematics); Traffic platooning

Highways; Planning and Forecasting

TRIS, TRB, ATRI

Dec 8 2016 12:36PM

• Characterization of Trip-Level Pace Variability Based on Taxi GPS Trajectory Data
• Consistency Between Convergence of Dynamic Assignment and Stochasticity of Microsimulation: Implication for Number of Runs
• Effectiveness of Predictive Weather-Related Active Transportation and Demand Management Strategies for Network Management
• Estimating Path Travel Costs for Heterogeneous Users on Large-Scale Networks: Heuristic Approach to Integrated Activity-Based Model–Dynamic Traffic Assignment Models
• Estimation of Time-Varying Origin–Destination Patterns for Design of Multipath Progression on a Signalized Arterial
• Improved Calibration Method for Dynamic Traffic Assignment Models: Constrained Extended Kalman Filter
• Monitoring Signalized Urban Networks: Dynamic Equilibrium-Free Model Based on a Discrete-Time Optimal Control Formulation
• Multiclass Traffic Assignment Problem with Flow-Dependent Passenger Car Equivalent Value of Trucks
• Multiclass, Multicriteria Dynamic Traffic Assignment with Path-Dependent Link Cost and Entropy-Based Risk Preference
• Online Charging and Routing of Electric Vehicles in Stochastic Time-Varying Networks
• Reducing the Dimension of Online Calibration in Dynamic Traffic Assignment Systems
• Ridesharing User Equilibrium and Its Implications for High-Occupancy Toll Lane Pricing
• Solving the School Bus Routing Problem by Maximizing Trip Compatibility
• User and Operator Perspectives in Public Transport Timetable Synchronization Design