Traditional Genetic Algorithm Research Articles

Optimization of offshore wind farm inspection paths based on K-means-GA.

As global demand for offshore wind energy continues to rise, the imperative to enhance the profitability of wind power projects and reduce their operational costs becomes increasingly urgent. This study proposes an innovative approach to optimize the inspection routes of offshore wind farms, which integrates the K-means clustering algorithm and genetic algorithm (GA). In this paper, the inspection route planning problem is formulated as a multiple traveling salesman problem (mTSP), and the advantages of the K-means clustering algorithm in distance similarity are utilized to effectively group the positions of wind turbines, thereby optimizing the inspection schedule for vessels. Subsequently, by harnessing the powerful optimization capability and robustness of genetic algorithms, further refinement is conducted to search for the optimal inspection routes, aiming to achieve cost reduction objectives. The results of simulation experiments demonstrate the effectiveness of this integrated approach. Compared to traditional genetic algorithms, the inspection route length has been significantly reduced, from 93 kilometers to 79.36 kilometers. Simultaneously, operational costs have also experienced a notable decrease, dropping from 141,500 Chinese Yuan to 125,600 Chinese Yuan.

A Genetic Algorithm with Lower Neighborhood Search for the Three-Dimensional Multiorder Open-Size Rectangular Packing Problem

This paper addresses the multiorder open-dimension three-dimensional rectangular packing problem (3D-MOSB-ODRPP), which involves packing rectangular items from multiple orders into a single, size-adjustable container. We propose a novel metaheuristic approach combining a genetic algorithm with the Gurobi solver. The algorithm incorporates a lower neighborhood search strategy and is underpinned by a mathematical model representing the multiorder open-dimension packing scenario. Extensive experiments validate the effectiveness of the proposed approach. The LNSGA algorithm outperforms Gurobi and the traditional genetic algorithm in solution quality and computational efficiency. For small-scale instances, LNSGA achieves optimal values in most cases. LNSGA demonstrates significant optimization improvements over Gurobi and the genetic algorithm for large-scale instances. The superior performance is attributed to the effective integration of the lower neighborhood search mechanism and the Gurobi solver. This study offers valuable insights for optimizing the packing process in e-commerce warehousing and logistics operations.

Incorporating Background Knowledge in Symbolic Regression Using a Computer Algebra System

Abstract Symbolic Regression (SR) can generate interpretable, concise expressions that fit a given dataset, allowing for more human understanding of the structure than black-box approaches. The addition of background knowledge (in the form of symbolic mathematical constraints) allows for the generation of expressions that are meaningful with respect to theory while also being consistent with data. We specifically examine the addition of constraints to traditional genetic algorithm (GA) based SR (PySR) as well as a Markov-chain Monte Carlo (MCMC) based Bayesian SR architecture (Bayesian Machine Scientist), and apply these to rediscovering adsorption equations from experimental, historical datasets.
We find that, while hard constraints prevent GA and MCMC SR from searching, soft constraints can lead to improved performance both in terms of search effectiveness and model meaningfulness, with computational costs increasing by about an order of magnitude. If the constraints do not correlate well with the dataset or expected models, they can hinder the search of expressions. We find incorporating these constraints in Bayesian SR (as the Bayesian prior) is better than by modifying the fitness function in the GA.

Path Optimization of Container Multimodal Transportation Considering Differences in Cargo Time Sensitivity

To optimize the container multimodal transportation path selection problem with differences in cargo time sensitivity, this paper introduces the concept of mixed time windows and establishes an integer programming model from the perspective of carriers. The objective is to minimize the total transportation cost while meeting the customer’s on-time delivery requirements. The model imposes hard time window constraints on cargoes with on-time delivery requirements and soft time window constraints on general cargoes. A bi-level genetic algorithm is employed to solve the model. A case study is conducted to demonstrate the effectiveness of the proposed approach. Experimental results show that the bi-level genetic algorithm’s convergence ability, efficiency, stability, and global search capabilities are far superior to those of traditional single-level genetic algorithms. This indicates that the use of multi-stage solution approaches can mitigate the shortcomings of genetic algorithms in dealing with high-dimensional problems. In addition, when analyzing the effects of time penalty intensity and time window on decision-making results, it is found that the more time-sensitive cargoes are more likely to be affected by the time window setting, and will tend to sacrifice costs to ensure that the time demand is met. At the same time an increase in demand for time-sensitive services is accompanied by an increase in operating costs. Accurate assessment and classification of time sensitivity of cargoes can effectively prevent wasting resources in unnecessary areas, and ultimately maximize decision outcomes and ensure the most efficient use of resources.

