%0 Journal Article
%T Time Cycling Parallel Algorithm of Multiobjective Dynamic Programming<br>多目标动态规划时段轮换并行算法
%A Kang Yimei
%A Wu Cangpu
%A <br>康一梅
%A 吴沧浦
%J 自动化学报
%D 1994
%I 
%X 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.
%K Parallel algorithm
%K time complexity
%K speedup
%K time cycling<br>并行算法
%K 时段轮换
%K 动态规划
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=E76622685B64B2AA896A7F777B64EB3A&aid=3093CA6F8E2CE12055A7CA75DF617126&yid=3EBE383EEA0A6494&vid=A04140E723CB732E&iid=94C357A881DFC066&sid=B4F9D541F855CF96&eid=1FA4E9C3E6E88FC8&journal_id=0254-4156&journal_name=自动化学报&referenced_num=0&reference_num=2