Algorition

基本解釋

Unsolvable problem by conventional method can be solved by genetic algorit hon s.
傳統(tǒng)搜索方法解決不了的復(fù)雜問題，應(yīng)用遺傳算法卻可以得到解決。
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為網(wǎng)絡(luò)模型,分別針對擁塞下限、擁塞概率、網(wǎng)絡(luò)時延和負(fù)載均衡度4個指標(biāo),對提出的啟發(fā)式算法與另外2種典型的優(yōu)化算法進行了比較和分析。
Locus Intersection Method of dimension d(LIMD) is a typical algorithm used in the area in GCS, This paper extended this algorit...
LIMD是約束求解中一個應(yīng)用較廣的算法;作者對該算法進行了拓寬和改進;提出了具體解決方法;并得到了較好結(jié)果.
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算法用于最大推力模式和最小油耗模式仿真結(jié)果對比曲線。