Conventional Genetic Algorithm Research Articles

Design Optimization of a Plate‐Fin Heat Exchanger With Metaheuristic Hybrid Algorithm

ABSTRACTThis paper introduces a novel approach to enhance the heat transfer efficiency of a plate‐fin heat exchanger. The metaheuristic hybrid approach combines particle swarm optimization (PSO) with the genetic algorithm (GA). Seven critical design parameters are used as variables. The research demonstrates the effectiveness of this hybrid method through a case study based on existing literature. The numerical results show the superior performance of the hybrid genetic algorithm particle swarm optimization over conventional GA and PSO techniques. The hybrid method achieves an optimal configuration with increased accuracy in a shorter computational time, offering significant time and cost savings in the design process.

Compensation of phased array antenna electrical performance based on improved genetic algorithm

Phased array antennas are frequently subjected to surface distortions due to environ-mental factors during operation. Such distortions can lead to a deterioration in the electrical performance of the phased array antenna. This study provides an in-depth analysis of the impact of array distortions on electrical performance indicators. An electronic compensation approach, employing an enhanced genetic algorithm, is proposed to mitigate the effects of these distortions. The conventional genetic algorithm has been augmented with an elimination mechanism to boost convergence. This method compensates for amplitude and phase by calculating each element's amplitude and phase of the excitation current, thereby enhancing the convergence performance. Simulations this approach, simulations of rectangular microstrip patch antennas are conducted to validate the effectiveness of this approach. The simulation outcomes reveal that the proposed method significantly improves the antenna's radiation pattern and all performance indicators, confirming its efficacy.

Intelligent Design of Street Lamp in Rural Areas Based on an Improved Genetic Algorithm

This study addresses the demand for more efficient streetlight designs in rural areas by introducing an improved genetic algorithm (GA) to optimize the geometry and placement of streetlight poles. Conventional GAs frequently suffer from premature convergence and becoming trapped in local optima, reducing their effectiveness. To mitigate these issues, this research integrates the genetic algorithm with Sequential Quadratic Programming (SQP), using the quasi-optimal solution generated by the GA as the initial input for the SQP, enhancing both accuracy and stability. The methodology includes developing a geometric model of streetlight poles utilizing point cloud data and extracting the centerline via the optimized GA-SQP approach. Additionally, the study examines the effects of random errors, gross errors, incomplete point cloud data, and centerline deviations on the algorithm's performance.

An exponential variation based PSO for analog circuit sizing in constrained environment

This work presents an Exponential Variation based Particle Swarm Optimization (EV-PSO) algorithm to improve the convergence rate and find an optimal solution to analog circuit optimization problems in a constrained-driven environment. Existing evolutionary algorithms have a lower convergence rate leading to higher design time. This work introduces two novel parameters, ζ1 and ζ2, into the velocity update equation. These parameters dynamically vary with the number of iterations. The algorithm was implemented on the Python platform. The results have shown that, in comparison to the considered existing methods, the exponential variation of the parameters ζ1 and ζ2 in the proposed algorithms have a larger rate of convergence. The proposed EV-PSO has a convergence rate of 27 iterations, which is 57.8%, 65.38%, and 59.1% better than the conventional PSO, differential evolution (DE) and genetic algorithm (GA) respectively. The typical design obtained from the optimal solution is verified through the simulation using 45-nm CMOS technology. The optimal solution presented in this work meets the desired input specifications within the specified constrained environment.

Automatic optimization design of laser triangulation ranging sensors using an improved genetic algorithm

Optical system parameter design is of great importance to ensure the accuracy of asymmetry systems such as laser triangulation ranging systems. However, the system parameter determination often depends on the experience and manual attempts of designers, which is not only time-consuming but also inevitable to introduce human errors. Therefore, in this paper an automatic optimization design method based on nonlinear programming genetic algorithm with elitism strategy (E-NPGA) is proposed, to accurately and fast determine the optimal system parameters of laser triangulation ranging systems assisting in improving the measurement accuracy. Firstly, an optimization model of system parameters is developed under the Scheimpflug rule establishing the constraints for various measurement resolutions and ranges. An image size constraint is constructed for the first time to improve and evaluate the parameter optimization. Secondly, the E-NPGA is proposed with nonlinear optimization and elitism strategy, which can determine the optimal system parameters in 15 iterations avoiding local extremum. In design examples, using the E-NPGA determined system parameters ZEMAX simulation and experimental results of the parameters depended image spot size show a slight relative difference below 0.6%. Moreover, the experiment results demonstrate the sensor system designed by using the E-NPGA enables a distance measurement with submicron absolute error and 10−4 relative uncertainty. The automatic optimization method proposed in this paper is compared with the conventional GA method and PSO method, and it is validated that the convergence accuracy of the proposed method is much higher than the conventional ones.

