期刊文献+

目标与机会平衡规划法 被引量:1

Balanced programming between target and chance
原文传递
导出
摘要 提出一种目标与机会平衡规划法.基于待决策问题的有效决策前沿曲线形状的全局信息,通过权衡决策目标收益和实现机会两个因素的数值关系以及二者沿有效决策前沿曲线变化速度的对比关系,最大限度地提高决策效用.该方法能以更合理、更全面、更灵活的方式分析处理随机优化问题,有效解决期望值模型、机会约束规划法和相关机会规划法之间的矛盾.最后通过算例表明了所提出方法的主要特点和有效性. A programming method, termed as balanced programming between target and chance, is developed. Based on the all-around information about the effective decision front curve (EDFC) of the problems concerned, this method can maximize the utility of a decision-making problem through weighing the quantity relationships and comparing the changing velocity along the EDFC between the target profit and the realization chance. The method can solve stochastic optimization problems in a more rational, flexible, and easy-to-use way, and avoid conflicts among the expected value model, chance-constrained programming and dependent chance programming. A numerical example shows the effectiveness and main features of the proposed method.
出处 《控制与决策》 EI CSCD 北大核心 2009年第11期1641-1646,共6页 Control and Decision
基金 国家973计划项目(2004CB217905) 教育部新世纪优秀人才支持计划项目(NCET-04-0818)
关键词 目标与机会平衡规划法 期望值模型 机会约束规划法 相关机会规划法 报价策略 Balanced programming between target and chance (BPTC) Expected value model (EVM) Chanceconstrained programming(CCP) Dependent chance programming(DCP) Bidding strategies
  • 相关文献

参考文献1

二级参考文献8

共引文献29

同被引文献15

  • 1高建刚,牟鹏,向东,段广洪,汪劲松.拆卸与或图模型中的可拆卸性筛子[J].机械设计与研究,2004,20(4):53-56. 被引量:2
  • 2李剑峰,陈建,李方义,王玉玲.机电产品拆卸回收模型及其拆卸序列生成[J].山东大学学报(工学版),2004,34(5):9-13. 被引量:9
  • 3章小红,李世其,王峻峰.基于蚁群算法的产品拆卸序列规划方法[J].计算机辅助设计与图形学学报,2007,19(3):387-391. 被引量:23
  • 4薛俊芳,邱长华,向东.基于蚁群优化算法的目标拆卸序列规划[J].计算机辅助设计与图形学学报,2007,19(6):742-747. 被引量:12
  • 5Gupta S M, Mclean C R. Disassembly of Products. NIST Systems Integration for Manufacturing Appli- cation Program Grant No. 60NANB5D0112F Final Report[R]. Boston:Northeastern University, 1996.
  • 6Gao Meimei, Zhou Mengehu, Tang Ying. Intelligent Decision Making in Disassembly Process Based on Fuzzy Reasoning Petri Nets[J]. IEEE Transactions on Systems, Man and Cybernetics -- Part B: Cyber- netics, 2004,34 (5) : 2029-2034.
  • 7Moore K E,Gungor A,Gupta S M. A Petri Net Ap- proach to Disassembly Process Planning[J]. Com- puters and Industrial Engineering, 1998, 35 (1/2) : 165-168.
  • 8Wang Hui, Xiang Dong, Duan Guanghong. A Ge- netic Algorithm for Product Disassembly Sequence Planning[J]. Neurocomputing, 2008, 71 ( 13/15 ) : 2720-2726.
  • 9Li Jing-- Rong, Li Pheng-- Khoo, Shu Beng-- Tor. Generation of Possible Multiple Components Dis- assembly Sequence for Maintenance Using a Disas- sembly Constraint Graph[J]. International Journal of Production Economics, 2006,102 ( 1 ) : 51-65.
  • 10Kirkpatrick S, Gelatt C D, Vecchi M P. Optimiza- tion by Simulated Annealing[J]. Science, 1983,220 (4598) : 671-680.

引证文献1

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部