Li Wang

Dr. Li Wang

Beijing University of Posts and Telecommunications

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 August 2020 in Sustainability
Verified
Journal Article
Open access
PDF file
ZCZongyi Chen
Zongyi Chen
MYMingkang Yang
Mingkang Yang
GYGuo Yijun
Guo Yijun
YLYu Liang
Yu Liang
YDYifan Ding
Yifan Ding
LWLi Wang
Li Wang
Besides routing and packing plans, synthetically considering the requirements of customers about service time is absolutely necessary. An order split delivery plan can not only better satisfy the service time requirements, but also improve the full-load rate of vehicles. The split delivery vehicle routing problem with three-dimensional loading constraints (3L-SDVRP) combines vehicle routing and three-dimensional loading with additional packing constraints. In the 3L-SDVRP splitting deliveries of customers is basically possible, i.e., a customer can be visited in two or more tours. The vehicle routing problem with three-dimensional loading constraints that are based on the time window and considering split delivery of orders (3L-CVRPTWSDO) and its optimization algorithm are studied in this paper. We established mathematical model of the problem and designed the tabu search algorithm. Based on the examples used in Gendreau et al. (2006), examples was constructed to test our algorithm. The experimental results have expressed that, in the 3L-CVRP problem, the results of split delivery is better than those of non-split delivery, and it is easier to satisfy the time window constraints. The algorithm in this paper generates high quality solutions, it provides a effective method to solve the 3L-CVRPTWSDO problems.

11 August 2020 in Journal of Advanced Transportation
Verified
Journal Article
Open access
PDF file
LWLi Wang
Li Wang
SGShuai Gao
Shuai Gao
KWKai Wang
Kai Wang
TLTong Li
Tong Li
LLLin Li
Lin Li
ZCZhiyuan Chen
Zhiyuan Chen
With energy and environmental issues becoming increasingly prominent, electric vehicles (EVs) have become the important transportation means in the logistics distribution. In the real-world urban road network, there often exist multiple paths between any two locations (depot, customer, and charging station) since the time-dependent travel times. That is, the travel speed of an EV on each path may be different during different time periods, and thus, this paper explicitly considers path selection between two locations in the time-dependent electric vehicle routing problem with time windows, denoted as path flexibility. Therefore, the integrated decision-making should include not only the routing plan but also the path selection, and the interested problem of this paper is a time-dependent electric vehicle routing problem with time windows and path flexibility (TDEVRP-PF). In order to determine the optimal path between any two locations, an optimization model is established with the goal of minimizing the distance and the battery energy consumption associated with travel speed and cargo load. On the basis of the optimal path model, a 0-1 mixed-integer programming model is then formulated to minimize the total travel distance. Hereinafter, an improved version of the variable neighborhood search (VNS) algorithm is utilized to solve the proposed models, in which multithreading technique is adopted to improve the solution efficiency significantly. Ultimately, several numerical experiments are carried out to test the performance of VNS with a view to the conclusion that the improved VNS is effective in finding high-quality distribution schemes consisted of the distribution routes, traveling paths, and charging plans, which are of practical significance to select and arrange EVs for logistics enterprises.

26 August 2019 in Journal of Advanced Transportation
Verified
Journal Article
Open access
PDF file
WZWenjuan Zhou
Wenjuan Zhou
LWLi Wang
Li Wang
Aiming to provide an approach for finding energy-efficient routes in dynamic and stochastic transportation networks for electric vehicles, this paper addresses the route planning problem in dynamic transportation network where the link travel times are assumed to be random variables to minimize total energy consumption and travel time. The changeable signals are introduced to establish state-space-time network to describe the realistic dynamic traffic network and also used to adjust the travel time according to the signal information (signal cycle, green time, and red time). By adjusting the travel time, the electric vehicle can achieve a nonstop driving mode during the traveling. Further, the nonstop driving mode could avoid frequent acceleration and deceleration at the signal intersections so as to reduce the energy consumption. Therefore, the dynamically adjusted travel time can save the energy and eliminate the waiting time. A multiobjective 0-1 integer programming model is formulated to find the optimal routes. Two methods are presented to transform the multiobjective optimization problem into a single objective problem. To verify the validity of the model, a specific simulation is conducted on a test network. The results indicate that the shortest travel time and the energy consumption of the planning route can be significantly reduced, demonstrating the effectiveness of the proposed approaches.