A Bayesian optimization-genetic algorithm-based approach for automatic parameter calibration of soil models: Application to clay and sand model

This paper develops a novel approach for automatic parameter calibration of soil constitutive models by combining Bayesian optimization (BO) and genetic algorithm (GA). The BO method enables locating the possible point over a large multi-parameter search domain quickly, by which the search domain is no longer required to be accurately pre-defined. Thereafter, the GA is employed to find the best solution within the BO-optimized search space. This calibration procedure can quickly give the best-matched model parameters for both sands and clays even with the same large search space. Taking a critical state-based soil model (Clay And Sand Model (CASM)) as an example, the superiority and capability of the proposed calibration method are examined by comparing experimental data with predicted results for both clays and sands. It is shown that the BO-GA-based approach can reduce errors by 46.4% for clays and 41.2% for sands compared with the conventional GA method and outperforms other traditional optimization algorithms. Eventually, the evolution process of BO and GA is visualized to better understand the principles of automatic parameter calibration, which is followed by model uncertainty analyses.

Transit Dynamic Operation Optimization Using Combination of Stop-Skipping Strategy and Local Route Optimization

The efficient operation and intelligent upgrading of public transportation can effectively enhance the attractiveness of conventional public transportation. In order to improve the delicacy management level of bus operations, this study designed a new dynamic optimization model for single-line bus operations with the dual optimization objectives of the lowest passenger travel cost and lowest operation cost, using a combination of the strategy of stop-skipping control and local route optimization. Simulated annealing (SA) was introduced into the genetic algorithm (GA) to design a hybrid heuristic algorithm for model solving. The effectiveness of the optimization model and the hybrid algorithm were verified and evaluated by using the No. 115 bus line in Ganzhou City as an example. The results showed that the proposed optimization model had a good usability, which can effectively improve the average vehicle speed, shorten the overall waiting time of passengers, and enhance the operational efficiency of the line. The hybrid algorithm saw significant improvement in terms of the iteration speed and the quality of the optimal solution compared with the conventional genetic algorithm.

Non-uniform optical phased array based on dual-adaption genetic algorithm improved by chaos sequence

To address the issue of diminishing peak side lobe levels (PSLL) in non-uniform optical phased array (OPA) as steering angle increases, we introduce a dual-adaption genetic algorithm (DAGA) based on chaos sequence to optimize the antenna array layout. By leveraging chaos mapping traversal and randomness, this approach enhances the diversity of the initial antenna layout, thereby improving the algorithm's capacity to escape local optima. Concurrently, we also reduce background noise during the array steering process to enhance PSLL at large steering angle. In this study, we optimize non-uniform antenna arrays with 64-, 128-, and 256-channels. The results demonstrate that at a steering angle of 80°, the PSLL is improved by 2.18, 2.81, and 3.59 dB, respectively, compared to the conventional genetic algorithm (GA). Notably, for a 256-channel array, the PSLL can be optimized to an impressive -18.46 dB using this method. To our knowledge, this represents the lowest PSLL achieved for an equivalent number of channels. Our research offers valuable insights for the practical implementation of OPAs as transmitters in chip-scale frequency modulated continuous wave (FMCW) light detection and ranging (LiDAR) systems.

An improved transient search optimization algorithm for building energy optimization and hybrid energy sizing applications

In this paper, a new algorithm named the improved transient search optimization algorithm (ITSOA) is utilized to solve classical test functions, optimize the consumption of building energy, and optimize hybrid energy system production. The conventional TSOA draws inspiration from the fleeting behavior of electrical circuits with energy storage components. Rosenbrock’s direct rotation technique is used to improve the traditional TSOA performance against exploration and exploitation unbalance. First, the ITSOA performance is investigated in solving 23 classical benchmark functions, and the outcomes have shown the superior capability of the recommended algorithm in comparison with the conventional TSOA, DMO, SHO, GA, MRFO, and PSO methods. Also, the ITSOA proficiency is verified in solving the building energy optimization (BEO) problem for minimizing the energy usage of two simple and detailed buildings. The optimization results showed that the optimized solutions of ITSOA in single and multi-objective optimizations compared to conventional TSOA, DMO, SHO, GA, MRFO, and PSO obtained a lower value of the cost function. Also, the superiority of ITSOA has been confirmed to solve the BEO compared to previous methods. Moreover, the multi-objective optimization results have shown that ITSOA is able to determine the ultimate solution among the Pareto front set based on the fuzzy decision-making approach and building energy utilization decisions.

