Ying Li

Ying Li

Auto-generated profile, based on publicly available information

Ying Li

Qinghai Institute of Science and Technology Information,Xining,China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
29 September 2020 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
YLYing Li
Ying Li
Feng ChuFeng Chu
Feng Chu
FZFeifeng Zheng
Feifeng Zheng
Ming LiuMing Liu
Ming Liu
Growing global trade brings an increasing challenge to intelligent maritime transportation, which is an important branch of the intelligent transportation system. Developing efficient technologies to improve the performance of intelligent maritime transportation is especially important. Most existing works for integrated berth allocation and quay crane assignment assume that all the equipment is available over the time horizon, however, there exists frequently time-consuming quay crane maintenance activities in the maritime port. It is recognized that maintenance activities can impact the loading/unloading activities. In this paper, we study a new bi-objective optimization model of integrated berth allocation and quay crane assignment with preventive quay crane maintenance activities. The two objectives are minimizing the total turnaround time of vessels and the total penalty cost of quay crane maintenance earliness and tardiness. For the considered problem, an appropriate integer linear programming model is formulated, and an ϵ-constraint-based two-phase iterative heuristic is designed based on the characteristics of our problem. Computational results on a case study and randomly generated instances show the efficiency of the proposed algorithm.

31 December 2021 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Closed access
YLYantong Li
Yantong Li
YLYing Li
Ying Li
JCJunheng Cheng
Junheng Cheng
PWPeng Wu
Peng Wu
This paper investigates a new multi-objective order assignment and scheduling problem for personal protective equipment (PPE) production and distribution during the outbreak of epidemics like COVID-19. The objective is to simultaneously minimize the total cost and maximize the PPE supply timeliness. For the problem, we first develop a bi-objective mixed-integer linear program (MILP). Then an $\epsilon $ -constraint combined with logic-based Benders decomposition method is proposed based on some explored properties. We then extend the proposed model to handle dynamics and randomness. In particular, we design a predictive reactive rescheduling approach to address random order arrivals and manufacturer disruptions. Computational experiments on a real case from China and 100 randomly generated instances are conducted. Results show that the proposed algorithm significantly outperforms an adapted $\epsilon $ -constraint method combined with the proposed MILP and the widely used non-dominated sorting genetic algorithm II (NSGA-II) in obtaining high-quality Pareto solutions. Note to Practitioners —The unprecedented outbreak of COVID-19 and its rapid spread caught numerous national and local governments unprepared. Healthcare systems faced a vital scarcity of PPEs. The urgency of producing and delivering PPEs increases as the number of infected cases rapidly increases. A key challenge in response to the epidemic is effectively and efficiently matching the demands and needs. Performing practical and efficient order assignment and scheduling for PPE production during the COVID-19 outbreak is critical to curbing the COVID-19 pandemic. This work first proposes a bi-objective mixed-integer linear program for optimal order assignment and scheduling for PPE production. The aim is to achieve an economical and timely PPE production and supply. A novel method that combines the $\epsilon $ -constraint framework and the logic-based Benders decomposition is proposed to yield high-quality Pareto solutions for practical-sized problems. Computational results indicate that the proposed approaches are practical and feasible, which can help decision-makers to perform acceptable order assignment and scheduling decisions.

17 November 2023
Verified
Conference Paper
Closed access
TLTingjuan Li
Tingjuan Li
ZLZhiXin Li
ZhiXin Li
YLYing Li
Ying Li
YHYongqiang Hu
Yongqiang Hu
Bean Optimization Algorithm (BOA) is a kind of swarm intelligence algorithm constructed by the principles of natural seed propagation and population distribution evolution. Its bionic significance is clear and computational efficiency is high. In order to improve the diversity of BOA global search and enhance the performance of fine search, a bean optimization algorithm based on Lévy flight (LBOA) was proposed. LBOA introduces the Lévy flight mechanism into the offspring population distribution module of the BOA, which perturbs different positions of a certain proportion of individuals. By setting a larger Lévy flight step weight in the early and middle stages of BOA evolution, the global search ability and convergence speed of BOA are improved. In the fine search stage of BOA evolution, setting a smaller Lévy flight step weight improves the fine search performance of BOA. Finally, through comparative experiments with other mainstream swarm intelligence algorithms, it is shown that LBOA has better optimization performance.