Yi Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yi Liu has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Chun Ouyang
Fudan University, Shanghai, China
4 shared publications - Hongda Zhang
Academy for Engineering and Technology, Fudan University, Shanghai, China
3 shared publications - Zhongxue Gan
Fudan University
3 shared publications - Lida Xu
Department of Mechanical and Electrical Engineering School of Intelligent Manufacturing Xiamen University Xiamen China
2 shared publications Yuning Chen
Academy for Engineering and Technology, Fudan University, Shanghai, China
2 shared publications- Zhuo Zou
Fudan University
2 shared publications
Latest Publications
- Open Access
- 15 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1573-1577
Joint-Guided Spatial and Semantic Sensitive Diffusion Policy for Robotic Manipulation
- 15 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1573-1577
Open AccessJoint-Guided Spatial and Semantic Sensitive Diffusion Policy for Robotic Manipulation
- 9 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 30 (2) , 795-809
Dynamic Grouping With a Self-Aware Computational Resource Allocation for Large-Scale Multi-Objective Optimization
In real-world applications, many problems are characterized by numerous variables and conflicting objectives, which are referred to as Large-Scale Multi-Objective Optimization Problems (LSMOPs). The Cooperative Coevolution (CC) algorithm is commonly used to solve LSMOPs. The decision variables of the target problem are partitioned into groups with each group being solved independently. However, existing multi-objective CC algorithms encounter difficulties in accurately grouping variables by importance and lack effective methods for allocating computational resources to enhance solution efficiency. To address these challenges, a dynamic grouping method based on variable importance is introduced alongside a self-aware computational resource allocation mechanism. Our proposed algorithm calculates the importance of each variable by considering the impact of value fluctuations on each objective. Variables with similar importance levels are subsequently grouped together. Based on this, the resource allocation mechanism is proposed to monitor changes in the improvement rate of population quality during the optimization process across different variable groups, dynamically directing resources to groups of greater importance. The proposed algorithm was tested against five state-of-the-art large-scale multi-objective algorithms (RG-DRA, LERD, LMOCSO, LMEA, FDV) using the LSMOP and WFG benchmark suites. It outperformed at least 75% of LSMOP instances and surpassed RG-DRA, LERD, and LMOCSO in over 50% of WFG instances, demonstrating comparable performance to LMEA and FDV.
- 9 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 30 (2) , 795-809
Dynamic Grouping With a Self-Aware Computational Resource Allocation for Large-Scale Multi-Objective Optimization
In real-world applications, many problems are characterized by numerous variables and conflicting objectives, which are referred to as Large-Scale Multi-Objective Optimization Problems (LSMOPs). The Cooperative Coevolution (CC) algorithm is commonly used to solve LSMOPs. The decision variables of the target problem are partitioned into groups with each group being solved independently. However, existing multi-objective CC algorithms encounter difficulties in accurately grouping variables by importance and lack effective methods for allocating computational resources to enhance solution efficiency. To address these challenges, a dynamic grouping method based on variable importance is introduced alongside a self-aware computational resource allocation mechanism. Our proposed algorithm calculates the importance of each variable by considering the impact of value fluctuations on each objective. Variables with similar importance levels are subsequently grouped together. Based on this, the resource allocation mechanism is proposed to monitor changes in the improvement rate of population quality during the optimization process across different variable groups, dynamically directing resources to groups of greater importance. The proposed algorithm was tested against five state-of-the-art large-scale multi-objective algorithms (RG-DRA, LERD, LMOCSO, LMEA, FDV) using the LSMOP and WFG benchmark suites. It outperformed at least 75% of LSMOP instances and surpassed RG-DRA, LERD, and LMOCSO in over 50% of WFG instances, demonstrating comparable performance to LMEA and FDV.
- 24 January 2025
- Published by Elsevier in Neurocomputing
- Vol. 624
RPN: A region-to-pixel-mask-based convolutional network for lesion segmentation of fundus images
- 24 January 2025
- Published by Elsevier in Neurocomputing
- Vol. 624
RPN: A region-to-pixel-mask-based convolutional network for lesion segmentation of fundus images
- 20 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 21 (4) , 3007-3016
Real-Time Scheduling Framework for Multiagent Cooperative Logistics With Dynamic Supply Demands
In logistics systems with multiagent collaboration, one of the prevailing focus lies on modeling as the dynamic multiperiod vehicle routing problem (DMPVRP). This work introduces modifications to DMPVRP to align with the requirements of real factory operations, particularly with dynamic supply demands. A self-established multiagent dynamic scheduling framework has been proposed to adapt to dynamic environmental changes and make timely adjustments, which consists of two modules: dynamic path planning and machine assignment. The first module utilizes a self-designed multioperator two-stage evolutionary algorithm to dynamically update the routes for vehicles. The second module maintains the workload balance among vehicles in real time. Experimental results demonstrate that the proposed algorithm achieves optimal outcomes compared to three state-of-the-art algorithms, surpassing others by 20% in machine output and exhibiting 5% lower transportation costs. In addition, a case study from a steel cord manufacturing factory is conducted, demonstrating its capability to promptly enhance efficiency.
- 20 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 21 (4) , 3007-3016
Real-Time Scheduling Framework for Multiagent Cooperative Logistics With Dynamic Supply Demands
In logistics systems with multiagent collaboration, one of the prevailing focus lies on modeling as the dynamic multiperiod vehicle routing problem (DMPVRP). This work introduces modifications to DMPVRP to align with the requirements of real factory operations, particularly with dynamic supply demands. A self-established multiagent dynamic scheduling framework has been proposed to adapt to dynamic environmental changes and make timely adjustments, which consists of two modules: dynamic path planning and machine assignment. The first module utilizes a self-designed multioperator two-stage evolutionary algorithm to dynamically update the routes for vehicles. The second module maintains the workload balance among vehicles in real time. Experimental results demonstrate that the proposed algorithm achieves optimal outcomes compared to three state-of-the-art algorithms, surpassing others by 20% in machine output and exhibiting 5% lower transportation costs. In addition, a case study from a steel cord manufacturing factory is conducted, demonstrating its capability to promptly enhance efficiency.
- Open Access
- 12 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 47-55
Learning-Based Neural Ant Colony Optimization
- 12 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 47-55
Open AccessLearning-Based Neural Ant Colony Optimization
- Open Access
- 25 June 2020
- Published by Association for Computing Machinery (ACM)
- p. 368-376
Absumption and subsumption based learning classifier systems
Learning Classifier Systems (LCSs) are a group of rule-based evolutionary computation techniques, which have been frequently applied to data-mining tasks. Evidence shows that LCSs can produce models containing human-discernible patterns. But, traditional LCSs cannot efficiently discover consistent, general rules - especially in domains that have unbalanced class distribution. The reason is that traditional search methods, e.g. crossover, mutation, and roulette wheel deletion, rely on stochasticity to find and keep optimum rules. Recently, absumption has been introduced to deterministically remove over-general rules, which is complementary to subsumption that deterministically removes over-specific rules. It is hypothesized that utilizing just assumption & subsumption transforms the search process from stochastic to deterministic, which benefits LCSs in evolving interpretable models and removing the need to tune search parameters to the problem. Interrogatable artificial Boolean domains with varying numbers of attributes are considered as benchmarks. The new LCS, termed Absumption Subsumption Classifier System (ASCS), successfully produces interpretable models for all the complex domains tested, whereas the non-optimal rules in existing techniques obscure the patterns. ACSC's ability to handle complex search spaces is observed, e.g. for the 14-bits Majority-On problem the required 6435 different cooperating rules were discovered enabling correct pattern visualization.
- 25 June 2020
- Published by Association for Computing Machinery (ACM)
- p. 368-376
Open AccessAbsumption and subsumption based learning classifier systems
Learning Classifier Systems (LCSs) are a group of rule-based evolutionary computation techniques, which have been frequently applied to data-mining tasks. Evidence shows that LCSs can produce models containing human-discernible patterns. But, traditional LCSs cannot efficiently discover consistent, general rules - especially in domains that have unbalanced class distribution. The reason is that traditional search methods, e.g. crossover, mutation, and roulette wheel deletion, rely on stochasticity to find and keep optimum rules. Recently, absumption has been introduced to deterministically remove over-general rules, which is complementary to subsumption that deterministically removes over-specific rules. It is hypothesized that utilizing just assumption & subsumption transforms the search process from stochastic to deterministic, which benefits LCSs in evolving interpretable models and removing the need to tune search parameters to the problem. Interrogatable artificial Boolean domains with varying numbers of attributes are considered as benchmarks. The new LCS, termed Absumption Subsumption Classifier System (ASCS), successfully produces interpretable models for all the complex domains tested, whereas the non-optimal rules in existing techniques obscure the patterns. ACSC's ability to handle complex search spaces is observed, e.g. for the 14-bits Majority-On problem the required 6435 different cooperating rules were discovered enabling correct pattern visualization.