Toward Efficient Transportation Electrification of Heavy-Duty Trucks: Joint Scheduling of Truck Routing and Charging

• URL: http://arxiv.org/abs/2302.00240v4
• Date: Mon, 13 Nov 2023 22:57:17 GMT
• Title: Toward Efficient Transportation Electrification of Heavy-Duty Trucks: Joint Scheduling of Truck Routing and Charging
• Authors: Mikhail A. Bragin, Zuzhao Ye, Nanpeng Yu
• Abstract summary: This paper proposes Joint Routing and Charging scheduling for electric trucks. The objective of the associated optimization problem is to minimize the cost of transportation, charging, and tardiness. A Surrogate Level-Based Lagrangian Relaxation (SLBLR) method is employed to decompose the overall problem into significantly less complex truck subproblems.
• Score: 3.0794207344325693
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The timely transportation of goods to customers is an essential component of economic activities. However, heavy-duty diesel trucks used for goods delivery significantly contribute to greenhouse gas emissions within many large metropolitan areas, including Los Angeles, New York, and San Francisco. To reduce GHG emissions by facilitating freight electrification, this paper proposes Joint Routing and Charging scheduling for electric trucks. The objective of the associated optimization problem is to minimize the cost of transportation, charging, and tardiness. A large number of possible combinations of road segments as well as a large number of combinations of charging decisions and charging durations leads to a combinatorial explosion in the possible decisions electric trucks can make. The resulting mixed-integer linear programming problem is thus extremely challenging because of the combinatorial complexity even in the deterministic case. Therefore, a Surrogate Level-Based Lagrangian Relaxation (SLBLR) method is employed to decompose the overall problem into significantly less complex truck subproblems. In the coordination aspect, each truck subproblem is solved independently of other subproblems based on the values of Lagrangian multipliers. In addition to serving as a means of guiding and coordinating trucks, multipliers can also serve as a basis for transparent and explanatory decision-making by trucks. Testing results demonstrate that even small instances cannot be solved using the off-the-shelf solver CPLEX after several days of solving. The SLBLR method, on the other hand, can obtain near-optimal solutions within a few minutes for small cases, and within 30 minutes for large ones. Furthermore, it has been demonstrated that as battery capacity increases, the total cost decreases significantly; moreover, as the charging power increases, the number of trucks required decreases as well.

Related papers

• Large Neighborhood Search and Bitmask Dynamic Programming for Wireless Mobile Charging Electric Vehicle Routing Problems in Medical Transportation [5.740535941960799]
  We propose the Wireless Mobile Charging Electric Vehicle Problem (WMC-EVRP) This problem enables Medical Transportation Electric Vehicles (MTEVs) to be charged while traveling via Mobile Charging Carts (MCTs) We develop a mathematical model and a tailored meta-heuristic algorithm that combines Bit Mask Dynamic Programming (BDP) and Large Neighborhood Search (LNS)
  arXiv  Detail & Related papers  (2025-03-11T14:11:10Z)
• Towards Interactive and Learnable Cooperative Driving Automation: a Large Language Model-Driven Decision-Making Framework [79.088116316919]
  Connected Autonomous Vehicles (CAVs) have begun to open road testing around the world, but their safety and efficiency performance in complex scenarios is still not satisfactory. This paper proposes CoDrivingLLM, an interactive and learnable LLM-driven cooperative driving framework.
  arXiv  Detail & Related papers  (2024-09-19T14:36:00Z)
• Assessing the Effects of Container Handling Strategies on Enhancing Freight Throughput [1.3499500088995464]
  The U.S. faces escalating transportation demands as global supply chains and freight volumes grow. The San Pedro Port Complex (SPPC), the nation's busiest, incurs a significant share of these challenges. We utilize an agent-based simulation to replicate real-world scenarios. This involves relocating container classification to potential warehouses in California, Utah, Arizona, and Nevada, rather than exclusively at port areas.
  arXiv  Detail & Related papers  (2024-08-05T18:38:27Z)
• Fair collaborative vehicle routing: A deep multi-agent reinforcement learning approach [49.00137468773683]
  Collaborative vehicle routing occurs when carriers collaborate through sharing their transportation requests and performing transportation requests on behalf of each other. Traditional game theoretic solution concepts are expensive to calculate as the characteristic function scales exponentially with the number of agents. We propose to model this problem as a coalitional bargaining game solved using deep multi-agent reinforcement learning.
  arXiv  Detail & Related papers  (2023-10-26T15:42:29Z)
