车轮转速信号混合噪声的非线性Volterra滤波方法

为保证机车黏着控制品质,提出车轮转速信号所含混合噪声(高斯噪声和冲击噪声)的非线性Volterra滤波方法,并结合混沌优化策略及动态随机局部搜索算子,提出动态随机局部搜索生物地理优化算法对Volterra滤波器模型参数进行优化求解.利用Volterra滤波器的结构优势(具有预测性能、兼具线性和非线性项),既能滤除混合噪声又可满足黏着控制的实时性要求.仿真实验结果表明,经优化求解的非线性Volterra滤波器实现了对车轮转速信号所含混合噪声的有效滤除.

面向多平台多目标协同跟踪的指派问题

针对多平台多目标协同跟踪中要求多个无人地面平台尽可能均匀地协同跟踪多个目标的特点,提出了改进的离散粒子群优化算法。首先采用连续型粒子群优化算法中的速度和位置迭代公式,然后对粒子位置进行离散编码,使粒子编码对应于可行的指派方案;其次,在优化算法中引入局部搜索,提高算法寻优性能。最后将所提算法应用于多平台多目标协同跟踪中的指派问题,并与未加入局部搜索的粒子群优化算法比较,仿真结果表明,加入局部搜索后的离散粒子群优化算法具有较好的寻优性能。

Modified electromagnetism-like algorithm and its application to slope stability analysis

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.

Hybrid particle swarm optimization with differential evolution and chaotic local search to solve reliability-redundancy allocation problems

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.

带有限容量缓冲库的多目标柔性作业车间调度优化

研究一类从无缝钢管生产实际中提炼出的作业车间调度问题.该问题具有生产工序间存在有限容量缓冲库,生产工艺路径柔性选择,生产设备需要转换时间,生产调度多目标等特点.针对具有这些特点的调度问题,构建了混合整数规划模型.鉴于其NP-hard性,设计改进的遗传算法进行求解,进而提出辅以局部搜索优化算法的方法,并通过企业生产实际数据比较和验证算法的性能及有效性.该模型和算法已被用于无缝钢管生产作业计划软件系统的开发,并在实际运用中取得了良好的效果,对各大钢管企业的生产调度均具有一定的实际指导意义.

Optimal four-impulse rendezvous between coplanar elliptical orbits

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.

Multi-objective layout optimization of a satellite module using the Wang-Landau sampling method with local search

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.