.png){kind=icon}
.png){kind=icon}
Return
Dynamic Resource Scheduling for C2 Organizations Based on Multi-Objective Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2914951.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The dynamic resource scheduling problem is a field of intense research in command and control organization mission planning. This paper analyzes the emergencies in the battlefield first and divides them into three categories: the changing of task attributes, reduction of available platforms, and change in the number of tasks. To deal with these emergencies, in this paper, we built a series of multi-objective optimization models that maximizes the task execution quality and minimizes the cost of plan adjustment. To solve the model, we proposed an improved multi-objective evolutionary algorithm. A type of mapping operator and an improved crowding-distance sorting method are designed for the algorithm. Finally, the availability of the model and the solving algorithm were proved through a series of experiments. The Pareto frontier for the multi-objective dynamic resource scheduling problem can be found effectively, and the algorithm proposed in this paper shows better convergence compared with the AMP-NSGA-II algorithm.
Keywords:
Command and control organization
dynamic resource scheduling
multi-objective evolutionary algorithm
multi-objective optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.