Lijun Fan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Lijun Fan has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
Changshi Liu
3 shared publicationsJunyu Li
3 shared publicationsBo Dai
2 shared publications- Ruiyou Zhang
College of Information Science and Engineering, Northeastern University, Shenyang 110819, China
2 shared publications - Kunxiang Yi
School of business administration, Hunan University of Technology and Business, Changsha, China
1 shared publication Peng Jia
1 shared publication
Latest Publications
- 14 January 2026
- Published by Elsevier in Swarm and Evolutionary Computation
- Vol. 101
River-land multi-modal bulk cargo transportation problem with containerization
- 14 January 2026
- Published by Elsevier in Swarm and Evolutionary Computation
- Vol. 101
River-land multi-modal bulk cargo transportation problem with containerization
- 13 November 2025
- Published by Elsevier in Applied Soft Computing
- Vol. 186
An adaptive ant colony algorithm for urban-rural collaborative electric vehicle routing problem
- 13 November 2025
- Published by Elsevier in Applied Soft Computing
- Vol. 186
An adaptive ant colony algorithm for urban-rural collaborative electric vehicle routing problem
- Open Access
- 26 October 2023
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 10 (2) , 2107-2128
A two-stage hybrid ant colony algorithm for multi-depot half-open time-dependent electric vehicle routing problem
This article presents a detailed investigation into the Multi-Depot Half-Open Time-Dependent Electric Vehicle Routing Problem (MDHOTDEVRP) within the domain of urban distribution, prompted by the growing urgency to mitigate the environmental repercussions of logistics transportation. The study first surmounts the uncertainty in Electric Vehicle (EV) range arising from the dynamic nature of urban traffic networks by establishing a flexible energy consumption estimation strategy. Subsequently, a Mixed-Integer Programming (MIP) model is formulated, aiming to minimize the total distribution costs associated with EV dispatch, vehicle travel, customer service, and charging operations. Given the unique attributes intrinsic to the model, a Two-Stage Hybrid Ant Colony Algorithm (TSHACA) is developed as an effective solution approach. The algorithm leverages enhanced K-means clustering to assign customers to EVs in the first stage and employs an Improved Ant Colony Algorithm (IACA) for optimizing the distribution within each cluster in the second stage. Extensive simulations conducted on various test scenarios corroborate the economic and environmental benefits derived from the MDHOTDEVRP solution and demonstrate the superior performance of the proposed algorithm. The outcomes highlight TSHACA’s capability to efficiently allocate EVs from different depots, optimize vehicle routes, reduce carbon emissions, and minimize urban logistic expenditures. Consequently, this study contributes significantly to the advancement of sustainable urban logistics transportation, offering valuable insights for practitioners and policy-makers.
- 26 October 2023
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 10 (2) , 2107-2128
Open AccessA two-stage hybrid ant colony algorithm for multi-depot half-open time-dependent electric vehicle routing problem
This article presents a detailed investigation into the Multi-Depot Half-Open Time-Dependent Electric Vehicle Routing Problem (MDHOTDEVRP) within the domain of urban distribution, prompted by the growing urgency to mitigate the environmental repercussions of logistics transportation. The study first surmounts the uncertainty in Electric Vehicle (EV) range arising from the dynamic nature of urban traffic networks by establishing a flexible energy consumption estimation strategy. Subsequently, a Mixed-Integer Programming (MIP) model is formulated, aiming to minimize the total distribution costs associated with EV dispatch, vehicle travel, customer service, and charging operations. Given the unique attributes intrinsic to the model, a Two-Stage Hybrid Ant Colony Algorithm (TSHACA) is developed as an effective solution approach. The algorithm leverages enhanced K-means clustering to assign customers to EVs in the first stage and employs an Improved Ant Colony Algorithm (IACA) for optimizing the distribution within each cluster in the second stage. Extensive simulations conducted on various test scenarios corroborate the economic and environmental benefits derived from the MDHOTDEVRP solution and demonstrate the superior performance of the proposed algorithm. The outcomes highlight TSHACA’s capability to efficiently allocate EVs from different depots, optimize vehicle routes, reduce carbon emissions, and minimize urban logistic expenditures. Consequently, this study contributes significantly to the advancement of sustainable urban logistics transportation, offering valuable insights for practitioners and policy-makers.
- Open Access
- 14 September 2023
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 18 (9) , e0291473
A hybrid adaptive large neighborhood search for time-dependent open electric vehicle routing problem with hybrid energy replenishment strategies
As competition intensifies, an increasing number of companies opt to outsource their package distribution operations to professional Third-Party Logistics (3PL) fleets. In response to the growing concern over urban pollution, 3PL fleets have begun to deploy Electric Vehicles (EVs) to perform transportation tasks. This paper aims to address the Time-Dependent Open Electric Vehicle Routing Problem with Hybrid Energy Replenishment Strategies (TDOEVRP-HERS) in the context of urban distribution. The study considers the effect of dynamic urban transport networks on EV energy drain and develops an approach for estimating energy consumption. Meanwhile, the research further empowers 3PL fleets to judiciously oscillate between an array of energy replenishment techniques, encompassing both charging and battery swapping. Based on these insights, a Mixed-Integer Programming (MIP) model with the objective of minimizing total distribution costs incurred by the 3PL fleet is formulated. Given the characteristics of the model, a Hybrid Adaptive Large Neighborhood Search (HALNS) is designed, synergistically integrating the explorative prowess of Ant Colony Optimization (ACO) with the localized search potency of Adaptive Large Neighborhood Search (ALNS). The strategic blend leverages the broad-based solution initiation of ACO as a foundational layer for ALNS’s deeper, nuanced refinements. Numerical experiments on a spectrum of test sets corroborate the efficacy of the HALNS: it proficiently designs vehicular itineraries, trims down EV energy requisites, astutely chooses appropriate energy replenishment avenues, and slashes logistics-related outlays. Therefore, this work not only introduces a new hybrid heuristic technique within the EVRP field, providing high-quality solutions but also accentuates its pivotal role in fostering a sustainable trajectory for urban logistics transportation.
- 14 September 2023
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 18 (9) , e0291473
Open AccessA hybrid adaptive large neighborhood search for time-dependent open electric vehicle routing problem with hybrid energy replenishment strategies
As competition intensifies, an increasing number of companies opt to outsource their package distribution operations to professional Third-Party Logistics (3PL) fleets. In response to the growing concern over urban pollution, 3PL fleets have begun to deploy Electric Vehicles (EVs) to perform transportation tasks. This paper aims to address the Time-Dependent Open Electric Vehicle Routing Problem with Hybrid Energy Replenishment Strategies (TDOEVRP-HERS) in the context of urban distribution. The study considers the effect of dynamic urban transport networks on EV energy drain and develops an approach for estimating energy consumption. Meanwhile, the research further empowers 3PL fleets to judiciously oscillate between an array of energy replenishment techniques, encompassing both charging and battery swapping. Based on these insights, a Mixed-Integer Programming (MIP) model with the objective of minimizing total distribution costs incurred by the 3PL fleet is formulated. Given the characteristics of the model, a Hybrid Adaptive Large Neighborhood Search (HALNS) is designed, synergistically integrating the explorative prowess of Ant Colony Optimization (ACO) with the localized search potency of Adaptive Large Neighborhood Search (ALNS). The strategic blend leverages the broad-based solution initiation of ACO as a foundational layer for ALNS’s deeper, nuanced refinements. Numerical experiments on a spectrum of test sets corroborate the efficacy of the HALNS: it proficiently designs vehicular itineraries, trims down EV energy requisites, astutely chooses appropriate energy replenishment avenues, and slashes logistics-related outlays. Therefore, this work not only introduces a new hybrid heuristic technique within the EVRP field, providing high-quality solutions but also accentuates its pivotal role in fostering a sustainable trajectory for urban logistics transportation.
- 20 July 2023
- Published by Elsevier in Journal of Cleaner Production
- Vol. 418
Electric vehicle routing problem considering energy differences of charging stations
- 20 July 2023
- Published by Elsevier in Journal of Cleaner Production
- Vol. 418
Electric vehicle routing problem considering energy differences of charging stations