15 February 2024 in World Electric Vehicle Journal
Verified
Journal Article
Open access
PDF file
LWLi Wang
Li Wang
YDYifan Ding
Yifan Ding
ZCZhiyuan Chen
Zhiyuan Chen
ZSZhiyuan Su
Zhiyuan Su
YZYufeng Zhuang
Yufeng Zhuang
In light of the widespread use of electric vehicles for urban distribution, this paper delves into the electric vehicle routing problem (EVRP): specifically addressing multiple trips per vehicle, diverse vehicle types, and simultaneous pickup and delivery. The primary objective is to minimize the overall cost, which encompasses travel expenses, waiting times, recharging costs, and fixed vehicle costs. The focal problem is formulated as a heterogeneous and multi-trip electric vehicle routing problem with pickup and delivery (H-MT-EVRP-PD). Additionally, we introduce two heuristic algorithms to efficiently approximate solutions within a reasonable computational time. The variable neighborhood search (VNS) algorithm and the adaptive large neighborhood search (ALNS) algorithm are presented and compared based on our computational experiences with both. Through solving a series of large-scale real-world instances for the H-MT-EVRP-PD and smaller instances using an exact method, we demonstrate the efficacy of the proposed approaches.

20 August 2021 in Sustainability
Verified
Journal Article
Open access
PDF file
GPGuanqiao Pan
Guanqiao Pan
HJHongchao Jiang
Hongchao Jiang
QJQianhui Jin
Qianhui Jin
TZTianyi Zhao
Tianyi Zhao
JWJiajun Wang
Jiajun Wang
LWLi Wang
Li Wang
In order to solve the problems of mismatch between transportation resources and order volume in logistics transportation, we propose a cooperative pattern called sharing transportation to solve this problems. In this pattern, several logistics enterprises or alliances cooperate with each other and share transportation resources to achieve the goal of reducing costs and increasing income. In this paper, we set the application scene of sharing transportation to the section from the distribution center to the service outlets in the city. We first put forward the judgment function in the analysis model of cooperative pattern, and the possible cooperative pattern is divided into three kinds by constructing and solving the replication dynamic equation. Then we proposed the income allocation model by considering the functions of order quantity and overall income. Moreover, the proposed models are extended to the multi-agent game situation to realize the sharing transportation of multiple enterprises. Finally, we use the example simulation and sensitivity analysis to verify the rationality of the model. This paper provides a new idea for how to integrate the surplus resources to increase the profit in the process of logistics transportation.

4 February 2021 in Algorithms
Verified
Journal Article
Open access
PDF file
LWLi Wang
Li Wang
XWXi Wang
Xi Wang
XCXilong Cai
Xilong Cai
The sharing mode of the logistics industry can effectively solve the new problems arising from the rapid development of the express industry. However, only when the interests are reasonably distributed can the sharing mode be implemented for a long time. This paper discusses the connotation of unified warehouse and distribution, designs the operation mode of a unified warehouse and distribution, and solves the profit distribution problem of a unified warehouse and distribution alliance based on the improved Shapley value method. Firstly, the traditional Shapley value method is improved by using a comprehensive correction factor, including the proportions of investment, risk, and innovative research contributions. Secondly, each factor’s weight is determined by the analytic hierarchy process (AHP), and the profits are distributed according to the contribution of each express enterprise to the alliance. Finally, an example is given to verify the validity of the modified algorithm. It proves that the modified Shapley value method can effectively solve the problem of profit distribution.