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.

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

90C35, 90C15, 90C70, 68Q25

- R. K. Ahuja, J. B. Orlin and R. E. Tarjan: Improved time bounds for the maximum flow problem. SIAM J. Comput. 18 (1989), 939-954. CrossRef
- A. Charnes and W. W. Cooper: The stepping stone method of explaining linear programming calculations in transportation problems. Management Sci. 1 (1954), 49-69. CrossRef
- M. H. Chen, H. Ishii and C. X. Wu: Transportation problems on a fuzzy network. Internat. J. Innovative Computing, Information and Control 4 (2008), 1105-1109. CrossRef
- G. B. Dantzig: Application of the simplex method to a transportation problem. In: Activity Analysis of Production and Allocation, Chapter 23, Cowles Commission Monograph 13. Wiley, New York 1951. CrossRef
- L. R. Ford, Jr. and D. R. Fulkerson: Solving the transportation problem. Management Sci. 3 (1956), 24-32. CrossRef
- R. S. Garfinkel and M. R. Rao: The bottleneck transportation problem. Naval Res. Logist. Quart. 18 (1971), 465-472. CrossRef
- S. Geetha and K. P. K. Nair: A stochastic bottleneck transportation problem. J. Oper. Res. Soc. 45 (1994), 583-588. CrossRef
- P. L. Hammer: Time minimizing transportation problem. Naval Res. Logist. Quart. 16 (1969), 345-357. CrossRef
- F. L. Hitchcock: The distribution of a product from several sources to numerous localities. J. Math. Phys. 20 (1941), 224-230. CrossRef
- H. Ishii: Competitive transportation problem. Central Europ. J. Oper. Res. 12 (2004), 71-78. CrossRef
- H. Ishii and Y. Ge: Fuzzy transportation problem with random transportation costs. Scient. Math. Japon. 70 (2009), 151-157. CrossRef
- H. Ishii, M. Tada and T. Nishida: Fuzzy transportation problem. J. Japan Soc. Fuzzy Theory and System 2 (1990), 79-84. CrossRef
- F. T. Lin and T. R. Tsai: A two-stage genetic algorithm for solving the transportation problem with fuzzy demands and fuzzy supplies. Internat. J. Innov. Comput. Inform. Control 5 (2009), 4775-4785. CrossRef
- J. Munkres: Algorithms for the assignment and transportation problems. J. Soc. Industr. Appl. Math. 5 (1957), 32-38. CrossRef
- V. Srinivasan and G. L. Thompson: An operator theory of parametric programming for the transportation-I. Naval Res. Logist. Quart. 19 (1972), 205-226. CrossRef
- W. Szwarc: Some remarks on the time transportation problem. Naval Res. Logist. Quart. 18 (1971), 473-485. CrossRef
- M. Tada and H. Ishii: An integer fuzzy transportation Problem. Comput. Math. Appl. 31 (1996), 71-87. CrossRef
- M. Tada, H. Ishii and T. Nishida: Fuzzy transportation problem with integral flow. Math. Japon. 35 (1990), 335-341. CrossRef