Structural Reliability-Based Topology Optimization(RBTO),as an efficient design methodology,serves as a crucial means to ensure the development ofmodern engineering structures towards high performance,long service lif...Structural Reliability-Based Topology Optimization(RBTO),as an efficient design methodology,serves as a crucial means to ensure the development ofmodern engineering structures towards high performance,long service life,and high reliability.However,in practical design processes,topology optimization must not only account for the static performance of structures but also consider the impacts of various responses and uncertainties under complex dynamic conditions,which traditional methods often struggle accommodate.Therefore,this study proposes an RBTO framework based on a Kriging-assisted level set function and a novel Dynamic Hybrid Particle Swarm Optimization(DHPSO)algorithm.By leveraging the Kriging model as a surrogate,the high cost associated with repeatedly running finite element analysis processes is reduced,addressing the issue of minimizing structural compliance.Meanwhile,the DHPSO algorithm enables a better balance between the population’s developmental and exploratory capabilities,significantly accelerating convergence speed and enhancing global convergence performance.Finally,the proposed method is validated through three different structural examples,demonstrating its superior performance.Observed that the computational that,compared to the traditional Solid Isotropic Material with Penalization(SIMP)method,the proposed approach reduces the upper bound of structural compliance by approximately 30%.Additionally,the optimized results exhibit clear material interfaces without grayscale elements,and the stress concentration factor is reduced by approximately 42%.Consequently,the computational results fromdifferent examples verify the effectiveness and superiority of this study across various fields,achieving the goal of providing more precise optimization results within a shorter timeframe.展开更多
The Dynamical Density Functional Theory(DDFT)algorithm,derived by associating classical Density Functional Theory(DFT)with the fundamental Smoluchowski dynamical equation,describes the evolution of inhomo-geneous flui...The Dynamical Density Functional Theory(DDFT)algorithm,derived by associating classical Density Functional Theory(DFT)with the fundamental Smoluchowski dynamical equation,describes the evolution of inhomo-geneous fluid density distributions over time.It plays a significant role in studying the evolution of density distributions over time in inhomogeneous systems.The Sunway Bluelight II supercomputer,as a new generation of China’s developed supercomputer,possesses powerful computational capabilities.Porting and optimizing industrial software on this platform holds significant importance.For the optimization of the DDFT algorithm,based on the Sunway Bluelight II supercomputer and the unique hardware architecture of the SW39000 processor,this work proposes three acceleration strategies to enhance computational efficiency and performance,including direct parallel optimization,local-memory constrained optimization for CPEs,and multi-core groups collaboration and communication optimization.This method combines the characteristics of the program’s algorithm with the unique hardware architecture of the Sunway Bluelight II supercomputer,optimizing the storage and transmission structures to achieve a closer integration of software and hardware.For the first time,this paper presents Sunway-Dynamical Density Functional Theory(SW-DDFT).Experimental results show that SW-DDFT achieves a speedup of 6.67 times within a single-core group compared to the original DDFT implementation,with six core groups(a total of 384 CPEs),the maximum speedup can reach 28.64 times,and parallel efficiency can reach 71%,demonstrating excellent acceleration performance.展开更多
A new algorithm based on genetic algorithm(GA) is developed for solving function optimization problems with inequality constraints. This algorithm has been used to a series of standard test problems and exhibited good...A new algorithm based on genetic algorithm(GA) is developed for solving function optimization problems with inequality constraints. This algorithm has been used to a series of standard test problems and exhibited good performance. The computation results show that its generality, precision, robustness, simplicity and performance are all satisfactory.展开更多
An adaptive immune-genetic algorithm （AIGA） is proposed to avoid premature convergence and guarantee the diversity of the population. Rapid immune response （secondary response）, adaptive mutation and density opera...An adaptive immune-genetic algorithm （AIGA） is proposed to avoid premature convergence and guarantee the diversity of the population. Rapid immune response （secondary response）, adaptive mutation and density operators in the AIGA are emphatically designed to improve the searching ability, greatly increase the converging speed, and decrease locating the local maxima due to the premature convergence. The simulation results obtained from the global optimization to four multivariable and multi-extreme functions show that AIGA converges rapidly, guarantees the diversity, stability and good searching ability.展开更多
As a promising technique, surrogate-based design and optimization（SBDO） has been widely used in modern engineering design optimizations. Currently, static surrogate-based optimization methods have been successfully ...As a promising technique, surrogate-based design and optimization（SBDO） has been widely used in modern engineering design optimizations. Currently, static surrogate-based optimization methods have been successfully applied to expensive optimization problems. However, due to the low efficiency and poor flexibility, static surrogate-based optimization methods are difficult to efficiently solve practical engineering cases. At the aim of enhancing efficiency, a novel surrogate-based efficient optimization method is developed by using sequential radial basis function（SEO-SRBF）. Moreover, augmented Lagrangian multiplier method is adopted to solve the problems involving expensive constraints. In order to study the performance of SEO-SRBF, several numerical benchmark functions and engineering problems are solved by SEO-SRBF and other well-known surrogate-based optimization methods including EGO, MPS, and IARSM. The optimal solutions, number of function evaluations, and algorithm execution time are recorded for comparison. The comparison results demonstrate that SEO-SRBF shows satisfactory performance in both optimization efficiency and global convergence capability. The CPU time required for running SEO-SRBF is dramatically less than that of other algorithms. In the torque arm optimization case using FEA simulation, SEO-SRBF further reduces 21% of thematerial volume compared with the solution from static-RBF subject to the stress constraint. This study provides the efficient strategy to solve expensive constrained optimization problems.展开更多
This paper presents a two-phase genetic algorithm (TPGA) based on the multi- parent genetic algorithm (MPGA). Through analysis we find MPGA will lead the population' s evol vement to diversity or convergence accor...This paper presents a two-phase genetic algorithm (TPGA) based on the multi- parent genetic algorithm (MPGA). Through analysis we find MPGA will lead the population' s evol vement to diversity or convergence according to the population size and the crossover size, so we make it run in different forms during the global and local optimization phases and then forms TPGA. The experiment results show that TPGA is very efficient for the optimization of low-dimension multi-modal functions, usually we can obtain all the global optimal solutions.展开更多
The filled function method is an approach for finding a global minimum of multi-dimensional functions. With more and more relevant research, it becomes a promising way used in unconstrained global optimization. Some f...The filled function method is an approach for finding a global minimum of multi-dimensional functions. With more and more relevant research, it becomes a promising way used in unconstrained global optimization. Some filled functions with one or two parameters have already been suggested. However, there is no certain criterion to choose a parameter appropriately. In this paper, a parameter-free filled function was proposed. The definition of the original filled function and assumptions of the objective function given by Ge were improved according to the presented parameter-free filled function. The algorithm and numerical results of test functions were reported. Conclusions were drawn in the end. Key words global optimization - filled function method - local minimizer MSC 2000 90C30展开更多
Improving the efficiency of ship optimization is crucial for modem ship design. Compared with traditional methods, multidisciplinary design optimization （MDO） is a more promising approach. For this reason, Collabora...Improving the efficiency of ship optimization is crucial for modem ship design. Compared with traditional methods, multidisciplinary design optimization （MDO） is a more promising approach. For this reason, Collaborative Optimization （CO） is discussed and analyzed in this paper. As one of the most frequently applied MDO methods, CO promotes autonomy of disciplines while providing a coordinating mechanism guaranteeing progress toward an optimum and maintaining interdisciplinary compatibility. However, there are some difficulties in applying the conventional CO method, such as difficulties in choosing an initial point and tremendous computational requirements. For the purpose of overcoming these problems, optimal Latin hypercube design and Radial basis function network were applied to CO. Optimal Latin hypercube design is a modified Latin Hypercube design. Radial basis function network approximates the optimization model, and is updated during the optimization process to improve accuracy. It is shown by examples that the computing efficiency and robustness of this CO method are higher than with the conventional CO method.展开更多
Teaching-Learning-Based Optimization (TLBO) is recently being used as a new, reliable, accurate and robust optimization technique scheme for global optimization over continuous spaces [1]. This paper presents an, impr...Teaching-Learning-Based Optimization (TLBO) is recently being used as a new, reliable, accurate and robust optimization technique scheme for global optimization over continuous spaces [1]. This paper presents an, improved version of TLBO algorithm, called the Weighted Teaching-Learning-Based Optimization (WTLBO). This algorithm uses a parameter in TLBO algorithm to increase convergence rate. Performance comparisons of the proposed method are provided against the original TLBO and some other very popular and powerful evolutionary algorithms. The weighted TLBO (WTLBO) algorithm on several benchmark optimization problems shows a marked improvement in performance over the traditional TLBO and other algorithms as well.展开更多
This paper presents a parallel two-level evolutionary algorithm based on domain decomposition for solving function optimization problem containing multiple solutions. By combining the characteristics of the global sea...This paper presents a parallel two-level evolutionary algorithm based on domain decomposition for solving function optimization problem containing multiple solutions. By combining the characteristics of the global search and local search in each sub-domain, the former enables individual to draw closer to each optima and keeps the diversity of individuals, while the latter selects local optimal solutions known as latent solutions in sub-domain. In the end, by selecting the global optimal solutions from latent solutions in each sub-domain, we can discover all the optimal solutions easily and quickly.展开更多
In this study,2~5 （five factors at two-level factorial design） design of experiment was applied to investigate a set of optimal machining parameters to achieve a minimum surface roughness value for Abies nordmannian...In this study,2~5 （five factors at two-level factorial design） design of experiment was applied to investigate a set of optimal machining parameters to achieve a minimum surface roughness value for Abies nordmanniana.Wood specimens were prepared using different values of spindle speed,feed rate,depth of cut,tool radius,and cutting directions.Average surface roughness （R_z） values were applied using a stylus.The objectives were to：（1）obtain the effective variables of wood surface roughness;（2） analyze which of these factors had an impact on variability in the CNC machining process;（3） evaluate the optimal cutting values within the range of different cutting levels of machining parameters.The results indicate that the design of experiment（DOE） based on the desirability function approach determined the optimal machining parameters successfully,leading to minimum R_a compared to the observed value.Minimum surface roughness values of tangential and radial cutting directions were 3.58 and 3.21 μm,respectively.展开更多
This paper presents a Fuzzy Preference Function-based Robust Multidisciplinary Design Optimization(FPF-RMDO) methodology. This method is an effective approach to multidisciplinary systems, which can be used to designe...This paper presents a Fuzzy Preference Function-based Robust Multidisciplinary Design Optimization(FPF-RMDO) methodology. This method is an effective approach to multidisciplinary systems, which can be used to designer experiences during the design optimization process by fuzzy preference functions. In this study, two optimizations are done for Predator MQ-1 Unmanned Aerial Vehicle(UAV):(A) deterministic optimization and(B) robust optimization. In both problems, minimization of takeoff weight and drag is considered as objective functions, which have been optimized using Non-dominated Sorting Genetic Algorithm(NSGA). In the robust design optimization, cruise altitude and velocity are considered as uncertainties that are modeled by the Monte Carlo Simulation(MCS) method. Aerodynamics, stability and control, mass properties, performance, and center of gravity are used for multidisciplinary analysis. Robust design optimization results show 46% and 42% robustness improvement for takeoff weight and cruise drag relative to optimal design respectively.展开更多
Dipper throated optimization(DTO)algorithm is a novel with a very efficient metaheuristic inspired by the dipper throated bird.DTO has its unique hunting technique by performing rapid bowing movements.To show the effi...Dipper throated optimization(DTO)algorithm is a novel with a very efficient metaheuristic inspired by the dipper throated bird.DTO has its unique hunting technique by performing rapid bowing movements.To show the efficiency of the proposed algorithm,DTO is tested and compared to the algorithms of Particle Swarm Optimization(PSO),Whale Optimization Algorithm(WOA),Grey Wolf Optimizer(GWO),and Genetic Algorithm(GA)based on the seven unimodal benchmark functions.Then,ANOVA and Wilcoxon rank-sum tests are performed to confirm the effectiveness of the DTO compared to other optimization techniques.Additionally,to demonstrate the proposed algorithm’s suitability for solving complex realworld issues,DTO is used to solve the feature selection problem.The strategy of using DTOs as feature selection is evaluated using commonly used data sets from the University of California at Irvine(UCI)repository.The findings indicate that the DTO outperforms all other algorithms in addressing feature selection issues,demonstrating the proposed algorithm’s capabilities to solve complex real-world situations.展开更多
In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a （weakly） LU-efficient solution in the considered nonsmooth multiobjective programming problem with the mult...In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a （weakly） LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a （weakly） LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval- objective function are convex.展开更多
In this paper, a new filled function with only one parameter is proposed. The main advantages of the new filled function are that it not only can be analyzed easily, but also can be approximated uniformly by a continu...In this paper, a new filled function with only one parameter is proposed. The main advantages of the new filled function are that it not only can be analyzed easily, but also can be approximated uniformly by a continuously differentiable function. Thus, a minimizer of the proposed filled function can be obtained easily by using a local optimization algorithm. The obtained minimizer is taken as the initial point to minimize the objective function and a better minimizer will be found. By repeating the above processes, we will find a global minimizer at last. The results of numerical experiments show that the new proposed filled function method is effective.展开更多
In terms of tandem cold mill productivity and product quality, a multi-objective optimization model of rolling schedule based on cost fimction was proposed to determine the stand reductions, inter-stand tensions and r...In terms of tandem cold mill productivity and product quality, a multi-objective optimization model of rolling schedule based on cost fimction was proposed to determine the stand reductions, inter-stand tensions and rolling speeds for a specified product. The proposed schedule optimization model consists of several single cost fi.mctions, which take rolling force, motor power, inter-stand tension and stand reduction into consideration. The cost function, which can evaluate how far the rolling parameters are from the ideal values, was minimized using the Nelder-Mead simplex method. The proposed rolling schedule optimization method has been applied successfully to the 5-stand tandem cold mill in Tangsteel, and the results from a case study show that the proposed method is superior to those based on empirical formulae.展开更多
The existing studies, concerning the dressing process, focus on the major influence of the dressing conditions on the grinding response variables. However, the choice of the dressing conditions is often made, based on...The existing studies, concerning the dressing process, focus on the major influence of the dressing conditions on the grinding response variables. However, the choice of the dressing conditions is often made, based on the experience of the qualified staff or using data from reference books. The optimal dressing parameters, which are only valid for the particular methods and dressing and grinding conditions, are also used. The paper presents a methodology for optimization of the dressing parameters in cylindrical grinding. The generalized utility function has been chosen as an optimization parameter. It is a complex indicator determining the economic, dynamic and manufacturing characteristics of the grinding process. The developed methodology is implemented for the dressing of aluminium oxide grinding wheels by using experimental diamond roller dressers with different grit sizes made of medium- and high-strength synthetic diamonds type AC32 and AC80. To solve the optimization problem, a model of the generalized utility function is created which reflects the complex impact of dressing parameters. The model is built based on the results from the conducted complex study and modeling of the grinding wheel lifetime, cutting ability, production rate and cutting forces during grinding. They are closely related to the dressing conditions （dressing speed ratio, radial in-feed of the diamond roller dresser and dress-out time）, the diamond roller dresser grit size/grinding wheel grit size ratio, the type of synthetic diamonds and the direction of dressing. Some dressing parameters are determined for which the generalized utility fimction has a maximum and which guarantee an optimum combination of the following： the lifetime and cutting ability of the abrasive wheels, the tangential cutting force magnitude and the production rate of the grinding process. The results obtained prove the possibility of control and optimization of grinding by selecting particular dressing parameters.展开更多
Reliability-based design optimization （RBDO） is intrinsically a double-loop procedure since it involves an overall optimization and an iterative reliability assessment at each search point. Due to the double-loop pr...Reliability-based design optimization （RBDO） is intrinsically a double-loop procedure since it involves an overall optimization and an iterative reliability assessment at each search point. Due to the double-loop procedure, the computational expense of RBDO is normally very high. Current RBDO research focuses on problems with explicitly expressed performance functions and readily available gradients. This paper addresses a more challenging type of RBDO problem in which the performance functions are computation intensive. These computation intensive functions are often considered as a ＂black-box＂ and their gradients are not available or not reliable. On the basis of the reliable design space （RDS） concept proposed earlier by the authors, this paper proposes a Reliable Space Pursuing （RSP） approach, in which RDS is first identified and then gradually refined while optimization is performed. It fundamentally avoids the nested optimization and probabilistic assessment loop. Three well known RBDO problems from the literature are used for testing and demonstrating the effectiveness of the proposed RSP method.展开更多
In this paper, we design a primal-dual interior-point algorithm for linear optimization. Search directions and proximity function are proposed based on a new kernel function which includes neither growth term nor barr...In this paper, we design a primal-dual interior-point algorithm for linear optimization. Search directions and proximity function are proposed based on a new kernel function which includes neither growth term nor barrier term. Iteration bounds both for large-and small-update methods are derived, namely, O（nlog（n/c）） and O（√nlog（n/ε））. This new kernel function has simple algebraic expression and the proximity function has not been used before. Analogous to the classical logarithmic kernel function, our complexity analysis is easier than the other pri- mal-dual interior-point methods based on logarithmic barrier functions and recent kernel functions.展开更多
The paper is concerned with the filled functions for global optimization of a continuous function of several variables.More general forms of filled functions are presented for smooth and nonsmooth optimizations.These ...The paper is concerned with the filled functions for global optimization of a continuous function of several variables.More general forms of filled functions are presented for smooth and nonsmooth optimizations.These functions have either two adjustable parameters or one adjustable parameter.Conditions on functions and on the values of parameters are given so that the constructed functions are desired filled functions.展开更多
基金fundings supported by Sichuan Science and Technology Program(2025YFHZ0065).
文摘Structural Reliability-Based Topology Optimization(RBTO),as an efficient design methodology,serves as a crucial means to ensure the development ofmodern engineering structures towards high performance,long service life,and high reliability.However,in practical design processes,topology optimization must not only account for the static performance of structures but also consider the impacts of various responses and uncertainties under complex dynamic conditions,which traditional methods often struggle accommodate.Therefore,this study proposes an RBTO framework based on a Kriging-assisted level set function and a novel Dynamic Hybrid Particle Swarm Optimization(DHPSO)algorithm.By leveraging the Kriging model as a surrogate,the high cost associated with repeatedly running finite element analysis processes is reduced,addressing the issue of minimizing structural compliance.Meanwhile,the DHPSO algorithm enables a better balance between the population’s developmental and exploratory capabilities,significantly accelerating convergence speed and enhancing global convergence performance.Finally,the proposed method is validated through three different structural examples,demonstrating its superior performance.Observed that the computational that,compared to the traditional Solid Isotropic Material with Penalization(SIMP)method,the proposed approach reduces the upper bound of structural compliance by approximately 30%.Additionally,the optimized results exhibit clear material interfaces without grayscale elements,and the stress concentration factor is reduced by approximately 42%.Consequently,the computational results fromdifferent examples verify the effectiveness and superiority of this study across various fields,achieving the goal of providing more precise optimization results within a shorter timeframe.
基金supported by National Key Research and Development Program of China under Grant 2024YFE0210800National Natural Science Foundation of China under Grant 62495062Beijing Natural Science Foundation under Grant L242017.
文摘The Dynamical Density Functional Theory(DDFT)algorithm,derived by associating classical Density Functional Theory(DFT)with the fundamental Smoluchowski dynamical equation,describes the evolution of inhomo-geneous fluid density distributions over time.It plays a significant role in studying the evolution of density distributions over time in inhomogeneous systems.The Sunway Bluelight II supercomputer,as a new generation of China’s developed supercomputer,possesses powerful computational capabilities.Porting and optimizing industrial software on this platform holds significant importance.For the optimization of the DDFT algorithm,based on the Sunway Bluelight II supercomputer and the unique hardware architecture of the SW39000 processor,this work proposes three acceleration strategies to enhance computational efficiency and performance,including direct parallel optimization,local-memory constrained optimization for CPEs,and multi-core groups collaboration and communication optimization.This method combines the characteristics of the program’s algorithm with the unique hardware architecture of the Sunway Bluelight II supercomputer,optimizing the storage and transmission structures to achieve a closer integration of software and hardware.For the first time,this paper presents Sunway-Dynamical Density Functional Theory(SW-DDFT).Experimental results show that SW-DDFT achieves a speedup of 6.67 times within a single-core group compared to the original DDFT implementation,with six core groups(a total of 384 CPEs),the maximum speedup can reach 28.64 times,and parallel efficiency can reach 71%,demonstrating excellent acceleration performance.
文摘A new algorithm based on genetic algorithm(GA) is developed for solving function optimization problems with inequality constraints. This algorithm has been used to a series of standard test problems and exhibited good performance. The computation results show that its generality, precision, robustness, simplicity and performance are all satisfactory.
基金the Research Fund for the Doctoral Program of Higher Education of China (20020008004).
文摘An adaptive immune-genetic algorithm （AIGA） is proposed to avoid premature convergence and guarantee the diversity of the population. Rapid immune response （secondary response）, adaptive mutation and density operators in the AIGA are emphatically designed to improve the searching ability, greatly increase the converging speed, and decrease locating the local maxima due to the premature convergence. The simulation results obtained from the global optimization to four multivariable and multi-extreme functions show that AIGA converges rapidly, guarantees the diversity, stability and good searching ability.
基金Supported by National Natural Science Foundation of China (Grant Nos.51105040,11372036)Aeronautical Science Foundation of China (Grant Nos.2011ZA72003,2009ZA72002)+1 种基金Excellent Young Scholars Research Fund of Beijing Institute of Technology (Grant No.2010Y0102)Foundation Research Fund of Beijing Institute of Technology (Grant No.20130142008)
文摘As a promising technique, surrogate-based design and optimization（SBDO） has been widely used in modern engineering design optimizations. Currently, static surrogate-based optimization methods have been successfully applied to expensive optimization problems. However, due to the low efficiency and poor flexibility, static surrogate-based optimization methods are difficult to efficiently solve practical engineering cases. At the aim of enhancing efficiency, a novel surrogate-based efficient optimization method is developed by using sequential radial basis function（SEO-SRBF）. Moreover, augmented Lagrangian multiplier method is adopted to solve the problems involving expensive constraints. In order to study the performance of SEO-SRBF, several numerical benchmark functions and engineering problems are solved by SEO-SRBF and other well-known surrogate-based optimization methods including EGO, MPS, and IARSM. The optimal solutions, number of function evaluations, and algorithm execution time are recorded for comparison. The comparison results demonstrate that SEO-SRBF shows satisfactory performance in both optimization efficiency and global convergence capability. The CPU time required for running SEO-SRBF is dramatically less than that of other algorithms. In the torque arm optimization case using FEA simulation, SEO-SRBF further reduces 21% of thematerial volume compared with the solution from static-RBF subject to the stress constraint. This study provides the efficient strategy to solve expensive constrained optimization problems.
基金Supported by the National Natural Science Foundation of China (70071042,60073043,60133010)
文摘This paper presents a two-phase genetic algorithm (TPGA) based on the multi- parent genetic algorithm (MPGA). Through analysis we find MPGA will lead the population' s evol vement to diversity or convergence according to the population size and the crossover size, so we make it run in different forms during the global and local optimization phases and then forms TPGA. The experiment results show that TPGA is very efficient for the optimization of low-dimension multi-modal functions, usually we can obtain all the global optimal solutions.
文摘The filled function method is an approach for finding a global minimum of multi-dimensional functions. With more and more relevant research, it becomes a promising way used in unconstrained global optimization. Some filled functions with one or two parameters have already been suggested. However, there is no certain criterion to choose a parameter appropriately. In this paper, a parameter-free filled function was proposed. The definition of the original filled function and assumptions of the objective function given by Ge were improved according to the presented parameter-free filled function. The algorithm and numerical results of test functions were reported. Conclusions were drawn in the end. Key words global optimization - filled function method - local minimizer MSC 2000 90C30
文摘Improving the efficiency of ship optimization is crucial for modem ship design. Compared with traditional methods, multidisciplinary design optimization （MDO） is a more promising approach. For this reason, Collaborative Optimization （CO） is discussed and analyzed in this paper. As one of the most frequently applied MDO methods, CO promotes autonomy of disciplines while providing a coordinating mechanism guaranteeing progress toward an optimum and maintaining interdisciplinary compatibility. However, there are some difficulties in applying the conventional CO method, such as difficulties in choosing an initial point and tremendous computational requirements. For the purpose of overcoming these problems, optimal Latin hypercube design and Radial basis function network were applied to CO. Optimal Latin hypercube design is a modified Latin Hypercube design. Radial basis function network approximates the optimization model, and is updated during the optimization process to improve accuracy. It is shown by examples that the computing efficiency and robustness of this CO method are higher than with the conventional CO method.
文摘Teaching-Learning-Based Optimization (TLBO) is recently being used as a new, reliable, accurate and robust optimization technique scheme for global optimization over continuous spaces [1]. This paper presents an, improved version of TLBO algorithm, called the Weighted Teaching-Learning-Based Optimization (WTLBO). This algorithm uses a parameter in TLBO algorithm to increase convergence rate. Performance comparisons of the proposed method are provided against the original TLBO and some other very popular and powerful evolutionary algorithms. The weighted TLBO (WTLBO) algorithm on several benchmark optimization problems shows a marked improvement in performance over the traditional TLBO and other algorithms as well.
基金Supported by the National Natural Science Foundation of China(60133010,60073043,70071042)
文摘This paper presents a parallel two-level evolutionary algorithm based on domain decomposition for solving function optimization problem containing multiple solutions. By combining the characteristics of the global search and local search in each sub-domain, the former enables individual to draw closer to each optima and keeps the diversity of individuals, while the latter selects local optimal solutions known as latent solutions in sub-domain. In the end, by selecting the global optimal solutions from latent solutions in each sub-domain, we can discover all the optimal solutions easily and quickly.
基金performed in the laboratuary of Istanbul University,Faculty of Forestry where the authors are employed at present
文摘In this study,2~5 （five factors at two-level factorial design） design of experiment was applied to investigate a set of optimal machining parameters to achieve a minimum surface roughness value for Abies nordmanniana.Wood specimens were prepared using different values of spindle speed,feed rate,depth of cut,tool radius,and cutting directions.Average surface roughness （R_z） values were applied using a stylus.The objectives were to：（1）obtain the effective variables of wood surface roughness;（2） analyze which of these factors had an impact on variability in the CNC machining process;（3） evaluate the optimal cutting values within the range of different cutting levels of machining parameters.The results indicate that the design of experiment（DOE） based on the desirability function approach determined the optimal machining parameters successfully,leading to minimum R_a compared to the observed value.Minimum surface roughness values of tangential and radial cutting directions were 3.58 and 3.21 μm,respectively.
文摘This paper presents a Fuzzy Preference Function-based Robust Multidisciplinary Design Optimization(FPF-RMDO) methodology. This method is an effective approach to multidisciplinary systems, which can be used to designer experiences during the design optimization process by fuzzy preference functions. In this study, two optimizations are done for Predator MQ-1 Unmanned Aerial Vehicle(UAV):(A) deterministic optimization and(B) robust optimization. In both problems, minimization of takeoff weight and drag is considered as objective functions, which have been optimized using Non-dominated Sorting Genetic Algorithm(NSGA). In the robust design optimization, cruise altitude and velocity are considered as uncertainties that are modeled by the Monte Carlo Simulation(MCS) method. Aerodynamics, stability and control, mass properties, performance, and center of gravity are used for multidisciplinary analysis. Robust design optimization results show 46% and 42% robustness improvement for takeoff weight and cruise drag relative to optimal design respectively.
文摘Dipper throated optimization(DTO)algorithm is a novel with a very efficient metaheuristic inspired by the dipper throated bird.DTO has its unique hunting technique by performing rapid bowing movements.To show the efficiency of the proposed algorithm,DTO is tested and compared to the algorithms of Particle Swarm Optimization(PSO),Whale Optimization Algorithm(WOA),Grey Wolf Optimizer(GWO),and Genetic Algorithm(GA)based on the seven unimodal benchmark functions.Then,ANOVA and Wilcoxon rank-sum tests are performed to confirm the effectiveness of the DTO compared to other optimization techniques.Additionally,to demonstrate the proposed algorithm’s suitability for solving complex realworld issues,DTO is used to solve the feature selection problem.The strategy of using DTOs as feature selection is evaluated using commonly used data sets from the University of California at Irvine(UCI)repository.The findings indicate that the DTO outperforms all other algorithms in addressing feature selection issues,demonstrating the proposed algorithm’s capabilities to solve complex real-world situations.
文摘In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a （weakly） LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a （weakly） LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval- objective function are convex.
文摘In this paper, a new filled function with only one parameter is proposed. The main advantages of the new filled function are that it not only can be analyzed easily, but also can be approximated uniformly by a continuously differentiable function. Thus, a minimizer of the proposed filled function can be obtained easily by using a local optimization algorithm. The obtained minimizer is taken as the initial point to minimize the objective function and a better minimizer will be found. By repeating the above processes, we will find a global minimizer at last. The results of numerical experiments show that the new proposed filled function method is effective.
基金Project(51074051)supported by the National Natural Science Foundation of ChinaProject(N110307001)supported by the Fundamental Research Funds for the Central Universities,China
文摘In terms of tandem cold mill productivity and product quality, a multi-objective optimization model of rolling schedule based on cost fimction was proposed to determine the stand reductions, inter-stand tensions and rolling speeds for a specified product. The proposed schedule optimization model consists of several single cost fi.mctions, which take rolling force, motor power, inter-stand tension and stand reduction into consideration. The cost function, which can evaluate how far the rolling parameters are from the ideal values, was minimized using the Nelder-Mead simplex method. The proposed rolling schedule optimization method has been applied successfully to the 5-stand tandem cold mill in Tangsteel, and the results from a case study show that the proposed method is superior to those based on empirical formulae.
文摘The existing studies, concerning the dressing process, focus on the major influence of the dressing conditions on the grinding response variables. However, the choice of the dressing conditions is often made, based on the experience of the qualified staff or using data from reference books. The optimal dressing parameters, which are only valid for the particular methods and dressing and grinding conditions, are also used. The paper presents a methodology for optimization of the dressing parameters in cylindrical grinding. The generalized utility function has been chosen as an optimization parameter. It is a complex indicator determining the economic, dynamic and manufacturing characteristics of the grinding process. The developed methodology is implemented for the dressing of aluminium oxide grinding wheels by using experimental diamond roller dressers with different grit sizes made of medium- and high-strength synthetic diamonds type AC32 and AC80. To solve the optimization problem, a model of the generalized utility function is created which reflects the complex impact of dressing parameters. The model is built based on the results from the conducted complex study and modeling of the grinding wheel lifetime, cutting ability, production rate and cutting forces during grinding. They are closely related to the dressing conditions （dressing speed ratio, radial in-feed of the diamond roller dresser and dress-out time）, the diamond roller dresser grit size/grinding wheel grit size ratio, the type of synthetic diamonds and the direction of dressing. Some dressing parameters are determined for which the generalized utility fimction has a maximum and which guarantee an optimum combination of the following： the lifetime and cutting ability of the abrasive wheels, the tangential cutting force magnitude and the production rate of the grinding process. The results obtained prove the possibility of control and optimization of grinding by selecting particular dressing parameters.
基金supported by Natural Science and Engineering Research Council (NSERC) of Canada
文摘Reliability-based design optimization （RBDO） is intrinsically a double-loop procedure since it involves an overall optimization and an iterative reliability assessment at each search point. Due to the double-loop procedure, the computational expense of RBDO is normally very high. Current RBDO research focuses on problems with explicitly expressed performance functions and readily available gradients. This paper addresses a more challenging type of RBDO problem in which the performance functions are computation intensive. These computation intensive functions are often considered as a ＂black-box＂ and their gradients are not available or not reliable. On the basis of the reliable design space （RDS） concept proposed earlier by the authors, this paper proposes a Reliable Space Pursuing （RSP） approach, in which RDS is first identified and then gradually refined while optimization is performed. It fundamentally avoids the nested optimization and probabilistic assessment loop. Three well known RBDO problems from the literature are used for testing and demonstrating the effectiveness of the proposed RSP method.
基金Supported by the Natural Science Foundation of Hubei Province (2008CDZD47)
文摘In this paper, we design a primal-dual interior-point algorithm for linear optimization. Search directions and proximity function are proposed based on a new kernel function which includes neither growth term nor barrier term. Iteration bounds both for large-and small-update methods are derived, namely, O（nlog（n/c）） and O（√nlog（n/ε））. This new kernel function has simple algebraic expression and the proximity function has not been used before. Analogous to the classical logarithmic kernel function, our complexity analysis is easier than the other pri- mal-dual interior-point methods based on logarithmic barrier functions and recent kernel functions.
文摘The paper is concerned with the filled functions for global optimization of a continuous function of several variables.More general forms of filled functions are presented for smooth and nonsmooth optimizations.These functions have either two adjustable parameters or one adjustable parameter.Conditions on functions and on the values of parameters are given so that the constructed functions are desired filled functions.
