LABELED DATA STORAGE SERVER ALLOCATION METHOD BASED ON EVOLUTIONARY OPTIMIZATION

Disclosed is a labeled data storage server allocation method based on evolutionary optimization. In the present invention, an improved sine-cosine algorithm is used to solve the problem of labeled data storage server allocation. The improved sine-cosine algorithm comprises: firstly generating a random population, and setting the survival periods of individuals; next, generating guidance probabilities by means of comprehensively taking the priorities and survival periods of the individuals into consideration; then, choosing guidance individuals on the basis of the guidance probabilities, and executing sine-cosine operation operators based on the guidance individuals, choosing excellent individuals to enter a new-generation population, and then updating the survival periods of the individuals; and repeatedly executing this search process until a termination condition is satisfied. In the present invention, a search guidance direction is chosen by means of comprehensively taking the priorities and survival perio