版权说明 操作指南
首页 > 成果 > 详情

Replaceable encoding for basic variable of traffic network transportation optimization problem

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Zhou, Kang;Zhu, Yule;Jin, Feng;Tao, Xin
通讯作者:
Zhou, K.(zhoukang_wh@yahoo.com.cn1)
作者机构:
[Tao, Xin; Zhou, Kang; Zhu, Yule; Jin, Feng] School of Math and Computer, Wuhan Polytechnic University, 430023 Wuhan, China
通讯机构:
[Zhou, K.] S
School of Math and Computer, , 430023 Wuhan, China
语种:
英文
关键词:
DNA computing;Group deleting experiment;Group insert experiment;TNTOP
期刊:
Advances in Intelligent Systems and Computing
ISSN:
2194-5357
年:
2013
卷:
212
页码:
45-53
基金类别:
The work is supported by the National Natural Science Foundation of China (61179032), and by Natural Science Foundation of Hubei Province of China (2011CDB229), and by Science and Technology Research Project of Hubei Provincial Department of Education (D20111702), and by Science and Technology Research and Development Project of Ministry of Housing and Urban–Rural Development of the People’s Republic of China (2012-K5-9), and by Construction Science and Technology Plan Project of of Hubei Provincial Department of Reconstruction(2011-29).
机构署名:
本校为第一机构
院系归属:
数学与计算机学院
摘要:
A linear programming problem is solved for the first time based on DNA computing model, which has important significance for research on DNA computing. According to feature of the mathematical model of traffic network transportation optimization problem (TNTOP), three groups of replaceable encoding for each basic variable are designed in the algorithm as follows: basic variable group;variable value group and c value group, which stores the information of basic variable and its value and has many groups replaceable foreign DNA corresponding to the basic variable. In the algorithm of TNTOP based...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com