Optimal Route Planning and Energy Consumption Analysis of Electric Logistics Vehicles

This paper analysis the energy consumption of the traditional vehicle routing problem (VRP), which primarily focuses on minimizing distance, by proposing a more comprehensive route planning method for electric logistics vehicles (E V). The proposed method is based on the simulated annealing (SA) algorithm and introduces energy consumption parameters to enhance the accuracy and effectiveness of the route optimization. In addition to distance, the study considers a range of factors that influence energy consumption, such as temperature, rainfall, time of day, vehicle load, slope angle, and rolling resistance. By integrating these parameters, the proposed approach transitions from a purely distance-centric model to one that mirrors real-world conditions more closely. The use of SA is crucial in this context, as it helps to avoid local optima and ensures the attainment of a global optimal solution. Moreover, the study conducts simulations by varying the weights assigned to distance and energy consumption while keeping other factors constant. These simulations demonstrate how different weight settings can impact energy consumption, enabling the identification of the most efficient route. The proposed method not only reduces time costs but also minimizes financial losses caused by uncontrollable factors, making it a significant advancement in the field of logistics and transportation.

Authors

Institutions

Publication Details

Published
2024-11-06
DOI
https://doi.org/10.1109/rasse64357.2024.10773990
Primary Topic
Maritime Ports and Logistics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimal Route Planning and Energy Consumption Analysis of Electric Logistics Vehicles

Chen‐Wei Huang, Liang Xiao, Syuan‐Yi Chen, Chien-Chiang Tung
Maritime Ports and Logistics
article

Optimal Route Planning and Energy Consumption Analysis of Electric Logistics Vehicles

Chen‐Wei Huang, Liang Xiao, Syuan‐Yi Chen, Chien-Chiang Tung
article en

Abstract

This paper analysis the energy consumption of the traditional vehicle routing problem (VRP), which primarily focuses on minimizing distance, by proposing a more comprehensive route planning method for electric logistics vehicles (E V). The proposed method is based on the simulated annealing (SA) algorithm and introduces energy consumption parameters to enhance the accuracy and effectiveness of the route optimization. In addition to distance, the study considers a range of factors that influence energy consumption, such as temperature, rainfall, time of day, vehicle load, slope angle, and rolling resistance. By integrating these parameters, the proposed approach transitions from a purely distance-centric model to one that mirrors real-world conditions more closely. The use of SA is crucial in this context, as it helps to avoid local optima and ensures the attainment of a global optimal solution. Moreover, the study conducts simulations by varying the weights assigned to distance and energy consumption while keeping other factors constant. These simulations demonstrate how different weight settings can impact energy consumption, enabling the identification of the most efficient route. The proposed method not only reduces time costs but also minimizes financial losses caused by uncontrollable factors, making it a significant advancement in the field of logistics and transportation.

National Taiwan Normal University (TW), National Taiwan University of Science and Technology (TW)
Affordable and clean energy
Openalex Percentile: Top 68%
Maritime Ports and Logistics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.