毕业设计（论文）-基于Gridsim和遗传算法对组合双向拍卖问题的研究汇.docVIP

本 科 毕 业 设 计（论文） 题目: 基于Gridsim和遗传算法对组合双向拍卖问题的研究 姓 名 2008年 月由澳大利亚墨尔本大学Rajkumar Buyya领导开发Gridsim在Java环境下进行资源调度的仿真。经过多次实验，以上两个问题得到了较好的解决。本文对遗传算法中的参数设置进行了多次对比实验，得出了特定例子的近似最优设置，为使用遗传算法解决此类问题提出了一些建议和方法。 关键字 网络资源调度 网格计算 组合双向拍卖 遗传算法 Gridsim The Design and Realization of Interactive Demonstration System of the Protocol of VPNNAT ABSTRACT At present, the distribution of computation resources among computer users all over the world has shown a unreasonable state: that some users who have heavy demands own comparatively lesser resources when the resources of users that have little demands are left unused. People want to utilize the computation resources as convenient as electricity in their house. So there is a growing number of people who devote themselves to figuring out the way of scheduling resources of this kind. It can be imagined that a new fully-fledged protocol should be applied to solve the problem above. Before this happened, simulations of resource scheduling in an area-wide are required. So grid-computation has emerged because of this opportunity and varies of applications appear when lots of classic algorithms are added in. Simultaneously, some economic phenomenon presented in the process of resources scheduling, for instance, the auction. Genetic algorithm have been a mature method to solve NP problems like VSP and VRP. One problem in this article, the optimizing of selection of users and resources in combinational auctions, is also an NP problem. Considering GA is very robust and popular, so we take genetic algorithm for the tool to slove the problem. In this article, we figure out the way to decide which users and resources suppliers will be selected to join the final trade with genetic algorithm. Then we start the trade simulation of this chosen users and suppliers on the platform of Java combine with gridsim which have been exploiting by the group that leaded by Rajkumar Buyya in University of Melbourne in Australia. The two main targets above are sl