Skip Navigation



IMA Journal of Management Mathematics Advance Access published online on June 11, 2009
IMA Journal of Management Mathematics, doi:10.1093/imaman/dpp005
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Beraldi, P.
Right arrow Articles by Guerriero, F.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The authors 2009. Published by Oxford University Press on behalf of the Institute of Mathematics and its Applications. All rights reserved.

Network reliability design via joint probabilistic constraints

P. Beraldi{dagger}, M. E. Bruni{ddagger} and F. Guerriero§

Dipartimento di Elettronica, Informatica, Sistemistica, Università della Calabria, Via P. Bucci 41C, 87030 Rende, Cosenza, Italy

{dagger} Corresponding author. Email: beraldi{at}deis.unical.it

{ddagger} Email: mebruni{at}deis.unical.it

§ Email: guerriero{at}deis.unical.it

Received on 19 July 2007. Accepted on 11 January 2008.

Network reliability is an important issue in network planning and operation. While there is a flourishing literature on reliability measurement both theoretical and computational, very little effort has been made to address practical applicability of reliability concepts in real network design problems. This work attempts to bridge the gap between theory and practice by relating reliability concepts to design criteria, useful in several practical contexts. In particular, the problem of finding a minimum cost network design, satisfying some reliability constraints is addressed. An integer programming model is developed to represent mathematically the proposed network design problem. For its solution, two heuristics approaches are devised and implemented. Their performance is evaluated on a set of well-known test problems. The computational results collected are very encouraging, showing that the developed methods determine good quality solutions, in a limited amount of time.

Keywords: network design; probabilistic constraints; heuristic approaches


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.