Piping network optimization for district heating system using an enhanced Genetic Algorithm searching method

Given the substantial construction and operational expenses associated with a district heating system (DHS), achieving an optimal layout for the piping network is paramount for its successful deployment. In this study, the optimization of DHS piping configuration has been explored. Traditional exhaustive search methods for network design are often impractical due to computational constraints, making Genetic Algorithm (GA) a preferred alternative for navigating the vast search space of optimization problems efficiently. However, GA, which relies on probabilistic heuristics, may not always pinpoints the most effective solutions, particularly those in close proximity to the current near-optimal configuration. To address this issue, an enhanced GA-based neighboring search method for identifying optimal or near-optimal piping layout for DHS more effectively has been developed in this study. When a local minimum is detected in the GA optimization process, the method initiates a neighboring search by selecting an elite candidate. The link with the highest piping cost from the elite candidate's configuration is identified. Subsequently, one of the other nodes in the configuration is connected to the nodes of the identified link to explore solutions beyond the local optimum. This new approach was firstly validated against an Optimal Communication Spanning Tree (OCST) benchmark problem, where it demonstrated superior efficacy by achieving higher success rate and quicker first-hit generation compared to conventional GA method. Specifically, this method showed a 60 % success rate with a minimum first-hit generation number of 140, outperforming the traditional GA's 40 % success rate and 263 generations. Further modification to the OCST benchmark to better simulate a real-world DHS application underscored the ability of this neighboring search method to exceed the previously established optimal configuration, uncovering a “better' solution with superior fitness value. This promising methodology was subsequently applied to the hypothetical design of a DHS piping network, illustrating its potential to enhance the planning and implementation of efficient, cost-effective district heating systems.

Design a new algorithm (iL-GA) to optimize controller parameters for an automotive suspension system

Purpose This paper aims to design a PD controller for an active suspension system to improve the car’s moving smoothness. Design/methodology/approach The controller parameters are optimized by an in-loop genetic algorithm (iL-GA). Unlike previous studies that only used conventional GAs to tune coefficients for the controller, the iL-GA designed in this paper provides outstanding efficiency when determining the optimal value range for the system. The optimal value range of parameters is determined by the in-loop algorithm based on criteria related to systematic errors. The optimal values are then calculated by the GA based on this range instead of an uncertain one. Findings Simulation results show that vehicle body acceleration and displacement values are significantly reduced when using the active suspension system compared to the conventional passive suspension system. The phase difference phenomenon does not occur in the iL-GA situation. In addition, the frequency domain investigation also shows the system’s stability when using iL-GA instead of conventional GA. Originality/value To the best of the authors’ knowledge, this is a new application that provides positive effects to the suspension controller. This algorithm can be applied to tune coefficients for direct controllers in the future.

An improved genetic algorithm for robot path planning

The conventional genetic algorithm (GA) for path planning exists several drawbacks, such as uncertainty in the direction of robot movement, circuitous routes, low convergence rates, and prolonged search time. To solve these problems, this study introduces an improved GA-based path-planning algorithm that adopts adaptive regulation of crossover and mutation probabilities. This algorithm uses a hybrid selection strategy that merges elite, tournament, and roulette wheel selection methods. An adaptive approach is implemented to control the speed of population evolution through crossover and mutation. Combining with a local search operation enhances the optimization capability of the algorithm. The proposed algorithm was compared with the traditional GA through simulations, demonstrating shorter path lengths and reduced search times.

PEGA: A Privacy-Preserving Genetic Algorithm for Combinatorial Optimization.

Evolutionary algorithms (EAs), such as the genetic algorithm (GA), offer an elegant way to handle combinatorial optimization problems (COPs). However, limited by expertise and resources, most users lack the capability to implement EAs for solving COPs. An intuitive and promising solution is to outsource evolutionary operations to a cloud server, however, it poses privacy concerns. To this end, this article proposes a novel computing paradigm called evolutionary computation as a service (ECaaS), where a cloud server renders evolutionary computation services for users while ensuring their privacy. Following the concept of ECaaS, this article presents privacy-preserving genetic algorithm (PEGA), a privacy-preserving GA designed specifically for COPs. PEGA enables users, regardless of their domain expertise or resource availability, to outsource COPs to the cloud server that holds a competitive GA and approximates the optimal solution while safeguarding privacy. Notably, PEGA features the following characteristics. First, PEGA empowers users without domain expertise or sufficient resources to solve COPs effectively. Second, PEGA protects the privacy of users by preventing the leakage of optimization problem details. Third, PEGA performs comparably to the conventional GA when approximating the optimal solution. To realize its functionality, we implement PEGA falling in a twin-server architecture and evaluate it on two widely known COPs: 1) the traveling Salesman problem (TSP) and 2) the 0/1 knapsack problem (KP). Particularly, we utilize encryption cryptography to protect users' privacy and carefully design a suite of secure computing protocols to support evolutionary operators of GA on encrypted chromosomes. Privacy analysis demonstrates that PEGA successfully preserves the confidentiality of COP contents. Experimental evaluation results on several TSP datasets and KP datasets reveal that PEGA performs equivalently to the conventional GA in approximating the optimal solution.

