Search results

Nature’s evolution has shaped intelligent behaviors in creatures like insects and birds, inspiring the field of Swarm Intelligence. Researchers have developed bio-inspired algorithms to address complex optimization problems efficiently. These algorithms strike a balance between computational efficiency and solution optimality, attracting significant attention across domains.

Bio-inspired optimization techniques for feature engineering and its applications are systematically reviewed with chief objective of assessing statistical influence and significance of “Bio-inspired optimization”-based computational models by referring to vast research literature published between year 2015 and 2022.

The Scopus and Web of Science databases were explored for review with focus on parameters such as country-wise publications, keyword occurrences and citations per year. Springer and IEEE emerge as the most creative publishers, with indicative prominent and superior journals, namely, PLoS ONE, Neural Computing and Applications, Lecture Notes in Computer Science and IEEE Transactions. The “National Natural Science Foundation” of China and the “Ministry of Electronics and Information Technology” of India lead in funding projects in this area. China, India and Germany stand out as leaders in publications related to bio-inspired algorithms for feature engineering research.

The review findings integrate various bio-inspired algorithm selection techniques over a diverse spectrum of optimization techniques. Anti colony optimization contributes to decentralized and cooperative search strategies, bee colony optimization (BCO) improves collaborative decision-making, particle swarm optimization leads to exploration-exploitation balance and bio-inspired algorithms offer a range of nature-inspired heuristics.

In order to solve the problems faced by First Order Reliability Method (FORM) and First Order Saddlepoint Approximation (FOSA) in structural reliability optimization, this paper aims to propose a new Reliability-based Design Optimization (RBDO) strategy for offshore engineering structures based on Original Probabilistic Model (OPM) decoupling strategy. The application of this innovative technique to other maritime structures has the potential to substantially improve their design process by optimizing cost and enhancing structural reliability.

In the strategy proposed by this paper, sequential optimization and reliability assessment method and surrogate model are used to improve the efficiency for solving RBDO. The strategy is applied to the analysis of two marine engineering structure cases of ship cargo hold structure and frame ring of underwater skirt pile gripper. The effectiveness of the method is proved by comparing the original design and the optimized results.

In this paper, the proposed new RBDO strategy is used to optimize the design of the ship cargo hold structure and the frame ring of the underwater skirt pile gripper. According to the results obtained, compared with the original design, the structure of optimization design has better reliability and stability, and reduces the risk of failure. This optimization can also better balance the relationship between performance and cost. Therefore, it is recommended for related RBDO problems in the field of marine engineering.

In view of the limitations of FORM and FOSA that may produce multiple MPPs for a single performance function, the new RBDO strategy proposed in this study provides valuable insights and robust methods for the optimization design of offshore engineering structures. It emphasizes the importance of combining advanced MPP search technology and integrating SORA and surrogate models to achieve more economical and reliable design.

This study aims to propose a more precise method for robust design optimization of mechanical structures with black-box problems, while also considering the efficiency of uncertainty analysis.

The method first introduces a dual adaptive chaotic flower pollination algorithm (DACFPA) to overcome the shortcomings of the original flower pollination algorithm (FPA), such as its susceptibility to poor accuracy and convergence efficiency when dealing with complex optimization problems. Furthermore, a DACFPA-Kriging model is developed by optimizing the relevant parameter of Kriging model via DACFPA. Finally, the dual Kriging model is constructed to improve the efficiency of uncertainty analysis, and a robust design optimization method based on DACFPA-Dual-Kriging is proposed.

The DACFPA outperforms the FPA, particle swarm optimization and gray wolf optimization algorithms in terms of solution accuracy, convergence speed and capacity to avoid local optimal solutions. Additionally, the DACFPA-Kriging model exhibits superior prediction accuracy and robustness contrasted with the original Kriging and FPA-Kriging. The proposed method for robust design optimization based on DACFPA-Dual-Kriging is applied to the motor hanger of the electric multiple units as an engineering case study, and the results confirm a significant reduction in the fluctuation of the maximum equivalent stress.

This study represents the initial attempt to enhance the prediction accuracy of the Kriging model using the improved FPA and to combine the dual Kriging model for uncertainty analysis, providing an idea for the robust optimization design of mechanical structure with black-box problem.

This research aims to create a methodology that integrates optimization techniques into preliminary cost estimates and predicts the impacts of design alternatives of steel pedestrian bridges (SPBs). The cost estimation process uses two main parameters, but the main goal is to create a cost estimation model.

This study explores a flexible model design that uses computing capabilities for decision-making. Using cost optimization techniques, the model can select an optimal pedestrian bridge system based on multiple criteria that may change independently. This research focuses on four types of SPB systems prevalent in Egypt and worldwide. The study also suggests developing a computerized cost and weight optimization model that enables decision-makers to select the optimal system for SPBs in keeping up with the criteria established for that system.

