Zhenyao 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
Zhenyao Liu has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Wei-Chang Yeh
Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu 300, Taiwan
7 shared publications Wei-Chang Yeh
Integration and Collaboration Laboratory, Department of Industrial Engineering and Engineering Management, National Tsing Hua University , Hsinchu 300044 , Taiwan
4 shared publicationsChia-Ling Huang
3 shared publications- Chia-Ling Huang
Department of International Logistics and Transportation Management, Kainan University, Taoyuan 338, Taiwan
2 shared publications - Shi-Yi Tan
Integration and Collaboration Laboratory, Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu 30013, Taiwan
2 shared publications Wenbo Zhu
2 shared publications
Latest Publications
- Open Access
- 25 February 2026
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 143 (5-6) , 3177-3195
Semiconductor manufacturing for wafer ID recognition system developed by object detection framework
- 25 February 2026
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 143 (5-6) , 3177-3195
Open AccessSemiconductor manufacturing for wafer ID recognition system developed by object detection framework
- 30 November 2025
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 164
Simplified swarm optimization for cutting optimization problems
- 30 November 2025
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 164
Simplified swarm optimization for cutting optimization problems
- Open Access
- 3 July 2024
- Published by Oxford University Press (OUP) in Journal of Computational Design and Engineering
- Vol. 11 (4) , 203-233
Non-dominated sorting simplified swarm optimization for multi-objective omni-channel of pollution-routing problem
The activities of the traffic department mainly contribute to the generation of greenhouse gas (GHG) emissions. The swift expansion of the traffic department results in a significant increase in global pollution levels, adversely affecting human health. To address GHG emissions and propose impactful solutions for reducing fuel consumption in vehicles, environmental considerations are integrated with the core principles of the vehicle routing problem. This integration gives rise to the pollution-routing problem (PRP), which aims to optimize routing decisions with a focus on minimizing environmental impact. At the same time, the retail distribution system explores the use of an omni-channel approach as a transportation mode adopted in this study. The objectives of this research include minimizing total travel costs and fuel consumption while aiming to reduce GHG emissions, promoting environmental sustainability, and enhancing the convenience of shopping and pickup for customers through the integration of online and offline modes. This problem is NP-hard; therefore, the Non-dominated Sorting Simplified Swarm Optimization (NSSO) algorithm is employed. NSSO combines the non-dominated technique of Non-dominated Sorting Genetic Algorithm II (NSGA-II) with the update mechanism of Simplified Swarm Optimization to obtain a set of Pareto-optimal solutions. Moreover, the NSSO, a multi-objective evolutionary algorithm, is adopted to address multi-objective problems. The PRP benchmark dataset is utilized, and the results are compared with two other multi-objective evolutionary algorithms: NSGA-II and Non-dominated Sorting Particle Swarm Optimization (NSPSO). The findings of the study confirm that NSSO exhibits feasibility, provides good solutions, and achieves faster convergence compared with the other two algorithms, NSGA-II and NSPSO.
- 3 July 2024
- Published by Oxford University Press (OUP) in Journal of Computational Design and Engineering
- Vol. 11 (4) , 203-233
Open AccessNon-dominated sorting simplified swarm optimization for multi-objective omni-channel of pollution-routing problem
The activities of the traffic department mainly contribute to the generation of greenhouse gas (GHG) emissions. The swift expansion of the traffic department results in a significant increase in global pollution levels, adversely affecting human health. To address GHG emissions and propose impactful solutions for reducing fuel consumption in vehicles, environmental considerations are integrated with the core principles of the vehicle routing problem. This integration gives rise to the pollution-routing problem (PRP), which aims to optimize routing decisions with a focus on minimizing environmental impact. At the same time, the retail distribution system explores the use of an omni-channel approach as a transportation mode adopted in this study. The objectives of this research include minimizing total travel costs and fuel consumption while aiming to reduce GHG emissions, promoting environmental sustainability, and enhancing the convenience of shopping and pickup for customers through the integration of online and offline modes. This problem is NP-hard; therefore, the Non-dominated Sorting Simplified Swarm Optimization (NSSO) algorithm is employed. NSSO combines the non-dominated technique of Non-dominated Sorting Genetic Algorithm II (NSGA-II) with the update mechanism of Simplified Swarm Optimization to obtain a set of Pareto-optimal solutions. Moreover, the NSSO, a multi-objective evolutionary algorithm, is adopted to address multi-objective problems. The PRP benchmark dataset is utilized, and the results are compared with two other multi-objective evolutionary algorithms: NSGA-II and Non-dominated Sorting Particle Swarm Optimization (NSPSO). The findings of the study confirm that NSSO exhibits feasibility, provides good solutions, and achieves faster convergence compared with the other two algorithms, NSGA-II and NSPSO.
- Open Access
- 1 January 2024
- Published by National Library of Serbia in Computer Science and Information Systems
- Vol. 21 (2) , 593-623
Machine learning based approach for exploring online shopping behavior and preferences with eye tracking
In light of advancements in information technology and the widespread impact of the COVID-19 pandemic, consumer behavior has undergone a significant transformation, shifting from traditional in-store shopping to the realm of online retailing. This shift has notably accelerated the growth of the online retail sector. An essential advantage offered by e-commerce lies in its ability to accumulate and analyze user data, encompassing browsing and purchase histories, through its recommendation systems. Nevertheless, prevailing methodologies predominantly rely on historical user data, which often lack the dynamism required to comprehend immediate user responses and emotional states during online interactions. Recognizing the substantial influence of visual stimuli on human perception, this study leverages eye-tracking technology to investigate online consumer behavior. The research captures the visual engagement of 60 healthy participants while they engage in online shopping, while also taking note of their preferred items for purchase. Subsequently, we apply statistical analysis and machine learning models to unravel the impact of visual complexity, consumer considerations, and preferred items, thereby providing valuable insights for the design of e-commerce platforms. Our findings indicate that the integration of eye-tracking data into e-commerce recommendation systems is conducive to enhancing their performance. Furthermore, machine learning algorithms exhibited remarkable classification capabilities when combined with eye-tracking data. Notably, during the purchase of hedonic products, participants primarily fixated on product images, whereas for utilitarian products, equal attention was dedicated to images, prices, reviews, and sales volume. These insights hold significant potential to augment the effectiveness of e-commerce marketing endeavors.
- 1 January 2024
- Published by National Library of Serbia in Computer Science and Information Systems
- Vol. 21 (2) , 593-623
Open AccessMachine learning based approach for exploring online shopping behavior and preferences with eye tracking
In light of advancements in information technology and the widespread impact of the COVID-19 pandemic, consumer behavior has undergone a significant transformation, shifting from traditional in-store shopping to the realm of online retailing. This shift has notably accelerated the growth of the online retail sector. An essential advantage offered by e-commerce lies in its ability to accumulate and analyze user data, encompassing browsing and purchase histories, through its recommendation systems. Nevertheless, prevailing methodologies predominantly rely on historical user data, which often lack the dynamism required to comprehend immediate user responses and emotional states during online interactions. Recognizing the substantial influence of visual stimuli on human perception, this study leverages eye-tracking technology to investigate online consumer behavior. The research captures the visual engagement of 60 healthy participants while they engage in online shopping, while also taking note of their preferred items for purchase. Subsequently, we apply statistical analysis and machine learning models to unravel the impact of visual complexity, consumer considerations, and preferred items, thereby providing valuable insights for the design of e-commerce platforms. Our findings indicate that the integration of eye-tracking data into e-commerce recommendation systems is conducive to enhancing their performance. Furthermore, machine learning algorithms exhibited remarkable classification capabilities when combined with eye-tracking data. Notably, during the purchase of hedonic products, participants primarily fixated on product images, whereas for utilitarian products, equal attention was dedicated to images, prices, reviews, and sales volume. These insights hold significant potential to augment the effectiveness of e-commerce marketing endeavors.
- 14 August 2023
- Published by Elsevier in Applied Soft Computing
- Vol. 147
Risk-averse two-stage stochastic programming-based closed-loop supply chain network design under uncertain demand
- 14 August 2023
- Published by Elsevier in Applied Soft Computing
- Vol. 147
Risk-averse two-stage stochastic programming-based closed-loop supply chain network design under uncertain demand
- Open Access
- 10 March 2023
- Published by Oxford University Press (OUP) in Journal of Computational Design and Engineering
- Vol. 10 (2) , 758-772
A novel binary-addition simplified swarm optimization for generalized reliability redundancy allocation problem
Network systems are commonly used in various fields, such as power grids, Internet of Things, and gas networks. The reliability redundancy allocation problem is a well-known reliability design tool that needs to be developed when the system is extended from a series-parallel structure to a more general network structure. Therefore, this study proposes a novel reliability redundancy allocation problem, referred to as the general reliability redundancy allocation problem, to be applied in network systems. Because the general reliability redundancy allocation problem is NP-hard, a new algorithm referred to as binary-addition simplified swarm optimization is proposed in this study. Binary-addition simplified swarm optimization combines the accuracy of the binary addition tree algorithm with the efficiency of simplified swarm optimization, which can effectively reduce the solution space and speed up the time required to find high-quality solutions. The experimental results show that binary-addition simplified swarm optimization outperforms three well-known algorithms: the genetic algorithm, particle swarm optimization, and simplified swarm optimization in high-quality solutions and high stability on six network benchmarks.
- 10 March 2023
- Published by Oxford University Press (OUP) in Journal of Computational Design and Engineering
- Vol. 10 (2) , 758-772
Open AccessA novel binary-addition simplified swarm optimization for generalized reliability redundancy allocation problem
Network systems are commonly used in various fields, such as power grids, Internet of Things, and gas networks. The reliability redundancy allocation problem is a well-known reliability design tool that needs to be developed when the system is extended from a series-parallel structure to a more general network structure. Therefore, this study proposes a novel reliability redundancy allocation problem, referred to as the general reliability redundancy allocation problem, to be applied in network systems. Because the general reliability redundancy allocation problem is NP-hard, a new algorithm referred to as binary-addition simplified swarm optimization is proposed in this study. Binary-addition simplified swarm optimization combines the accuracy of the binary addition tree algorithm with the efficiency of simplified swarm optimization, which can effectively reduce the solution space and speed up the time required to find high-quality solutions. The experimental results show that binary-addition simplified swarm optimization outperforms three well-known algorithms: the genetic algorithm, particle swarm optimization, and simplified swarm optimization in high-quality solutions and high stability on six network benchmarks.
- 1 January 2023
- Published by Growing Science in International Journal of Industrial Engineering Computations
- Vol. 14 (4) , 723-748
Bi-Objective simplified swarm optimization for fog computing task scheduling
- 1 January 2023
- Published by Growing Science in International Journal of Industrial Engineering Computations
- Vol. 14 (4) , 723-748
Bi-Objective simplified swarm optimization for fog computing task scheduling
- Open Access
- 6 July 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (14) , 6858
A New BAT and PageRank Algorithm for Propagation Probability in Social Networks
Social networks have increasingly become important and popular in modern times. Moreover, the influence of social networks plays a vital role in various organizations, including government organizations, academic research organizations and corporate organizations. Therefore, strategizing the optimal propagation strategy in social networks has also become more important. Increasing the precision of evaluating the propagation probability of social networks can indirectly influence the investment of cost, manpower and time for information propagation to achieve the best return. This study proposes a new algorithm, which includes a scale-free network, Barabási–Albert model, binary-addition tree (BAT) algorithm, PageRank algorithm, Personalized PageRank algorithm and a new BAT algorithm to calculate the propagation probability of social networks. The results obtained after implementing the simulation experiment of social network models show that the studied model and the proposed algorithm provide an effective method to increase the efficiency of information propagation in social networks. In this way, the maximum propagation efficiency is achieved with the minimum investment.
- 6 July 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (14) , 6858
Open AccessA New BAT and PageRank Algorithm for Propagation Probability in Social Networks
Social networks have increasingly become important and popular in modern times. Moreover, the influence of social networks plays a vital role in various organizations, including government organizations, academic research organizations and corporate organizations. Therefore, strategizing the optimal propagation strategy in social networks has also become more important. Increasing the precision of evaluating the propagation probability of social networks can indirectly influence the investment of cost, manpower and time for information propagation to achieve the best return. This study proposes a new algorithm, which includes a scale-free network, Barabási–Albert model, binary-addition tree (BAT) algorithm, PageRank algorithm, Personalized PageRank algorithm and a new BAT algorithm to calculate the propagation probability of social networks. The results obtained after implementing the simulation experiment of social network models show that the studied model and the proposed algorithm provide an effective method to increase the efficiency of information propagation in social networks. In this way, the maximum propagation efficiency is achieved with the minimum investment.
- Open Access
- 11 June 2022
- Published by MDPI AG in Technologies
- Vol. 10 (3) , 73
Solving Dual-Channel Supply Chain Pricing Strategy Problem with Multi-Level Programming Based on Improved Simplified Swarm Optimization
With the evolution of the Internet and the introduction of third-party platforms, a diversified supply chain has gradually emerged. In contrast to the traditional single sales channel, companies can also increase their revenue by selling through multiple channels, such as dual-channel sales: adding a sales channel for direct sales through online third-party platforms. However, due to the complexity of the supply chain structure, previous studies have rarely discussed and analyzed the capital-constrained dual-channel supply chain model, which is more relevant to the actual situation. To solve more complex and realistic supply chain decision problems, this paper uses the concept of game theory to describe the pricing negotiation procedures among the capital-constrained manufacturers and other parties in the dual-channel supply chain by applying the Stackelberg game theory to describe the supply chain structure as a hierarchical multi-level mathematical model to solve the optimal pricing strategy for different financing options to achieve the common benefit of the supply chain. In this study, we propose a Multi-level Improved Simplified Swarm Optimization (MLiSSO) method, which uses the improved, simplified swarm optimization (iSSO) for the Multi-level Programming Problem (MLPP). It is applied to this pricing strategy model of the supply chain and experiments with three related MLPPs in the past studies to verify the effectiveness of the method. The results show that the MLiSSO algorithm is effective, qualitative, and stable and can be used to solve the pricing strategy problem for supply chain models; furthermore, the algorithm can also be applied to other MLPPs.
- 11 June 2022
- Published by MDPI AG in Technologies
- Vol. 10 (3) , 73
Open AccessSolving Dual-Channel Supply Chain Pricing Strategy Problem with Multi-Level Programming Based on Improved Simplified Swarm Optimization
With the evolution of the Internet and the introduction of third-party platforms, a diversified supply chain has gradually emerged. In contrast to the traditional single sales channel, companies can also increase their revenue by selling through multiple channels, such as dual-channel sales: adding a sales channel for direct sales through online third-party platforms. However, due to the complexity of the supply chain structure, previous studies have rarely discussed and analyzed the capital-constrained dual-channel supply chain model, which is more relevant to the actual situation. To solve more complex and realistic supply chain decision problems, this paper uses the concept of game theory to describe the pricing negotiation procedures among the capital-constrained manufacturers and other parties in the dual-channel supply chain by applying the Stackelberg game theory to describe the supply chain structure as a hierarchical multi-level mathematical model to solve the optimal pricing strategy for different financing options to achieve the common benefit of the supply chain. In this study, we propose a Multi-level Improved Simplified Swarm Optimization (MLiSSO) method, which uses the improved, simplified swarm optimization (iSSO) for the Multi-level Programming Problem (MLPP). It is applied to this pricing strategy model of the supply chain and experiments with three related MLPPs in the past studies to verify the effectiveness of the method. The results show that the MLiSSO algorithm is effective, qualitative, and stable and can be used to solve the pricing strategy problem for supply chain models; furthermore, the algorithm can also be applied to other MLPPs.
- 1 November 2020
- Published by Elsevier in Reliability Engineering & System Safety
- Vol. 203
General multi-state rework network and reliability algorithm
- 1 November 2020
- Published by Elsevier in Reliability Engineering & System Safety
- Vol. 203
General multi-state rework network and reliability algorithm