Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Management Sciences in China》 2007-02
Add to Favorite Get Latest Update

Chance-constrained programming model for network expansion

WU Yun1,LIN Yi2,ZHOU Jian31.College of Management,Wuhan University of Technology,Wuhan 430073,China;2.College of Chemistry and Molecular Sciences,Wuhan University,Wuhan 430072,China;3.Department of Computer Sciences,University of Angers,France  
In this paper we consider how to increase the capacities of the elements in a set E efficiently so that the total cost for the increment of capacity can be decreased to the maximum extent while the final expansion capacity of a given family F of subsets of E is within a given limit bound.We suppose that cost is a stochastic variable which conforms to normal distribution.Network bottleneck capacity expansion problem with stochastic cost is originally formulated as Chanceconstrained programming model according to some criteria.In order to solve the stochastic model efficiently,network bottleneck capacity algorithm,stochastic simulation and genetic algorithm are integrated to produce a hybrid intelligent algorithm.Finally,some numerical example are presented.
【Fund】: 国家自然科学基金资助项目(70071011)
【CateGory Index】: U491.12
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
Chinese Journal Full-text Database 1 Hits
1 WANG Hong\|guo\ MA Shao\|han ( Dept. of Computer Science,Shandong Univ.,Jinan 250100,China);THE CAPACITY EXPANSION PROBLEM ON DIRECTED NETWORKS[J];Applied Mathematics A Journal of Chinese Universities;2001-04
Chinese Journal Full-text Database 5 Hits
1 ZHANG Gang-ting,JIANG Xiao-bing,WANG Shu-zhen (1. Department of Computer Science, Xi’an University of Arts and Science Xi’an 710065; 2. School of Economics & Management, Xidian University Xi’an 710071);Research on Network Max-flow Pareto Expansion Problem[J];Journal of University of Electronic Science and Technology of China;2006-01
2 WU Yun~(1,3),ZHOU Jian~2,YANG Yang~1(1. School of Management, Wuhan University of Technology,Wuhan 430077,China;2. Department of Computer Sciences , University of Angers,Angers France;3. School of Management , Huazhong Universtiy of Science and Technology,Wuhan 430077,China);A Chance-constrained Model and Intelligent Algorithm for Stochastic Network Bottleneck Capacity Expansion[J];Systems Engineering;2005-04
3 WU Yun ~(1,3),ZHOU Jian ~(2 ),YANG Jun ~(1) (1. College of Management, Huazhong University of Science and Technology, Wuhan 430077, China; 2. Department of Computer Sciences, University of Angers, France; 3. College of Management, Wuhan University of Technology, Wuhan 430077, China);Expected Value Model for Stochastic Network Bottleneck Capacity Expansion[J];Industrial Engineering and Management;2005-04
4 Wang Liping 1 Wang Shuzhen 2 Xu Guohua 21 (Dept.of Computer,lüliang Higher Technical College,Lishi 033000) 2 (School of Electromechanical Engineering,Xidian Univ.,Xi'an710071);The Network Capacity Expansion Problem with the Time and Cost Constraints[J];Computer Engineering and Applications;2003-11
5 WANG Shuzhen,WANG Dong,LIU Huailiang,XU Guohua (School of Electromechanical Engineering, Xidian Univ., Xi'an 710071);Network Capacity Expansion Problem with the Time and Cost Constraints[J];Computer Engineering;2004-01
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved