多目标排序若干新结果(Ⅰ)

对多目标排序问题,提出一类τ约束多目标简单排序问题,将所论问题归结为简单排序模型:Qm||∑Fτ,i,j(τ=i—j,-λ≤i,j≤λ),并依据简单和式∑aij分解理论给出了最优排序算法.

Non-dominated sorting quantum particle swarm optimization and its application in cognitive radio spectrum allocation

In order to solve discrete multi-objective optimization problems, a non-dominated sorting quantum particle swarm optimization (NSQPSO) based on non-dominated sorting and quantum particle swarm optimization is proposed, and the performance of the NSQPSO is evaluated through five classical benchmark functions. The quantum particle swarm optimization (QPSO) applies the quantum computing theory to particle swarm optimization, and thus has the advantages of both quantum computing theory and particle swarm optimization, so it has a faster convergence rate and a more accurate convergence value. Therefore, QPSO is used as the evolutionary method of the proposed NSQPSO. Also NSQPSO is used to solve cognitive radio spectrum allocation problem. The methods to complete spectrum allocation in previous literature only consider one objective, i.e. network utilization or fairness, but the proposed NSQPSO method, can consider both network utilization and fairness simultaneously through obtaining Pareto front solutions. Cognitive radio systems can select one solution from the Pareto front solutions according to the weight of network reward and fairness. If one weight is unit and the other is zero, then it becomes single objective optimization, so the proposed NSQPSO method has a much wider application range. The experimental research results show that the NSQPS can obtain the same non-dominated solutions as exhaustive search but takes much less time in small dimensions; while in large dimensions, where the problem cannot be solved by exhaustive search, the NSQPSO can still solve the problem, which proves the effectiveness of NSQPSO.

NSGA Ⅱ based multi-objective homing trajectory planning of parafoil system

Homing trajectory planning is a core task of autonomous homing of parafoil system.This work analyzes and establishes a simplified kinematic mathematical model,and regards the homing trajectory planning problem as a kind of multi-objective optimization problem.Being different from traditional ways of transforming the multi-objective optimization into a single objective optimization by weighting factors,this work applies an improved non-dominated sorting genetic algorithm Ⅱ(NSGA Ⅱ) to solve it directly by means of optimizing multi-objective functions simultaneously.In the improved NSGA Ⅱ,the chaos initialization and a crowding distance based population trimming method were introduced to overcome the prematurity of population,the penalty function was used in handling constraints,and the optimal solution was selected according to the method of fuzzy set theory.Simulation results of three different schemes designed according to various practical engineering requirements show that the improved NSGA Ⅱ can effectively obtain the Pareto optimal solution set under different weighting with outstanding convergence and stability,and provide a new train of thoughts to design homing trajectory of parafoil system.

Best compromising crashworthiness design of automotive S-rail using TOPSIS and modified NSGAⅡ

In order to reduce both the weight of vehicles and the damage of occupants in a crash event simultaneously, it is necessary to perform a multi-objective optimal design of the automotive energy absorbing components. Modified non-dominated sorting genetic algorithm II(NSGA II) was used for multi-objective optimization of automotive S-rail considering absorbed energy(E), peak crushing force(Fmax) and mass of the structure(W) as three conflicting objective functions. In the multi-objective optimization problem(MOP), E and Fmax are defined by polynomial models extracted using the software GEvo M based on train and test data obtained from numerical simulation of quasi-static crushing of the S-rail using ABAQUS. Finally, the nearest to ideal point(NIP)method and technique for ordering preferences by similarity to ideal solution(TOPSIS) method are used to find the some trade-off optimum design points from all non-dominated optimum design points represented by the Pareto fronts. Results represent that the optimum design point obtained from TOPSIS method exhibits better trade-off in comparison with that of optimum design point obtained from NIP method.