Charging Station Site Selection Optimization for Electric Logistics Vehicles, Taking into Account Time-Window and Load Constraints

In order to improve the efficiency of the “last-mile” distribution in urban logistics and solve the problem of the difficult charging of electric logistics vehicles (ELVs), this paper proposes a charging station location optimization scheme for ELVs that takes into account time-window and load constraints (TW-LCs). Taking the optimal transportation path as the objective function and considering the time-window and vehicle load constraints, a charging station siting model was established. For the TW-LC problem, an improved genetic algorithm combining the farthest-insertion heuristic idea and local search operation was designed. Three different types of standardized arithmetic examples, C type, R type, and RC type, were used to test the proposed algorithm and compare it with the traditional genetic algorithm. The results indicate that, under the same conditions, compared to the traditional genetic algorithm, the improved genetic algorithm reduced the optimal path length by an average of 11.12%. It also decreased the number of charging stations selected, the number of vehicles in use, and the algorithm complexity by 22.97%, 13.71%, and 46.81%. Building on this, a case study was conducted on the TW-LC problem in a specific area of Chongqing, China. It resulted in a 50% reduction in the number of charging stations and a 25% reduction in the number of vehicles selected. In terms of economic indicators, the proposed algorithm improves unit electricity sales by 73.88% and reduces the total annualized cost of the logistics company by 18.81%, providing a theoretical basis for the subsequent promotion of ELVs.

Matrix Wasserstein distance generative adversarial network with gradient penalty for fast low-carbon economic dispatch of novel power systems

For novel power systems, access to sustainable energy sources will undoubtedly increase the uncertainty of power systems significantly. Consequently, to guarantee efficient, secure, smooth, and expedited functioning, this work proposes a matrix Wasserstein distance generative adversarial network with gradient penalty (MWGAN-GP), which considers the minimization of generation cost and carbon emission simultaneously for low-carbon economic dispatch (ED) of novel power systems. The proposed MWGAN-GP generates a series of matrix data by a trained generator, equalizes load values and the sum of unit outputs at each period by relaxation operation, and rapidly generates numerous ED solutions. The speed of ED based on MWGAN-GP is greatly faster than the speed of ED based on a traditional genetic algorithm (GA). Furthermore, the introduction of the relaxation operation decreases the average cost of ED based on MWGAN-GP by 7.94 % compared to GA according to the case with 4000 sets of load data.

Omnidirectional AGV Path Planning Based on Improved Genetic Algorithm

To address the issues with traditional genetic algorithm (GA) path planning, which often results in redundant path nodes and local optima, we propose an Improved Genetic Algorithm that incorporates an ant colony algorithm (ACO). Firstly, a new population initialization method is proposed. This method adopts a higher-quality random point generation strategy to generate random points centrally near the start and end of connecting lines. It combines the improved ACO algorithm to connect these random points quickly, thus greatly improving the quality of the initial population. Secondly, path smoothness constraints are proposed in the adaptive function. These constraints reduce the large-angle turns and non-essential turns, improving the smoothness of the generated path. The algorithm integrates the roulette and tournament methods in the selection stage to enhance the searching ability and prevent premature convergence. Additionally, the crossover stage introduces the edit distance and a two-layer crossover operation based on it to avoid ineffective crossover and improve convergence speed. In the mutation stage, we propose a new mutation method and introduce a three-stage mutation operation based on the idea of simulated annealing. This makes the mutation operation more effective and efficient. The three-stage mutation operation ensures that the mutated paths also have high weights, increases the diversity of the population, and avoids local optimality. Additionally, we added a deletion operation to eliminate redundant nodes in the paths and shorten them. The simulation software and experimental platform of ROS (Robot Operating System) demonstrate that the improved algorithm has better path search quality and faster convergence speed. This effectively prevents the algorithm from maturing prematurely and proves its effectiveness in solving the path planning problem of AGV (automated guided vehicle).

