Lin Shi

Ms. Lin Shi

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
8 March 2022 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Open access
LSLin Shi
Lin Shi
ZZZhi-Hui Zhan
Zhi-Hui Zhan
DLDi Liang
Di Liang
JZJun Zhang
Jun Zhang
The developments of electric vehicle (EV) technology and mobile internet technology have made the EV-oriented ride-hailing service a trend in smart cities. In the service scenario, a high-quality order allocation approach is in great need to quickly process a series of customer request orders, so as to reduce total customer waiting time and transportation cost. To simulate real-world customer-EV allocation scenarios, in this paper, a dynamic EV dispatch (DEVD) model is established by considering multi-source data association from five sources, including customer, vehicle, charging, station, and service. To solve the proposed multi-source data associated DEVD model, a memory-based ant colony optimization (MACO) approach is developed. MACO maintains a memory archive to store the historically good solutions, which not only can be used to update pheromone to guide the search, but also can be used to help the reactions to environmental changes. In response to dynamic changes, a partial reassignment strategy is also proposed to re-optimize some of the assigned customer-EV pairs in the historically best solution. Moreover, an exchange or replace local search procedure is designed to enhance the performance. The MACO algorithm is applied to a set of dynamic test cases with different customer request and EV sizes. Experimental results show that MACO generally outperforms the first-come-first-served approach and some state-of-the-art ACO-based dynamic optimization algorithms.

19 May 2022 in IEEE Transactions on Emerging Topics in Computational Intelligence
Verified
Journal Article
Open access
LWLi-Jiao Wu
Li-Jiao Wu
LSLin Shi
Lin Shi
ZZZhi-Hui Zhan
Zhi-Hui Zhan
Kuei-Kuei LaiKuei-Kuei Lai
Kuei-Kuei Lai
JZJun Zhang
Jun Zhang
Cold chain logistics (CCL) scheduling is an emerging research problem in the logistics industry in smart cities, which mainly concerns the distribution of perishable goods. As the quality loss of goods that occurs in the distribution process should be considered, the CCL scheduling problem is very challenging. Moreover, the problem is more challenging when the dynamic characteristics (e.g., the orders are unknown beforehand) of the real scheduling environment are considered. Therefore, this paper focuses on the dynamic CCL (DCCL) scheduling problem by establishing a practical DCCL model. In this model, a working day is divided into multiple time slices so that the dynamic new orders revealed in the working day can be scheduled in time. The objective of the DCCL model is to minimize the total distribution cost in a working day, which includes the transportation cost, the cost of order rejection penalty, and the cost of quality loss of goods. To solve the DCCL model, a buffer-based ant colony system (BACS) approach is proposed. The BACS approach is characterized by a buffering strategy that is carried out at the beginning of the scheduling in every time slice except the last one to temporarily buffer some non-urgent orders, so as to concentrate on scheduling the orders that are preferred to be delivered first. Besides, to further promote the performance of BACS, a periodic learning strategy is designed to avoid local optima. Comparison experiments are conducted on test instances with different problem scales. The results show that BACS is more preferred for solving the DCCL model when compared with the other five state-of-the-art and recent well-performing scheduling approaches.

5 December 2023
Verified
Conference Paper
Closed access
JHJun Hong
Jun Hong
LSLin Shi
Lin Shi
KDKe-Jing Du
Ke-Jing Du
CCChun-hua Chen
Chun-hua Chen
HWHua Wang
Hua Wang
ZZZhi-Hui Zhan
Zhi-Hui Zhan
Nowadays, recommendation systems (RSs) have been widely used in many real-world applications. However, traditional recommendation techniques mainly aim at improving recommendation accuracy, while other metrics to measure the performance of the RSs are not considered. In this paper, a multiobjective recommendation model that considers different metrics, including accuracy, diversity, and novelty of recommendations is established. Compared with recommendation models that only consider accuracy, this model can recommend more different items with higher diversity and more fresh items with higher novelty to enhance the long-term performance of RSs. Moreover, to efficiently solve this multiobjective recommendation model, a multi-population genetic algorithm (MPGA), which follows the multiple populations for multiple objectives (MPMO) framework, is proposed. As far as we know, it is the first time that the advanced MPMO framework is used in RSs. We conduct comparison experiments on three real-world datasets with three state-of-the-art multiobjective recommendation algorithms and two traditional multiobjective evolutionary algorithms. The experimental results indicate that the performance of MPGA is better than all the compared methods.

11 July 2026 in Algorithms
Verified
Journal Article
Open access
PDF file
XCXinyi Chen
Xinyi Chen
LSLin Shi
Lin Shi
Jian-Yu LiJian-Yu Li
Jian-Yu Li
Urban unmanned aerial vehicle (UAV) logistics systems require routing algorithms that can balance delivery efficiency and operational safety under complex physical and environmental constraints. However, existing multi-objective routing methods often show limited adaptability when the search landscape changes during optimization. In particular, conventional ant colony optimization (ACO) algorithms usually rely on fixed pheromone update rules, which may lead to premature convergence, uneven Pareto front distributions, and pheromone-induced search stagnation. To address these limitations, this paper proposes a Sliding-Window Adaptive Multi-Strategy Ant Colony Optimization (SW-MSACO) framework for complex urban UAV delivery routing. First, a Complex Multi-objective Urban Routing Problem (CMURP) is formulated by jointly considering cumulative delivery lateness and safety risk under payload and nonlinear battery energy constraints. Second, a multi-strategy pheromone evolution pool is designed to provide complementary search behaviors for convergence acceleration, safety-efficiency balancing, and Pareto front diversity preservation. Third, a Sliding-Window Adaptive Strategy Selection (SW-ASS) mechanism is introduced to adjust strategy selection probabilities according to recent search performance rather than long-term cumulative rewards. Comprehensive simulation experiments under different map scales and task-load conditions demonstrate that SW-MSACO achieves improved Pareto solution quality and search stability compared with existing heuristic optimization approaches, particularly under large-scale and high-load scenarios, confirming the effectiveness of the proposed framework for complex UAV logistics optimization.