Authors: Settapong Malisuwan, Teeranan Nandhakwang, Tawiwat Veeraklaew
An algorithm based on evolutionary programming (EP) is developed and presented for large numbers of target-weapon assignment. An optimal assignment scheduling in one, which allocates target to weapon such that the total expected of target surviving the defense, is minimized. The proposed method improves EP with reordered mutation operator to handle a large- scale assignment problem. The main advantage of this approach is that the computation time can be controlled via tradeoff performance between the computation time and target surviving value.