Optimization is an important and fundamental challenge to solve optimization problems in different scientific disciplines. In this paper, a new stochastic nature-inspired optimization algorithm called Pelican Optimization Algorithm (POA) is introduced. The main idea in designing the proposed POA is simulation of the natural behavior of pelicans during hunting. In POA, search agents are pelicans that search for food sources. The mathematical model of the POA is presented for use in solving optimization issues. The performance of POA is evaluated on twenty-three objective functions of different unimodal and multimodal types. The optimization results of unimodal functions show the high exploitation ability of POA to approach the optimal solution while the optimization results of multimodal functions indicate the high ability of POA exploration to find the main optimal area of the search space. Moreover, four engineering design issues are employed for estimating the efficacy of the POA in optimizing real-world applications. The findings of POA are compared with eight well-known metaheuristic algorithms to assess its competence in optimization. The simulation results and their analysis show that POA has a better and more competitive performance via striking a proportional balance between exploration and exploitation compared to eight competitor algorithms in providing optimal solutions for optimization problems.

• Klíčová slova
• nature inspired, optimization, optimization problem, pelican, population-based algorithm, stochastic, swarm intelligence,
• MeSH
• algoritmy * MeSH
• počítačová simulace MeSH
• teoretické modely * MeSH
• Publikační typ
• časopisecké články MeSH

Balancing diversity and convergence among solutions in many-objective optimization is challenging, particularly in high-dimensional spaces with conflicting objectives. This paper presents the Many-Objective Marine Predator Algorithm (MaOMPA), an adaptation of the Marine Predators Algorithm (MPA) specifically enhanced for many-objective optimization tasks. MaOMPA integrates an elitist, non-dominated sorting and crowding distance mechanism to maintain a well-distributed set of solutions on the Pareto front. MaOMPA improves upon traditional metaheuristic methods by achieving a robust balance between exploration and exploitation using the predator-prey interaction model. The algorithm underwent evaluation on various benchmarks together with complex real-world engineering problems where it showed superior outcomes when compared against state-of-the-art generational distance and hypervolume and coverage metrics. Engineers and researchers can use MaOMPA as an effective reliable tool to address complex optimization scenarios in engineering design. The MaOMPA source code is available at https://github.com/kanak02/MaOMPA .

• Klíčová slova
• Convergence, Diversity, Information feedback mechanism, Many-objective optimization, Marine predator algorithm, Metaheuristic algorithm,
• MeSH
• algoritmy * MeSH
• potravní řetězec * MeSH
• predátorské chování * MeSH
• zvířata MeSH
• Check Tag
• zvířata MeSH
• Publikační typ
• časopisecké články MeSH

Many important engineering optimization problems require a strong and simple optimization algorithm to achieve the best solutions. In 2020, Rao introduced three non-parametric algorithms, known as Rao algorithms, which have garnered significant attention from researchers worldwide due to their simplicity and effectiveness in solving optimization problems. In our simulation studies, we have developed a new version of the Rao algorithm called the Fully Informed Search Algorithm (FISA), which demonstrates acceptable performance in optimizing real-world problems while maintaining the simplicity and non-parametric nature of the original algorithms. We evaluate the effectiveness of the suggested FISA approach by applying it to optimize the shifted benchmark functions, such as those provided in CEC 2005 and CEC 2014, and by using it to design mechanical system components. We compare the results of FISA to those obtained using the original RAO method. The outcomes obtained indicate the efficacy of the proposed new algorithm, FISA, in achieving optimized solutions for the aforementioned problems. The MATLAB Codes of FISA are publicly available at https://github.com/ebrahimakbary/FISA.

• Klíčová slova
• Constrained engineering optimization, Fully Informed Search Algorithm (FISA), Optimization, Rao algorithms,
• Publikační typ
• časopisecké články MeSH

This research introduces the Multi-Objective Liver Cancer Algorithm (MOLCA), a novel approach inspired by the growth and proliferation patterns of liver tumors. MOLCA emulates the evolutionary tendencies of liver tumors, leveraging their expansion dynamics as a model for solving multi-objective optimization problems in engineering design. The algorithm uniquely combines genetic operators with the Random Opposition-Based Learning (ROBL) strategy, optimizing both local and global search capabilities. Further enhancement is achieved through the integration of elitist non-dominated sorting (NDS), information feedback mechanism (IFM) and Crowding Distance (CD) selection method, which collectively aim to efficiently identify the Pareto optimal front. The performance of MOLCA is rigorously assessed using a comprehensive set of standard multi-objective test benchmarks, including ZDT, DTLZ and various Constraint (CONSTR, TNK, SRN, BNH, OSY and KITA) and real-world engineering design problems like Brushless DC wheel motor, Safety isolating transformer, Helical spring, Two-bar truss and Welded beam. Its efficacy is benchmarked against prominent algorithms such as the non-dominated sorting grey wolf optimizer (NSGWO), multiobjective multi-verse optimization (MOMVO), non-dominated sorting genetic algorithm (NSGA-II), decomposition-based multiobjective evolutionary algorithm (MOEA/D) and multiobjective marine predator algorithm (MOMPA). Quantitative analysis is conducted using GD, IGD, SP, SD, HV and RT metrics to represent convergence and distribution, while qualitative aspects are presented through graphical representations of the Pareto fronts. The MOLCA source code is available at: https://github.com/kanak02/MOLCA.

