Geodesic
Chance constrained bottleneck transportation problem with preference of routes
Kybernetika, Tome 48 (2012) no. 5, pp. 958-967 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

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.
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.
Classification : 68Q25, 90C15, 90C35, 90C70
Keywords: bottleneck transportation; random transportation time; chance constraint; preference of routes; non-domination 
@article{KYB_2012_48_5_a8,
     author = {Ge, Yue and Chen, Minghao and Ishii, Hiroaki},
     title = {Chance constrained bottleneck transportation problem with preference of routes},
     journal = {Kybernetika},
     pages = {958--967},
     year = {2012},
     volume = {48},
     number = {5},
     mrnumber = {3086862},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_2012_48_5_a8/}
}
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
SP  - 958
EP  - 967
VL  - 48
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/KYB_2012_48_5_a8/
LA  - en
ID  - KYB_2012_48_5_a8
ER  - 
%0 Journal Article
%A Ge, Yue
%A Chen, Minghao
%A Ishii, Hiroaki
%T Chance constrained bottleneck transportation problem with preference of routes
%J Kybernetika
%D 2012
%P 958-967
%V 48
%N 5
%U http://geodesic.mathdoc.fr/item/KYB_2012_48_5_a8/
%G en
%F KYB_2012_48_5_a8
Ge, Yue; Chen, Minghao; Ishii, Hiroaki. Chance constrained bottleneck transportation problem with preference of routes. Kybernetika, Tome 48 (2012) no. 5, pp. 958-967. http://geodesic.mathdoc.fr/item/KYB_2012_48_5_a8/