• Coalitional Bargaining via Reinforcement Learning: An Application to Collaborative Vehicle Routing [49.00137468773683]
  Collaborative Vehicle Routing is where delivery companies cooperate by sharing their delivery information and performing delivery requests on behalf of each other. This achieves economies of scale and thus reduces cost, greenhouse gas emissions, and road congestion. But which company should partner with whom, and how much should each company be compensated? Traditional game theoretic solution concepts, such as the Shapley value or nucleolus, are difficult to calculate for the real-world problem of Collaborative Vehicle Routing.
  arXiv  Detail & Related papers  (2023-10-26T15:04:23Z)
• A Multi-Objective approach to the Electric Vehicle Routing Problem [0.0]
  The electric vehicle routing problem (EVRP) has garnered great interest from researchers and industrialists in an attempt to move from fuel-based vehicles to healthier and more efficient electric vehicles (EVs) Previous works target logistics and delivery-related solutions wherein a homogeneous fleet of commercial EVs have to return to the initial point after making multiple stops. We perform multi-objective optimization - minimizing the total trip time and the cumulative cost of charging.
  arXiv  Detail & Related papers  (2022-08-26T05:09:59Z)
• A Reinforcement Learning Approach for Electric Vehicle Routing Problem with Vehicle-to-Grid Supply [2.6066825041242367]
  We present QuikRouteFinder that uses reinforcement learning (RL) for EV routing to overcome these challenges. Results from RL are compared against exact formulations based on mixed-integer linear program (MILP) and genetic algorithm (GA) metaheuristics.
  arXiv  Detail & Related papers  (2022-04-12T06:13:06Z)
• An SMT Based Compositional Model to Solve a Conflict-Free Electric Vehicle Routing Problem [2.64699517152535]
  The Electric Conflict-Free Vehicle Routing Problem (CF-EVRP) involves constraints such as limited operating range of the vehicles, time windows on the delivery to the customers, and limited capacity on the number of vehicles the road segments can accommodate. We develop a compositional model that breaks down the problem into smaller and simpler sub-problems and provides sub-optimal, feasible solutions.
  arXiv  Detail & Related papers  (2021-06-10T20:37:46Z)
• Dynamic Bicycle Dispatching of Dockless Public Bicycle-sharing Systems using Multi-objective Reinforcement Learning [79.61517670541863]
  How to use AI to provide efficient bicycle dispatching solutions based on dynamic bicycle rental demand is an essential issue for dockless PBS (DL-PBS) We propose a dynamic bicycle dispatching algorithm based on multi-objective reinforcement learning (MORL-BD) to provide the optimal bicycle dispatching solution for DL-PBS.
  arXiv  Detail & Related papers  (2021-01-19T03:09:51Z)
• Efficient algorithms for electric vehicles' min-max routing problem [4.640835690336652]
  An increase in greenhouse gases emission from the transportation sector has led companies and the government to elevate and support the production of electric vehicles (EV) With recent developments in urbanization and e-commerce, transportation companies are replacing their conventional fleet with EVs to strengthen the efforts for sustainable and environment-friendly operations. deploying a fleet of EVs asks for efficient routing and recharging strategies to alleviate their limited range and mitigate the battery degradation rate.
  arXiv  Detail & Related papers  (2020-08-07T18:45:26Z)
• Equitable and Optimal Transport with Multiple Agents [48.17429789586127]
  We introduce an extension of the Optimal Transport problem when multiple costs are involved. We aim to share equally between agents the work of transporting one distribution to another. Another point of view is when the goal is to partition equitably goods between agents according to their heterogeneous preferences.
  arXiv  Detail & Related papers  (2020-06-12T15:15:41Z)
• Reinforcement Learning Based Vehicle-cell Association Algorithm for Highly Mobile Millimeter Wave Communication [53.47785498477648]
  This paper investigates the problem of vehicle-cell association in millimeter wave (mmWave) communication networks. We first formulate the user state (VU) problem as a discrete non-vehicle association optimization problem. The proposed solution achieves up to 15% gains in terms sum of user complexity and 20% reduction in VUE compared to several baseline designs.
  arXiv  Detail & Related papers  (2020-01-22T08:51:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.