Shi-Yi Tan

Dr. Shi-Yi Tan

Integration and Collaboration Laboratory, Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu 30013, Taiwan

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
2 November 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Shi-Yi TanShi-Yi Tan
Shi-Yi Tan
WYWei-Chang Yeh
Wei-Chang Yeh
Transportation planning has been established as a key topic in the literature and social production practices. An increasing number of researchers are studying vehicle routing problems (VRPs) and their variants considering real-life applications and scenarios. Furthermore, with the rapid growth in the processing speed and memory capacity of computers, various algorithms can be used to solve increasingly complex instances of VRPs. In this study, we analyzed recent literature published between 2019 and August of 2021 using a taxonomic framework. We reviewed recent research according to models and solutions, and divided models into three categories of customer-related, vehicle-related, and depot-related models. We classified solution algorithms into exact, heuristic, and meta-heuristic algorithms. The main contribution of our study is a classification table that is available online as Appendix A. This classification table should enable future researchers to find relevant literature easily and provide readers with recent trends and solution methodologies in the field of VRPs and some well-known variants.

16 November 2022 in Applied Soft Computing
Verified
Journal Article
Closed access
PSPei-Chiang Su
Pei-Chiang Su
Shi-Yi TanShi-Yi Tan
Shi-Yi Tan
ZLZhenyao Liu
Zhenyao Liu
WYWei-Chang Yeh
Wei-Chang Yeh

2 November 2022 in Reliability Engineering & System Safety
Verified
Journal Article
Closed access
WYWei-Chang Yeh
Wei-Chang Yeh
CDChia-Ming Du
Chia-Ming Du
Shi-Yi TanShi-Yi Tan
Shi-Yi Tan
MFMajid Forghani-Elahabad
Majid Forghani-Elahabad

24 July 2021 in Electronics
Verified
Journal Article
Open access
PDF file
WYWei-Chang Yeh
Wei-Chang Yeh
Shi-Yi TanShi-Yi Tan
Shi-Yi Tan
Transportation planning has been established as a key topic in the literature and practices of social production, especially in urban contexts. To consider traffic environment factors, more and more researchers are taking time-varying factors into account when scheduling their logistic activities. The time-dependent vehicle routing problem (TDVRP) is an extension of the classical Vehicle Routing Problem with Time Windows (VRPTW) by determining a set of optimal routes serving a set of customers within specific time windows. However, few of them use the continuous speed function to express the time-varying. In practice, many vehicle routing problems are addressed by a fleet of heterogeneous vehicles with different capacities and travel costs including fix costs and variable costs. In this study, a Heterogeneous Fleet Vehicle Routing Problem (HFPRP) Time-Varying Continuous Speed Function has been proposed. The objective is to minimize distribution costs, which contained fixed costs of acquiring and variable fuel costs. To address this problem, our research developed a mathematical model and proposed a Simplified Swarm Optimization (SSO) heuristic for HFVRP with Time-Varying Continuous Speed Function.

5 April 2022 in Reliability Engineering & System Safety
Verified
Journal Article
Closed access
WYWei-Chang Yeh
Wei-Chang Yeh
Shi-Yi TanShi-Yi Tan
Shi-Yi Tan
WZWenbo Zhu
Wenbo Zhu
CHChia-Ling Huang
Chia-Ling Huang
GYGuang-Yi Yang
Guang-Yi Yang

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.