In order to solve reliability-redundancy allocation problems more effectively, a new hybrid algorithm named CDEPSO is proposed in this work, which combines particle swarm optimization （PSO） with differential evoluti...In order to solve reliability-redundancy allocation problems more effectively, a new hybrid algorithm named CDEPSO is proposed in this work, which combines particle swarm optimization （PSO） with differential evolution （DE） and a new chaotic local search. In the CDEPSO algorithm, DE provides its best solution to PSO if the best solution obtained by DE is better than that by PSO, while the best solution in the PSO is performed by chaotic local search. To investigate the performance of CDEPSO, four typical reliability-redundancy allocation problems were solved and the results indicate that the convergence speed and robustness of CDEPSO is better than those of PSO and CPSO （a hybrid algorithm which only combines PSO with chaotic local search）. And, compared with the other six improved meta-heuristics, CDEPSO also exhibits more robust performance. In addition, a new performance was proposed to more fairly compare CDEPSO with the same six improved recta-heuristics, and CDEPSO algorithm is the best in solving these problems.展开更多
Based on crowding mechanism, a novel niche genetic algorithm was proposed which can record evolution- ary direction dynamically during evolution. After evolution, the solutions’s precision can be greatly improved by ...Based on crowding mechanism, a novel niche genetic algorithm was proposed which can record evolution- ary direction dynamically during evolution. After evolution, the solutions’s precision can be greatly improved by means of the local searching along the recorded direction. Simulation shows that this algorithm can not only keep population diversity but also find accurate solutions. Although using this method has to take more time compared with the standard GA, it is really worth applying to some cases that have to meet a demand for high solution precision.展开更多
In the view of the disadvantages of complex method (CM) and electromagnetism-like algorithm (EM), complex electromagnetism-like hybrid algorithm (CEM) was proposed by embedding complex method into electromagnetism-lik...In the view of the disadvantages of complex method (CM) and electromagnetism-like algorithm (EM), complex electromagnetism-like hybrid algorithm (CEM) was proposed by embedding complex method into electromagnetism-like algorithm as local optimization algorithm. CEM was adopted to search the minimum safety factor in slope stability analysis and the results show that CEM holds advantages over EM and CM. It combines the merits of two and is more stable and efficient. For further improvement, two CEM hybrid algorithms based on predatory search (PS) strategies were proposed, both of which consist of modified algorithms and the search area of which is dynamically adjusted by changing restriction. The CEM-PS1 adopts theoretical framework of original predatory search strategy. The CEM-PS2 employs the idea of area-restricted search learned from predatory search strategy, but the algorithm structure is simpler. Both the CEM-PS1 and CEM-PS2 have been demonstrated more effective and efficient than the others. As for complex method which locates in hybrid algorithm, the optimization can be achieved at a convergence precision of 1×10-3, which is recommended to use.展开更多
Rendezvous in circular or near circular orbits has been investigated in great detail, while rendezvous in arbitrary eccentricity elliptical orbits is not sufficiently explored. Among the various optimization methods p...Rendezvous in circular or near circular orbits has been investigated in great detail, while rendezvous in arbitrary eccentricity elliptical orbits is not sufficiently explored. Among the various optimization methods proposed for fuel optimal orbital rendezvous, Lawden＇s primer vector theory is favored by many researchers with its clear physical concept and simplicity in solu- tion. Prussing has applied the primer vector optimization theory to minimum-fuel, multiple-impulse, time-fixed orbital ren- dezvous in a near circular orbit and achieved great success. Extending Prussing＇s work, this paper will employ the primer vec- tor theory to study trajectory optimization problems of arbitrary eccentricity elliptical orbit rendezvous. Based on linearized equations of relative motion on elliptical reference orbit （referred to as T-H equations）, the primer vector theory is used to deal with time-fixed multiple-impulse optimal rendezvous between two coplanar, coaxial elliptical orbits with arbitrary large ec- centricity. A parameter adjustment method is developed for the prime vector to satisfy the Lawden＇s necessary condition for the optimal solution. Finally, the optimal multiple-impulse rendezvous solution including the time, direction and magnitudes of the impulse is obtained by solving the two-point boundary value problem. The rendezvous error of the linearized equation is also analyzed. The simulation results confirmed the analyzed results that the rendezvous error is small for the small eccentric- ity case and is large for the higher eccentricity. For better rendezvous accuracy of high eccentricity orbits, a combined method of multiplier penalty function with the simplex search method is used for local optimization. The simplex search method is sensitive to the initial values of optimization variables, but the simulation results show that initial values with the primer vector theory, and the local optimization algorithm can improve the rendezvous accuracy effectively with fast convergence, because the optimal results obtained by the primer vector theory are already very close to the actual optimal solution.展开更多
The layout design of satellite modules is considered to be NP-hard. It is not only a complex coupled system design problem but also a special multi-objective optimization problem. The greatest challenge in solving thi...The layout design of satellite modules is considered to be NP-hard. It is not only a complex coupled system design problem but also a special multi-objective optimization problem. The greatest challenge in solving this problem is that the function to be optimized is characterized by a multitude of local minima separated by high-energy barriers. The Wang-Landau(WL) sampling method, which is an improved Monte Carlo method, has been successfully applied to solve many optimization problems. In this paper we use the WL sampling method to optimize the layout of a satellite module. To accelerate the search for a global optimal layout, local search(LS) based on the gradient method is executed once the Monte-Carlo sweep produces a new layout. By combining the WL sampling algorithm, the LS method, and heuristic layout update strategies, a hybrid method called WL-LS is proposed to obtain a final layout scheme. Furthermore, to improve significantly the efficiency of the algorithm, we propose an accurate and fast computational method for the overlapping depth between two objects(such as two rectangular objects, two circular objects, or a rectangular object and a circular object) embedding each other. The rectangular objects are placed orthogonally. We test two instances using first 51 and then 53 objects. For both instances, the proposed WL-LS algorithm outperforms methods in the literature. Numerical results show that the WL-LS algorithm is an effective method for layout optimization of satellite modules.展开更多
The locally optimal block preconditioned 4-d conjugate gradient method(LOBP4dC G) for the linear response eigenvalue problem was proposed by Bai and Li(2013) and later was extended to the generalized linear response e...The locally optimal block preconditioned 4-d conjugate gradient method(LOBP4dC G) for the linear response eigenvalue problem was proposed by Bai and Li(2013) and later was extended to the generalized linear response eigenvalue problem by Bai and Li(2014). We put forward two improvements to the method: A shifting deflation technique and an idea of extending the search subspace. The deflation technique is able to deflate away converged eigenpairs from future computation, and the idea of extending the search subspace increases convergence rate per iterative step. The resulting algorithm is called the extended LOBP4 dC G(ELOBP4dC G).Numerical results of the ELOBP4 dC G strongly demonstrate the capability of deflation technique and effectiveness the search space extension for solving linear response eigenvalue problems arising from linear response analysis of two molecule systems.展开更多
基金Project(20040533035)supported by the National Research Foundation for the Doctoral Program of Higher Education of ChinaProject(60874070)supported by the National Natural Science Foundation of China
文摘In order to solve reliability-redundancy allocation problems more effectively, a new hybrid algorithm named CDEPSO is proposed in this work, which combines particle swarm optimization （PSO） with differential evolution （DE） and a new chaotic local search. In the CDEPSO algorithm, DE provides its best solution to PSO if the best solution obtained by DE is better than that by PSO, while the best solution in the PSO is performed by chaotic local search. To investigate the performance of CDEPSO, four typical reliability-redundancy allocation problems were solved and the results indicate that the convergence speed and robustness of CDEPSO is better than those of PSO and CPSO （a hybrid algorithm which only combines PSO with chaotic local search）. And, compared with the other six improved meta-heuristics, CDEPSO also exhibits more robust performance. In addition, a new performance was proposed to more fairly compare CDEPSO with the same six improved recta-heuristics, and CDEPSO algorithm is the best in solving these problems.
文摘Based on crowding mechanism, a novel niche genetic algorithm was proposed which can record evolution- ary direction dynamically during evolution. After evolution, the solutions’s precision can be greatly improved by means of the local searching along the recorded direction. Simulation shows that this algorithm can not only keep population diversity but also find accurate solutions. Although using this method has to take more time compared with the standard GA, it is really worth applying to some cases that have to meet a demand for high solution precision.
基金Project(10972238) supported by the National Natural Science Foundation of ChinaProject(2010ssxt237) supported by Graduate Student Innovation Foundation of Central South University, ChinaProject supported by Excellent Doctoral Thesis Support Program of Central South University, China
文摘In the view of the disadvantages of complex method (CM) and electromagnetism-like algorithm (EM), complex electromagnetism-like hybrid algorithm (CEM) was proposed by embedding complex method into electromagnetism-like algorithm as local optimization algorithm. CEM was adopted to search the minimum safety factor in slope stability analysis and the results show that CEM holds advantages over EM and CM. It combines the merits of two and is more stable and efficient. For further improvement, two CEM hybrid algorithms based on predatory search (PS) strategies were proposed, both of which consist of modified algorithms and the search area of which is dynamically adjusted by changing restriction. The CEM-PS1 adopts theoretical framework of original predatory search strategy. The CEM-PS2 employs the idea of area-restricted search learned from predatory search strategy, but the algorithm structure is simpler. Both the CEM-PS1 and CEM-PS2 have been demonstrated more effective and efficient than the others. As for complex method which locates in hybrid algorithm, the optimization can be achieved at a convergence precision of 1×10-3, which is recommended to use.
基金supported by the National Natural Science Foundation of China(Grant Nos. 10832004 and 11072122)
文摘Rendezvous in circular or near circular orbits has been investigated in great detail, while rendezvous in arbitrary eccentricity elliptical orbits is not sufficiently explored. Among the various optimization methods proposed for fuel optimal orbital rendezvous, Lawden＇s primer vector theory is favored by many researchers with its clear physical concept and simplicity in solu- tion. Prussing has applied the primer vector optimization theory to minimum-fuel, multiple-impulse, time-fixed orbital ren- dezvous in a near circular orbit and achieved great success. Extending Prussing＇s work, this paper will employ the primer vec- tor theory to study trajectory optimization problems of arbitrary eccentricity elliptical orbit rendezvous. Based on linearized equations of relative motion on elliptical reference orbit （referred to as T-H equations）, the primer vector theory is used to deal with time-fixed multiple-impulse optimal rendezvous between two coplanar, coaxial elliptical orbits with arbitrary large ec- centricity. A parameter adjustment method is developed for the prime vector to satisfy the Lawden＇s necessary condition for the optimal solution. Finally, the optimal multiple-impulse rendezvous solution including the time, direction and magnitudes of the impulse is obtained by solving the two-point boundary value problem. The rendezvous error of the linearized equation is also analyzed. The simulation results confirmed the analyzed results that the rendezvous error is small for the small eccentric- ity case and is large for the higher eccentricity. For better rendezvous accuracy of high eccentricity orbits, a combined method of multiplier penalty function with the simplex search method is used for local optimization. The simplex search method is sensitive to the initial values of optimization variables, but the simulation results show that initial values with the primer vector theory, and the local optimization algorithm can improve the rendezvous accuracy effectively with fast convergence, because the optimal results obtained by the primer vector theory are already very close to the actual optimal solution.
基金supported by the National Natural Science Foundation of China(Nos.61373016 and 61403206)the Six Talent Peaks Project of Jiangsu Province,China(No.DZXX-041)+1 种基金Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutionsthe Natural Science Foundation of Jiangsu Province,China(No.BK20141005)
文摘The layout design of satellite modules is considered to be NP-hard. It is not only a complex coupled system design problem but also a special multi-objective optimization problem. The greatest challenge in solving this problem is that the function to be optimized is characterized by a multitude of local minima separated by high-energy barriers. The Wang-Landau(WL) sampling method, which is an improved Monte Carlo method, has been successfully applied to solve many optimization problems. In this paper we use the WL sampling method to optimize the layout of a satellite module. To accelerate the search for a global optimal layout, local search(LS) based on the gradient method is executed once the Monte-Carlo sweep produces a new layout. By combining the WL sampling algorithm, the LS method, and heuristic layout update strategies, a hybrid method called WL-LS is proposed to obtain a final layout scheme. Furthermore, to improve significantly the efficiency of the algorithm, we propose an accurate and fast computational method for the overlapping depth between two objects(such as two rectangular objects, two circular objects, or a rectangular object and a circular object) embedding each other. The rectangular objects are placed orthogonally. We test two instances using first 51 and then 53 objects. For both instances, the proposed WL-LS algorithm outperforms methods in the literature. Numerical results show that the WL-LS algorithm is an effective method for layout optimization of satellite modules.
基金supported by National Science Foundation of USA(Grant Nos.DMS1522697,CCF-1527091,DMS-1317330 and CCF-1527091)National Natural Science Foundation of China(Grant No.11428104)
文摘The locally optimal block preconditioned 4-d conjugate gradient method(LOBP4dC G) for the linear response eigenvalue problem was proposed by Bai and Li(2013) and later was extended to the generalized linear response eigenvalue problem by Bai and Li(2014). We put forward two improvements to the method: A shifting deflation technique and an idea of extending the search subspace. The deflation technique is able to deflate away converged eigenpairs from future computation, and the idea of extending the search subspace increases convergence rate per iterative step. The resulting algorithm is called the extended LOBP4 dC G(ELOBP4dC G).Numerical results of the ELOBP4 dC G strongly demonstrate the capability of deflation technique and effectiveness the search space extension for solving linear response eigenvalue problems arising from linear response analysis of two molecule systems.
