Due to the nonlinearity and difficulty in the process of the cooperative target assignment, a discrete beetle swarm optimization algorithm is proposed. Firstly, the target assignment model is established based on the ...
详细信息
ISBN:
(纸本)9781665440899
Due to the nonlinearity and difficulty in the process of the cooperative target assignment, a discrete beetle swarm optimization algorithm is proposed. Firstly, the target assignment model is established based on the damage probability and target value of missile attacking target. Secondly, according to the constraint characteristics of the model, a particle integer coding method is proposed to reduce the complexity of the problem. Then, the discrete beetle swarm optimization algorithm is designed and used to solve the problem, which is an improved particle swarm optimization algorithm by introducing beetle antennae search algorithm. The simulation results show that the algorithm combines the advantages of particle swarm optimization algorithm and beetle antennae search algorithm, and has fast convergence speed and is not easy to fall into local optimum. Compared with other algorithms, the effectiveness of the algorithm is verified.
The metaheuristic particle Swarm Optimization (PSO) is well suited to solve the Flexible Job Shop Scheduling Problem (FJSP), and a suitable particle representation should importantly impact the optimization results an...
详细信息
ISBN:
(数字)9783319920580
ISBN:
(纸本)9783319920580;9783319920573
The metaheuristic particle Swarm Optimization (PSO) is well suited to solve the Flexible Job Shop Scheduling Problem (FJSP), and a suitable particle representation should importantly impact the optimization results and performance of this algorithm. The chosen representation has a direct impact on the dimension and content of the solution space. In this paper, we intend to evaluate and compare the performance of two different variants of PSO with different particle representations (PSO with Job-Machine coding Scheme (PSO-JMS) and PSO with Only-Machine coding Scheme (PSO-OMS)) for solving FJSP. These procedures have been tested on thirteen benchmark problems, where the objective function is to minimize the makespan and total workload and to compare the run time of the different PSO variants. Based on the experimental results, it is clear that PSO-OMS gives the best performance in solving all benchmark problems.
Due to the nonlinearity and difficulty in the process of the cooperative target assignment,a discrete beetle swarm optimization algorithm is ***,the target assignment model is established based on the damage probabili...
详细信息
Due to the nonlinearity and difficulty in the process of the cooperative target assignment,a discrete beetle swarm optimization algorithm is ***,the target assignment model is established based on the damage probability and target value of missile attacking ***,according to the constraint characteristics of the model,a particle integer coding method is proposed to reduce the complexity of the ***,the discrete beetle swarm optimization algorithm is designed and used to solve the problem,which is an improved particle swarm optimization algorithm by introducing beetle antennae search *** simulation results show that the algorithm combines the advantages of particle swarm optimization algorithm and beetle antennae search algorithm,and has fast convergence speed and is not easy to fall into local *** with other algorithms,the effectiveness of the algorithm is verified.
暂无评论