Fuzzy C-mean clustering algorithm based on genetic simulated annealing algorithm battlefield site selection

Junjie Zhou; Linming Chen; Tao Li

doi:10.1117/12.2686358

10 August 2023 Fuzzy C-mean clustering algorithm based on genetic simulated annealing algorithm battlefield site selection

Junjie Zhou, Linming Chen, Tao Li

Author Affiliations +

Proceedings Volume 12759, International Conference on Automation Control, Algorithm, and Intelligent Bionics (ACAIB 2023); 127591Q (2023) https://doi.org/10.1117/12.2686358
Event: 2023 3rd International Conference on Automation Control, Algorithm and Intelligent Bionics (ACAIB 2023), 2023, Xiamen, China

Abstract

In this paper, for a battlefield material point siting problem, we do not adopt the traditional ideas, but treat it as a classification and solution module model, and choose to bring in a nested algorithm model to fuzzy cluster the points on the battlefield in order to divide them into multiple independent siting problems, and change the aggregation path of each node according to a heuristic algorithm to traverse all reach possibilities as much as possible. Dividing the battlefield area into n regions for clustering optimization: the fuzzy C-mean clustering algorithm using genetic simulated annealing algorithm for fuzzy clustering within the battlefield area, and then the immune algorithm to make a selection of all possibilities, can guarantee the accuracy rate while greatly reducing the model running time and achieving higher efficiency. (1) regional selection stage, based on the difficulty of attacking each point of the battlefield to establish an evaluation index system, the use of cluster analysis methods[1] to divide the battlefield area into n categories to achieve for different looking for the corresponding command center, material center target group; (2) Immune algorithm optimization, based on the immune algorithm to construct the corresponding model and design a modified genetic algorithm to optimize the optimal addressing[2]. After using the genetic algorithm with adaptive parameters, a more stable centroid is obtained in 500 iterations. Based on the above two-stage planning method, the empirical study results show that it can provide scientific personalized optimal addressing points for addressing class problems.

Citation Download Citation

Junjie Zhou, Linming Chen, and Tao Li "Fuzzy C-mean clustering algorithm based on genetic simulated annealing algorithm battlefield site selection", Proc. SPIE 12759, International Conference on Automation Control, Algorithm, and Intelligent Bionics (ACAIB 2023), 127591Q (10 August 2023); https://doi.org/10.1117/12.2686358

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
10 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Genetic algorithms

Algorithms

Fuzzy logic

Genetics

Mathematical optimization

Detection and tracking algorithms

Annealing

Show All Keywords

Keywords/Phrases

Search In:

Publication Years