.png){kind=icon}
.png){kind=icon}
Return
Fixed charge solid transportation problem in uncertain environment and its algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2016.10.030.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, the fixed charge solid transportation problem under uncertainty is investigated. As a result, three mathematical models are constructed for the problem, i.e., expected value model, chance constrained programming model and measure-chance programming model, where the supplies, demands, conveyance capacities, direct costs and fixed charges are regarded as uncertain variables. After that, the crisp equivalences of the models are discussed. What is more, a hybrid intelligent algorithm is designed based on the uncertainty theory and tabu search algorithm to solve the models. Compared with the existing work, the innovations of the proposed work are briefly illustrated. Finally, some numerical examples are given to show the applications of the models and the algorithm. (C) 2016 Elsevier Ltd. All rights reserved.
Keywords:
Transportation problem
Chance-constrained programming
Measure-chance programming
Uncertainty theory
Tabu search algorithm
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.5
Papers:
1.0W
Citations:
3.8W
Organization
View more organizations