CSpace
Dependent-chance goal programming and its genetic algorithm based approach
Liu, BD
1996-10-01
发表期刊MATHEMATICAL AND COMPUTER MODELLING
ISSN0895-7177
卷号24期号:7页码:43-52
摘要This paper develops a general formulation of dependent-chance goal programming (DCGP) which is an extension of stochastic goal programming in a complex stochastic system, and gives an example of water allocation and supply to show the application of DCGP. A genetic algorithm based approach is also presented to solve such a model. DCGP is available to the systems in which there are multiple stochastic inputs and multiple outputs with their own reliability levels. The characteristic of DCGP is that the chances of some probabilistic goals are dependent, i.e., the goals cannot be considered in isolation or converted to their deterministic equivalents. Finally, Monte Carlo simulation is also discussed for calculating the chance functions in complex stochastic constraints.
关键词stochastic programming goal programming dependent-chance goal programming genetic algorithm
语种英语
WOS研究方向Computer Science ; Mathematics
WOS类目Computer Science, Interdisciplinary Applications ; Computer Science, Software Engineering ; Mathematics, Applied
WOS记录号WOS:A1996VN51000004
出版者PERGAMON-ELSEVIER SCIENCE LTD
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/28818
专题中国科学院数学与系统科学研究院
作者单位CHINESE ACAD SCI,INST SYST SCI,BEIJING 100080,PEOPLES R CHINA
推荐引用方式
GB/T 7714
Liu, BD. Dependent-chance goal programming and its genetic algorithm based approach[J]. MATHEMATICAL AND COMPUTER MODELLING,1996,24(7):43-52.
APA Liu, BD.(1996).Dependent-chance goal programming and its genetic algorithm based approach.MATHEMATICAL AND COMPUTER MODELLING,24(7),43-52.
MLA Liu, BD."Dependent-chance goal programming and its genetic algorithm based approach".MATHEMATICAL AND COMPUTER MODELLING 24.7(1996):43-52.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Liu, BD]的文章
百度学术
百度学术中相似的文章
[Liu, BD]的文章
必应学术
必应学术中相似的文章
[Liu, BD]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。