Affiliation:
1. College of Computer Science, Beijing University of Posts and Telecommunications, Beijing 100876, China
2. Radio and Television & New Media Intelligent Monitoring Key Laboratory of NRTA (Radio, Film & Television Design & Research Institute), Beijing 100045, China
Abstract
Transmission task static allocation (TTSA) is one of the most important issues in the automatic management of radio and television stations. Different transmission tasks are allocated to the most suitable transmission equipment to achieve the overall optimal transmission effect. This study proposes a TTSA mathematical model suitable for solving multiple intelligent algorithms, with the goal of achieving the highest comprehensive evaluation value, and conducts comparative testing of multiple intelligent algorithms. An improved crossover operator is proposed to solve the problem of chromosome conflicts. The operator is applied to improved genetic algorithm (IGA) and hybrid intelligent algorithms. A discrete particle swarm optimization (DPSO) algorithm is proposed, which redefines the particle position, particle movement direction, and particle movement speed for the problem itself. A particle movement update strategy based on a probability selection model is designed to ensure the search range of the DPSO, and random perturbation is designed to improve the diversity of the population. Based on simulation, comparative experiments were conducted on the proposed intelligent algorithms and the results of three aspects were compared: the success rate, convergence speed, and accuracy of the algorithm. The DPSO has the greatest advantage in solving TTSA.
Subject
Fluid Flow and Transfer Processes,Computer Science Applications,Process Chemistry and Technology,General Engineering,Instrumentation,General Materials Science
Reference32 articles.
1. Yu, W., Huang, X., Luo, H., Soo, V., and Lee, Y. (2021). Auction-Based Consensus of Autonomous Vehicles for Multi-Target Dynamic Task Allocation and Path Planning in an Unknown Obstacle Environment. Appl. Sci., 11.
2. Deep intelligent Ant Colony Optimization for Solving Travelling Salesman Problem;Wang;J. Comput. Res. Dev.,2021
3. Job—Shop scheduling theory: What is relevant?;Kenneth;Interfaces,1988
4. Lawler, E., Leenstra, J., and Kan, A. (1993). Sequencing and Scheduling: Algorithms and Complexity//Handbooks in Operations Research and Management Science, Volume 4: Logistics of Production and Inventory, Elsevier.
5. Park, J., Ng, H., Chua, T., Ng, Y., and Kim, J. (2021). Unified Genetic Algorithm Approach for Solving Flexible Job-Shop Scheduling Problem. Appl. Sci., 11.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献