Research on Genetic Algorithm Optimization with Fusion Tabu Search Strategy and Its Application in Solving Three-Dimensional Packing Problems

Symmetry is an important principle and characteristic that is prevalent in nature and artificial environments. In the three-dimensional packing problem, leveraging the inherent symmetry of goods and the symmetry of the packing space can enhance packing efficiency and utilization.The three-dimensional packing problem is an NP-hard combinatorial optimization problem in the field of modern logistics, with high computational complexity. This paper proposes an improved genetic algorithm by incorporating a fusion tabu search strategy to address this problem. The algorithm employs a three-dimensional loading mathematical model and utilizes a wall-building method under residual space constraints for stacking goods. Furthermore, adaptation of fitness variation strategy, chromosome adjustment, and tabu search algorithm are introduced to balance the algorithm’s global and local search capabilities, as well as to enhance population diversity and convergence speed. Through testing on benchmark cases such as Bischoff and Ratcliff, the improved algorithm demonstrates an average increase of over 3% in packing space utilization compared to traditional genetic algorithms and other heuristic algorithms, validating its feasibility and effectiveness. The proposed improved genetic algorithm provides new insights for solving three-dimensional packing problems and optimizing logistics loading schedules, offering promising prospects for various applications.

A Novel Single Parent Mating Technique in Genetic Algorithm for Discrete – Time System Identification

System identification is concerned with the construction of a mathematical model based on given input and output data to represent the dynamical behaviour of a system. As a step-in system identification, model structure selection is a step where a model perceived as adequate system representation is selected. A typical rule is that the model must have a good balance between parsimony and accuracy in estimating a dynamic system. As a popular search method, genetic algorithm (GA) is used for selecting a model structure. However, the optimality of the final model depends much on the optimality of GA. This paper introduces a novel mating technique in GA based on the chromosome structure of the parents such that a single parent is sufficient in achieving mating that demonstrates high exploration capability. In investigating this, four systems of linear and nonlinear classes were simulated to generate discrete-time sets of data i.e. later used for identification. The outcome shows that GA incorporated with the mating technique within 10% - 20% of the population size is able to find optimal models quicker than the traditional GA.

Construction of a Sustainable Training System for Engineering and Technological Innovation Talents Based on CIPP Model in the Digital Era

With the advent of the digital era, the demand for engineering and technological talents in the market is increasing. It is crucial to design a sustainable training and evaluation system suitable for engineering and technological innovation talents. However, traditional data evaluation models have problems with unsuitable evaluation indicators and low model accuracy. Therefore, the paper selects the decision-making-oriented evaluation model to build the basic talent training evaluation indicators, and design expert questionnaires based on the Delphi method to screen indicators. Moreover, the paper also combines the adaptive genetic algorithm optimised backpropagation neural network to establish a talent cultivation evaluation model, and conducts simulation experiments using MATLAB to verify its feasibility. The results showed that the evaluation accuracy [Formula: see text] value of the research model was 0.99635, and the fitness value was 1.34, which was 0.5 higher than the unmodified model and achieved good evaluation results. At the same time, by comparing with the traditional genetic algorithm optimised model and the unimproved backpropagation model, the average evaluation accuracy of the research model increased by 66.44% and 13.59%, and the recall rate increased by 10.79% and 23.96%. The research model has improved the accuracy of evaluation, and its adaptability has also been enhanced, achieving superior evaluation results, which has important value in the cultivation of engineering and technological innovation talents.

Multi-objective optimization approach for coverage path planning of mobile robot

