Return
Uncertain minimum cost multicommodity flow problem
DOI:10.1007/s00500-015-1871-6.png)
Abstract
En 中文
This paper investigates the minimum cost multicommodity flow problem with uncertain costs and uncertain capacities. Uncertainty theory is used to deal with indeterminacy factors in uncertain network. An (, )-minimum cost multicommodity flow model is formulated. Some properties of the model are analyzed. An equivalence relationship between the (, )-minimum cost multicommodity flow and the minimum cost multicommodity flow is proved. Then, a global optimal algorithm is developed for finding the (, )-minimum cost multicommodity flow and the minimum cost multicommodity flow, and obtaining the uncertainty distribution of total shipping cost. Finally, two examples are presented to illustrate the algorithm.
Keywords:
Uncertainty theory
Uncertain programming
Uncertain variable
Minimum cost flow
Network optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W
Organization
Cited Papers
Extreme value theorems of uncertain process with application to insurance risk model
SOFT COMPUTING
IF2.5
Pretreatment serum levels of hematopoietic cytokines in patients with colorectal adenomas and cancer

