System deployment optimization in architecture design

Optimization of architecture design has recently drawn research interest. System deployment optimization （SDO） refers to the process of optimizing systems that are being deployed to activi- ties. This paper first formulates a mathematical model to theorize and operationalize the SDO problem and then identifies optimal so- lutions to solve the SDO problem. In the solutions, the success rate of the combat task is maximized, whereas the execution time of the task and the cost of changes in the system structure are mini- mized. The presented optimized algorithm generates an optimal solution without the need to check the entire search space. A novel method is finally proposed based on the combination of heuristic method and genetic algorithm （HGA）, as well as the combination of heuristic method and particle swarm optimization （HPSO）. Experi- ment results show that the HPSO method generates solutions faster than particle swarm optimization （PSO） and genetic algo- rithm （GA） in terms of execution time and performs more efficiently than the heuristic method in terms of determining the best solution.     

A transfer forecasting model for container throughput guided by discrete PSO

Abstract Accurate forecast of future container throughput of a port is very important for its con struction, upgrading, and operation management. This study proposes a transfer forecasting model guided by discrete particle swarm optimization algorithm （TF-DPSO）. It firstly transfers some related time series in source domain to assist in modeling the target time series by transfer learning technique, and then constructs the forecasting model by a pattern matching method called analog complexing. Finally, the discrete particle swarm optimization algorithm is introduced to find the optimal match between the two important parameters in TF-DPSO. The container throughput time series of two im portant ports in China, Shanghai Port and Ningbo Port are used for empirical analysis, and the results show the effectiveness of the proposed model.     

Blind estimation of phase offset in OFDM subcarrier for coherent demodulation

An adaptive algorithm named low complexity phase offset estimation (LC-POE) is proposed for orthogonal frequency division multiplexing (OFDM) signals. Depending on the requirement, the estimation procedure is divided into several scales to accelerate the adaptive convergence speed and ensure the estimation accuracy. The true phase offset is estimated through shrinking the detection range and raising the resolution scale step by step. Both the convergence performance and complexity are discussed in the paper. Simulation results show the effectiveness of the proposed algorithm. The LC-POE algorithm is promising in the application of OFDM systems.     

Support vector classification algorithm based on variable parameter linear programming

To solve the problems of SVM in dealing with large sample size and asymmetric distributed samples, a support vector classification algorithm based on variable parameter linear programming is proposed. In the proposed algorithm, linear programming is employed to solve the optimization problem of classification to decrease the computation time and to reduce its complexity when compared with the original model. The adjusted punishment parameter greatly reduced the classification error resulting from asymmetric distributed samples and the detailed procedure of the proposed algorithm is given. An experiment is conducted to verify whether the proposed algorithm is suitable for asymmetric distributed samples.     

Shape control on probability density function in stochastic systems

A novel strategy of probability density function （PDF） shape control is proposed in stochastic systems. The control er is designed whose parameters are optimal y obtained through the improved particle swarm optimization algorithm. The parameters of the control er are viewed as the space position of a particle in particle swarm optimization algorithm and updated continual y until the control er makes the PDF of the state variable as close as possible to the expected PDF. The proposed PDF shape control technique is compared with the equivalent linearization technique through simulation experiments. The results show the superiority and the effectiveness of the proposed method. The control er is excellent in making the state PDF fol ow the expected PDF and has the very smal error between the state PDF and the expected PDF, solving the control problem of the PDF shape in stochastic systems effectively.     

求解约束优化问题的动量粒子群算法

为解决约束优化问题,提出使用双可行域吸引子策略改进动量粒子群算法。该算法只需初始种群中有一个粒子位于可行域内,随着搜索过程的进行,整个种群自动进入可行域内搜索。一方面,在搜索过程早期,由于可行域内粒子少,所有粒子移向相同的吸引子,整个种群迅速进入可行域内。另一方面,随着进入可行域粒子的增多,由于每个粒子使用距本身最近的可行域吸引子,较好地维持了种种群的多样性,避免早熟现象的发生,使算法具有较好的寻优性能。与国际上当前解决约束优化问题的粒子群算法在4个标准约束优化函数上测试比较,实验结果表明本算法取得的最优值要优于其它粒子群算法。

