Effect of process conditions on product yield and composition of fast pyrolysis of Eucalyptus grandis in fluidized bed reactor

Aghdas Heidari,Ralph Stahl,Habibollah Younesi,Alimorad Rashidi,Nicole Troeger,Ali Asghar Ghoreyshi 한국공업화학회 2014 Journal of Industrial and Engineering Chemistry Vol.20 No.4

The fast pyrolysis of eucalyptus wood was conducted in a continuous-feed fluidized bed reactor. The effect of pyrolysis temperature, nitrogen flow rate, biomass feed rate and biomass feed size was investigated. The results showed that with increasing nitrogen flow rate, the bio-oil yield firstly increased from 51.9% to 61.1% and then decreased to 59.9%. The maximum percentage of syringol and guaiacol were 16.27 and 8.98 at temperature of 450 and 600 ℃, respectively. The maximum bio-oil yield was 71.1%. The maximum percentage of CO was 44.1 at a flow rate 11.1 L/min, feed size 1.5 and feeding rate 1.7 g/min.

Advanced orthogonal learning and Gaussian barebone hunger games for engineering design

Zhou Xinsen,Gui Wenyong,Heidari Ali Asghar,Cai Zhennao,Elmannai Hela,Hamdi Monia,Liang Guoxi,Chen Huiling 한국CDE학회 2022 Journal of computational design and engineering Vol.9 No.5

The hunger games search (HGS) algorithm is a recently proposed population-based optimization algorithm that mimics a common phenomenon of animals searching for food due to hunger stimuli and has a simple and easy-to- understand structure. However, the original HGS still suffers from shortcomings, such as low population diversity and the tendency to fall into local optima. To remedy these shortcomings, an improved HGS, called OCBHGS, is proposed, which introduces three main strategies, namely the chaotic initialization strategy, the Gaussian barebone mechanism, and the orthogonal learning strategy. Firstly, chaotic mapping is used for initialization to improve the quality of the initialized population. Secondly, the embedding of the Gaussian barebone mechanism effectively improves the diversity of the population, facilitates the communication between members, and helps the population avoid falling into local optima. Finally, the orthogonal learning strategy can extend the domain exploration and improve the solution accuracy of the algorithm. We conducted extensive experiments in the CEC2014 competition benchmark function, comparing OCBHGS with nine other metaheuristics and 12 improved algorithms. Also, the experimental results were evaluated using Wilcoxon signed-rank tests to analyze the experimental results comprehensively. In addition, OCBHGS was used to solve three constrained real-world engineering problems. The experimental results show that OCBHGS has a significant advantage in convergence speed and accuracy. As a result, OCBHGS ranks first in overall performance compared to other optimizers.

Individual disturbance and neighborhood mutation search enhanced whale optimization: performance design for engineering problems

Qiao Shimeng,Yu Helong,Heidari Ali Asghar,El-Saleh Ayman A,Cai Zhennao,Xu Xingmei,Mafarja Majdi,Chen Huiling 한국CDE학회 2022 Journal of computational design and engineering Vol.9 No.5

The whale optimizer is a popular metaheuristic algorithm, which has the problems of weak global exploration, easy falling into local optimum, and low optimization accuracy when searching for the optimal solution. To solve these problems, this paper proposes an enhanced whale optimization algorithm (WOA) based on the worst individual disturbance (WD) and neighborhood mutation search (NM), named WDNMWOA, which employed WD to enhance the ability to jump out of local optimum and global exploration, adopted NM to enhance the possibility of individuals approaching the optimal solution. The superiority of WDNMWOA is demonstrated by representative IEEE CEC2014, CEC2017, CEC2019, and CEC2020 benchmark functions and four engineering examples. The experimental results show that thes WDNMWOA has better convergence accuracy and strong optimization ability than the original WOA.

Salp swarm algorithm with iterative mapping and local escaping for multi-level threshold image segmentation: a skin cancer dermoscopic case study

Hao Shuhui,Huang Changcheng,Heidari Ali Asghar,Chen Huiling,Li Lingzhi,Algarni Abeer D.,Elmannai Hela,Xu Suling 한국CDE학회 2023 Journal of computational design and engineering Vol.10 No.2

If found and treated early, fast-growing skin cancers can dramatically prolong patients’ lives. Dermoscopy is a convenient and reliable tool during the fore-period detection stage of skin cancer, so the efficient processing of digital images of dermoscopy is particularly critical to improving the level of a skin cancer diagnosis. Notably, image segmentation is a part of image preprocessing and essential technical support in the process of image processing. In addition, multi-threshold image segmentation (MIS) technology is extensively used due to its straightforward and effective features. Many academics have coupled different meta-heuristic algorithms with MIS to raise image segmentation quality. Nonetheless, these meta-heuristic algorithms frequently enter local optima. Therefore, this paper suggests an improved salp swarm algorithm (ILSSA) method that combines iterative mapping and local escaping operator to address this drawback. Besides, this paper also proposes the ILSSA-based MIS approach, which is triumphantly utilized to segment dermoscopic images of skin cancer. This method uses two-dimensional (2D) Kapur’s entropy as the objective function and employs non-local means 2D histogram to represent the image information. Furthermore, an array of benchmark function test experiments demonstrated that ILSSA could alleviate the local optimal problem more effectively than other compared algorithms. Afterward, the skin cancer dermoscopy image segmentation experiment displayed that the proposed ILSSA-based MIS method obtained superior segmentation results than other MIS peers and was more adaptable at different thresholds.

