| 无标底招投标的Nash均衡模型及GA算法实现 |
| |
| 引用本文： | 陈洁,李引珍.无标底招投标的Nash均衡模型及GA算法实现[J].兰州铁道学院学报,2006,25(4):121-124. |
| |
| 作者姓名： | 陈洁 李引珍 |
| |
| 作者单位： | 兰州交通大学交通运输学院,甘肃兰州730070 |
| |
| 摘 要： | 在分析现有无标底招投标规则的基础上,采用一般对象化方法,建立无标底招投标报价问题的无协作形式Nash均衡模型.在招投标报价中引入智能算法思想,运用并行选择遗传算法进行求解,并通过双矩阵的实例验证了该算法的有效性.
|
| 关 键 词： | 无标底招投标 Nash均衡模型 遗传算法 |
| 文章编号： | 1001-4373(2006)04-0121-04 |
| 收稿时间： | 2006-02-15 |
| 修稿时间： | 2006年2月15日 |
Nash Equilibrium Model and Improved Genetic Algorithms of Inviting Tender without Bottom Price |
| |
| Chen Jie,Li Yinzhen.Nash Equilibrium Model and Improved Genetic Algorithms of Inviting Tender without Bottom Price[J].Journal of Lanzhou Railway University,2006,25(4):121-124. |
| |
| Authors: | Chen Jie Li Yinzhen |
| |
| Institution: | School of Traffic and Transportation Engineering, Lanzhou Jiaotong University, lanzhou 730070, China |
| |
| Abstract: | By analyzing the rules of inviting tender without bottom price, a more practical of non-cooperative game is presented in a generalized object theory. By adopting intelligent optimization algorithms, a Genetic Algorithm is presented on the base of the ideas of coordinate-select method which can increase the efficiency of GA. Finally the genetic algorithm is discussed and proved to be effective through computing and analyzing of a two matrix game. |
| |
| Keywords: | inviting tender without bottom price Nash equilibrium Genetic Algorithm |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
