http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Fixed Charge Transportation Problem and Its Uncertain Programming Model
Sheng, Yuhong,Yao, Kai Korean Institute of Industrial Engineers 2012 Industrial Engineeering & Management Systems Vol.11 No.2
In this paper, we study the fixed charge transportation problem with uncertain variables. The fixed charge transportation problem has two kinds of costs: direct cost and fixed charge. The direct cost is the cost associated with each source-destination pair, and the fixed charge occurs when the transportation activity takes place in the corresponding source-destination pair. The uncertain fixed charge transportation problem is modeled on the basis of uncertainty theory. According to inverse uncertainty distribution, the model can be transformed into a deterministic form. Finally, in order to solve the uncertain fixed charge transportation problem, a numerical example is given to show the application of the model and algorithm.
Fixed Charge Transportation Problem and Its Uncertain Programming Model
Yuhong Sheng,Kai Yao 대한산업공학회 2012 Industrial Engineeering & Management Systems Vol.11 No.2
In this paper, we study the fixed charge transportation problem with uncertain variables. The fixed charge transportation problem has two kinds of costs: direct cost and fixed charge. The direct cost is the cost associated with each source-destination pair, and the fixed charge occurs when the transportation activity takes place in the corresponding source-destination pair. The uncertain fixed charge transportation problem is modeled on the basis of uncertainty theory. According to inverse uncertainty distribution, the model can be transformed into a deterministic form. Finally, in order to solve the uncertain fixed charge transportation problem, a numerical example is given to show the application of the model and algorithm.
Relative Entropy Model of Uncertain Random Shortest Path
Gang SHI,Yuhong SHENG,Qing CUI 국제이네비해양경제학회 2015 International Journal of e-Navigation and Maritime Vol.2 No.1
The shortest path problem is one of network optimization problems. This paper considers a shortest path problem under the situation where lengths of arcs in a network include both uncertainty and randomness, and focuses on the case that the lengths of arcs are expressed by uncertain random variables. This paper presents a new type of model: relative entropy model of shortest path. By the definition of relative entropy of the uncertain random variables, relative entropy model of shortest path problem is proposed to find the shortest path which fully reflects uncertain and random information. This model is formulated to find a shortest path whose chance distribution minimizes the difference from the ideal one. A numerical example is given to illustrate the model’s effectiveness.