Stochastic bottleneck transportation problem with flexible supply and demand quantity

Ge, Yue, and Ishii, Hiroaki. "Stochastic bottleneck transportation problem with flexible supply and demand quantity." Kybernetika 47.4 (2011): 560-571. <http://eudml.org/doc/196596>.

@article{Ge2011,
abstract = {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.},
author = {Ge, Yue, Ishii, Hiroaki},
journal = {Kybernetika},
keywords = {bottleneck transportation; random transportation time; flexible supply and demand quantity; non-dominated transportation pattern; bottleneck transportation; random transportation time; flexible supply and demand quantity; non-dominated transportation pattern},
language = {eng},
number = {4},
pages = {560-571},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Stochastic bottleneck transportation problem with flexible supply and demand quantity},
url = {http://eudml.org/doc/196596},
volume = {47},
year = {2011},
}

TY - JOUR
AU - Ge, Yue
AU - Ishii, Hiroaki
TI - Stochastic bottleneck transportation problem with flexible supply and demand quantity
JO - Kybernetika
PY - 2011
PB - Institute of Information Theory and Automation AS CR
VL - 47
IS - 4
SP - 560
EP - 571
AB - 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.
LA - eng
KW - bottleneck transportation; random transportation time; flexible supply and demand quantity; non-dominated transportation pattern; bottleneck transportation; random transportation time; flexible supply and demand quantity; non-dominated transportation pattern
UR - http://eudml.org/doc/196596
ER -