In this paper, the authors developed an optimization model for cost estimates of SPBs. The model considers two main parameters: weight and cost. The main contribution of this study based on a parametric study is to propose an approach that enables structural engineers and designers to select the optimum system for SPBs.

The implications of this research from a practical perspective are that the study outlines a feasible approach to develop a computerized model that utilizes the capabilities of computing for quick cost optimization that enables decision-makers to select the optimal system for four common SPBs based on multiple criteria that may change independently and in concert with cost optimization during the preliminary design stage.

The model can choose an optimal system for SPBs based on multiple criteria that may change independently and in concert with cost optimization. The resulting optimization model can forecast the optimum cost of the SPBs for different structural spans and road spans based on local unit costs of materials cost of steel structures, fabrication, erection and painting works.

The authors developed a computerized model that uses spreadsheet software's capabilities for cost optimization, enabling decision-makers to select the optimal system for SPBs meeting the criteria established for such a system. Based on structural characteristics and material unit costs, this study shows that using the optimization model for estimating the total direct cost of SPB systems, the project cost can be accurately predicted based on the conceptual design status, and positive prediction outcomes are achieved.

The purpose of this paper is to propose a novel improved teaching and learning-based algorithm (TLBO) to enhance its convergence ability and solution accuracy, making it more suitable for solving large-scale optimization issues.

Utilizing multiple cooperation mechanisms in teaching and learning processes, an improved TBLO named CTLBO (collectivism teaching-learning-based optimization) is developed. This algorithm introduces a new preparation phase before the teaching and learning phases and applies multiple teacher–learner cooperation strategies in teaching and learning processes. Applying modularization idea, based on the configuration structure of operators of CTLBO, six variants of CTLBO are constructed. For identifying the best configuration, 30 general benchmark functions are tested. Then, three experiments using CEC2020 (2020 IEEE Conference on Evolutionary Computation)-constrained optimization problems are conducted to compare CTLBO with other algorithms. At last, a large-scale industrial engineering problem is taken as the application case.

Experiment with 30 general unconstrained benchmark functions indicates that CTLBO-c is the best configuration of all variants of CTLBO. Three experiments using CEC2020-constrained optimization problems show that CTLBO is one powerful algorithm for solving large-scale constrained optimization problems. The application case of industrial engineering problem shows that CTLBO and its variant CTLBO-c can effectively solve the large-scale real problem, while the accuracies of TLBO and other meta-heuristic algorithm are far lower than CLTBO and CTLBO-c, revealing that CTLBO and its variants can far outperform other algorithms. CTLBO is an excellent algorithm for solving large-scale complex optimization issues.

The innovation of this paper lies in the improvement strategies in changing the original TLBO with two-phase teaching–learning mechanism to a new algorithm CTLBO with three-phase multiple cooperation teaching–learning mechanism, self-learning mechanism in teaching and group teaching mechanism. CTLBO has important application value in solving large-scale optimization problems.

The paper proposed a fast procedure for solving the reliability-based robust design optimization (RBRDO) by modifying the RBRDO formulation and transforming it into a series of RBRDO subproblems. Then for each subproblem, the objective function, constraint function and reliability index are approximated using Taylor series expansion, and their approximate forms depend on the deterministic design vector rather than the random vector and the uncertain estimation in the inner loop of RBRDO can be avoided. In this way, it can greatly reduce the evaluation number of performance function. Lastly, the trust region method is used to manage the above sequential RBRDO subproblems for convergence.

As is known, RBRDO is nested optimization, where the outer loop updates the design vector and the inner loop estimate the uncertainties. When solving the RBRDO, a large evaluation number of performance functions are needed. Aiming at this issue, the paper proposed a fast integrated procedure for solving the RBRDO by reducing the evaluation number for the performance functions. First, it transforms the original RBRDO problem into a series of RBRDO subproblems. In each subproblem, the objective function, constraint function and reliability index caused are approximated using simple explicit functions that solely depend on the deterministic design vector rather than the random vector. In this way, the need for extensive sampling simulation in the inner loop is greatly reduced. As a result, the evaluation number for performance functions is significantly reduced, leading to a substantial reduction in computation cost. The trust region method is then employed to handle the sequential RBRDO subproblems, ensuring convergence to the optimal solutions. Finally, the engineering test and the application are presented to illustrate the effectiveness and efficiency of the proposed methods.

The paper proposes a fast procedure of solving the RBRDO can greatly reduce the evaluation number of performance function within the RBRDO and the computation cost can be saved greatly, which makes it suitable for engineering applications.

The standard deviation of the original objective function of the RBRDO is replaced by the mean and the reliability index of the original objective function, which are further approximated by using Taylor series expansion and their approximate forms depend on the deterministic design vector rather than the random vector. Moreover, the constraint functions are also approximated by using Taylor series expansion. In this way, the uncertainty estimation of the performance functions (i.e. the mean of the objective function, the constraint functions) and the reliability index of the objective function are avoided within the inner loop of the RBRDO.