Abstract：

The strategy that two good positions in feasible region worked as attractors was incorporated into momentum particle swarm optimization algorithm in order to resolve constrained optimization problems. The resulting algorithm only requires that one of the initial particles is in the feasible region, and then all particles in the swam automatically move into the feasible region. On the one hand, in the early iterations few particles appear in the feasible region and hence all particles move toward the same attractors, so the particles soon enter into the feasible region. On the other hand, as the number of particles in the feasible region increases, each particle adopts the most near attractor so that each particle has different attractor. Therefore, the algorithm maintains the diversity of the population, alleviates the premature, and hence achieves good performance. The algorithm is compared with other particle swarm optimization algorithms on four benchmark functions. The experimental results show that the solution of the algorithm is better than that of others.     

Autotuning algorithm of particle swarm PID parameter based on D-Tent chaotic model

An improved particle swarm algorithm based on the D-Tent chaotic model is put forward aiming at the standard particle swarm algorithm. The convergence rate of the late of proposed algorithm is improved by revising the inertia weight of global optimal particles and the introduction of D-Tent chaotic sequence. Through the test of typical function and the autotuning test of proportionalintegral-derivative （PID） parameter, finally a simulation is made to the servo control system of a permanent magnet synchronous motor （PMSM） under double-loop control of rotating speed and current by utilizing the chaotic particle swarm algorithm. Studies show that the proposed algorithm can reduce the iterative times and improve the convergence rate under the condition that the global optimal solution can be got.     

Polyphase coded signal design for MIMO radar using MO-MicPSO

A novel modified optimization technique known as the multi-objective micro particle swarm optimization(MO-MicPSO) is proposed for polyphase coded signal design.The proposed MO-MicPSO requires only a small population size compared with the standard particle swarm optimization that uses a larger population size.This new method is guided by an elite archive to finish the multi-objective optimization.The orthogonal polyphase coded signal(OPCS) can fundamentally improve the multiple input multiple output(MIMO) radar system performance,with which the radar system has high resolution and abundant signal channels.Simulation results on the polyphase coded signal design show that the MO-MicPSO can perform quite well for this high-dimensional multi-objective optimized problem.Compared with particle swarm optimization or genetic algorithm,the proposed MO-MicPSO has a better optimized efficiency and less time consumption.     

基于DPSO的无等待混合流水车间调度方法

研究了无等待混合流水车间调度问题,调度目标为最小化工件的最大完成时间。针对问题中工件加工无等待特点,设计了分阶段实现的无等待算法,并将机器的能力约束嵌入到算法之中。在此基础上,首次应用离散粒子群优化算法对无等待混合流水车间调度问题进行了优化求解。通过仿真实验表明,离散粒子群算法的优化质量优于遗传算法及LTPT、STPT和FCFP三种启发式算法,同时验证了分阶段无等待算法的有效性。

Abstract：

A no-wait hybrid flow shop（NWHFS） scheduling problem was studied for the objective of minimizing makespan.For the no-wait constraint between two sequential operations of a job,not only the no-wait algorithm of grading was designed,but also the number restriction of machines was embedded into this algorithm.On this basis,the discrete particle swarm optimization（DPSO） algorithm was proposed for the first time to solve such problems.The last simulation experiments show the optimization qualities of DPSO are superior to those of the genetic algorithm（GA） and the heuristic algorithms of LTPT,STPT and FCFP,and demonstrate the effectiveness of the no-wait algorithm of grading as well.     

Genetic algorithm for pareto optimum-based route selection

