Username   Password       Forgot your password?  Forgot your username? 

ISSUES BY YEAR

Volume 13 - 2017

No.4 July 2017
No.4 July 2017
No.5 September 2017
No.5 September 2017
No.7 November 2017
No.7 November 2017
No.8 December 2017
No.8 December 2017

Volume 12 - 2016

Volume 11 - 2015

Volume 10 - 2014

Volume 9 - 2013

Volume 8 - 2012

Volume 7 - 2011

Volume 6 - 2010

Volume 5 - 2009

Volume 4 - 2008

Volume 3 - 2007

Volume 2 - 2006

Approximation of Minimal Cut Sets for a Flow Network via Evolutionary Optimization and Data Mining Techniques

Volume 7, Number 1, January 2011 - Paper 2 - pp. 21-31

CHI ZHANG and JOSÉ EMMANUEL RAMIREZ-MARQUEZ

Stevens Institute of Technology, Castle Point on Hudson, Hoboken, NJ, 07030, USA

(Received on March 15, 2009, revised June 28, 2010)


Abstract:

For the reliability analysis of networks, approaches based on minimal cut sets provide not only the necessary elements to obtain a reliability value but also, insight about the importance of network components. When considering a flow network, flow minimal cut sets –the equivalent of minimal cut sets in the binary case- identification is generally based on the a priori knowledge of binary minimal cut sets. Unfortunately, the enumeration of minimal cut sets is known to be an NP-hard problem. For complex and high density networks, obtaining an exact value of reliability may be prohibitive. Instead an approximation to the true reliability may suffice. In this paper, for the first time minimal cut set approximation for a flow network is done via the development of an optimization problem and an evolutionary algorithm to solve this model. The evolutionary algorithm is based on a data mining technique used to identify potentially optimal set of solutions- a subset of the true set of all cut sets that can be used to create a reliability bound and identify critical components.

 

References: 27

Click here to download the paper.

Please note : You will need Adobe Acrobat viewer to view the full articles.Get Free Adobe Reader

 

Important Access Information

Individuals, Institutions and Corporations with access via userid and password:

If you have a valid userid and password, you will need to login at the top of the screen. All volumes that are authorized by your subscription will be available for download. If you are not authorized, you will see an 'add to cart' option and you have the choice of purchasing the articles. You may also apply for subscription from our Subscription page.

 

If you cannot access any paper and you feel your subscription entitles you to access, please notify us by using the contact form on the Contact Us page. Please provide as much detail as possible.

 

Institutions and Corporations with access via IP addresses:

If you have a subscription via IP addresses, all volumes that are authorized by your subscription will be available for download. If you are not authorized, you will see an 'add to cart' option and you have the choice of purchasing the articles. You may also apply for subscription from our Subscription page.

 

If you cannot access any paper and you feel your subscription entitles you to access, please verify that the EXTERNAL IP address of your computer is authorized. Before contacting us, contact your system administrator and confirm if the IP address of your network has been authorized for access. To find out the EXTERNAL IP address of your network, simply open any Internet browser and point it to : http://www.WhatIsMyIP.com. Your EXTERNAL IP address will be shown in the browser window.

 

Once you have this information, you may email us using the contact form on the Contact Us page. Please provide as much detail as possible. You may also email a screenshot of the browser to :subscriptions@IJPE-Online.com

 

Thank you for your understanding. We will try our best to reply within 24-48 hours.

This site uses encryption for transmitting your passwords. ratmilwebsolutions.com