Dependent-chance programming model for stochastic network bottleneck capacity expansion based on neural network and genetic algorithm

Lecture Notes in Computer Science

Volumn 3612, Issue PART III, 2005, Pages 120-128

  Wu, Yun ^a,c   Zhou, Jian ^b   Yang, Jun ^c  

^a WUHAN UNIVERSITY OF TECHNOLOGY   (China)

^b UNIVERSITÉ D'ANGERS   (France)

^c HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; GENETIC ALGORITHMS; MATHEMATICAL MODELS; NEURAL NETWORKS; PROBABILITY; STOCHASTIC CONTROL SYSTEMS;

DEPENDENT-CHANCE PROGRAMMING MODEL; STOCHASTIC MODEL; SUBSETS;

DYNAMIC PROGRAMMING;

EID: 26844457991     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11539902_14     Document Type: Conference Paper

References (17)

1. Ahuja R.K,Magnanti T.L,Orlin J.B.: Network Flows. Englewood Cliffs, NJ: Prentice-Hall(1993)
2. Averbakh I, Berman O,Punnen AP .: Constrained Matroidal Bottleneck Problem. Discrete Applied Mathematics 63 (1995) 201-14
3. Krumke,S.O , Marthe ,M.V.,Ravi,R., and Ravi, S.S.: Approximation Algorithms for Certain Network Improvement, Journal of Combinatorial Optimization, 2(1998),257-288
4. Zhang,J., Yang,C., Lin, Y.: A Class of Bottleneck Expansion Problems , Computer and Operational Research, 124(2000),77-88
5. Yang,C., Liu,J.: A Capacity Expansion Problem with Budget Constraint and Bottleneck Limitation , Acta Mathematica Scientia , 22(2002),207-212
6. Wang Hongguo, Ma Shaohan: Capacity Expansion Problem on Undirected Network, Journal of Shangdong University, 35(2000),418-424
7. Wang Hongguo, Ma Shaohan: Capacity Expansion Problem on Directed Network, Application Mathematics Journal of Chinese University, 16(2001) 471-473
8. X.G.Yang, J.Z.Zhang: A Network Improvement Problem under Different Norms. Computational Optimization and Applications.27 (2004) 305-319
9. Charnes, A.,&Cooper, W.W: Management Models and Industrial Applications of Linear Programming , Englewood Cliffs, NJ: Prentice-Hall (1961)
10. Liu B : Dependent-Chance Programming : a class of stochastic programming. Computers& Mathematics with Applications 34(1997)89-104
11. 11K.IWAMURA, B.Liu: Dependent-Chance Integer Programming Applied to Capital Budgeting, Journal of the Operations Research Society of Japan, 42(1999) 117-127.
12. Ryan SM: Capacity Expansion for Random Exponential Demand Growth. Working Paper No.00-109, Industrial and Manufacturing Systems Engineering, Iowa State University, Ames, IA, August 2000.
13. H.Katagiri, H.Ishii: Chance Constrained Bottleneck Spanning Tree Problem with Fuzzy Random Edge Costs, Journal of the Operations Research Society of Japan 43 (2000) 128-137
14. H.Katagiri, Masatoshi Sakawa, Hiroaki Ishii: Fuzzy Random Bottleneck Spanning Tree Problem Using Possibility and Necessity Measures, European Journal of Operational Research 152 (2004) 88-95
15. Liu B: Uncertain Programming. New York : wiley(1999)
16. Venkatech S.: Computation and Learning in the Context of Neural Network Capacity, Neural Networks for Perception 2 (1992) 173-327
17. Castellano G.,Fanelli A.M, Pelillo M.: An Iterative Pruning Algorithm for FeedForward Neural Networks, IEEE Transactions on Neural Network 8 (1997) 519-537.