Stochastic bottleneck transportation problem with flexible supply and demand quantity

Title:

Stochastic bottleneck transportation problem with flexible supply and demand quantity

Creator:

Ge, Yue and Ishii, HIroaki

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:fa18f67b-ea5f-4677-8d9b-c3eee6fb13a4
uuid:fa18f67b-ea5f-4677-8d9b-c3eee6fb13a4

Subject:

bottleneck transportation, random transportation time, flexible supply and demand quantity, and non-dominated transportation pattern

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

We consider the following bottleneck transportation problem with both random and fuzzy factors. There exist m supply points with flexible supply quantity and n demand points with flexible demand quantity. For each supply-demand point pair, the transportation time is an independent positive random variable according to a normal distribution. Satisfaction degrees about the supply and demand quantity are attached to each supply and each demand point, respectively. They are denoted by membership functions of corresponding fuzzy sets. Under the above setting, we seek a transportation pattern minimizing the transportation time target subject to a chance constraint and maximizing the minimal satisfaction degree among all supply and demand points. Since usually there exists no transportation pattern optimizing two objectives simultaneously, we propose an algorithm to find some non-dominated transportation patterns after defining non-domination. We then give the validity and time complexity of the algorithm. Finally, a numerical example is presented to demonstrate how our algorithm runs.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

[560]-571

Source:

Kybernetika | 2011 Volume:47 | Number:4

Harvested from:

CDK

Metadata only:

false