ZHENYAO LIU

Prof. Dr. ZHENYAO LIU

orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
14 August 2023 in Applied Soft Computing
Verified
Journal Article
Closed access
ZLZHENYAO LIU
ZHENYAO LIU
LHLi-Man Hu
Li-Man Hu
WYWei-Chang Yeh
Wei-Chang Yeh

1 November 2020 in Reliability Engineering & System Safety
Verified
Journal Article
Closed access
ZHZhifeng Hao
Zhifeng Hao
WYWei-Chang Yeh
Wei-Chang Yeh
ZLZHENYAO LIU
ZHENYAO LIU
Majid Forghani-elahabadMajid Forghani-elahabad
Majid Forghani-elahabad

6 July 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
WYWei-Chang Yeh
Wei-Chang Yeh
WZWenbo Zhu
Wenbo Zhu
CHChia-Ling Huang
Chia-Ling Huang
THTzu-Yun Hsu
Tzu-Yun Hsu
ZLZHENYAO LIU
ZHENYAO LIU
Shi-Yi TanShi-Yi Tan
Shi-Yi Tan
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.

10 March 2023 in Journal of Computational Design and Engineering
Verified
Journal Article
Open access
PDF file
YJYunzhi Jiang
Yunzhi Jiang
ZLZHENYAO LIU
ZHENYAO LIU
JCJen-Hsuan Chen
Jen-Hsuan Chen
WYWei-Chang Yeh
Wei-Chang Yeh
CHChia-Ling Huang
Chia-Ling Huang
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.

11 June 2022 in Technologies
Verified
Journal Article
Open access
PDF file
WYWei-Chang Yeh
Wei-Chang Yeh
ZLZHENYAO LIU
ZHENYAO LIU
YYYu-Cheng Yang
Yu-Cheng Yang
Shi-Yi TanShi-Yi Tan
Shi-Yi Tan
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 January 2024 in Computer Science and Information Systems
Verified
Journal Article
Open access
PDF file
ZLZHENYAO LIU
ZHENYAO LIU
WYWei-Chang Yeh
Wei-Chang Yeh
KLKe-Yun Lin
Ke-Yun Lin
CLChia-Sheng Hota Lin
Chia-Sheng Hota Lin
Chuan-Yu ChangChuan-Yu Chang
Chuan-Yu Chang
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.