An official website of the United States government
The battery electric truck (BET) has emerged as a promising solution to reduce greenhouse gas emissions in urban logistics, given the current strict environmental regulations. This research explores the formulation and solution of the bi-objective BET dispatching problem with backhauls and time windows, aiming to simultaneously reduce environmental impacts and enhance the efficiency of urban logistics. From the sustainability perspective, one of the objectives is to minimize total energy costs, which include energy consumption and battery replacement expenses. On the other hand, from an economic perspective, the other objective is the minimization of labor costs. To solve this bi-objective BET dispatching problem, we propose an innovative approach, integrating an adaptive large neighborhood search-based metaheuristics algorithm with a multi-objective optimization strategy. This integration enables the exploration of the trade-off between fleet energy expenses and labor costs, optimizing the dispatching decisions for BETs. To validate the proposed dispatching strategy, extensive experiments were conducted using real-world fleet operations data from a logistics fleet in Southern California. The results demonstrated that the proposed approach yields a set of Pareto solutions, showcasing its effectiveness in finding a balance between energy efficiency and labor costs in urban logistics systems. The findings of this research contribute to advancing sustainable urban logistics practices and provide valuable insights for fleet operators in effectively managing BET fleets to reduce environmental impacts while maintaining economic efficiency.
more »
« less
Addressing the Robust Battery Electric Truck Dispatching Problem with Backhauls and Time Windows Under Travel Time Uncertainty
The emergence of battery electric trucks (BETs) in recent years has shown great promise in reducing greenhouse gas (GHG) emissions in urban freight logistics. However, designing a customer-oriented dispatching strategy for a BET fleet is more complex than traditional vehicle routing problems (VRP) due to several constraints, such as limited driving range, potential need for en route recharging, and long recharging times. Also, in practice, the uncertain travel times in urban transportation network may lead to the violation of scheduled customer time windows and impact overall energy consumption. To better utilize the BET fleet, this paper introduces a robust BET dispatching problem with backhauls and time windows under travel time uncertainty, which aims to minimize the overall fleet energy consumption while also minimizing the risk of violating customer time window. A mathematical optimization model based on novel route-related sets is developed, and an adaptive large neighborhood search (ALNS) metaheuristic algorithm is used to find robust dispatching solutions. Based on real-world data from a truck fleet in San Bernardino County, California, a simulation study is conducted to demonstrate the robustness of the solutions obtained by the proposed method. Moreover, a sensitivity analysis with respect to uncertainty parameters is performed to assess the trade-off between the overall fleet energy consumption and the robustness of the solutions.
more »
« less
- Award ID(s):
- 2152258
- PAR ID:
- 10584683
- Publisher / Repository:
- IEEE
- Date Published:
- ISBN:
- 979-8-3315-0592-9
- Page Range / eLocation ID:
- 84 to 89
- Format(s):
- Medium: X
- Location:
- Edmonton, AB, Canada
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
The adoption of battery electric trucks (BETs) as a replacement for diesel trucks has potential to significantly reduce greenhouse gas emissions from the freight transportation sector. However, BETs have shorter driving range and lower payload capacity, which need to be taken into account when dispatching them. This article addresses the energy-efficient dispatching of BET fleets, considering backhauls and time windows. To optimize vehicle utilization, customers are categorized into two groups: linehaul customers requiring deliveries, where the deliveries need to be made following the last-in-first-out principle, and backhaul customers requiring pickups. The objective is to determine a set of energy-efficient routes that integrate both linehaul and backhaul customers while considering factors such as limited driving range, payload capacity of BETs, and the possibility of en route recharging. We formulate the problem as a mixed-integer linear programming model and propose an algorithm that combines adaptive large neighborhood search and simulated annealing metaheuristics to solve it. The effectiveness of the proposed strategy is demonstrated through extensive experiments using a real-world case study from a logistics company in Southern California. The results indicate that the proposed strategy leads to a significant reduction in total energy consumption compared to the baseline strategy, ranging from 11% to 40%, while maintaining reasonable computational time. In addition, the proposed strategy provides solutions that are better than or comparable with those obtained by other metaheuristics. This research contributes to the development of sustainable transportation solutions in the freight sector by providing a novel approach for dispatching BET fleets. The findings emphasize the potential of deploying BETs to achieve energy savings and advance the goal of green logistics.more » « less
-
null (Ed.)With the rising need for efficient and flexible short-distance urban transportation, more vehicle sharing companies are offering one-way car-sharing services. Electrified vehicle sharing systems are even more effective in terms of reducing fuel consumption and carbon emission. In this article, we investigate a dynamic fleet management problem for an Electric Vehicle (EV) sharing system that faces time-varying random demand and electricity price. Demand is elastic in each time period, reacting to the announced price. To maximize the revenue, the EV fleet optimizes trip pricing and EV dispatching decisions dynamically. We develop a new value function approximation with input convex neural networks to generate high-quality solutions. Through a New York City case study, we compare it with standard dynamic programming methods and develop insights regarding the interaction between the EV fleet and the power grid.more » « less
-
Abstract Local delivery networks expect drivers to make deliveries to and/or pickups from customers using the shortest routes in order to minimize costs, delivery time, and environmental impact. However, in real‐world applications, it is often the case that not all customers are known when planning the initial delivery route. Instead, additional customers become known while the driver is making deliveries or pickups. Before serving the new demand requests, the vehicle will return to the depot for restocking. In other words, there exists a precedence relation in the delivery route to visit the depot before delivering new orders. The uncertainty in new customer locations can lead to expensive rerouting of the tour, as drivers revisit previous neighborhoods to serve the new customers. We address this issue by constructing the delivery route with the knowledge that additional customers will appear, using historical demand patterns to guide our predictions for the uncertainty. We model this network delivery problem as a precedence‐constrained asymmetric traveling salesman problem using mixed‐integer optimization. Experimental results show that the proposed robust optimization approach provides an effective delivery route under the uncertainty of customer demands.more » « less
-
When demand increases beyond the system capacity, riders in ride-hailing/ride-sharing systems often experience long waiting time, resulting in poor customer satisfaction. This paper proposes a spatio-temporal pricing framework (AP-RTRS) to alleviate this challenge and shows how it naturally complements state-of-the-art dispatching and routing algorithms. Specifically, the pricing optimization model regulates demand to ensure that every rider opting to use the system is served within reason-able time: it does so either by reducing demand to meet the capacity constraints or by prompting potential riders to postpone service to a later time. The pricing model is a model-predictive control algorithm that works at a coarser temporal and spatial granularity compared to the real-time dispatching and routing, and naturally integrates vehicle relocations. Simulation experiments indicate that the pricing optimization model achieves short waiting times without sacrificing revenues and geographical fairness.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.1109/ITSC58415.2024.10919697