Abstract Coverage path planning (CPP) is a subfield of path planning problems in which free areas of a given domain must be visited by a robot at least once while avoiding obstacles. In some situations, the path may be optimized for one or more criteria such as total distance traveled, number of turns, and total area covered by the robot. Accordingly, the CPP problem has been formulated as a multi-objective optimization (MOO) problem, which turns out to be a challenging discrete optimization problem, hence conventional MOO algorithms like Non-dominated Sorting Genetic Algorithm-2 (NSGA-II) do not work as it is. This study implements a modified NSGA-II to solve the MOO problem of CPP for a mobile robot. In this paper, the proposed method adopted two objective functions: (1) the total distance traveled by the robot and (2) the number of turns taken by the robot. The two objective functions are used to calculate energy consumption. The proposed method is compared to the hybrid genetic algorithm (HGA) and the traditional genetic algorithm (TGA) in a rectilinear environment containing obstacles of various complex shapes. In addition, the results of the proposed algorithm are compared to those generated by HGA, TGA, oriented rectilinear decomposition, and spatial cell diffusion and family of spanning tree coverage in existing research papers. The results of all comparisons indicate that the proposed algorithm outperformed the existing algorithms by reducing energy consumption by 5 to 60%. This paper provides the facility to operate the robot in different modes.

The Intelligent Layout of the Ship Piping System Based on the Optimization Algorithm

The ship piping layout is one of the essential tasks in the detailed design stage of a ship. Traditional manual expert design has disadvantages such as low efficiency, reliance on experience, and subjective influence. Therefore, this paper systematically proposes an intelligent arrangement method for ships’ single, parallel, and branch pipelines. Firstly, the traditional genetic algorithm is improved and combined with the A* algorithm to solve the intelligent arrangement problem of a single pipeline in ships. Then, the parallel pipeline and branch pipeline are split into multiple single pipelines by combining with the connection point strategy to solve the arrangement problem of parallel pipeline and branch pipeline. Finally, the optimized A*-genetic algorithm proposed in this paper is compared with the A* algorithm, particle swarm algorithm, and the labyrinth-genetic algorithm used in previous research through simulation experiments. The results show that the A*-genetic algorithm of this paper is optimal in six indexes, including length, number of elbows, energy value, fitness value, number of optimal solutions, and average number of convergence generations, in the arrangement of the single pipeline. In solving the parallel pipeline and branch pipeline arrangement problems, the all-around performance of this paper’s algorithm is better than that of A*-genetic algorithm and maze–genetic algorithm, respectively. The A*-genetic algorithm of this paper considers the quality of pipeline arrangement and the solution’s efficiency. It verifies the adaptability and superiority of the algorithm for the intelligent arrangement of various types of pipelines in ship pipelines.

Monitoring and Early Warning Method of Debris Flow Expansion Behavior Based on Improved Genetic Algorithm and Bayesian Network

Based on an improved genetic algorithm and debris flow disaster monitoring network, this study examines the monitoring and early warning method of debris flow expansion behavior, divides the risk of debris flow disaster, and provides a scientific basis for emergency rescue and post-disaster recovery. The function of the debris flow disaster monitoring network of the spreading behavior disaster chain is constructed. According to the causal reasoning of debris flow disaster monitoring information, the influence factors of debris flow, such as rainfall intensity and duration, are selected as the inputs of the Bayesian network, and the probability of a debris flow disaster is obtained. The probability is compared with the historical data threshold to complete the monitoring and early warning of debris flow spreading behavior. Innovatively, by introducing niche technology to improve traditional genetic algorithms by learning Bayesian networks, the optimization efficiency and convergence speed of genetic algorithms are improved, and the robustness of debris flow monitoring and warning is enhanced. The experimental results show that this method divides debris flow disasters into the following five categories based on their danger: low-risk area, medium-risk area, high-risk area, higher-risk area, and Very high-risk area. It accurately monitors the expansion of debris flows and completes early warning. The disaster management department can develop emergency rescue and post-disaster recovery strategies based on early warning results, thus providing a scientific basis for debris flow disasters. The improved genetic algorithm has a higher learning efficiency, a higher accuracy, a faster convergence speed, and higher advantages in learning time and accuracy of the Bayesian network structure.

A fuzzy interval optimization approach for p-hub median problem under uncertain information.

