Skip Navigation


IMA Journal of Management Mathematics Advance Access originally published online on March 14, 2007
IMA Journal of Management Mathematics 2007 18(2):135-155; doi:10.1093/imaman/dpm010
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
18/2/135    most recent
dpm010v1
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 Liang, Y.-C.
Right arrow Articles by Chen, Y.-C.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

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

Variable neighbourhood search for redundancy allocation problems

Yun-Chia Liang**, Min-Hua Lo*** and Yi-Ching Chen****

Department of Industrial Engineering and Management, Yuan Ze University, No 135 Yuan-Tung Road, Chung-Li, Taoyuan County, Taiwan 320, Republic of China

** Email: ycliang{at}saturn.yzu.edu.tw

*** Email: s929512{at}mail.yzu.edu.tw

**** Email: s927522{at}mail.yzu.edu.tw


  Abstract

A variable neighbourhood search (VNS) algorithm has been developed to solve the redundancy allocation problem (RAP). The VNS method is perfectly suited to those combinatorial problems with potential neighbourhood structures, as in the case of the RAP. The most studied configuration of the RAP is a series system of s-independent k-out-of-n:G subsystems the so-called series–parallel system. The RAP is to select the optimal combination and redundancy levels of components to meet system-level constraints. Two types of objectives are considered in this study—system reliability maximization and system cost minimization. The VNS algorithm is tested on sets of benchmark problems and compared to the best heuristics in the literature such as tabu search, multiple weighted objective heuristic, ant colony optimization and genetic algorithm. Computational results show the advantages and benefits of VNS for solving both types of RAP while considering both solution quality and computational efficiency.

Keywords: variable neighbourhood search; redundancy allocation problem; series–parallel system

Received on April 2006. accepted on 2 February 2007.


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.