Journal
APPLIED SOFT COMPUTING
Volume 51, Issue -, Pages 49-59Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.asoc.2016.11.027
Keywords
Bicriteria solid transportation problem; Combinatorial optimization; Uncertainty theory; Uncertain goal programming
Categories
Funding
- Projects of the Humanity and Social Science Foundation of Ministry of Education of China [13YJA630065]
- Key Project of Hubei Provincial Natural Science Foundation [2015CFA144]
- Project of Hubei Provincial Natural Science Foundation [2016CFB308]
- Fundamental Research Funds for the Central Universities, China [31541411222, 31541411209]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available