Performance optimization of annealing salp swarm algorithm: frameworks and applications for engineering design

Song Jiuman,Chen Chengcheng,Heidari Ali Asghar,Liu Jiawen,Yu Helong,Chen Huiling 한국CDE학회 2022 Journal of computational design and engineering Vol.9 No.2

Swarm salp algorithm is a swarm intelligence optimization algorithm enlightened by the movement and foraging behaviors of the salp population. The salp swarm algorithm (SSA) has a simple structure and fast processing speed and can gain significant results on objective functions with fewer local optima. However, it has poor exploration ability and is easy to suffer from the local optimal solutions, so it performs poorly on multimodal objective functions. Besides, its unfair balance of exploration and exploitation is another notable shortcoming. To ameliorate these shortcomings and enhance the algorithm’s performance on multimodal functions, this research proposes simulated annealing (SA) improved salp swarm algorithm (SASSA). SASSA embeds the SA strategy into the followers’ position updating method of SSA, performs a certain number of iterations of the SA strategy, and uses Lévy flight to realize the random walk in the SA strategy. SASSA and 23 original and improved competitive algorithms are compared on 30 IEEE CEC2017 benchmark functions. SASSA ranked first in the Friedman test. Compared with SSA, SASSA can obtain better solutions on 27 benchmark functions. The balance and diversity experiment and analysis of SSA and SASSA are carried out. SASSA’s practicability is verified by solving five engineering problems and the fertilizer effect function problem. Experimental and statistical results reveal that the proposed SASSA has strong competitiveness and outperforms all the competitors. SASSA has excellent exploration ability, suitable for solving composition functions with multiple peaks. Meanwhile, SASSA brings about a good balance of exploration and exploitation and dramatically improves the quality of the solutions.

Multi-strategy enhanced kernel search optimization and its application in economic emission dispatch problems

Dong Ruyi,LIUYANAN,Wang Siwen,Heidari Ali Asghar,Wang Mingjing,Chen Yi,Wang Shuihua,Chen Huiling,Zhang Yudong 한국CDE학회 2024 Journal of computational design and engineering Vol.11 No.1

The kernel search optimizer (KSO) is a recent metaheuristic optimization algorithm that is based on kernel theory, eliminating the need for hyper-parameter adjustments, and demonstrating excellent global search capabilities. However, the original KSO exhibits insufficient accuracy in local search, and there is a high probability that it may fail to achieve local optimization in complex tasks. Therefore, this paper proposes a multi-strategy enhanced KSO (MSKSO) to enhance the local search ability of the KSO. The MSKSO combines several control strategies, including chaotic initialization, chaotic local search mechanisms, the high-altitude walk strategy (HWS), and the Levy flight (LF), to effectively balance exploration and exploitation. The MSKSO is compared with ten well-known algorithms on 50 benchmark test functions to validate its performance, including single-peak, multi-peak, separable variable, and non-separable variable functions. Additionally, the MSKSO is applied to two real engineering economic emission dispatch (EED) problems in power systems. Experimental results demonstrate that the performance of the MSKSO nearly optimizes that of other well-known algorithms and achieves favorable results on the EED problem. These case studies verify that the MSKSO outperforms other algorithms and can serve as an effective optimization tool.

A horizontal and vertical crossover cuckoo search: optimizing performance for the engineering problems

Su Hang,Zhao Dong,Yu Fanhua,Heidari Ali Asghar,Xu Zhangze,Alotaibi Fahd S,Mafarja Majdi,Chen Huiling 한국CDE학회 2023 Journal of computational design and engineering Vol.10 No.1

As science and technology advance, more engineering-type problems emerge. Technology development has likewise led to an increase in the complexity of optimization problems, and the need for new optimization techniques has increased. The swarm intelligence optimization algorithm is popular among researchers as a flexible, gradient-independent optimization method. The cuckoo search (CS) algorithm in the population intelligence algorithm has been widely used in various fields as a classical optimization algorithm. However, the current CS algorithm can no longer satisfy the performance requirements of the algorithm for current optimization problems. Therefore, in this paper, an improved CS algorithm based on a crossover optimizer (CC) and decentralized foraging (F) strategy is proposed to improve the search ability and the ability to jump out of the local optimum of the CS algorithm (CCFCS). Then, in order to verify the performance of the algorithm, this paper demonstrates the performance of CCFCS from six perspectives: core parameter setting, balance analysis of search and exploitation, the impact of introduced strategies, the impact of population dimension, and comparison with classical algorithms and similar improved algorithms. Finally, the optimization effect of CCFCS on real engineering problems is tested by five classic cases of engineering optimization. According to the experimental results, CCFCS has faster convergence and higher solution quality in the algorithm performance test and maintains the same excellent performance in engineering applications.

