首页 | 本学科首页   官方微博 | 高级检索  
     检索      

投资优化模型及其启发式遗传算法
引用本文:刘伟,王永庆,郭吉林.投资优化模型及其启发式遗传算法[J].清华大学学报(自然科学版),1999,39(6).
作者姓名:刘伟  王永庆  郭吉林
作者单位:清华大学,核能技术设计研究院,北京,100084
基金项目:国家“九五”科技攻关项目
摘    要:建设期利息和物价浮动在核电站工程投资中占有很大的比例。为优化工程投资,提出了以最大净现值为目标的核电站投资优化数学模型。该模型基于工程的活动网络且是NP问题。针对该模型给出了一种启发式遗传算法(HGAs)。在该算法中,解是一串表示活动分配资源优先级的数,这种编码方法克服了传统遗传算法求解该问题时难以找到可行解的困难。本文提出的前件矩阵的概念能有效地求解活动网络的关键路径。用C语言编制了启发式遗传算法程序(HGAP),并用该程序求解了一个实例。计算结果表明该模型符合工程实际,该算法能有效解决该模型。

关 键 词:核电站  投资控制  净现值  遗传算法
修稿时间:1998-09-04

Cost optimization model and its heuristic genetic algorithms
LIU Wei,WANG Yongqing,GUO Jilin.Cost optimization model and its heuristic genetic algorithms[J].Journal of Tsinghua University(Science and Technology),1999,39(6).
Authors:LIU Wei  WANG Yongqing  GUO Jilin
Abstract:Interest and escalation are large quantity in proportion to the cost of nuclear power plant construction. In order to optimize the cost, the mathematics model of cost optimization for nuclear power plant construction was proposed, which takes the maximum net present value as the optimization goal. The model is based on the activity networks of the project and is an NP problem. A heuristic genetic algorithms (HGAs) for the model was introduced. In the algorithms, a solution is represented with a string of numbers each of which denotes the priority of each activity for assigned resources. The HGAs with this encoding method can overcome the difficulty which is harder to get feasible solutions when using the traditional GAs to solve the model. The critical path of the activity networks is figured out with the concept of predecessor matrix. An example was computed with the HGAP programmed in C language. The results indicate that the model is suitable for the objectiveness, the algorithms is effective to solve the model.
Keywords:nuclear  power plant  cost control  net present value  heuristic genetic algorithms (HGAs)
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号