By setting the properties of switches in each loop corresponding to the tie switch , the ts searching areas of each loop are made " independent " to each other . in this way the solution areas are made continuous and the dimensions of solution areas are decoupled by numbers of tie switch 通过设置各环网中常闭分段开关的属性，将各个环网的禁忌搜索邻域“独立” ，使解空间连续并按联络开关个数分解，从而很好的发挥禁忌算法寻优效率高和全局寻优的特点。
Through such a study , it is also shown that when the time delay is long enough such that the stability switches of the equilibrium of system halt , the bifurcation branches originated from the critical time delays cannot be surely stable or unstable in the whole solution space , that is , their stability depends on cases . this phenomenon also implies that the stability of the periodic solutions on the bifurcation diagrams indicates only the stability on the local center manifo ld . some distinguished features of delay dyn 利用打靶法的数值结果说明了当系统平衡点不再发生稳定性切换时，源自这些临界时滞处的解支的稳定性在整个解空间的稳定性具有不可判定性，这也说明由多尺度法所得高阶近似判定的解支的稳定性事实上只表示解支在局部中心流形上的稳定性，而非在整个解空间中的稳定性。
The novel optimization algorithm , genetic algorithm popular these years , is introduced . genetic algorithm has the characteristics of multi - point searching , parallel computing and self - adaptive global optimization . so it is very suitable for the solution of complex engineering problems , which often have numerous variables , high dimension , highly nonlinear optimization objects , and the great solution spaces 引入了近几年兴起的新型优化算法? ?遗传算法，其具有多点搜索、并行计算和自适应全局寻优的特点，特别适用于求解离散型设计变量多、维数高、优化目标高度非线性、解空间十分庞大的复杂工程问题。
The three kinds of construction graph can be applied to optimization problems with different characteristics , and the two kinds of layered construction graph are more suitable for complex multi - stage dynamic decision problems ( cmsddp ) than scg . the clcg defines smaller solution building blocks and is able to perform better in large - scale cmsddps than the blcg . 2 . the construction graph of aco algorithms need statically describe the whole solution space ( or discrete solution spa ( 2 )蚁群优化算法的解构造图一般要静态地描述整个解空间(或者是离散化了的解空间) ，对于大规划动态决策问题，不仅存在描述解空间的困难，而且让蚁群在迭代过程中始终在整个解空间中进行搜索，搜索性能会很低。
This paper is to study harmonic maps into symplectic groups and local isometric immersions into space forms by means of the soliton theory . by realizing an action of the rational loop group on the spaces of corrsponding solutions , we get the backlund transformation and the darboux transformation , and thereby we give the explicit construction for harmonic maps into symplectic groups and local isometric immersions into space forms via purely algebraic algorithm 主要用孤立子理论研究到辛群的调和映射和到空间形式的局部等距浸入，通过有理loop群在其解空间上的dressing作用，给出b icklund变换和darboux变换的显式表示，从而获得到辛群及其对称空间的调和映射和到空间形式的局部等距浸入的纯代数构造方法。
But , with the help of the theories of semigroups and the generalized solution space , we can always make the solution of the original abstract cauchy problem and fc - times integrated abstract cauchy problem unique . moreover , the introduction of bounded injective operator c help us so much that we obtain important results in this paper 首先，借助算子a的广义-次解空间，同时引入有界的单射且可与a交换的算子c ，我们证明始终可以使满足一定条件的解是唯一的，而且我们找到了-次积分抽象cauchy问题的解是唯一的关于a的条件，有如下结果：定理2
As been analyzed , searching of mec is not carried out in the whole solution space with equal intensity , but in some focal regions . meanwhile , within each selected region , the search focus only on a narrow band . those features of mec explain clearly why it has excellent performance 分析认为mec不是对整个解空间进行相等强度的搜索，而是通过异化操作在整个解空间中选择寻找有希望存在最优解的吸引域，再对这些区域进行趋同(局部)搜索，而在趋同(局部)搜索中又只搜索了一个窄的带子，因此mec具有很高的搜索效率。
Genetic algorithm is a widely concerned global search algorithm , which has good parallel search ability for having pioneered the implementation of methods that exploit the idea of combining solutions , while tabu search has pioneered the systematic exploration of memory functions in search processes , having good local search ability because of its flexible memory mechanism and respective tabu criteria to avoid circuit search 遗传算法是一种受到广泛关注的全局优化算法,开创了在解空间中从多出发点搜索问题最优解的先河,具有很强的并行搜索能力,而禁忌搜索算法是在搜索过程中使用记忆功能的先驱者,以其灵活的存储结构和相应的禁忌准则来避免迂回搜索,具有较强的局部搜索能力。
According to the rules and considerations which are based and taken into account in the practical work , this paper proposes a new model for power supply system maintenance scheduling which intends to find the most economical maintenance schedule without violating any restrictions . the paper makes a deep research of ga ( genetic algorithm ) , . then proposed the method which improves the convergence of optimization and shortens the calculation time 本文结合实际电力调度计划工作中检修计划的制定原则和所要考虑的各种因素，抽象出适合配电网检修计划优化的数学模型；对遗传算法进行了研究和探讨，针对遗传算法的不足提出了通过对实际问题的分析抽象出一定规则指导算法在解空间进行搜索的改进措施，并应用于供电系统检修计划的优化，并编制了相应的应用软件；应用该软件对长治供电公司的检修计划进行了优化，结果表明，本文所提出的模型和改进的优化方法是正确和有效的。
On the ground of multiresolution analysis , wavelet galerkin method uses wavelet scaling function as the basis for the resolution space , with whose linear combination any function in this space can be expressed . then the partial differential equations ( for short pdes ) can be dispersed to a linear system through galerkin 小波galerkin法是根据多分辨分析，利用小波尺度函数构造解空间的基来线性表示该空间中的任意函数，然后通过galerkin形式的变分把偏微分方程(简称pdes )离散成一个线性系统。
