Joint Routing of Conventional and Range-Extended Electric Vehicles in a Large Metropolitan Network
Anirudh Subramanyam, Taner Cokyasar, Jeffrey Larson, Monique, Stinson

TL;DR
This paper addresses the complex routing problem involving both conventional and range-extended electric vehicles in urban settings, proposing solution methods and analyzing a real-world case to optimize costs and efficiency.
Contribution
It introduces two solution methods for the heterogeneous vehicle routing problem and provides a comprehensive case study on parcel delivery in Chicago.
Findings
Exact algorithm provides tight lower bounds and near-optimal solutions.
Deploying 20% range-extended vehicles with 33-mile range reduces energy costs by up to 17%.
Increasing range to 60 miles yields marginal additional savings.
Abstract
Range-extended electric vehicles combine the higher efficiency and environmental benefits of battery-powered electric motors with the longer mileage and autonomy of conventional internal combustion engines. This combination is particularly advantageous for time-constrained delivery routing in dense urban areas, where battery recharging along routes can be too time-consuming to economically justify the use of all-electric vehicles. However, switching from electric to conventional fossil fuel modes also results in higher costs and emissions and lower efficiency. This paper analyzes this heterogeneous vehicle routing problem and describes two solution methods: an exact branch-price-and-cut algorithm and an iterated tabu search metaheuristic. From a methodological perspective, we find that the exact algorithm consistently obtains tight lower bounds that also serve to certify the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
