In this thesis , firstly , the theory on multicast is introduced . secondly , a research is made on algorithm satisfying multiple constraints and an adaptive and reliable algorithm satisfying qos for multicast is proposed . it overcomes the shortcoming of the existent algorithms 本論文首先介紹了有關(guān)多播的相關(guān)知識(shí);接著對(duì)有多個(gè)約束的多播路由問題進(jìn)行了研究,并且給出了一種滿足qos約束可靠的適應(yīng)性多播路由算法。
This main study of paper centralizes on following aspect : 1 . based on shortest path heuristic and greedy algorithms , using path similarity principle and genetic operations , provides a heuristic algorithms in finding multiple feasible paths for multiple constraints ( k - sph ) . 2 基于最短路徑( sph )和greedy算法,使用路徑相似性原:理和遺傳算法的變異操作,提出了尋找滿足1個(gè)或2個(gè)約束條件的多路徑啟發(fā)式算法(稱為k - sph算法) 。
Abstract firstly , convert a programming problem with multiple constraints into a programming problem with single constraint , secondly , several convexification and concavification transformations for the constrained problem with strictly monotone constraint functions are proposed according to the transformed problem with single constraint , then this constrained programming problem can be converted into a concave minimization or a reverse convex programming problem 摘要首先將一個(gè)具有多個(gè)約束的規(guī)劃問題轉(zhuǎn)化為一個(gè)只有一個(gè)約束的規(guī)劃問題,然后通過利用這個(gè)單約束的規(guī)劃問題,對(duì)原來的多約束規(guī)劃問題提出了一些凸化、凹化的方法,這樣這些多約束的規(guī)劃問題可以被轉(zhuǎn)化為一些凹規(guī)劃、反凸規(guī)劃同題。
Then , the mathematical models for workshop layout of general production line and automobile assembly - welding line are given , the topology model of multiple constraints expression and workshop layout is presented in depth , and then principles on position check and constraints check are also presented . a modified genetic algorithm is also proposed based on traditional generic algorithm 在此基礎(chǔ)上,以物流優(yōu)化和空間利用率最大化為目標(biāo),建立了車間設(shè)備布局的一般數(shù)學(xué)模型和汽車裝焊車間設(shè)備布局的數(shù)學(xué)模型;深入探討了多種約束表達(dá)和車間布局的拓?fù)淠P?提出了約束檢驗(yàn)的方法和位置判定的原則。