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 算例表明,论文算法不仅保留了自适应进化规划算法的全局搜索能力,而且还具有高效的进化能力。