Towards Sustainable Production: An Adaptive Intelligent Optimization Genetic Algorithm for Solid Wood Panel Manufacturing

Optimizing production processes to conserve resources and reduce waste has become crucial in pursuing sustainable manufacturing practices. The solid wood panel industry, marked by substantial raw materials and energy consumption, stands at the forefront of addressing this challenge. This research delves into production scheduling and equipment utilization inefficiencies, offering innovative solutions for the solid wood panel processing line aimed at achieving environmental sustainability and operational efficiency. The study is articulated through two main segments: (1) an exhaustive analysis and the development of a simulation system for the solid wood panel processing line, delineating all production elements and operational logic, furnished with a user-friendly simulation interface, and (2) a comprehensive evaluation and enhancement of various scheduling algorithms specific to the Flexible Job-Shop Scheduling Problem (FJSP) encountered in solid wood panel workshops. A significant leap forward is made with the introduction of the Adaptive Intelligent Optimization Genetic Algorithm (AIOGA), an evolved version of the standard Genetic Algorithm (GA) engineered for optimal scheduling within the solid wood panel processing line. AIOGA incorporates advanced features such as encoding strategy, population initialization, objective function setting, selection strategy, crossover operation, and mutation operation, demonstrating the methodological depth of the study. We applied AIOGA in a designed FJSP, and AIOGA substantially reduced the maximum completion time to 90 min. It evidenced an improvement of 39.60% over the conventional GA, enhancing the equilibrium of the equipment workload across the system. This research presents a multifaceted strategy to address the scheduling complications inherent in solid wood panel production and highlights the extensive applicability of adaptive intelligent optimization in diverse industrial settings. This study establishes a new paradigm in manufacturing optimization, underlining the valuable integration of sustainability and efficiency in production methodologies.

Optimization of thermal management system architecture in hydrogen engine employing improved genetic algorithm

Decarbonization in the aeronautical industry is a daunting challenge due to the lack of sustainable aviation fuel. Hydrogen offers a potential option for this problem, given that it is an energy-dense fuel capable of reducing climate impact. Along with it, the liquid hydrogen preheating and thermal protection bring inevitable safety issues. Currently, how to construct the optimal thermal management system (TMS) architecture and further clarify its principles is still unclear. Thus, this study compares different TMS architectures through optimized genetic algorithms (GA), and firstly points out the excellent architecture as well as its operating parameters. Strikingly, our results reveal the optimized algorithm can significantly improve efficiency and precision of the optimizing processes. Benefiting from adaptive population strategy and elite preservation strategy, optimized GA saves half the time compared to conventional GA, and the variance is 60 % smaller than that of conventional GA. Using optimized GA, the series-parallel scheme is determined as the best solution and it exhibits better advantages on lightweight. In addition, results also show the leading factor is air/helium heat exchanger area. In conclusion, we hope this work can provide guidance for the optimal GA, contribute to decarbonization, and provide more ideas for the optimization of hydrogen TMS in the future.

Modeling and simulation analysis of optimal layout scheme of aviation logistics park based on genetic algorithm

AbstractAs an important component of modern logistics industry, aviation logistics parks address the problems of unreasonable layout and low efficiency in traditional planning and construction methods. The study first constructed a grid model for optimizing the layout of functional areas in the aviation logistics park, and selected the layout scheme with the highest comprehensive correlation as the optimal planning. At the same time, three important model parameters were determined: prediction of cargo throughput, size of functional areas in the park, and comprehensive correlation values between functional areas. Subsequently, in response to the optimization problem of functional area layout in aviation logistics parks, a cosine adaptive genetic algorithm based on adaptive reversal operation was introduced to solve the model. According to the findings, the research mention algorithm has an average utilization rate of up to 69.64% in the international freight zone, which is a 12.38% improvement over the conventional genetic algorithm. Additionally, it has an average domestic cargo area utilization rate of 67.93%, 11.24% greater than the genetic algorithm. This demonstrated that the functional area layout scheme of the aviation logistics park produced by examining the suggested algorithm is extremely viable and offers new ideas and techniques for the planning and designing of aviation logistics parks.