• Klíčová slova
• Engineering design optimization, Liver cancer algorithm, MOLCA, Multi objective optimization, Non-dominated solution, Pareto front, Pareto solution,
• Publikační typ
• časopisecké články MeSH

The charge-flipping algorithm (CFA) is a member of the diverse family of dual-space iterative phasing algorithms. These algorithms use alternating modifications in direct and reciprocal space to find a solution to the phase problem. The current state-of-the-art CFA is reviewed and it is put in the context of related dual-space algorithms with relevance for crystallography. The CFA has found applications in many crystallographic problems. The principal applications in various fields are described with sections devoted to routine structure solution, the solution of complex structures from powder diffraction data, the solution of incommensurately modulated crystals and quasicrystals, macromolecular crystallography and single-particle imaging.

• Klíčová slova
• charge-flipping algorithm, dual-space methods, structure solution,
• Publikační typ
• časopisecké články MeSH

With the whirlwind evolution of technology, the quantity of stored data within datasets is rapidly expanding. As a result, extracting crucial and relevant information from said datasets is a gruelling task. Feature selection is a critical preprocessing task for machine learning to reduce the excess data in a set. This research presents a novel quasi-reflection learning arithmetic optimization algorithm - firefly search, an enhanced version of the original arithmetic optimization algorithm. Quasi-reflection learning mechanism was implemented for enhancement of population diversity, while firefly algorithm metaheuristics were used to improve the exploitation abilities of the original arithmetic optimization algorithm. The aim of this wrapper-based method is to tackle a specific classification problem by selecting an optimal feature subset. The proposed algorithm is tested and compared with various well-known methods on ten unconstrained benchmark functions, then on twenty-one standard datasets gathered from the University of California, Irvine Repository and Arizona State University. Additionally, the proposed approach is applied to the Corona disease dataset. The experimental results verify the improvements of the presented method and their statistical significance.

• Klíčová slova
• Aritmetic optimisation algorithm, Feature selection, Firefly algorithm, Metaheuristics, Quasi-reflection-based learning,
• Publikační typ
• časopisecké články MeSH

Knowledge of soft tissue fiber structure is necessary for accurate characterization and modeling of their mechanical response. Fiber configuration and structure informs both our understanding of healthy tissue physiology and of pathological processes resulting from diseased states. This study develops an automatic algorithm to simultaneously estimate fiber global orientation, abundance, and waviness in an investigated image. To our best knowledge, this is the first validated algorithm which can reliably separate fiber waviness from its global orientation for considerably wavy fibers. This is much needed feature for biological tissue characterization. The algorithm is based on incremental movement of local regions of interest (ROI) and analyzes two-dimensional images. Pixels belonging to the fiber are identified in the ROI, and ROI movement is determined according to local orientation of fiber within the ROI. The algorithm is validated with artificial images and ten images of porcine trachea containing wavy fibers. In each image, 80-120 fibers were tracked manually to serve as verification. The coefficient of determination R2 between curve lengths and histograms documenting the fiber waviness and global orientation were used as metrics for analysis. Verification-confirmed results were independent of image rotation and degree of fiber waviness, with curve length accuracy demonstrated to be below 1% of fiber curved length. Validation-confirmed median and interquartile range of R2, respectively, were 0.90 and 0.05 for curved length, 0.92 and 0.07 for waviness, and 0.96 and 0.04 for global orientation histograms. Software constructed from the proposed algorithm was able to track one fiber in about 1.1 s using a typical office computer. The proposed algorithm can reliably and accurately estimate fiber waviness, curve length, and global orientation simultaneously, moving beyond the limitations of prior methods.

• Klíčová slova
• automated algorithm, collagen structure, fiber orientation, fiber waviness, image analysis, soft tissue analysis,
• MeSH
• algoritmy * MeSH
• kolagen MeSH
• prasata MeSH
• software * MeSH
• zvířata MeSH
• Check Tag
• zvířata MeSH
• Publikační typ
• časopisecké články MeSH
• Názvy látek
• kolagen MeSH

