欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
对求最小值的最优指派数学模型，设计并实现了DNA计算算法。首先经过特殊的DNA编码将二维的决策变量和二维的效益值编入DNA序列中；然后通过杂交实验和分离实验得到指派问题的全部可行解；最后通过电泳实验和检测实验获得最优指派问题的最优解。证明了算法的复杂性并举例说明了算法的可行性。分别给出了求最大值的最优指派问题和人数与工作数不等的最优指派问题的处理方法。
英文摘要：
An algorithm of DNA computing is designed for minimum assignment problems, in which after planar decision-making variable and planar benefit value are compiled in DNA sequence through specific DNA encoding, all feasible solutions are gained with hybridization experiment and separating experiment, and then all optimization solutions are obtained with electrophoresis experiment and checking experiment. The complexity of the DNA algorithm is proved and its feasibility is explained by an example. Respective methods dealing with the maximal assignment problem and the people and worker＇s unequal number assignment problem are brought forward.
同期刊论文项目
同项目期刊论文
期刊信息
位置：