Identification of ipsilateral supraclavicular lymph node metastasis in breast cancer based on LASSO regression with a high penalty factor.

Aiming at the problems of small sample size and large feature dimension in the identification of ipsilateral supraclavicular lymph node metastasis status in breast cancer using ultrasound radiomics, an optimized feature combination search algorithm is proposed to construct linear classification models with high interpretability. The genetic algorithm (GA) is used to search for feature combinations within the feature subspace using least absolute shrinkage and selection operator (LASSO) regression. The search is optimized by applying a high penalty to the L1 norm of LASSO to retain excellent features in the crossover operation of the GA. The experimental results show that the linear model constructed using this method outperforms those using the conventional LASSO regression and standard GA. Therefore, this method can be used to build linear models with higher classification performance and more robustness.

Thermal unit commitment solution using an improved Lagrangian Relaxation

An improved Lagrangian relaxation (LR) solution to the thermal unit commitment problem (UCP) is proposed in this paper. The algorithm is characterized by: (1) a new Matlab function to determine the optimal path of the dual problem, (2) new initialization procedure of Lagrangian multipliers, based on both unit and time interval classification, (3) a flexible adjustment of Lagrangian multipliers, and (4) a dynamic search for uncertain stage scheduling, using a Lagrangian relaxation - dynamic programming method (LR-DP). After the LR best feasible solution is reached, and when identical or similar units exist, a unit decommitment is used to adjust the solution. The proposed algorithm is tested and compared to conventional Lagrangian relaxation (LR), genetic algorithm (GA), evolutionary programming (EP), Lagrangian relaxation and genetic algorithm (LRGA), and genetic algorithm based on unit characteristic classification (GAUC) on systems with the number of generating units in the range of 10 to 100. The total system production cost of the proposed algorithm is less than the others especially for the larger number of generating units. Computational time was found to increase almost linearly with system size, which is favorable for large-scale implementation.

An Effective Route Tracing Using Enhanced Ant Colony Optimization Techniques: Travelling Salesman Problem

The Travelling Salesman Problem (TSP) is a well-known optimization that determines the shortest route that visits a particular set of towns and returns to the start line. As an NP-hard, its complexity will increase considerably as the number of cities increases. Several heuristic algorithms, such as Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), and Genetic Algorithm (GA), have been developed to tackle this problem efficiently. This work establishes an approach that employs a multi-goal optimization algorithm that optimizes for minimizing the tour distances and maximizing the diversity of the towns visited. This paper aims to apply an enhanced ACO with conventional GA and PSO algorithms separately to leverage the strengths of both algorithms. The PSO and GA paths enhance the pheromone in global exploration, which speeds up the pheromone initialization of ACO. Thus, optimized routes by ant colony get integrated with pheromone reinforcement to obtain enhanced pheromone in the hybrid of GAACO and PSO-ACO. The ACO algorithm applies enhanced state transition to progress the search using the angle guidance function, and the best pheromone level improves convergence speed of the enhanced algorithms. This project has been designed as an intuitive and user-friendly interface for users to input TSP instances, select optimization algorithms, and visualize the solutions generated by each algorithm. Experiments are done to assess overall performance of ACO, GA-ACO, and PSO-ACO based on the best solution and convergence speed. Lastly, the effectiveness and performance of those algorithms in solving TSP across diverse scenarios and input parameters are compared.

Simultaneous Optimal Allocation of EVCSs and RESs Using an Improved Genetic Method

In the last decade, with the development of the electric vehicle industry and their acceptance in human societies, the participation plan of electric vehicles in supplying the load of the network has been taken into consideration. One of the requirements of this plan is the optimal location of the stations for these vehicles in the network so that they play an effective role in the operation of the network. In this regard, along with the construction of charging and discharging stations for electric vehicles, the construction of renewable sources in the network can play a complementary role for these stations. In this paper, the effect of using renewable resources as a supplement for smart charging stations and the placement of these stations to achieve technical and economic goals have been investigated. In order to manage the demand on the side of consumers and even out the load curve, the time of use mechanism as one of the demand response programs has been considered in this study. In this research, the improved nondominant sorting genetic algorithm is proposed to solve the problem, and the results of the proposed method are also compared with the conventional genetic and particle swarm optimization algorithms. All the simulations have been done in the MATLAB software and on the IEEE 33‐bus network. Based on the obtained results, after the implementation of the proposed plan in the distribution network, the objective functions of the loss, voltage drop, and the total cost have been reduced by 13.6%, 58.7%, and 54.4%, respectively, compared to the base conditions of the network.