计算机科学
遗传算法
过程(计算)
先决条件
人口
算法
计算
数学优化
机器学习
数学
操作系统
社会学
人口学
程序设计语言
作者
Ling Wu,Hangyu Wang,Faxing Lu,Peifa Jia
出处
期刊:
[Institute of Electrical and Electronics Engineers]
日期:2008-06-01
卷期号:: 2020-2025
被引量:32
标识
DOI:10.1109/cec.2008.4631065
摘要
An aanytime algorithm based on modified genetic algorithm (GA) for dynamic WTA problem, subject to temporal constraints, is developed in the paper. In the algorithm the weapons are assigned to targets one by one before the deadline of each target comes. After a target is assigned with some weapon, the target is replaced by a new one in all chromosomes in the population while the optimization process will not undergo any restart. The algorithm has three main advantages: 1) a new target can be dynamically accommodated in the allocation process without losing previous optimizing information, 2) the quality of the pairing decisions may be improved in the evolving process with a prolonged computation time, and 3) it optimally deploys weapons to targets where a weapon can be assigned to more than one target asynchronously without missing any deadline of the targets, under the precondition that the weapon can be allocated to only one target at one time. The feasibility and the validity of the modified GA are verified in simulations.
科研通智能强力驱动
Strongly Powered by AbleSci AI