Cauchy mutation boosted Harris hawk algorithm: optimal performance design and engineering applications

Shan Weifeng,He Xinxin,Liu Haijun,Heidari Ali Asghar,Wang Maofa,Cai Zhennao,Chen Huiling 한국CDE학회 2023 Journal of computational design and engineering Vol.10 No.2

Harris hawks optimization (HHO) has been accepted as one of the well-established swarm-based methods in the community of optimization and machine learning that primarily works based on multiple dynamic features and various exploratory and exploitative traits. Compared with other optimization algorithms, it has been observed that HHO can obtain high-quality solutions for continuous and constrained complex and real-world problems. While there is a wide variety of strategies in the HHO for dealing with diverse situations, there are chances for sluggish performance, where the convergence rate can gradually slow with time, and the HHO may stay stuck in the current relatively better place and may be unable to explore other better areas. To mitigate this concern, this paper combines the Cauchy mutation mechanism into the HHO algorithm named CMHHO. This idea can boost performance and provide a promising optimizer for solving complex optimization problems. The Cauchy mutation mechanism can speed up the convergence of the solution and help HHO explore more promising regions compared to its basic release. On 30 IEEE CEC2017 benchmark functions, the study compared the proposed CMHHO with various conventional and advanced metaheuristics to validate its performance and quality of solutions. It has been found through experiments that the overall optimization performance of CMHHO is far superior to all competitors. The CMHHO method is applied to four engineering challenges to investigate the capabilities of the proposed algorithm in solving real-world problems, and experimental results show that the suggested algorithm is more successful than existing algorithms.

Opposition-based ant colony optimization with all-dimension neighborhood search for engineering design

Zhao Dong,Liu Lei,Yu Fanhua,Heidari Ali Asghar,Wang Maofa,Chen Huiling,무함마드칸 한국CDE학회 2022 Journal of computational design and engineering Vol.9 No.3

The ant colony optimization algorithm is a classical swarm intelligence algorithm, but it cannot be used for continuous class optimization problems. A continuous ant colony optimization algorithm (ACOR) is proposed to overcome this difficulty. Still, some problems exist, such as quickly falling into local optimum, slow convergence speed, and low convergence accuracy. To solve these problems, this paper proposes a modified version of ACOR called ADNOLACO. There is an opposition-based learning mechanism introduced into ACOR to effectively improve the convergence speed of ACOR. All-dimension neighborhood mechanism is also introduced into ACOR to further enhance the ability of ACOR to avoid getting trapped in the local optimum. To strongly demonstrate these core advantages of ADNOLACO, with the 30 benchmark functions of IEEE CEC2017 as the basis, a detailed analysis of ADNOLACO and ACOR is not only qualitatively performed, but also a comparison experiment is conducted between ADNOLACO and its peers. The results fully proved that ADNOLACO has accelerated the convergence speed and improved the convergence accuracy. The ability to find a balance between local and globally optimal solutions is improved. Also, to show that ADNOLACO has some practical value in real applications, it deals with four engineering problems. The simulation results also illustrate that ADNOLACO can improve the accuracy of the computational results. Therefore, it can be demonstrated that the proposed ADNOLACO is a promising and excellent algorithm based on the results.

Horizontal and vertical crossover of sine cosine algorithm with quick moves for optimization and feature selection

Hu Hanyu,Shan Weifeng,Tang Yixiang,Heidari Ali Asghar,Chen Huiling,Liu Haijun,Wang Maofa,Escorcia-Gutierrez José,Mansour Romany F,Chen Jun 한국CDE학회 2022 Journal of computational design and engineering Vol.9 No.6

The sine cosine algorithm (SCA) is a metaheuristic algorithm proposed in recent years that does not resort to nature-related metaphors but explores and exploits the search space with the help of two simple mathematical functions of sine and cosine. SCA has fewer parameters and a simple structure and is widely used in various fields. However, it tends to fall into local optimality because it does not have a well-balanced exploitation and exploration phase. Therefore, in this paper, a new, improved SCA algorithm (QCSCA) is proposed to improve the performance of the algorithm by introducing a quick move mechanism and a crisscross mechanism to SCA and adaptively improving one of the parameters. To verify the effectiveness of QCSCA, comparison experiments with some conventional metaheuristic algorithms, advanced metaheuristic algorithms, and SCA variants are conducted on IEEE CEC2017 and CEC2013. The experimental results show a significant improvement in the convergence speed and the ability to jump out of the local optimum of the QCSCA. The scalability of the algorithm is verified in the benchmark function. In addition, QCSCA is applied to 14 real-world datasets from the UCI machine learning database for selecting a subset of near-optimal features, and the experimental results show that QCSCA is still very competitive in feature selection (FS) compared to similar algorithms. Our experimental results and analysis show that QCSCA is an effective method for solving global optimization problems and FS problems.