In this paper, we introduce an improved water strider algorithm designed to solve the inverse form of the Burgers-Huxley equation, a nonlinear partial differential equation. Additionally, we propose a physics-informed neural network to address the same inverse problem. To demonstrate the effectiveness of the new algorithm and conduct a comparative analysis, we compare the results obtained using the improved water strider algorithm against those derived from the original water strider algorithm, a genetic algorithm, and a physics-informed neural network with three hidden layers. Solving the inverse form of nonlinear partial differential equations is crucial in many scientific and engineering applications, as it allows us to infer unknown parameters or initial conditions from observed data. This process is often challenging due to the complexity and nonlinearity of the equations involved. Meta-heuristic algorithms and neural networks have proven to be effective tools in addressing these challenges. The numerical results affirm the efficiency of our proposed method in solving the inverse form of the Burgers-Huxley equation. The best results were obtained using the improved water strider algorithm and the physics-informed neural network with 10,000 iterations. With this iteration count, the mean absolute error of these algorithms is O ( 10 - 4 ) . Additionally, the improved water strider algorithm is nearly four times faster than the physics-informed neural network. All algorithms were executed on a computing system equipped with an Intel(R) Core(TM) i7-7500U processor and 12.00 GB of RAM, and were implemented in MATLAB.

• Klíčová slova
• Artificial intelligence, Burgers-Huxley equation, Genetic algorithm, Physics-informed neural networks, Water strider algorithm,
• Publikační typ
• časopisecké články MeSH

The whale optimization algorithm (WOA) is a widely used metaheuristic optimization approach with applications in various scientific and industrial domains. However, WOA has a limitation of relying solely on the best solution to guide the population in subsequent iterations, overlooking the valuable information embedded in other candidate solutions. To address this limitation, we propose a novel and improved variant called Pbest-guided differential WOA (PDWOA). PDWOA combines the strengths of WOA, particle swarm optimizer (PSO), and differential evolution (DE) algorithms to overcome these shortcomings. In this study, we conduct a comprehensive evaluation of the proposed PDWOA algorithm on both benchmark and real-world optimization problems. The benchmark tests comprise 30-dimensional functions from CEC 2014 Test Functions, while the real-world problems include pressure vessel optimal design, tension/compression spring optimal design, and welded beam optimal design. We present the simulation results, including the outcomes of non-parametric statistical tests including the Wilcoxon signed-rank test and the Friedman test, which validate the performance improvements achieved by PDWOA over other algorithms. The results of our evaluation demonstrate the superiority of PDWOA compared to recent methods, including the original WOA. These findings provide valuable insights into the effectiveness of the proposed hybrid WOA algorithm. Furthermore, we offer recommendations for future research to further enhance its performance and open new avenues for exploration in the field of optimization algorithms. The MATLAB Codes of FISA are publicly available at https://github.com/ebrahimakbary/PDWOA.

• Klíčová slova
• Differential evolution algorithm, Friedman test, Metaheuristic optimization, Pbest-guided algorithm, Statistical tests, Whale optimization algorithm, Wilcoxon signed-rank test,
• Publikační typ
• časopisecké články MeSH

This study proposes the One-to-One-Based Optimizer (OOBO), a new optimization technique for solving optimization problems in various scientific areas. The key idea in designing the suggested OOBO is to effectively use the knowledge of all members in the process of updating the algorithm population while preventing the algorithm from relying on specific members of the population. We use a one-to-one correspondence between the two sets of population members and the members selected as guides to increase the involvement of all population members in the update process. Each population member is chosen just once as a guide and is only utilized to update another member of the population in this one-to-one interaction. The proposed OOBO's performance in optimization is evaluated with fifty-two objective functions, encompassing unimodal, high-dimensional multimodal, and fixed-dimensional multimodal types, and the CEC 2017 test suite. The optimization results highlight the remarkable capacity of OOBO to strike a balance between exploration and exploitation within the problem-solving space during the search process. The quality of the optimization results achieved using the proposed OOBO is evaluated by comparing them to eight well-known algorithms. The simulation findings show that OOBO outperforms the other algorithms in addressing optimization problems and can give more acceptable quasi-optimal solutions. Also, the implementation of OOBO in six engineering problems shows the effectiveness of the proposed approach in solving real-world optimization applications.

• Klíčová slova
• engineering, exploitation, exploration, metaheuristic algorithm, one-to-one correspondence, sensors,
• Publikační typ
• časopisecké články MeSH