Stochastic and robust optimization approaches often result in sub-optimal solutions for the uncertain p-hub median problem when continuous design parameters are discretized to form different environmental scenarios. To solve this problem, this paper proposes a triangular fuzzy number model for the Non-Strict Uncapacitated Multi-Allocation p-hub Median Problem. To enhance the quality and the speed of optimization, a novel optimization approach, combining the triangular fuzzy number evaluation index with the Genetic-Tabu Search algorithm, is proposed. During the iterations of the Genetic-Tabu Search algorithm for finding the optimal solution, the fitness of fuzzy hub schemes is calculated by considering the relative positional relationships of triangular fuzzy number membership functions. This approach directly addresses the triangular fuzzy number model and ensures the integrity of information in the p-hub problem as much as possible. It is verified by the classic Civil Aeronautics Board and several self-constructed data sets. The results indicate that, compared to the traditional Genetic Algorithm and Tabu Search algorithm, the Genetic-Tabu Search algorithm reduces average computation time by 49.05% and 40.93%, respectively. Compared to traditional random, robust, and real-number-based optimization approaches, the proposed optimization approach reduces the total cost in uncertain environments by 1.47%, 2.80%, and 8.85%, respectively.

Ship Global Traveling Path Optimization via a Novel Non-Dominated Sorting Genetic Algorithm

Due to the intensification of economic globalization and the impact of global warming, the development of methods to reduce shipping costs and reduce carbon emissions has become crucial. In this study, a multi-objective optimization algorithm was designed to plan the optimal ship route for safe cross-ocean navigation under complex sea conditions. Based on the traditional non-dominated sorting genetic algorithm, considering ship stability and complex marine environment interference, a non-dominated sorting genetic algorithm model considering energy consumption was designed with the energy consumption and navigation time of the ship as the optimization objectives. The experimental results show that although the proposed method is 101.23 nautical miles more than the large ring route, and the voyage is increased by 10.1 h, the fuel consumption is reduced by 92.24 tons, saving 6.94%. Compared with the traditional genetic algorithm, the voyage distance and time are reduced by 216.93 nautical miles and 7.5 h, and the fuel consumption is reduced by 58.82 tons, which is almost 4.54%. Through experimental verification, the proposed model can obtain punctual routes, avoid areas with bad sea conditions, reduce fuel consumption, and is of great significance for improving the safety and economy of ship routes.

An efficient parameter-retrieval-based surrogate-assisted optimization of on-platform honeycomb absorbing structures

An electromagnetic parameter-retrieval-based surrogate-assisted optimization (PSAO) algorithm is presented to reduce radar cross section (RCS) by optimizing the on-platform honeycomb absorbing structures. To facilitate the optimization process, the honeycomb structure is transformed to an anisotropic homogeneous slab, and the effective parameters of the slab are extracted by the retrieval algorithm. A multi-fidelity model is employed to reduce the computing-time consumption, in which a Gaussian process (GP) regression model is used as the substitute for the coarse model. The GP model establishes a relationship between the geometry of the honeycomb structure and the RCS response of the target coated with the equivalent slab. Finally, the optimization result of the fine model is achieved through a space mapping strategy. The accuracy of the parameter extraction algorithm is verified by analyzing the honeycomb absorbing structure. Subsequently, the proposed optimization method is applied to a metal plate and a metal cylinder, resulting in a 10 dB reduction of RCS in broadband and wide-angle scenarios. This demonstrates the applicability of the proposed PSAO algorithm to both planar and conformal on-platform honeycomb absorbing structures. Furthermore, an NACA0015 foil is analyzed, showing an average RCS reduction of 10 dB and a minimum RCS reduction of 5 dB in the X-band. These results indicate that the PSAO approach can effectively apply to complicated targets. Additionally, the proposed method exhibits significant advantages in terms of computational accuracy and efficiency compared to the traditional genetic algorithm.

Mine water cooperative optimal scheduling based on improved genetic algorithm

