Variable neighbourhood search for redundancy allocation problems |
| |
Authors: | Liang, Yun-Chia Lo, Min-Hua Chen, Yi-Ching |
| |
Affiliation: | Department of Industrial Engineering and Management, Yuan Ze University, No 135 Yuan-Tung Road, Chung-Li, Taoyuan County, Taiwan 320, Republic of China |
| |
Abstract: | ** Email: ycliang{at}saturn.yzu.edu.tw*** Email: s929512{at}mail.yzu.edu.tw**** Email: s927522{at}mail.yzu.edu.tw A variable neighbourhood search (VNS) algorithm has been developedto solve the redundancy allocation problem (RAP). The VNS methodis perfectly suited to those combinatorial problems with potentialneighbourhood structures, as in the case of the RAP. The moststudied configuration of the RAP is a series system of s-independentk-out-of-n:G subsystems the so-called seriesparallelsystem. The RAP is to select the optimal combination and redundancylevels of components to meet system-level constraints. Two typesof objectives are considered in this studysystem reliabilitymaximization and system cost minimization. The VNS algorithmis tested on sets of benchmark problems and compared to thebest heuristics in the literature such as tabu search, multipleweighted objective heuristic, ant colony optimization and geneticalgorithm. Computational results show the advantages and benefitsof VNS for solving both types of RAP while considering bothsolution quality and computational efficiency. |
| |
Keywords: | variable neighbourhood search redundancy allocation problem series parallel system |
本文献已被 Oxford 等数据库收录! |
|