A quality of service (QoS) or constraint-based routing selection needs to find a path subject to multiple constraints through a network. The problem of finding such a path is known as the multi-constrained path(MCP) problem, and has been proven to be NP-complete that cannot be exactly solved in a polynomial time. The NPC problem is converted into a multiobjective optimization problem with constraints to be solved with a genetic algorithm. Based on the Pareto optimum, a constrained routing computation method is proposed to generate a set of nondominated optimal routes with the genetic algorithm mechanism. The convergence and time complexity of the novel algorithm is analyzed. Experimental results show that multiobjective evolution is highly responsive and competent for the Pareto optimum-based route selection. When this method is applied to a MPLS and metropolitan-area network, it will be capable of optimizing the transmission performance.     

基于混合粒子群算法和快速非均匀平面波算法的介质目标反演

提出了一种重构介质目标的新方法--混合粒子群算法,研究了几何形状已知的介质目标介电参数反演、均匀介质柱的外形轮廓反演及外形轮廓与介电参数均未知时的介质目标反演三类问题。利用快速非均匀平面波算法加速矩量法求解介质目标的雷达散射截面,以介质柱体的散射场的实际测量值与迭代计算值的偏差作为目标函数,通过单纯形法和伪群交叉算法混合的粒子群算法对优化变量进行优化,使目标函数达到最小值来对介质目标的介电特性进行电磁成像。仿真结果表明：混合粒子群算法简单、通用,在反演过程中不用加入正则化处理以确保数值稳定性,比简单遗传算法具有更好收敛性能、更高的成像精度和抗随机噪声干扰的能力。     

认知无线网络中准入控制和功率控制联合优化

提出了一种基于离散的粒子群算法和单纯形法的优化机制来实现准入控制和功率控制的联合优化方案。在主用户干扰温度门限和次用户QoS的约束下,将准入控制建模成0/1组合优化问题,并将功率控制建模成线性约束问题,由于准入控制是NP难,该方案将准入控制和功率控制进行加权规划进行优化,同时,为降低计算复杂度,提出一种针对准入控制组合优化的可行性验证方法。并且针对离散的粒子群算法的收敛性进行了证明。仿真与分析表明,该方案具有收敛性,相比其他优化方案,能更有效地提高用户准入量并降低用户功率消耗,提高网络性能。     

基于Hammerstein-Wiener模型的广义预测控制

提出了一种新型的基于Hammerstein-Wiener模型的广义预测控制策略。采用基于最小二乘支持向量机的Hammerstein-Wiener模型描述非线性系统动态特性,作为被控对象预测模型。同时,针对现有遗传算法和混沌粒子群优化算法收敛速度慢和精度低等缺点,给出一种拟牛顿信赖域混沌粒子群混合优化算法,作为预测控制的滚动优化策略,函数测试和非线性对象的广义预测控制的滚动优化表明该算法的优越性。最后,对设计的预测控制器进行实例仿真,结果表明它能满足系统实时稳定运行的需求,取得了良好的控制效果。     

Improved algorithms to plan missions for agile earth observation satellites

This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satellites. Hence, the mission planning and scheduling of AEOS is a popular research problem. This research investigates AEOS characteristics and establishes a mission planning model based on the working principle and constraints of AEOS as per analysis. To solve the scheduling issue of AEOS, several improved algorithms are developed. Simulation results suggest that these algorithms are effective.     

混沌量子粒子群的权重类条件贝叶斯网络分类器参数学习

针对贝叶斯网络判别学习方法在处理大数据集时,存在的模型训练时间长、算法迭代次数过多等问题,通过引入指数级参数,提出了混沌量子粒子群的权重类条件贝叶斯网络参数学习方法。该方法首先通过优化对数似然函数,解决生成学习的参数估计问题。然后,使用生成学习的结果,初始化判别学习的参数。最后,引入混沌映射序列,通过混沌量子粒子群优化(chaos quantum particle swarm optimization, CQPSO)算法,优化条件对数似然函数。使用权重类条件贝叶斯网络分类器对液体火箭发动机的故障进行分类,仿真结果表明,改进的方法分类精度高,误分类率低。同时,采用CQPSO与量子粒子群优化(quantum particle swarm optimization, QPSO)算法、标准粒子群优化(particle swarm optimization, PSO)算法相比,能够有效减少算法的迭代次数,提高算法的效率。     

