Genetic algorithm for multi-objective experimental optimization.
Ontology highlight
ABSTRACT:
SUBMITTER: Link H
PROVIDER: S-EPMC1705497 | biostudies-other | 2006 Dec
REPOSITORIES: biostudies-other
Similar Datasets
Project description:Genetic algorithm is widely used in multi-objective mechanical structure optimization. In this paper, a genetic algorithm-based optimization method for ladle refractory lining structure is proposed. First, the parametric finite element model of the new ladle refractory lining is established by using ANSYS Workbench software. The refractory lining is mainly composed of insulating layer, permanent layer and working layer. Secondly, a mathematical model for multi-objective optimization is established to reveal the functional relationship between the maximum equivalent force on the ladle lining, the maximum temperature on the ladle shell, the total mass of the ladle and the structural parameters of the ladle refractory lining. Genetic algorithm translates the optimization process of ladle refractory lining into natural evolution and selection. The optimization results show that, compared with the unoptimized ladle refractory lining structure (insulation layer thickness of 0 mm, permanent layer thickness of 81 mm, and working layer thickness of 152 mm), the refractory lining with insulation layer thickness of 8.02 mm, permanent layer thickness of 76.20 mm, and working layer thickness of 148.61 mm has the best thermal insulation performance and longer service life within the variation of ladle refractory lining structure parameters. Finally, the results of the optimization are verified and analyzed in this paper. The study found that by optimizing the design of the ladle refractory lining, the maximum equivalent force on the ladle lining, the maximum temperature on the ladle shell and the ladle mass were reduced. The thermal insulation performance and the lightweight performance of the ladle are improved, which is very important for improving the service life of the ladle.
| S-EPMC9240744 | biostudies-literature
Project description:The rectangular packing problem is an NP-complete combinatorial optimization problem. This problem occurs widely in social production scenarios, with steel plate cutting being one example. The cutting scheme for the rectangular packing problem needs to be improved because, without the globally optimal solution, there are many unnecessary edges in the steel cutting process. Based on a practical roll-fed disc shearing steel plate optimization problem, this paper explores a generalized packing method for rectangles of special dimensions and abstractly condenses complex quantitative relationships to establish a multi-objective mixed-integer nonlinear programming model. An innovative algorithm design based on a genetic algorithm is established to plan the cutting scheme in a high-speed and efficient way. The outcome is a utilization rate of up to 92.73% for raw materials and a significant reduction in labor, providing a guide for practical production and processing tasks. The advantages and disadvantages of the model and algorithm are discussed, and it is concluded that this rectangular packing method has strong universality and generalization ability, allowing rectangular packing tasks with large data volumes to be completed within a short time.
| S-EPMC9797486 | biostudies-literature
Project description:Multi-objective clustering has received widespread attention recently, as it can obtain more accurate and reasonable solution. In this paper, an improved multi-objective clustering framework using particle swarm optimization (IMCPSO) is proposed. Firstly, a novel particle representation for clustering problem is designed to help PSO search clustering solutions in continuous space. Secondly, the distribution of Pareto set is analyzed. The analysis results are applied to the leader selection strategy, and make algorithm avoid trapping in local optimum. Moreover, a clustering solution-improved method is proposed, which can increase the efficiency in searching clustering solution greatly. In the experiments, 28 datasets are used and nine state-of-the-art clustering algorithms are compared, the proposed method is superior to other approaches in the evaluation index ARI.
| S-EPMC5716574 | biostudies-literature
Project description:Many real-world engineering problems need to balance different objectives and can be formatted as multi-objective optimization problem. An effective multi-objective algorithm can achieve a set of optimal solutions that can make a tradeoff between different objectives, which is valuable to further explore and design. In this paper, an improved multi-objective differential evolution algorithm (MOEA/D/DEM) based on a decomposition strategy is proposed to improve the performance of differential evolution algorithm for practical multi-objective nutrition decision problems. Firstly, considering the neighborhood characteristic, a neighbor intimacy factor is designed in the search process for enhancing the diversity of the population, then a new Gaussian mutation strategy with variable step size is proposed to reduce the probability of escaping local optimum area and improve the local search ability. Finally, the proposed algorithm is tested by classic test problems (DTLZ1-7 and WFG1-9) and applied to the multi-objective nutrition decision problems, compared to the other reported multi-objective algorithms, the proposed algorithm has a better search capability and obtained competitive results.
| S-EPMC9729643 | biostudies-literature
Project description:The recently proposed multiobjective particle swarm optimization algorithm based on competition mechanism algorithm cannot effectively deal with many-objective optimization problems, which is characterized by relatively poor convergence and diversity, and long computing runtime. In this paper, a novel multi/many-objective particle swarm optimization algorithm based on competition mechanism is proposed, which maintains population diversity by the maximum and minimum angle between ordinary and extreme individuals. And the recently proposed θ-dominance is adopted to further enhance the performance of the algorithm. The proposed algorithm is evaluated on the standard benchmark problems DTLZ, WFG, and UF1-9 and compared with the four recently proposed multiobjective particle swarm optimization algorithms and four state-of-the-art many-objective evolutionary optimization algorithms. The experimental results indicate that the proposed algorithm has better convergence and diversity, and its performance is superior to other comparative algorithms on most test instances.
| S-EPMC7063896 | biostudies-literature
Project description:Flexible manufacturing system (FMS) enhances the firm's flexibility and responsiveness to the ever-changing customer demand by providing a fast product diversification capability. Performance of an FMS is highly dependent upon the accuracy of scheduling policy for the components of the system, such as automated guided vehicles (AGVs). An AGV as a mobile robot provides remarkable industrial capabilities for material and goods transportation within a manufacturing facility or a warehouse. Allocating AGVs to tasks, while considering the cost and time of operations, defines the AGV scheduling process. Multi-objective scheduling of AGVs, unlike single objective practices, is a complex and combinatorial process. In the main draw of the research, a mathematical model was developed and integrated with evolutionary algorithms (genetic algorithm (GA), particle swarm optimization (PSO), and hybrid GA-PSO) to optimize the task scheduling of AGVs with the objectives of minimizing makespan and number of AGVs while considering the AGVs' battery charge. Assessment of the numerical examples' scheduling before and after the optimization proved the applicability of all the three algorithms in decreasing the makespan and AGV numbers. The hybrid GA-PSO produced the optimum result and outperformed the other two algorithms, in which the mean of AGVs operation efficiency was found to be 69.4, 74, and 79.8 percent in PSO, GA, and hybrid GA-PSO, respectively. Evaluation and validation of the model was performed by simulation via Flexsim software.
| S-EPMC5338791 | biostudies-literature
Project description:Aiming at the weak performance of chaotic light output in semiconductor laser systems, the study designed a power control algorithm for semiconductor laser drive systems based on linear self-disturbance rejection control. Then the optimization parameters and scope were determined, and multi-objective optimization and direction preference algorithms were introduced. A chaotic optical performance optimization model based on improved multi-objective genetic algorithm was constructed using adaptive functions as evaluation indicators. These results confirmed that the larger the bandwidth of the controller, the faster the response speed of the resonant converter, but the stability was poor. When the input voltage underwent a sudden change, the current ripple coefficient of the PID algorithm was 0.55%. The linear active disturbance rejection control algorithm could ensure that the voltage and current maintained at the set values, and the output current of the algorithm was more stable when the load underwent sudden changes. The directional preference algorithm could further provide more valuable solutions on the basis of adaptive genetic algorithms. When the peak value of the autocorrelation function was equal to 0.2, the delay characteristics of chaotic light were effectively suppressed, having strong signal bandwidth and complexity. In summary, the constructed model has good application effects in optimizing chaotic optical performance and has certain positive significance for communication security.
| S-EPMC11008891 | biostudies-literature
Project description:RNA inverse folding is a computational technology for designing RNA sequences which fold into a user-specified secondary structure. Although pseudoknots are functionally important motifs in RNA structures, less reports concerning the inverse folding of pseudoknotted RNAs have been done compared to those for pseudoknot-free RNA design. In this paper, we present a new version of our multi-objective genetic algorithm (MOGA), MODENA, which we have previously proposed for pseudoknot-free RNA inverse folding. In the new version of MODENA, (i) a new crossover operator is implemented and (ii) pseudoknot prediction methods, IPknot and HotKnots, are used to evaluate the designed RNA sequences, allowing us to perform the inverse folding of pseudoknotted RNAs. The new version of MODENA with the new crossover operator was benchmarked with a dataset composed of natural pseudoknotted RNA secondary structures, and we found that MODENA can successfully design more pseudoknotted RNAs compared to the other pseudoknot design algorithm. In addition, a sequence constraint function newly implemented in the new version of MODENA was tested by designing RNA sequences which fold into the pseudoknotted structure of a hepatitis delta virus ribozyme; as a result, we successfully designed eight RNA sequences. The new version of MODENA is downloadable from http://rna.eit.hirosaki-u.ac.jp/modena/.
| S-EPMC3337422 | biostudies-literature
Project description:This paper proposes a new dynamic multi-objective optimization algorithm by integrating a new fitting-based prediction (FBP) mechanism with regularity model-based multi-objective estimation of distribution algorithm (RM-MEDA) for multi-objective optimization in changing environments. The prediction-based reaction mechanism aims to generate high-quality population when changes occur, which includes three subpopulations for tracking the moving Pareto-optimal set effectively. The first subpopulation is created by a simple linear prediction model with two different stepsizes. The second subpopulation consists of some new sampling individuals generated by the fitting-based prediction strategy. The third subpopulation is created by employing a recent sampling strategy, generating some effective search individuals for improving population convergence and diversity. Experimental results on a set of benchmark functions with a variety of different dynamic characteristics and difficulties illustrate that the proposed algorithm has competitive effectiveness compared with some state-of-the-art algorithms.
| S-EPMC8330920 | biostudies-literature
Project description:BackgroundConstructing molecular interaction networks from microarray data and then identifying disease module biomarkers can provide insight into the underlying pathogenic mechanisms of non-small cell lung cancer. A promising approach for identifying disease modules in the network is community detection.ResultsIn order to identify disease modules from gene co-expression networks, a community detection method is proposed based on multi-objective optimization genetic algorithm with decomposition. The method is named DM-MOGA and possesses two highlights. First, the boundary correction strategy is designed for the modules obtained in the process of local module detection and pre-simplification. Second, during the evolution, we introduce Davies-Bouldin index and clustering coefficient as fitness functions which are improved and migrated to weighted networks. In order to identify modules that are more relevant to diseases, the above strategies are designed to consider the network topology of genes and the strength of connections with other genes at the same time. Experimental results of different gene expression datasets of non-small cell lung cancer demonstrate that the core modules obtained by DM-MOGA are more effective than those obtained by several other advanced module identification methods.ConclusionsThe proposed method identifies disease-relevant modules by optimizing two novel fitness functions to simultaneously consider the local topology of each gene and its connection strength with other genes. The association of the identified core modules with lung cancer has been confirmed by pathway and gene ontology enrichment analysis.
| S-EPMC9830734 | biostudies-literature