A heuristics method based on ant colony optimisation for redundancy allocation problems
by Wenzhu Liao, Ershun Pan, Lifeng Xi
International Journal of Computer Applications in Technology (IJCAT), Vol. 40, No. 1/2, 2011

Abstract: Reliability allocation as an optimisation tool is to minimise the total amount of resource subject to the constraints of overall safety goals. Redundancy allocation problem is a multi-objective optimisation problem which has been shown to be NP-hard formulated with objectives of maximising its reliability while minimising the total resource. However, existing approaches are limited to the use in problems of small size. Considering the scale of the problems faced nowadays, a heuristic method is developed in this study based on ant colony optimisation, then tabu search technique, whose framework of short-term and long-term memories provides the parallel searching ability for both global and local area, is used to improve it. A case study using this heuristic method is presented. The developed method performs well and the computational result proves its efficiency.

Online publication date: Thu, 10-Feb-2011

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com