Slot allocation algorithm based on genetic and tabu search
DOI:
Author:
Affiliation:

1.Naval aeronautical university, YanTai, 264001; 2.Unit 92697 of the Chinese People's Liberation Army, LingShui, 572400

Clc Number:

TP924

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Slot allocation is a key technology in TDMA data link network planning. Reasonable time slot allocation can ensure the timeliness of tactical messages and improve the operation efficiency of data link network. Because the traditional slot allocation algorithm can not realize the allocation of any slot; The single intelligent optimization slot allocation algorithm has the problems of low global optimization ability, large amount of computation and low operation efficiency. Based on the minimum uniform slot variance model, a slot allocation algorithm based on genetic tabu search is proposed in this paper. The algorithm makes full use of the advantages of two typical intelligent optimization algorithms: genetic and tabu search, and uses genetic mutation operation to construct diverse neighborhoods, so as to enhance the probability of obtaining the global optimal slot solution; Tabu search algorithm is used to search locally to speed up the convergence speed. The accuracy, stability and efficiency of the proposed algorithm are evaluated by experiments. The results show that compared with the single genetic algorithm and tabu algorithm, the algorithm not only maintains high stability and operation efficiency, but also significantly improves the time slot allocation accuracy. When the number of free slots is 500 and 1000, the accuracy is improved by 6% and 9% respectively compared with the genetic slot allocation algorithm.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online: May 07,2024
  • Published: