Xie Xie

Prof. Xie Xie

Shenyang University, Shenyang, Liaoning, China
orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
19 February 2025 in Applied Sciences
Verified
Journal Article
Open access
PDF file
XXXie Xie
Xie Xie
YYYang Yulin
Yang Yulin
HZHuan Zhou
Huan Zhou
The whale optimization algorithm (WOA) is a swarm intelligence optimization algorithm developed by Mirjalili and Lewis in 2016 based on the foraging behavior of whales. Because of its simplicity and high efficiency, scholars have adopted this algorithm to address various problems in different disciplines. However, standard WOA has the problems of slow convergence speed, insufficient search accuracy, and limited ability to solve complex problems. In order to solve these problems, this paper proposes a multi-strategy hybrid whale algorithm (MHWOA). Firstly, the calculation speed is accelerated by modifying the parameters; then, the accuracy of the algorithm is improved by incorporating the scatter search strategy; finally, the simulated annealing algorithm is integrated to improve its ability to solve complex problems. The performance differences between MHWOA, the baseline algorithm, and the improved WOA algorithm are compared using the CEC2017 test suite and three real-world engineering problems. In the comparison of processing results of various problems, the calculation accuracy of MHWOA is improved by no less than 1.96%, the calculation error is reduced by no less than 1.83%, and the execution time is improved by no less than 5.6%. In the CNN-MHWOA-based time series electricity load forecasting problem, MHWOA shows the advantages of reduced error and improved fitting degree with the true value compared with the standard WOA.

10 February 2023 in Processes
Verified
Journal Article
Open access
PDF file
XXXie Xie
Xie Xie
YZYongyue Zheng
Yongyue Zheng
TMTianwei Mu
Tianwei Mu
FWFucai Wan
Fucai Wan
HDHai Dong
Hai Dong
This research is motivated by the practical pre-steelmaking stage in large iron and steel companies, which have steady and heavy demands for the steelmaking production process. Our problem studied the pre-steelmaking stage, which consists of two steps that are needed in each convertor before the steelmaking process. During each step, a necessary transportation must be operated by a crane. In contrast to the classical two-machine flowshop problem during which both machines are fixed, these transporting operations are performed by two mounted, removeable cranes. Our problem is scheduling two-crane operations for the sake of minimizing the last convertors’ completion time (makespan); that is, the last finish time among the total operation of the two cranes is minimized. This study was concerned with resolving the interference between two cranes by determining the sequence of loading operations and how each crane avoids the other in order to let it complete its next operation first. A mixed integer linear programming (MILP) model was developed to represent the problem, and we further present the computational complexity of the problem. The result implies that our problem is very difficult to solve, and it is computationally challenging to solve the model. A special case is provided, which can be optimally solved in polynomial time. Furthermore, an evolutionary algorithm cuckoo search (CS) algorithm was attempted to obtain near-optimal solutions for medium- and large-scale problems. Finally, the efficiency and effectiveness of our methods were validated by numerical results in both simulated instances as well as real data from a practical production process.