Version 1
: Received: 17 July 2023 / Approved: 18 July 2023 / Online: 19 July 2023 (08:54:36 CEST)
How to cite:
Dang---, Y.; Allen, T.T.; Singh, M. A Mixed Vehicle Routing Problem with Electric and Internal Combustion Vehicles and Common Carriers. Preprints2023, 2023071240. https://doi.org/10.20944/preprints202307.1240.v1
Dang---, Y.; Allen, T.T.; Singh, M. A Mixed Vehicle Routing Problem with Electric and Internal Combustion Vehicles and Common Carriers. Preprints 2023, 2023071240. https://doi.org/10.20944/preprints202307.1240.v1
Dang---, Y.; Allen, T.T.; Singh, M. A Mixed Vehicle Routing Problem with Electric and Internal Combustion Vehicles and Common Carriers. Preprints2023, 2023071240. https://doi.org/10.20944/preprints202307.1240.v1
APA Style
Dang---, Y., Allen, T.T., & Singh, M. (2023). A Mixed Vehicle Routing Problem with Electric and Internal Combustion Vehicles and Common Carriers. Preprints. https://doi.org/10.20944/preprints202307.1240.v1
Chicago/Turabian Style
Dang---, Y., Theodore Tetreault Allen and Manjeet Singh. 2023 "A Mixed Vehicle Routing Problem with Electric and Internal Combustion Vehicles and Common Carriers" Preprints. https://doi.org/10.20944/preprints202307.1240.v1
Abstract
With the continuous improvement and observable benefits of electric vehicles (EVs), major logistic companies are introducing more EVs into their conventional fleets. This gives rise to a new type of vehicle routing problem with mixed vehicles, where heterogeneous internal combustion vehicles (ICVs) and electric vehicles are considered in route planning. In addition, certain deliveries that are not efficient on any type of vehicles, are outsourced to third-party common carriers. In this paper, we define this problem as a mixed vehicle routing problem with common carriers (MVRPC). The objective of such problems is to minimize the transportation costs by considering routes with ICVs and EVs, the possibility of visiting recharging stations, outsourcing options, and drivers’ layover regulations. This variant of the vehicle routing problems has many practical applications, particularly in the design of long-haul transportation and last-mile delivery services. Effective MVRPC solutions play a key role in promoting the going Green image and optimally allocating resources. The problem has received limited attention in the literature likely because addressing all the needed aspects is especially challenging. To solve the large-scale problem, we develop a branch-and-cut pricing framework that relies on strong cuts and customized labeling algorithms. Numerical experiments highlight the effectiveness of our algorithm. This success can be attributed to tailored critical resources, dynamically bounded bidirectional labeling procedures, strong dominance criteria, and implementation strategies.
Keywords
vehicle routing problem; electric vehicles; internal combustion vehicles; common carriers; branch and cut and pricing; labelling algorithms
Subject
Engineering, Industrial and Manufacturing Engineering
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