Metaheuristic algorithms based on biology, evolutionary theory and physical principles, have been widely developed for complex global optimization. This paper aims to present a new hybrid optimization algorithm that combines the characteristics of biogeography-based optimization (BBO), invasive weed optimization (IWO) and genetic algorithms (GAs).

The significant difference between the new algorithm and original optimizers is a periodic selection scheme for offspring. The selection criterion is a function of cyclic discharge and the fitness of populations. It differs from traditional optimization methods where the elite always gains advantages. With this method, fitter populations may still be rejected, while poorer ones might be likely retained. The selection scheme is applied to help escape from local optima and maintain solution diversity.

The efficiency of the proposed method is tested on 13 high-dimensional, nonlinear benchmark functions and a homogenous slope stability problem. The results of the benchmark function show that the new method performs well in terms of accuracy and solution diversity. The algorithm converges with a magnitude of 10-4, compared to 102 in BBO and 10-2 in IWO. In the slope stability problem, the safety factor acquired by the analogy of slope erosion (ASE) is closer to the recommended value.

This paper introduces a periodic selection strategy and constructs a hybrid optimizer, which enhances the global exploration capacity of metaheuristic algorithms.

Competitive tendering in South Africa is often associated with procurement based on the lowest fee tendered. Previous research on this topic did not provide in-depth examinations of how pricing within consulting engineering companies was affected by competitive tendering nor did it illuminate the extent to which professional services were impacted by competitive tendering. This paper aims to examine the implications of competitive tendering on pricing and delivery of consulting engineering services in South Africa.

A survey research strategy with a questionnaire as the research instrument elicited qualitative data from 28 experienced consulting engineers in South Africa. Thematic analysis was used to analyse qualitative data from the questionnaires.

Three key themes were identified, namely: considerations when determining consulting engineering fees on competitively tendered projects; the impact of reduced fees due to competitive tendering on the delivery of consulting engineering services; and interventions to prevent unsustainably “low” professional fees. Many consulting engineers in South Africa still determine fees using fee scales, while other considerations include resources, project complexity, risk, etc. Most participants asserted that design optimisation/value engineering, training, meetings and construction monitoring were adversely impacted by “low” fees.

This paper provides in-depth qualitative feedback from experienced consulting engineers (most having more than 20 years’ experience) on a topical issue in the South African construction industry. Thematic analysis was a novel method of analysis that was not used previously in this area of study.

This paper aims to present a new hybrid algorithm of Particle Swarm Optimization and the Genetic Algorithm (PSOGA) to optimize the space trusses with continuous design variables. The PSOGA is an efficient hybridized algorithm to solve optimization problems.

These algorithms have shown outstanding performance in solving optimization problems with continuous variables. The PSO conceptually models the social behavior of birds, in which individual birds exchange information about their position, velocity and fitness. The behavior of a flock is influencing the probability of migration to other regions with high fitness. The GAs procedure is based on the mechanism of natural selection. The present study uses mutation, random selection and reproduction to reach the best genetic algorithm by the operators of natural genetics. Thus, only identical chromosomes or particles can be converged.

In this research, using the idea of hybridization PSO and GA algorithms are hybridized and a new meta-heuristic algorithm is developed to minimize the space trusses with continuous design variables. To showing the efficiency and robustness of the new algorithm, several benchmark problems are solved and compared with other researchers.

The results indicate that the hybrid PSO algorithm improved in both exploration and exploitation. The PSO algorithm can be used to minimize the weight of structural problems under stress and displacement constraints.

Multi-objective is a complex problem that appears in real life while these objectives are conflicting. The swarm intelligence algorithm is often used to solve such multi-objective problems. Due to its strong search ability and convergence ability, particle swarm optimization algorithm is proposed, and the multi-objective particle swarm optimization algorithm is used to solve multi-objective optimization problems. However, the particles of particle swarm optimization algorithm are easy to fall into local optimization because of their fast convergence. Uneven distribution and poor diversity are the two key drawbacks of the Pareto front of multi-objective particle swarm optimization algorithm. Therefore, this paper aims to propose an improved multi-objective particle swarm optimization algorithm using adaptive Cauchy mutation and improved crowding distance.

In this paper, the proposed algorithm uses adaptive Cauchy mutation and improved crowding distance to perturb the particles in the population in a dynamic way in order to help the particles trapped in the local optimization jump out of it which improves the convergence performance consequently.

In order to solve the problems of uneven distribution and poor diversity in the Pareto front of multi-objective particle swarm optimization algorithm, this paper uses adaptive Cauchy mutation and improved crowding distance to help the particles trapped in the local optimization jump out of the local optimization. Experimental results show that the proposed algorithm has obvious advantages in convergence performance for nine benchmark functions compared with other multi-objective optimization algorithms.

In order to help the particles trapped in the local optimization jump out of the local optimization which improves the convergence performance consequently, this paper proposes an improved multi-objective particle swarm optimization algorithm using adaptive Cauchy mutation and improved crowding distance.