MIMO-OFDM系统中联合时域和空间域信号处理的改进PTS算法

为了降低多输入多输出正交频分复用(multiple input multiple output orthogonal frequency division multiplexing, MIMO-OFDM)系统中传统部分传输序列(partial transmit sequence, PTS)算法的计算复杂度,提出了联合时域和空间域信号处理的改进PTS算法。在时域信号处理部分,通过信号子块循环移位实现备选序列的增加;在空间域部分,利用天线间信号子块交换实现峰均功率比(peak to average power ratio, PAPR)抑制。同时在接收端 ,利用子块相位旋转引起的相位差异,本方法通过比较接收信号与星座点的距离,可以实现信号的盲检测,从而有效高MIMO-OFDM系统的频谱利用率。仿真结果表明,提出的方法能有效地抑制MIMO-OFDM信号的PAPR,而且明显降低了传统PTS算法的计算复杂度,同时可获得跟传统PTS方法已知边带副信息时相似的比特误码率(bit error rate, BER)性能。     

基于双种群协同进化的QoS全局最优

针对服务质量（quality of service, QoS）全局最优Web服务选择问题,提出了一种双种群协同进化QoS全局最优Web服务选择算法。算法在多目标离散粒子群算法基础上设计一种双种群协同进化框架以同步进行非支配排序和精英粒子保留,并定义了一种新的离散粒子位置更新算子。同时为保证粒子的多样性和算法的全局收敛能力,算法采用基于距离的粒子多样性度量算子、基于适应值排序的粒子选择算法和基于轮盘赌的全局最优解选择策略。仿真实验结果表明该算法能同时优化多个目标,并得到一组满足约束的Pareto最优解,且具有较好的性能和鲁棒性,解集的质量和分布也优于非支配排序遗传（nondominated sorting genetic algorithm,NSGA）算法的改进算法NSGA-Ⅱ,能有效解决QoS全局最优的Web服务选择问题。     

基于Tent映射的混沌混合粒子群优化算法

为改善基本粒子群优化算法的寻优性能,通过算法混合,在粒子群优化算法中逐步引入优进策略和混沌搜索机制,以加强粒子群的局部寻优效率和全局寻优性能。并将粒子分为两类,分别执行不同的进化机制,实现协同寻优,从而构建为一种新的混沌混合粒子群优化算法。标准测试函数的仿真优化结果表明,该混合算法对较大规模的复杂问题具有较强的求解能力。算法寻优效率高、全局性能好、优化结果稳定,性能明显优于标准粒子群优化算法以及遗传算法等单一的随机搜索方法。     

基于改进粒子群算法的USV航向分数阶控制

针对欠驱动水面船舶（underactuated surface vessel,USV）航向保持稳定性问题,对船舶自动舵控制系统设计了分数阶PIλDμ控制器。积分阶次λ和微分阶次μ的引入使得分数阶比例积分微分（proportion integration differentiation, PID）PIλDμ控制器具有更好的鲁棒性和抗扰动能力,但同时也加大了算法设计的难度。使用改进粒子群算法对分数阶PIλDμ控制器参数进行整定,即解决了粒子群算法容易使粒子陷入局部最优问题,又解决了分数阶PIλDμ控制器整定参数多、设计复杂问题。通过仿真对比实验,结果表明,该控制器能很好地根据船舶动态特性变化,自动进行适应性参数优化,具有跟踪速度快、航向控制超调小以及抗扰性强等优点。