Abstract

In modern warfare, the comprehensiveness of combat domain and the complexity of tasks pose great challenges to operational coordination.To address this challenge, we use the improved triangular fuzzy number to express the combat mission time, first present a new multi-objective operational cooperative time scheduling model that takes the fluctuation of combat coordinative time and the time flexibility between each task into account. The resulting model is essentially a large-scale multi-objective combinatorial optimization problem, intractably complicated to solve optimally. We next propose multi-objective improved Bat algorithm based on angle decomposition (MOIBA/AD) to quickly identify high-quality solutions to the model. Our proposed algorithm improves the decomposition strategy by replacing the planar space with the angle space, which helps greatly reduce the difficulty of processing evolutionary individuals and hence the time complexity of the multi-objective evolutionary algorithm based on decomposition (MOEA/D). Moreover, the population replacement strategy is enhanced utilizing the improved bat algorithm, which helps evolutionary individuals avoid getting trapped in local optima. Computational experiments on multi-objective operational cooperative time scheduling (MOOCTS) problems of different scales demonstrate the superiority of our proposed method over four state-of-the-art multi-objective evolutionary algorithms (MOEAs), including multi-objective bat Algorithm (MOBA), MOEA/D, non-dominated sorting genetic algorithm version II (NSGA-II) and multi-objective particle swarm optimization algorithm (MOPSO). Our proposed method performs better in terms of four performance criteria, producing solutions of higher quality while keeping a better distribution of the Pareto solution set.

Highlights

  • Operational coordination refers to the coordination and cooperation among various combat forces in actions according to a unified plan when they jointly perform combat tasks, so as to ensure the coordinated actions of various combat forces and exert their overall combat effectiveness [1]

  • An evaluation method combining the Analytical Hierarchy Process (AHP) method and fuzzy mathematics [33,34,35], Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS) method in dynamic environment [36,37,38], Data Envelopment Analysis (DEA) method which is less affected by the subjective factors of decision makers [39,40,41], and entropy method combined with the above method [42, 43], etc

  • It can be seen that the diversity and convergence of MOIBA/AD are better than those of multi-objective bat Algorithm (MOBA), non-dominated sorting genetic algorithm version II (NSGA-II), multi-objective evolutionary algorithm based on decomposition (MOEA/D) and multi-objective particle swarm optimization algorithm (MOPSO) when solving the small-scale multi-objective operational cooperative time scheduling (MOOCTS) model

Read more

Summary

Introduction

Operational coordination refers to the coordination and cooperation among various combat forces in actions according to a unified plan when they jointly perform combat tasks, so as to ensure the coordinated actions of various combat forces and exert their overall combat effectiveness [1]. Wang et al [7] took the operational timeliness as their optimization objective, and based on considering the constraints such as task timing, task completion effect and task execution conflict, they used the invasive weed bat and twin group optimization (IWBDA) method to plan and solve the Operational task time sequence cooperative scheduling problem. Based on considering the priority of tasks and resources at the same time, many scholars use greedy strategy to locally search for the solution space of the multi-imensional dynamic list scheduling model (MDLS) [10,11,12] and multi-PRI list dynamic scheduling model (MPLDS) [13,14,15], which have achieved good results in the scheduling problem of cooperative task time This method does not take into account the coupling between the execution subjects and time of different and the same combat tasks in the solving process. Many arm of the services have mutual cooperation and support relations, the simple task chain of a single arm basically does not exist

MOEAs for operational task scheduling
MOCCTS
Model assumptions and notation descriptions
Model formulation
Definition and solution of cooperative time
A multi-objective improved bat algorithm based on angle decomposition
T λfg1 þ λfg2 þ λfgT ð23Þ where λcentre g ðg
Experiment and result analysis
Simulation example
Comparison algorithm
Performance metrics
Result analysis
Conclusion and future work
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call