English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Platooning of vehicles is a promising approach for reducing fuel consumption,increasing vehicle safety, and using road space more efficiently. We considerthe important but difficult problem of assigning optimal routes and departureschedules to a collection of vehicles. We propose an iterativeroute-then-schedule heuristic for centralized planning that quickly convergesto high-quality solutions. We also propose and analyze a collection of validinequalities for the individual problems of assigning vehicles to routes andscheduling the times that vehicles traverse their routes. These inequalitiesare shown to reduce the computational time or optimality gap of solving therouting and scheduling problem instances. Our approach uses the validinequalities in both the routing and scheduling portions of each iteration;numerical experiments highlight the speed of the approach for routing vehicleson a real-world road network.

A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation