摘要
提出一种由多人参与物品交换问题的新型组合优化模型——易物模型,该组合优化模型能处理一类非完全连通图的最短环路问题.利用图论原理,给出了求解易物模型的算法,并通过数值模拟实验验证了算法的有效性.
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.
出处
《吉林大学学报（理学版）》
CAS
CSCD
北大核心
2010年第4期653-657,共5页
Journal of Jilin University:Science Edition
基金
国家自然科学基金(批准号:10872077
60803052)
国家高技术研究发展计划863项目基金(批准号:2009AA02Z307)
高等学校博士学科点专项科研基金(批准号:20070183055)
吉林省科技发展计划项目(批准号:20080708
20080172)
吉林大学科学前沿与交叉学科创新项目(批准号:200903172
200810026)
关键词
物品交换
组合优化
基因调控
蛋白质调控
article exchange
combinatorial optimization
gene regulation
protein regulation
