Chance constrained bottleneck transportation problem with preference of routes

Ge, Yue, Chen, Minghao, and Ishii, Hiroaki. "Chance constrained bottleneck transportation problem with preference of routes." Kybernetika 48.5 (2012): 958-967. <http://eudml.org/doc/251435>.

@article{Ge2012,
abstract = {This paper considers a variant of the bottleneck transportation problem. For each supply-demand point pair, the transportation time is an independent random variable. Preference of each route is attached. Our model has two criteria, namely: minimize the transportation time target subject to a chance constraint and maximize the minimal preference among the used routes. Since usually a transportation pattern optimizing two objectives simultaneously does not exist, we define non-domination in this setting and propose an efficient algorithm to find some non-dominated transportation patterns. We then show the time complexity of the proposed algorithm. Finally, a numerical example is presented to illustrate how our algorithm works.},
author = {Ge, Yue, Chen, Minghao, Ishii, Hiroaki},
journal = {Kybernetika},
keywords = {bottleneck transportation; random transportation time; chance constraint; preference of routes; non-domination; bottleneck transportation; random transportation time; chance constraint; preference of routes; non-domination},
language = {eng},
number = {5},
pages = {958-967},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Chance constrained bottleneck transportation problem with preference of routes},
url = {http://eudml.org/doc/251435},
volume = {48},
year = {2012},
}

TY - JOUR
AU - Ge, Yue
AU - Chen, Minghao
AU - Ishii, Hiroaki
TI - Chance constrained bottleneck transportation problem with preference of routes
JO - Kybernetika
PY - 2012
PB - Institute of Information Theory and Automation AS CR
VL - 48
IS - 5
SP - 958
EP - 967
AB - This paper considers a variant of the bottleneck transportation problem. For each supply-demand point pair, the transportation time is an independent random variable. Preference of each route is attached. Our model has two criteria, namely: minimize the transportation time target subject to a chance constraint and maximize the minimal preference among the used routes. Since usually a transportation pattern optimizing two objectives simultaneously does not exist, we define non-domination in this setting and propose an efficient algorithm to find some non-dominated transportation patterns. We then show the time complexity of the proposed algorithm. Finally, a numerical example is presented to illustrate how our algorithm works.
LA - eng
KW - bottleneck transportation; random transportation time; chance constraint; preference of routes; non-domination; bottleneck transportation; random transportation time; chance constraint; preference of routes; non-domination
UR - http://eudml.org/doc/251435
ER -