.png){kind=icon}
.png){kind=icon}
Return
Uncertain goal programming models for bicriteria solid transportation problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2016.11.027.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper investigates an uncertain bicriteria solid transportation problem. The supplies, demands, conveyance capacities, transportation cost and transportation time are regarded as uncertain variables. According to two types of methods to rank the uncertain variables, expected value goal programming model and chance-constrained goal programming model for the bicriteria solid transportation problem are constructed. It is proved that the expected value goal programming model and chance-constrained goal programming model can be respectively transformed into the corresponding deterministic equivalents by taking advantage of some properties of uncertainty theory. Based on these equivalence relations, the optimal transportation plans of the uncertain goal programming models can be obtained. Several numerical experiments are presented to illustrate the applications of the models. (C) 2016 Elsevier B.V. All rights reserved.
Keywords:
Bicriteria solid transportation problem
Combinatorial optimization
Uncertainty theory
Uncertain goal programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W
Organization
View more organizations