Jiaqi Liang
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
Jiaqi Liang has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- MengChu Zhou
Macau University of Science and Technology
3 shared publications - Shixin Liu
Northeastern University
3 shared publications - Ziyan Zhao
College of Information Science and Engineering, Northeastern University, Shenyang 110819, China
3 shared publications - Sanjay Dominik Jena
Department of Analytics, Operations and Information Technologies, ESG UQAM, Université du Québec à Montréal, Montreal, Quebec, Canada
2 shared publications - Andrea Lodi
Cornell Tech and Technion–IIT
1 shared publication Bingchen Cao
College of Information Science and Engineering, Northeastern University, Shenyang, China
1 shared publication
Latest Publications
- 4 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. PP (21682216) , 1-13
Learning-Based Approach to Integrated Operational Optimization Problems in Robot-Assisted Multistation Warehouse Systems
In the era of booming e-commerce and Internet of Things technology, robotic mobile fulfillment systems (RMFSs) have gained more and more use in logistics industry. While these systems enhance labor efficiency, they introduce numerous optimization challenges. Order picking is a human–robot collaborative process in RMFS. It involves three critical and interrelated operational optimization issues: 1) PS; 2) resource scheduling; and 3) manual picking. Each of them is an NP-hard combinatorial optimization problem. Their integration is a significant challenge for operational optimization in RMFS with multiple picking stations and represents a novel problem that was not studied before to our best knowledge. To tackle this complex problem and fill the research gap, we first model it as a MIP to derive exact solutions for small-scale and illustrative cases. For industrial-scale cases that cannot be solved by exact methods given limited time, we propose a tailored learning-strategies-enhanced local search algorithm. It integrates a 3-D bi-section encoding strategy, a three-stage decoding policy, a learning-based ANS method, and two learning-based tabu mechanisms. Experimental results demonstrate the effectiveness of our proposed method, achieving 2.9% to 33.2% performance improvement over six competitive peers. This highlights its superiority in solving the concerned problem, providing significant potential for addressing practical order picking optimization challenges in RMFS.
- 4 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. PP (21682216) , 1-13
Learning-Based Approach to Integrated Operational Optimization Problems in Robot-Assisted Multistation Warehouse Systems
In the era of booming e-commerce and Internet of Things technology, robotic mobile fulfillment systems (RMFSs) have gained more and more use in logistics industry. While these systems enhance labor efficiency, they introduce numerous optimization challenges. Order picking is a human–robot collaborative process in RMFS. It involves three critical and interrelated operational optimization issues: 1) PS; 2) resource scheduling; and 3) manual picking. Each of them is an NP-hard combinatorial optimization problem. Their integration is a significant challenge for operational optimization in RMFS with multiple picking stations and represents a novel problem that was not studied before to our best knowledge. To tackle this complex problem and fill the research gap, we first model it as a MIP to derive exact solutions for small-scale and illustrative cases. For industrial-scale cases that cannot be solved by exact methods given limited time, we propose a tailored learning-strategies-enhanced local search algorithm. It integrates a 3-D bi-section encoding strategy, a three-stage decoding policy, a learning-based ANS method, and two learning-based tabu mechanisms. Experimental results demonstrate the effectiveness of our proposed method, achieving 2.9% to 33.2% performance improvement over six competitive peers. This highlights its superiority in solving the concerned problem, providing significant potential for addressing practical order picking optimization challenges in RMFS.
- Open Access
- 22 November 2024
- Published by Elsevier in EURO Journal on Transportation and Logistics
- Vol. 13
Dynamic rebalancing for Bike-sharing systems under inventory interval and target predictions
- 22 November 2024
- Published by Elsevier in EURO Journal on Transportation and Logistics
- Vol. 13
Open AccessDynamic rebalancing for Bike-sharing systems under inventory interval and target predictions
- 4 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 20 (10) , 11930-11939
Scheduling and Logistics Optimization for Batch Manufacturing Processes With Temperature Constraints and Alternative Thermal Devices
Batch scheduling problems are NP-hard and often coupled with logistics optimization problems in industrial manufacturing scenarios, further increasing the challenge of decision-making. This work focuses on a stainless steel hot-rolling production process, where it is essential to maintain the temperature of the products from the previous process beyond a certain threshold. Our work diverges from typical hot-rolling production processes by necessitating the utilization of alternative thermal devices, thereby intricately linking batch scheduling with logistics optimization and resulting in a novel lexicographical dual-objective optimization problem. To address this complex problem, we first introduce a mathematical model formulated as a mixed integer program, providing exact solutions of the concerned problem but taking much computation time. To provide effective and efficient solutions, we then propose an enhanced simulated annealing algorithm, which integrates destruction and construction methods inspired by iterated greedy algorithms. This algorithm is tailored to the specific characteristics of the problem, incorporating specialized encoding-decoding mechanisms, neighborhood search operators, and a Metropolis acceptance criterion. Our experimental results highlight the effectiveness of proposed approaches, demonstrating their superiority over competitive peers. Thus, this research contributes valuable insights and innovative solutions to the scheduling and optimization challenges inherent in batch manufacturing processes with temperature constraints and thermal devices.
- 4 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 20 (10) , 11930-11939
Scheduling and Logistics Optimization for Batch Manufacturing Processes With Temperature Constraints and Alternative Thermal Devices
Batch scheduling problems are NP-hard and often coupled with logistics optimization problems in industrial manufacturing scenarios, further increasing the challenge of decision-making. This work focuses on a stainless steel hot-rolling production process, where it is essential to maintain the temperature of the products from the previous process beyond a certain threshold. Our work diverges from typical hot-rolling production processes by necessitating the utilization of alternative thermal devices, thereby intricately linking batch scheduling with logistics optimization and resulting in a novel lexicographical dual-objective optimization problem. To address this complex problem, we first introduce a mathematical model formulated as a mixed integer program, providing exact solutions of the concerned problem but taking much computation time. To provide effective and efficient solutions, we then propose an enhanced simulated annealing algorithm, which integrates destruction and construction methods inspired by iterated greedy algorithms. This algorithm is tailored to the specific characteristics of the problem, incorporating specialized encoding-decoding mechanisms, neighborhood search operators, and a Metropolis acceptance criterion. Our experimental results highlight the effectiveness of proposed approaches, demonstrating their superiority over competitive peers. Thus, this research contributes valuable insights and innovative solutions to the scheduling and optimization challenges inherent in batch manufacturing processes with temperature constraints and thermal devices.
- Open Access
- 6 May 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 317 (3) , 875-889
Dynamic rebalancing optimization for bike-sharing systems: A modeling framework and empirical comparison
- 6 May 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 317 (3) , 875-889
Open AccessDynamic rebalancing optimization for bike-sharing systems: A modeling framework and empirical comparison
- Top Cited Papers
- 22 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (9) , 16314-16324
Order Picking Optimization in Smart Warehouses With Human–Robot Collaboration
With the development of robotics and Internet of Things, robot-assisted goods-to-person order picking systems become popular in smart warehouses. Order picking in such systems is a human-robot collaborative process, where robots carry pods to a picking station with human pickers who pick the demanded goods from them to fulfill orders. In it, pod selection, robot scheduling, and manual picking are highly coupled and together influence the efficiency of order picking. Their joint optimization is the key to enhancing operational efficiency but rarely studied in existing work. In order to fill such a research gap and meet high market demand, this work focuses on a novel human-robot collaborative order picking optimization problem. A mixed integer program is formulated to model it and provide an exact solution method for small-scale instances. To provide large-scale problems with efficient solutions in practical application scenarios, we propose an adaptive large-neighborhood-based tabu search algorithm. Specifically, an adaptive large neighborhood search method is designed and embedded into a tabu search algorithm with two tabu mechanisms. Experimental results indicate that the presented algorithm has significant advantages in solving the newly proposed problem. It substantially outperforms: 1) the independent use of adaptive large neighborhood search or tabu search, 2) Gurobi subject to an hour execution time, and 3) several competitive benchmark and newest well-performing algorithms. Its high performance implies its great potential in solving practical order picking optimization problems for Internet-of-Things-enabled robot-assisted smart warehouses.
- 22 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (9) , 16314-16324
Top Cited PapersOrder Picking Optimization in Smart Warehouses With Human–Robot Collaboration
With the development of robotics and Internet of Things, robot-assisted goods-to-person order picking systems become popular in smart warehouses. Order picking in such systems is a human-robot collaborative process, where robots carry pods to a picking station with human pickers who pick the demanded goods from them to fulfill orders. In it, pod selection, robot scheduling, and manual picking are highly coupled and together influence the efficiency of order picking. Their joint optimization is the key to enhancing operational efficiency but rarely studied in existing work. In order to fill such a research gap and meet high market demand, this work focuses on a novel human-robot collaborative order picking optimization problem. A mixed integer program is formulated to model it and provide an exact solution method for small-scale instances. To provide large-scale problems with efficient solutions in practical application scenarios, we propose an adaptive large-neighborhood-based tabu search algorithm. Specifically, an adaptive large neighborhood search method is designed and embedded into a tabu search algorithm with two tabu mechanisms. Experimental results indicate that the presented algorithm has significant advantages in solving the newly proposed problem. It substantially outperforms: 1) the independent use of adaptive large neighborhood search or tabu search, 2) Gurobi subject to an hour execution time, and 3) several competitive benchmark and newest well-performing algorithms. Its high performance implies its great potential in solving practical order picking optimization problems for Internet-of-Things-enabled robot-assisted smart warehouses.
- 25 September 2020
- Published by SAGE Publications in Transactions of the Institute of Measurement and Control
- Vol. 43 (2) , 267-277
H∞ control for a class of two-dimensional linear systems with fading measurements
In this paper, the control problem for a class of two-dimensional (2-D) linear discrete-time systems with fading measurements is investigated, where the 2-D systems are described by a Roesser model. The Rice fading model is applied to describe the fading phenomenon and the coefficients of the model satisfy the independent identical Gaussian distributions. The main objective of this paper is to design a controller such that both the 2-D closed-loop system is exponentially mean-square stable and the prescribed performance is guaranteed under the condition of applying the attenuation signals. By utilizing the Lyapunov stability theory and the linear matrix inequalities (LMIs) techniques, sufficient conditions are conducted to guarantee the desired tracking performance. Based on such conditions, the gain matrix of the proposed controller is obtained. Finally, the effectiveness of the proposed control schemes is illustrated with a numerical example and a Darboux equation example.- 25 September 2020
- Published by SAGE Publications in Transactions of the Institute of Measurement and Control
- Vol. 43 (2) , 267-277
H∞ control for a class of two-dimensional linear systems with fading measurements
In this paper, the control problem for a class of two-dimensional (2-D) linear discrete-time systems with fading measurements is investigated, where the 2-D systems are described by a Roesser model. The Rice fading model is applied to describe the fading phenomenon and the coefficients of the model satisfy the independent identical Gaussian distributions. The main objective of this paper is to design a controller such that both the 2-D closed-loop system is exponentially mean-square stable and the prescribed performance is guaranteed under the condition of applying the attenuation signals. By utilizing the Lyapunov stability theory and the linear matrix inequalities (LMIs) techniques, sufficient conditions are conducted to guarantee the desired tracking performance. Based on such conditions, the gain matrix of the proposed controller is obtained. Finally, the effectiveness of the proposed control schemes is illustrated with a numerical example and a Darboux equation example.- Open Access
- 1 January 2017
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 1808, 030015
The degradation of wheat straw lignin
Lignin is a kind of formed by polymerization of aromatic alcohol, prices are lower and sources of renewable resources. Using lignin as raw material, through the push to resolve together preparation phenolic high value-added fine chemicals alkanes and aromatic hydrocarbons, such as the high grade biofuels, can partly replace fossil fuels as raw material to the production process, biomass resources is an important part of the comprehensive utilization of effective components. In lignin push solve clustering method, catalytic hydrogenolysis can directly to the lignin into liquid fuels, low oxygen content in the use of biofuels shows great potential. In this paper, through the optimization of the reaction time, reaction temperature, catalyst type and solvent type, dosage of catalyst, etc factors, determines the alcoholysis - hydrogen solution two-step degradation of lignin, the optimal process conditions: lignin alcoholysis under 50% methanol and NaOH catalyst in the solution, the lignin in methanol solution and 50% hydrogen solution under the Pd/C catalyst. In this process, the degradation of lignin yield can reach 42%.
- 1 January 2017
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 1808, 030015
Open AccessThe degradation of wheat straw lignin
Lignin is a kind of formed by polymerization of aromatic alcohol, prices are lower and sources of renewable resources. Using lignin as raw material, through the push to resolve together preparation phenolic high value-added fine chemicals alkanes and aromatic hydrocarbons, such as the high grade biofuels, can partly replace fossil fuels as raw material to the production process, biomass resources is an important part of the comprehensive utilization of effective components. In lignin push solve clustering method, catalytic hydrogenolysis can directly to the lignin into liquid fuels, low oxygen content in the use of biofuels shows great potential. In this paper, through the optimization of the reaction time, reaction temperature, catalyst type and solvent type, dosage of catalyst, etc factors, determines the alcoholysis - hydrogen solution two-step degradation of lignin, the optimal process conditions: lignin alcoholysis under 50% methanol and NaOH catalyst in the solution, the lignin in methanol solution and 50% hydrogen solution under the Pd/C catalyst. In this process, the degradation of lignin yield can reach 42%.
- 1 July 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19325517,p. 1-6
Computational intelligence for control of wind turbine generators
This paper summarizes past and ongoing research in the area of the application of computational intelligence (CI) for control of wind turbine generators (WTGs). Several intelligent design approaches and control strategies, including optimal design of WTG controllers using particle swarm optimization (PSO) and mean-variance optimization (MVO) algorithms and adaptive critic design-based coordinated optimal adaptive control for wind plants and shunt FACTS devices, are presented for dynamic performance and fault ride-through enhancement of WTGs and the associated power grid. The effectiveness of these intelligent design approaches and control strategies are demonstrated by nonreal- and real-time simulations in PSCAD/EMTDC and RSCAD/RTDS, respectively.
- 1 July 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19325517,p. 1-6
Computational intelligence for control of wind turbine generators
This paper summarizes past and ongoing research in the area of the application of computational intelligence (CI) for control of wind turbine generators (WTGs). Several intelligent design approaches and control strategies, including optimal design of WTG controllers using particle swarm optimization (PSO) and mean-variance optimization (MVO) algorithms and adaptive critic design-based coordinated optimal adaptive control for wind plants and shunt FACTS devices, are presented for dynamic performance and fault ride-through enhancement of WTGs and the associated power grid. The effectiveness of these intelligent design approaches and control strategies are demonstrated by nonreal- and real-time simulations in PSCAD/EMTDC and RSCAD/RTDS, respectively.