基于多智能体进化算法的COA方法研究-电路与系统专业论文.docxVIP

II II 基于多智能体进化算法的COA方法研究 对比仿真实验，实验证明该方法在非支配解集的支配关系，以及解集的宽广性方 面相对其它两种方法都具有一定的优越性。该方法在一定程度上弥补了MAEA算 法中的竞争策略存在的上述缺陷。 本文工作得到国家自然科学基金J54507020124F010406 (35))资助。 关键字：行动规划问题，多智能体进化算法，环比评分法，精英种群 Abstract Abstract III Abstract In 0111modem world,complex situations arise that require the coordinated actions of many resources to achieve desired outcomes or effects．The first step in dealing with these complex situations is to develop and select a Course of Action that will lead to a desired outcome．The goal of COA is putting the right resource in the right place and time to perform the appropriate information gathering task on the appropriate objects of interest．The paper has done at least the following works： Firstly，COA can be defined aS a multi-objective optimization problem．In this paper, a method based on multi．agent evolutionary algorithm Was presented to solve COA resource management and scheduling problems．First of all，initialize the COA population,each individual of COA population Can be seen as an agent,in order to realize the local perceptivity of agents，the environment is organized as a latticelike structure．Each agent is fixed on a lattice point and it Can only interact with its neighbors． In this work,constraint functions are added in competition strategy to deal with the multi．．objective aspect of resource-constrained project scheduling problems．This approach avoids the use of a penalty function to deal with constraints．At the same time， the added constraint functions could make the whole algorithm evolving feasible．The simulation results demonstrated that this approach could improve searching ability of this algorithm，and the precision of this method． Secondly,a set of non-dominated solutions gained by the multi—agent evolutionary algorithm．SO a problems about how to choose one most suitable COA is raised．In t|liS paper,the weighted summation approach is u