Study on two-stage uncertain programming based on uncertainty theory

被引:7
作者
Zheng, Mingfa [1 ]
Yi, Yuan [1 ]
Wang, Zutong [2 ]
Chen, Jeng-Fung [3 ]
机构
[1] Xi An Jiao Tong Univ, Sch Math & Stat, Xian 710049, Peoples R China
[2] Air Force Engn Univ, Mat Management & Safety Engn Coll, Xian 710051, Peoples R China
[3] Feng Chia Univ, Dept Ind Engn & Syst Management, 100 Wenhwa Rd, Taichung 40724, Taiwan
关键词
Uncertainty theory; Two-stage uncertain programming; Convexity; Artificial bee colony algorithm; TIME; ALGORITHM; MODEL;
D O I
10.1007/s10845-014-1012-6
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, based on uncertainty theory, we first present a new class of two-stage uncertain programming model and give its deterministic equivalent programming problem. Then some fundamental properties of the two-stage uncertain programming problem, including the convexity of feasible set as well as objective function, are investigated. In addition, a solution method by employing an efficiently heuristic algorithm, called artificial bee colony algorithm, is applied to solve the two-stage uncertain programming problem. Finally, some numerical examples are provided to illustrate the novel method introduced in this paper.
引用
收藏
页码:633 / 642
页数:10
相关论文
共 33 条