机构地区: 吉林大学计算机科学与技术学院符号计算与知识工程教育部重点实验室
出 处: 《吉林大学学报(理学版)》 2010年第4期653-657,共5页
摘 要: 提出一种由多人参与物品交换问题的新型组合优化模型——易物模型,该组合优化模型能处理一类非完全连通图的最短环路问题.利用图论原理,给出了求解易物模型的算法,并通过数值模拟实验验证了算法的有效性. 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.
领 域: [自动化与计算机技术] [自动化与计算机技术]