易物模型及其求解算法

J4 ›› 2010, Vol. 07 ›› Issue (4): 653-657.

易物模型及其求解算法

于连江¹, 吴春国¹, 郭立强², 梁艳春¹, 杨锌朔³

1. 吉林大学计算机科学与技术学院, 符号计算与知识工程教育部重点实验室, 长春 130012;2. 北京大学计算机科学技术研究所, 北京 100871|3. 吉林大学数学学院| 长春 130012

收稿日期:2009-12-08 出版日期:2010-07-26 发布日期:2011-06-14
通讯作者: 梁艳春 E-mail:ycliang@jlu.edu.cn

Article Exchange Model and Its Algorithm

YU Lianjiang¹, WU Chunguo¹, GUO Liqiang^2, LIANG Yanchun¹, YANG Xin shuo³

1. College of Computer Science and Technology, Key Laboratory of Symbolic Computation and KnowledgeEngineering of Ministry of Education, Jilin University, Changchun 130012, China|2. Institute of Computer Science and Technology, Peking University, Beijing 100871, China； 3. College of Mathematics, Jilin University, Changchun 130012, China

Received:2009-12-08 Online:2010-07-26 Published:2011-06-14
Contact: LIANG Yanchun E-mail:ycliang@jlu.edu.cn

摘要/Abstract

摘要：

提出一种由多人参与物品交换问题的新型组合优化模型--易物模型, 该组合优化模型能处理一类非完全连通图的最短环路问题. 利用图论原
理, 给出了求解易物模型的算法, 并通过数值模拟实验验证了算法的有效性.

关键词: 物品交换； , 组合优化；基因调控；蛋白质调控

Abstract:

A new combinatorial optimization model, named article exchange model (AEM), is proposed that is extracted from the daily article exchange actions among multiparticipators, and the corresponding algorithm to solve AEM is presented successively. The proposed combinatorial model can be used to deal with a kind of shortest tour problems in noncomplete graph. The effectiveness and efficiency were verified by the numerical experiments with dimensions up to millions.

Key words: article exchange, combinatorial optimization; gene regulation, protein regulation

中图分类号:

TP183

于连江, 吴春国, 郭立强, 梁艳春, 杨锌朔. 易物模型及其求解算法[J]. J4, 2010, 07(4): 653-657.

XU Lian-Jiang, TUN Chun-Guo, GUO Li-Jiang, LIANG Yan-Chun, YANG Xin-Shuo. Article Exchange Model and Its Algorithm[J]. J4, 2010, 07(4): 653-657.

[1]	孙丹, 万里明, 孙延风, 梁艳春. 一种改进的RBF神经网络混合学习算法[J]. J4, 2010, 48(05): 817-822.
[2]	王彦全, 赵衍辉, 杨晓翠, 王海洋, 王江, 魏熙乐. 神经网络广义Backstepping预测控制[J]. J4, 2010, 48(05): 828-834.