zbMATH — the first resource for mathematics

Reliability based assignment in stochastic-flow freight network. (English) Zbl 1163.90003
Summary: Based on the reliability of transportation time, a transportation assignment model of stochastic-flow freight network is designed in this paper. This transportation assignment model is built by mean of stochastic chance-constraint programming and solved with a hybrid intelligent algorithm (HIA) which integrates genetic algorithm (GA), stochastic simulation (SS) and neural network (NN). GA is employed to report the optimal solution as well as the optimal objective function values of the proposed model. SS is used to simulate the value of uncertain system reliability function. The uncertain function approximated via NN is embedded into GA to check the feasibility and to compute the fitness of the chromosomes. These conclusions have been drawn after a test of numerical case using the proposed formulations. System reliability, total system cost and flow on each path would finally reach at their own convergence points. Increase of the system reliability causes increase of the total time cost. The system reliability and the total time cost converge at a possible Nash Equilibrium point.

90B25 Reliability, availability, maintenance, inspection in operations research
90B15 Stochastic network models in operations research
Full Text: DOI
[1] Sheffi, Y., Urban transportation network: equilibrium analysis with mathematical programming methods, (1984), Prentice-Hall, Inc. Englewood Cliffs, New Jersey
[2] Bielli, M.; Boulmakoul, A.; Mouncif, H., Object modeling and path computation for multimodal travel systems, Eur. J. oper. res., 17, 1705-1730, (2006) · Zbl 1142.90367
[3] Chen, Y.L.; Chin, Y.H., The quickest path problem, Comput. oper. res., 17, 153-161, (1990) · Zbl 0698.90083
[4] Martins, E.D.Q.V.; Santos, J.L.E.D., An algorithm for the quick path problem, Oper. res. lett., 20, 195-198, (1997)
[5] Chen, G.H.; Huang, Y.C., Algorithms for the constrained quickest path problem and the enumeration of quickest paths, Comput. oper. res., 21, 113-118, (1994) · Zbl 0795.90079
[6] Hung, Y.C.; Chen, G.H., Distributed algorithms for the quickest path problem, Parallel comput., 18, 823-834, (1992) · Zbl 0754.68057
[7] Lin, J.S.; Jane, C.C.; Yuan, J., On reliability evaluation of a capacitated-flow network in terms of minimal pathsets, Network, 25, 131-138, (1995) · Zbl 0828.90038
[8] Rosen, J.B.; Sun, S.Z.; Xue, G.L., Algorithms for the quickest path problem and the enumeration of quickest paths, Comput. oper. res., 18, 579-584, (1991) · Zbl 0747.90104
[9] Chen, Y.L., Finding the k quickest simples paths in a network, Inform. process. lett., 50, 89-92, (1994) · Zbl 0804.90129
[10] Lee, D.T.; Papadopoulou, E., The all-pairs quickest path problem, Inform. process. lett., 45, 261-267, (1993) · Zbl 0768.68049
[11] Lin, Y.K., A simple algorithm for reliability evaluation of a stochastic-flow network with node failure, Comput. oper. res., 28, 1277-1285, (2001) · Zbl 0989.90015
[12] Lin, Y.K., Reliability of a stochastic-flow network with unreliable branches & nodes under budget constraints, IEEE trans. reliab., 53, 381-387, (2004)
[13] Alexopoulos, C., Note on state-space decomposition methods for analyzing stochastic flow networks, IEEE trans. reliab., 44, 354-357, (1995)
[14] Lin, Y.K., Study on the multicommodity reliability of a capacitated-flow network, Comput. math. appl., 42, 255-264, (2001) · Zbl 0981.90014
[15] Locks, M.O., Recent development in computing of system reliability, IEEE trans. reliab., 34, 425-436, (1985) · Zbl 0584.90032
[16] Carlier, J.; Li, Y.; Jean; Luttonb, L., Reliability evaluation of large telecommunication networks, Disc. appl. math., 76, 61-80, (1997) · Zbl 0882.90041
[17] Y.K. Lin, Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths. Comput. Oper. Res., in press. Available online 14 December 2007.
[18] Chen, H.; Zhou, J., Reliability optimization in generalized stochastic-flow networks, IEEE trans. reliab., 40, 92-97, (1991) · Zbl 0739.90017
[19] Hsieh, C.C.; Lin, M.H., Reliability-oriented multi-resource allocation in a stochastic-flow network, Reliab. eng. syst. safe., 81, 155-161, (2003)
[20] Doulliez, P.; Jamoulle, E., Transportation networks with random arc capacities, Oper. res., 3, 45-60, (1972) · Zbl 0249.90025
[21] Y.K. Lin, Optimal routing policy of a stochastic-flow network. Comput. Indust. Eng. (2008), doi:10.1016/j.cie.2008.09.002.
[22] Sun, G.; Cassandras, C.G.; Wardi, Y.; Panayiotou, C.G.; Riley, G.F., Perturbation analysis and optimization of stochastic flow networks, IEEE trans. automat. contr., 49, 2143-2159, (2004) · Zbl 1365.93304
[23] Zhou, Y.; Meng, Q., Improving efficiency of solving d-MC problem in stochastic-flow network, Reliab. eng. syst. safe., 83, 1, 47-55, (2004)
[24] Beyer, H.G.; Sendhoff, B., Robust optimization—a comprehensive survey, Comput. meth. appl. mech. eng., 196, 3190-3218, (2007) · Zbl 1173.74376
[25] Barbarosogcaronlu, G.; Arda, Y., A two-stage stochastic programming framework for transportation planning in disaster response, J. oper. res. soc., 55, 43-53, (2004) · Zbl 1095.90586
[26] Charnes, A.; Cooper, W.W., Chance-constrained programming, Manage. sci., 6, 73-79, (1959) · Zbl 0995.90600
[27] Liu, B., Theory and practice of uncertain programming, (2002), Physica-Verlag Heidelberg · Zbl 1029.90084
[28] Liu, B., Uncertainty theory: an introduction to its axiomatic foundations, (2004), Springer-Verlag Berlin · Zbl 1072.28012
[29] Xia, Y.; Liu, B.; Wang, Sh.; Lai, K.K., A model for portfolio selection with order of expected returns, Comput. oper. res., 27, 409-422, (2000) · Zbl 1063.91519
[30] Ke, H.; Liu, B., Project scheduling problem with stochastic activity duration times, Appl. math. comput., 168, 342-353, (2005) · Zbl 1076.94044
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.