关键词: 生存控制器, 行动序列, 背包问题, 旅行商问题, 遗传算法

Abstract: Survivability controller is widely adopted into critical information system.A main function of the controller is to give policies which select corresponding sequence of multiple actions in a user-defined action set based on the reward assessment.Therefore，the quality of policy given by the controller determines its ability.The objective of this paper is to find out an efficient solution approach to determine Action Sequence（AS） achieving the maximal rewards.AS is a mixture of Knapsack Problem（KP） and Traveling Salesman Problem（TSP）.This work has developed a methodology based on Genetic Algorithm（GA） for effective solving combination optimization.Special coding and effective genetic operators are designed for this genetic algorithm.Comparing with greedy algorithm simulation-based experimental results demonstrate the validity and practicability of the Genetic Algorithm.

Key words: survivability controller, Action Sequence（AS）, Knapsack Problem（KP）, Traveling Salesman Problem（TSP）, Genetic Algorithm（GA）