Algorition

基本解释

Unsolvable problem by conventional method can be solved by genetic algorit hon s.
传统搜索方法解决不了的复杂问题，应用遗传算法却可以得到解决。
So this algorit m is rather efficient for s olvingmulti2 di mensi onal 02 1 knap sack problem.
英文摘要：Abstract:Multi2 di mensi onal 02 1 knap sack p roblem often appears in decisi on making and p r ogramming; res ource distributi on; l oading; and so on .
In the simulation part,the NSFNET was chosen as the network model and the heuristic algorithm was compared with two other kinds of designing algorit...
算法仿真部分以NSFNET为网络模型,分别针对拥塞下限、拥塞概率、网络时延和负载均衡度4个指标,对提出的启发式算法与另外2种典型的优化算法进行了比较和分析。
Locus Intersection Method of dimension d(LIMD) is a typical algorithm used in the area in GCS, This paper extended this algorit...
LIMD是约束求解中一个应用较广的算法;作者对该算法进行了拓宽和改进;提出了具体解决方法;并得到了较好结果.
The results of numerical simulations of maximum thrust mode and minimum fuel consumption mode using SQP and LP respectively show that SQP algorit.
给出了SQP算法与LP算法用于最大推力模式和最小油耗模式仿真结果对比曲线。