A Sequential Decomposition Method for Estimating Flow in a Multi-Commodity, Multistate Network

Yeh, W

A Sequential Decomposition Method for Estimating Flow in a Multi-Commodity, Multistate Network

Yeh, W

Permalink

Publisher:: IEEE Reliability Society
Publication Type:: Journal Article
Citation:: IEEE Transactions on Reliability, 2011, 60 (3), pp. 612 - 621
Issue Date:: 2011-01

Closed Access

	Filename	Description	Size
	2011004299OK.pdf		546.34 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Yeh, W	en_US
dc.date.issued	2011-01	en_US
dc.identifier.citation	IEEE Transactions on Reliability, 2011, 60 (3), pp. 612 - 621	en_US
dc.identifier.issn	0018-9529	en_US
dc.identifier.uri	http://hdl.handle.net/10453/18298
dc.description.abstract	The weighted multi-commodity multistate unreliable network (WMMUN) is an extension of the multistate network. It is a new network composed of multistate unreliable components (such as arcs and nodes) with various weight capacities which is able to transmit different types of commodities. Currently, the method used to calculate the direct WMMUN reliability is derived from algorithms based on D-minimal path (D-MP). The best-known method may fail to find real D-MPs, and therefore requires more comparison and verification. A very simple algorithm based on the sequential decomposition method has been developed for finding all real D-MPs before calculating the WMMUN reliability. The relationships among the different versions of WMMUN reliability problems have also been clarified. The correctness and computational complexity of the proposed algorithm will be analysed and proven in this paper. An example will be given to illustrate how the WMMUN reliability is evaluated using the proposed algorithm. Computational results compare favorably with existing methods in terms of the running time, the number of d-MPs, and the number of D-MP candidates.	en_US
dc.publisher	IEEE Reliability Society	en_US
dc.relation.ispartof	IEEE Transactions on Reliability	en_US
dc.relation.isbasedon	10.1109/TR.2011.2161030	en_US
dc.rights	© 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.	en_US
dc.subject.classification	Operations Research	en_US
dc.title	A Sequential Decomposition Method for Estimating Flow in a Multi-Commodity, Multistate Network	en_US
dc.type	Journal Article
utslib.citation.volume	3	en_US
utslib.citation.volume	60	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
utslib.for	0803 Computer Software	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Software
pubs.organisational-group	/University of Technology Sydney/Strength - AAI - Advanced Analytics Institute Research Centre
utslib.copyright.status	closed_access
pubs.consider-herdc	true	en_US
pubs.issue	3	en_US
pubs.volume	60	en_US

Abstract:

The weighted multi-commodity multistate unreliable network (WMMUN) is an extension of the multistate network. It is a new network composed of multistate unreliable components (such as arcs and nodes) with various weight capacities which is able to transmit different types of commodities. Currently, the method used to calculate the direct WMMUN reliability is derived from algorithms based on D-minimal path (D-MP). The best-known method may fail to find real D-MPs, and therefore requires more comparison and verification. A very simple algorithm based on the sequential decomposition method has been developed for finding all real D-MPs before calculating the WMMUN reliability. The relationships among the different versions of WMMUN reliability problems have also been clarified. The correctness and computational complexity of the proposed algorithm will be analysed and proven in this paper. An example will be given to illustrate how the WMMUN reliability is evaluated using the proposed algorithm. Computational results compare favorably with existing methods in terms of the running time, the number of d-MPs, and the number of D-MP candidates.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/18298