Yao Xu

Mr. Yao Xu


Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
28 October 2025 in Mathematics
Verified
Journal Article
Open access
PDF file
YZYixuan Zhou
Yixuan Zhou
Yao XuYao Xu
Yao Xu
KXKewen Xie
Kewen Xie
JLJian Li
Jian Li
The joint optimization of storage location assignment and order picking efficiency for fresh products has become a vital challenge in intelligent warehousing because of the perishable nature of goods, strict temperature requirements, and the need to balance cost and efficiency. This study proposes a comprehensive mathematical model that integrates five critical cost components: picking path, storage layout deviation, First-In-First-Out (FIFO) penalty, energy consumption, and picker workload balance. To solve this NP-hard combinatorial optimization problem, we develop a Particle Swarm-guided hybrid Genetic-Simulated Annealing (PS-GSA) algorithm that synergistically combines global exploration by Particle Swarm Optimization (PSO), population evolution of Genetic Algorithm (GA), and the local refinement and probabilistic acceptance of Simulated Annealing (SA) enhanced with Variable Neighborhood Search (VNS). Computational experiments based on real enterprise data demonstrate the superiority of PS-GSA over benchmark algorithms (GA, SA, HPSO, and GSA) in terms of solution quality, convergence behavior, and stability, achieving 4.08–9.43% performance improvements in large-scale instances. The proposed method not only offers a robust theoretical contribution to combinatorial optimization but also provides a practical decision-support tool for fresh e-commerce warehousing, enabling managers to flexibly weigh efficiency, cost, and sustainability under different strategic priorities.