In order to analyze the influence rule of experimental parameters on the energy-absorption characteristics and effectively forecast energy-absorption characteristic of thin-walled structure, the forecast model of GA-B...In order to analyze the influence rule of experimental parameters on the energy-absorption characteristics and effectively forecast energy-absorption characteristic of thin-walled structure, the forecast model of GA-BP hybrid algorithm was presented by uniting respective applicability of back-propagation artificial neural network （BP-ANN） and genetic algorithm （GA）. The detailed process was as follows. Firstly, the GA trained the best weights and thresholds as the initial values of BP-ANN to initialize the neural network. Then, the BP-ANN after initialization was trained until the errors converged to the required precision. Finally, the network model, which met the requirements after being examined by the test samples, was applied to energy-absorption forecast of thin-walled cylindrical structure impacting. After example analysis, the GA-BP network model was trained until getting the desired network error only by 46 steps, while the single BP-ANN model achieved the same network error by 992 steps, which obviously shows that the GA-BP hybrid algorithm has faster convergence rate. The average relative forecast error （ARE） of the SEA predictive results obtained by GA-BP hybrid algorithm is 1.543%, while the ARE of the SEA predictive results obtained by BP-ANN is 2.950%, which clearly indicates that the forecast precision of the GA-BP hybrid algorithm is higher than that of the BP-ANN.展开更多
A new hybrid optimization algorithm was presented by integrating the gravitational search algorithm （GSA） with the sequential quadratic programming （SQP）, namely GSA-SQP, for solving global optimization problems a...A new hybrid optimization algorithm was presented by integrating the gravitational search algorithm （GSA） with the sequential quadratic programming （SQP）, namely GSA-SQP, for solving global optimization problems and minimization of factor of safety in slope stability analysis. The new algorithm combines the global exploration ability of the GSA to converge rapidly to a near optimum solution. In addition, it uses the accurate local exploitation ability of the SQP to accelerate the search process and find an accurate solution. A set of five well-known benchmark optimization problems was used to validate the performance of the GSA-SQP as a global optimization algorithm and facilitate comparison with the classical GSA. In addition, the effectiveness of the proposed method for slope stability analysis was investigated using three ease studies of slope stability problems from the literature. The factor of safety of earth slopes was evaluated using the Morgenstern-Price method. The numerical experiments demonstrate that the hybrid algorithm converges faster to a significantly more accurate final solution for a variety of benchmark test functions and slope stability problems.展开更多
The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this wor...The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this work, a novel mathematic model for the hybrid flow shop scheduling problem with unrelated parallel machine(HFSPUPM) was proposed. Additionally, an effective hybrid estimation of distribution algorithm was proposed to solve the HFSPUPM, taking advantage of the features in the mathematic model. In the optimization algorithm, a new individual representation method was adopted. The(EDA) structure was used for global search while the teaching learning based optimization(TLBO) strategy was used for local search. Based on the structure of the HFSPUPM, this work presents a series of discrete operations. Simulation results show the effectiveness of the proposed hybrid algorithm compared with other algorithms.展开更多
In order to resolve the coordination and optimization of the power network planning effectively, on the basis of introducing the concept of power intelligence center (PIC), the key factor power flow, line investment a...In order to resolve the coordination and optimization of the power network planning effectively, on the basis of introducing the concept of power intelligence center (PIC), the key factor power flow, line investment and load that impact generation sector, transmission sector and dispatching center in PIC were analyzed and a multi-objective coordination optimal model for new power intelligence center (NPIC) was established. To ensure the reliability and coordination of power grid and reduce investment cost, two aspects were optimized. The evolutionary algorithm was introduced to solve optimal power flow problem and the fitness function was improved to ensure the minimum cost of power generation. The gray particle swarm optimization (GPSO) algorithm was used to forecast load accurately, which can ensure the network with high reliability. On this basis, the multi-objective coordination optimal model which was more practical and in line with the need of the electricity market was proposed, then the coordination model was effectively solved through the improved particle swarm optimization algorithm, and the corresponding algorithm was obtained. The optimization of IEEE30 node system shows that the evolutionary algorithm can effectively solve the problem of optimal power flow. The average load forecasting of GPSO is 26.97 MW, which has an error of 0.34 MW compared with the actual load. The algorithm has higher forecasting accuracy. The multi-objective coordination optimal model for NPIC can effectively process the coordination and optimization problem of power network.展开更多
This paper addresses the open vehicle routing problem with time window(OVRPTW), where each vehicle does not need to return to the depot after completing the delivery task.The optimization objective is to minimize the ...This paper addresses the open vehicle routing problem with time window(OVRPTW), where each vehicle does not need to return to the depot after completing the delivery task.The optimization objective is to minimize the total distance. This problem exists widely in real-life logistics distribution process.We propose a hybrid column generation algorithm(HCGA) for the OVRPTW, embedding both exact algorithm and metaheuristic. In HCGA, a label setting algorithm and an intelligent algorithm are designed to select columns from small and large subproblems, respectively. Moreover, a branch strategy is devised to generate the final feasible solution for the OVRPTW. The computational results show that the proposed algorithm has faster speed and can obtain the approximate optimal solution of the problem with 100 customers in a reasonable time.展开更多
Aiming at the phenomenon of discrete variables whic h generally exists in engineering structural optimization, a novel hybrid genetic algorithm (HGA) is proposed to directly search the optimal solution in this pape r....Aiming at the phenomenon of discrete variables whic h generally exists in engineering structural optimization, a novel hybrid genetic algorithm (HGA) is proposed to directly search the optimal solution in this pape r. The imitative full-stress design method (IFS) was presented for discrete struct ural optimum design subjected to multi-constraints. To reach the imitative full -stress state for dangerous members was the target of IFS through iteration. IF S is integrated in the GA. The basic idea of HGA is to divide the optimization t ask into two complementary parts. The coarse, global optimization is done by the GA while local refinement is done by IFS. For instance, every K generations, th e population is doped with a locally optimal individual obtained from IFS. Both methods run in parallel. All or some of individuals are continuously used as initial values for IFS. The locally optimized individuals are re-implanted into the current generation in the GA. From some numeral examples, hybridizatio n has been discovered as enormous potential for improvement of genetic algorit hm. Selection is the component which guides the HGA to the solution by preferring in dividuals with high fitness over low-fitted ones. Selection can be deterministi c operation, but in most implementations it has random components. "Elite surviv al" is introduced to avoid that the observed best-fitted individual dies out, j ust by selecting it for the next generation without any random experiments. The individuals of population are competitive only in the same generation. There exists no competition among different generations. So HGA may be permitted to h ave different evaluation criteria for different generations. Multi-Selectio n schemes are adopted to avoid slow refinement since the individuals have si milar fitness values in the end phase of HGA. The feasibility of this method is tested with examples of engineering design wit h discrete variables. Results demonstrate the validity of HGA.展开更多
This paper presents a new hybrid genetic algorithm for the vertex cover problems in which scan-repair and local improvement techniques are used for local optimization. With the hybrid approach, genetic algorithms are ...This paper presents a new hybrid genetic algorithm for the vertex cover problems in which scan-repair and local improvement techniques are used for local optimization. With the hybrid approach, genetic algorithms are used to perform global exploration in a population, while neighborhood search methods are used to perform local exploitation around the chromosomes. The experimental results indicate that hybrid genetic algorithms can obtain solutions of excellent quality to the problem instances with different sizes. The pure genetic algorithms are outperformed by the neighborhood search heuristics procedures combined with genetic algorithms.展开更多
In this paper, a new implementation of genetic algorithms (GAs) is developed for the machine scheduling problem, which is abundant among the modern manufacturing systems. The performance measure of early and tardy com...In this paper, a new implementation of genetic algorithms (GAs) is developed for the machine scheduling problem, which is abundant among the modern manufacturing systems. The performance measure of early and tardy completion of jobs is very natural as one's aim, which is usually to minimize simultaneously both earliness and tardiness of all jobs. As the problem is NP-hard and no effective algorithms exist, we propose a hybrid genetic algorithms approach to deal with it. We adjust the crossover and mutation probabilities by fuzzy logic controller whereas the hybrid genetic algorithm does not require preliminary experiments to determine probabilities for genetic operators. The experimental results show the effectiveness of the GAs method proposed in the paper.展开更多
Heuristic optimization methods provide a robust and efficient approach to solving complex optimization problems.This paper presents a hybrid optimization technique combining two heuristic optimization methods,artifici...Heuristic optimization methods provide a robust and efficient approach to solving complex optimization problems.This paper presents a hybrid optimization technique combining two heuristic optimization methods,artificial immune system（AIS） and particle swarm optimization（PSO）,together in searching for the global optima of nonlinear functions.The proposed algorithm,namely hybrid anti-prematuration optimization method,contains four significant operators,i.e.swarm operator,cloning operator,suppression operator,and receptor editing operator.The swarm operator is inspired by the particle swarm intelligence,and the clone operator,suppression operator,and receptor editing operator are gleaned by the artificial immune system.The simulation results of three representative nonlinear test functions demonstrate the superiority of the hybrid optimization algorithm over the conventional methods with regard to both the solution quality and convergence rate.It is also employed to cope with a real-world optimization problem.展开更多
Reengineering the refractive index profile of inhomogeneous coatings is a troublesome task. Multiplicity of solutions may significantly reduced by providing additional information. For this reason an in-situ broadband...Reengineering the refractive index profile of inhomogeneous coatings is a troublesome task. Multiplicity of solutions may significantly reduced by providing additional information. For this reason an in-situ broadband monitoring system was developed to measure the transmittance of the growing film directly at the rotating substrate. For characterization of these coatings, a new model was developed, which significantly reduces the number of parameters. The refractive index profile may be described by a proper number of equally spaced volume fraction values using the Bruggeman effective media approach. A good initial approximation of the refractive index profile can be generated based on deposition rates for both materials recorded with quartz crystal monitor during manufacturing. During the optimization process, a second order minimization algorithm was used to vary the refractive index profile of the whole coating and film thickness of the intermediate stages. Finally, a significantly improved accuracy of the modelled transmittance was achieved.展开更多
为更精确地预测航班过站时间,将全国机场按照规模差异及不同地理位置所导致的客流量差异和天气差异对航班过站时间造成的不同影响进行分类,基于各类机场航班数据,构建混合轻量级梯度提升机算法(LightGBM)模型对航班过站时间分类预测。...为更精确地预测航班过站时间,将全国机场按照规模差异及不同地理位置所导致的客流量差异和天气差异对航班过站时间造成的不同影响进行分类,基于各类机场航班数据,构建混合轻量级梯度提升机算法(LightGBM)模型对航班过站时间分类预测。引入自适应鲁棒损失函数(adaptive robust loss function,ARLF)改进LightGBM模型损失函数,降低航班数据中存在离群值的影响;通过改进的麻雀搜索算法对改进后的LightGBM模型进行参数寻优,形成混合LightGBM模型。采用全国2019年全年航班数据进行验证,实验结果验证了方法的可行性。展开更多
基金Project(50175110) supported by the National Natural Science Foundation of ChinaProject(2009bsxt019) supported by the Graduate Degree Thesis Innovation Foundation of Central South University, China
文摘In order to analyze the influence rule of experimental parameters on the energy-absorption characteristics and effectively forecast energy-absorption characteristic of thin-walled structure, the forecast model of GA-BP hybrid algorithm was presented by uniting respective applicability of back-propagation artificial neural network （BP-ANN） and genetic algorithm （GA）. The detailed process was as follows. Firstly, the GA trained the best weights and thresholds as the initial values of BP-ANN to initialize the neural network. Then, the BP-ANN after initialization was trained until the errors converged to the required precision. Finally, the network model, which met the requirements after being examined by the test samples, was applied to energy-absorption forecast of thin-walled cylindrical structure impacting. After example analysis, the GA-BP network model was trained until getting the desired network error only by 46 steps, while the single BP-ANN model achieved the same network error by 992 steps, which obviously shows that the GA-BP hybrid algorithm has faster convergence rate. The average relative forecast error （ARE） of the SEA predictive results obtained by GA-BP hybrid algorithm is 1.543%, while the ARE of the SEA predictive results obtained by BP-ANN is 2.950%, which clearly indicates that the forecast precision of the GA-BP hybrid algorithm is higher than that of the BP-ANN.
文摘A new hybrid optimization algorithm was presented by integrating the gravitational search algorithm （GSA） with the sequential quadratic programming （SQP）, namely GSA-SQP, for solving global optimization problems and minimization of factor of safety in slope stability analysis. The new algorithm combines the global exploration ability of the GSA to converge rapidly to a near optimum solution. In addition, it uses the accurate local exploitation ability of the SQP to accelerate the search process and find an accurate solution. A set of five well-known benchmark optimization problems was used to validate the performance of the GSA-SQP as a global optimization algorithm and facilitate comparison with the classical GSA. In addition, the effectiveness of the proposed method for slope stability analysis was investigated using three ease studies of slope stability problems from the literature. The factor of safety of earth slopes was evaluated using the Morgenstern-Price method. The numerical experiments demonstrate that the hybrid algorithm converges faster to a significantly more accurate final solution for a variety of benchmark test functions and slope stability problems.
基金Projects(61573144,61773165,61673175,61174040)supported by the National Natural Science Foundation of ChinaProject(222201717006)supported by the Fundamental Research Funds for the Central Universities,China
文摘The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this work, a novel mathematic model for the hybrid flow shop scheduling problem with unrelated parallel machine(HFSPUPM) was proposed. Additionally, an effective hybrid estimation of distribution algorithm was proposed to solve the HFSPUPM, taking advantage of the features in the mathematic model. In the optimization algorithm, a new individual representation method was adopted. The(EDA) structure was used for global search while the teaching learning based optimization(TLBO) strategy was used for local search. Based on the structure of the HFSPUPM, this work presents a series of discrete operations. Simulation results show the effectiveness of the proposed hybrid algorithm compared with other algorithms.
基金Project (70671039) supported by the National Natural Science Foundation of China
文摘In order to resolve the coordination and optimization of the power network planning effectively, on the basis of introducing the concept of power intelligence center (PIC), the key factor power flow, line investment and load that impact generation sector, transmission sector and dispatching center in PIC were analyzed and a multi-objective coordination optimal model for new power intelligence center (NPIC) was established. To ensure the reliability and coordination of power grid and reduce investment cost, two aspects were optimized. The evolutionary algorithm was introduced to solve optimal power flow problem and the fitness function was improved to ensure the minimum cost of power generation. The gray particle swarm optimization (GPSO) algorithm was used to forecast load accurately, which can ensure the network with high reliability. On this basis, the multi-objective coordination optimal model which was more practical and in line with the need of the electricity market was proposed, then the coordination model was effectively solved through the improved particle swarm optimization algorithm, and the corresponding algorithm was obtained. The optimization of IEEE30 node system shows that the evolutionary algorithm can effectively solve the problem of optimal power flow. The average load forecasting of GPSO is 26.97 MW, which has an error of 0.34 MW compared with the actual load. The algorithm has higher forecasting accuracy. The multi-objective coordination optimal model for NPIC can effectively process the coordination and optimization problem of power network.
基金supported by the National Natural Science Foundation of China (61963022,51665025,61873328)。
文摘This paper addresses the open vehicle routing problem with time window(OVRPTW), where each vehicle does not need to return to the depot after completing the delivery task.The optimization objective is to minimize the total distance. This problem exists widely in real-life logistics distribution process.We propose a hybrid column generation algorithm(HCGA) for the OVRPTW, embedding both exact algorithm and metaheuristic. In HCGA, a label setting algorithm and an intelligent algorithm are designed to select columns from small and large subproblems, respectively. Moreover, a branch strategy is devised to generate the final feasible solution for the OVRPTW. The computational results show that the proposed algorithm has faster speed and can obtain the approximate optimal solution of the problem with 100 customers in a reasonable time.
文摘Aiming at the phenomenon of discrete variables whic h generally exists in engineering structural optimization, a novel hybrid genetic algorithm (HGA) is proposed to directly search the optimal solution in this pape r. The imitative full-stress design method (IFS) was presented for discrete struct ural optimum design subjected to multi-constraints. To reach the imitative full -stress state for dangerous members was the target of IFS through iteration. IF S is integrated in the GA. The basic idea of HGA is to divide the optimization t ask into two complementary parts. The coarse, global optimization is done by the GA while local refinement is done by IFS. For instance, every K generations, th e population is doped with a locally optimal individual obtained from IFS. Both methods run in parallel. All or some of individuals are continuously used as initial values for IFS. The locally optimized individuals are re-implanted into the current generation in the GA. From some numeral examples, hybridizatio n has been discovered as enormous potential for improvement of genetic algorit hm. Selection is the component which guides the HGA to the solution by preferring in dividuals with high fitness over low-fitted ones. Selection can be deterministi c operation, but in most implementations it has random components. "Elite surviv al" is introduced to avoid that the observed best-fitted individual dies out, j ust by selecting it for the next generation without any random experiments. The individuals of population are competitive only in the same generation. There exists no competition among different generations. So HGA may be permitted to h ave different evaluation criteria for different generations. Multi-Selectio n schemes are adopted to avoid slow refinement since the individuals have si milar fitness values in the end phase of HGA. The feasibility of this method is tested with examples of engineering design wit h discrete variables. Results demonstrate the validity of HGA.
基金This project was supported by the National Natural Science Foundation of China the Open Project Foundation of Comput-er Software New Technique National Key Laboratory of Nanjing University.
文摘This paper presents a new hybrid genetic algorithm for the vertex cover problems in which scan-repair and local improvement techniques are used for local optimization. With the hybrid approach, genetic algorithms are used to perform global exploration in a population, while neighborhood search methods are used to perform local exploitation around the chromosomes. The experimental results indicate that hybrid genetic algorithms can obtain solutions of excellent quality to the problem instances with different sizes. The pure genetic algorithms are outperformed by the neighborhood search heuristics procedures combined with genetic algorithms.
文摘In this paper, a new implementation of genetic algorithms (GAs) is developed for the machine scheduling problem, which is abundant among the modern manufacturing systems. The performance measure of early and tardy completion of jobs is very natural as one's aim, which is usually to minimize simultaneously both earliness and tardiness of all jobs. As the problem is NP-hard and no effective algorithms exist, we propose a hybrid genetic algorithms approach to deal with it. We adjust the crossover and mutation probabilities by fuzzy logic controller whereas the hybrid genetic algorithm does not require preliminary experiments to determine probabilities for genetic operators. The experimental results show the effectiveness of the GAs method proposed in the paper.
文摘Heuristic optimization methods provide a robust and efficient approach to solving complex optimization problems.This paper presents a hybrid optimization technique combining two heuristic optimization methods,artificial immune system（AIS） and particle swarm optimization（PSO）,together in searching for the global optima of nonlinear functions.The proposed algorithm,namely hybrid anti-prematuration optimization method,contains four significant operators,i.e.swarm operator,cloning operator,suppression operator,and receptor editing operator.The swarm operator is inspired by the particle swarm intelligence,and the clone operator,suppression operator,and receptor editing operator are gleaned by the artificial immune system.The simulation results of three representative nonlinear test functions demonstrate the superiority of the hybrid optimization algorithm over the conventional methods with regard to both the solution quality and convergence rate.It is also employed to cope with a real-world optimization problem.
文摘Reengineering the refractive index profile of inhomogeneous coatings is a troublesome task. Multiplicity of solutions may significantly reduced by providing additional information. For this reason an in-situ broadband monitoring system was developed to measure the transmittance of the growing film directly at the rotating substrate. For characterization of these coatings, a new model was developed, which significantly reduces the number of parameters. The refractive index profile may be described by a proper number of equally spaced volume fraction values using the Bruggeman effective media approach. A good initial approximation of the refractive index profile can be generated based on deposition rates for both materials recorded with quartz crystal monitor during manufacturing. During the optimization process, a second order minimization algorithm was used to vary the refractive index profile of the whole coating and film thickness of the intermediate stages. Finally, a significantly improved accuracy of the modelled transmittance was achieved.
文摘为更精确地预测航班过站时间,将全国机场按照规模差异及不同地理位置所导致的客流量差异和天气差异对航班过站时间造成的不同影响进行分类,基于各类机场航班数据,构建混合轻量级梯度提升机算法(LightGBM)模型对航班过站时间分类预测。引入自适应鲁棒损失函数(adaptive robust loss function,ARLF)改进LightGBM模型损失函数,降低航班数据中存在离群值的影响;通过改进的麻雀搜索算法对改进后的LightGBM模型进行参数寻优,形成混合LightGBM模型。采用全国2019年全年航班数据进行验证,实验结果验证了方法的可行性。
