Time Cycling Parallel Algorithm of Multiobjective Dynamic Programming
多目标动态规划时段轮换并行算法

Time cycling parallel algorithm of multiobjective dynamic programming are presented for SIMD and MIMD parallel computers, respectively. The time cycling algorithm of multiobjective dynamic programming is such a method that transforms the optimization problem of whole procedure into the optimization problem of subprocedures, then finds the non-inferior solutions of whole procedure in the set of the non-inferior solutions of subprocedures. With this idea, the problem of memories of multiobjective dynamic programming can be transformed into a problem of time,then the problem can be solved effectively through parallel computers with very high computing speeds.