This article addresses the issues of unreasonable water scheduling and high costs in coal mine shafts, proposing a hierarchical optimization scheduling strategy. Taking the water quality and quantity of a certain mining area in Inner Mongolia as the research object, it designs the objective function with the highest reuse efficiency and the lowest reuse cost of mine water resources, and establishes the constraint conditions of water quality and quantity for each water-using unit. In response to the problem that traditional genetic algorithms are prone to local optima, an adaptive autobiographical operator is proposed and improved based on Metropolis principle of simulated annealing algorithm. The improved algorithm is applied to the calculation of the scheduling model, and the results show that the recovery cost in the heating season is reduced by 66779.36 CNY/month, a decrease of 10.34%; the recovery cost in the non-heating season is reduced by 61469.28 CNY/month, a decrease of 9.91%. At the same time, the heating season and the non-heating season have reduced by 136.99 h/month and 154.52 h/month respectively, significantly reducing the recovery cost and time.

Genetic Engineering Algorithm (GEA): An Efficient Metaheuristic Algorithm for Solving Combinatorial Optimization Problems

Genetic Algorithms (GAs) are known for their efficiency in solving combinatorial optimization problems, thanks to their ability to explore diverse solution spaces, handle various representations, exploit parallelism, preserve good solutions, adapt to changing dynamics, handle combinatorial diversity, and provide heuristic search. However, limitations such as premature convergence, lack of problem-specific knowledge, and randomness of crossover and mutation operators make GAs generally inefficient in finding an optimal solution. To address these limitations, this paper proposes a new metaheuristic algorithm called the Genetic Engineering Algorithm (GEA) that draws inspiration from genetic engineering concepts. GEA redesigns the traditional GA while incorporating new search methods to isolate, purify, insert, and express new genes based on existing ones, leading to the emergence of desired traits and the production of specific chromosomes based on the selected genes. Comparative evaluations against stateof-the-art algorithms on benchmark instances demonstrate the superior performance of GEA, showcasing its potential as an innovative and efficient solution for combinatorial optimization problems.

A rapid evaluation method of blasting effect based on optimized image segmentation algorithm and application in engineering

To quickly determine the blasting block degree and conduct an accurate and objective analysis of the tunnel blasting effect, this study has enhanced and improved upon the traditional genetic algorithm and Otsu algorithm. It has combined it with the marking watershed method and utilized ground digital acquisition to capture images of blasting debris. These images are then used in our custom-developed blasting analysis software to calculate the blasting block degree distribution and provide a quantitative analysis of blasting block degree. The research results show that the optimized image segmentation algorithm effectively improves the traditional threshold segmentation method on the poor effect of segmentation of the edge of the adherent block or the direct application of the watershed segmentation of the over-segmentation problem, to improve the segmentation accuracy based on the new segmentation technology is close to the traditional technology in terms of time. Through the self-developed software, the construction personnel in the project site to quickly obtain the blasting block degree histogram, block degree cumulative curve and other important indicators of the evaluation of the effect of blasting block degree, to provide data support for on-site construction, to assist in the modification of the blasting program, and to improve the efficiency of construction. This study realizes the rapid detection and block identification of blasting blocks, provides data support for the optimization of blasting parameters, and has good application and promotion value.

An Assembly Sequence Planning Method Based on Multiple Optimal Solutions Genetic Algorithm

Assembly sequence planning (ASP) is an indispensable and important step in the intelligent assembly process, and aims to solve the optimal assembly sequence with the shortest assembly time as its optimization goal. This paper focuses on modular cabin construction for large cruise ships, tackling the complexities and challenges of part assembly during the process, based on real engineering problems. It introduces the multiple optimal solutions genetic algorithm (MOSGA). The MOSGA analyzes product constraints and establishes a mathematical model. Firstly, the traditional genetic algorithm (GA) is improved in the case of falling into the local optimum when facing complex problems, so that it can jump out of the local optimum under the condition of satisfying the processing constraints and achieve the global search effect. Secondly, the problem whereby the traditional search algorithm converges to the unique optimal solution is solved, and multiple unique optimal solutions that are more suitable for the actual assembly problem are solved. Thirdly, for a variety of restrictions and emergencies that may occur during the assembly process, the assembly sequence flexible planning (ASFP) method is introduced so that each assembly can be flexibly adjusted. Finally, an example is used to verify the feasibility and effectiveness of the method. This method improves the assembly efficiency and the diversity of assembly sequence selection, and can flexibly adjust the assembly sequence, which has important guiding significance for the ASP problem.