Linear programming algorithm for solving friction - contact problems of multi - body systems under large displacements 大變位下多體系統摩擦接觸問題線性規劃求解方法
In this paper , a new dynamic programming algorithm for unconstrained 2d stock cutting problem is presented 摘要本文給出了一種求解無限制板材下料問題的動態規劃解法,對該算法的計算復雜度進行了分析。
This paper is to establish a system based on electronic map for motorcade - optimized dispatching , and dynamic programming algorithm is used to realize vehicle dispatching 本文的中心內容是:組建了一個基于電子地圖大型車隊優化調度及管理系統,并用動態規劃算法實現了車輛的智能調度。
This model can be converted into a common multi - objective linear programming , which can be efficiently solved by the corrected z - w method of interactive programming algorithm 通過把這類問題轉化為一般的多目標線性規劃問題,并利用交互規劃的修正z - w法進行求解,從而有效地解決這類問題。
The global random searching ability of adaptive evolutionary programming algorithm and high evolutionary ability by the method in this paper is illustrated by the result of actual power systems 算例表明,論文算法不僅保留了自適應進化規劃算法的全局搜索能力,而且還具有高效的進化能力。