The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
An Ant Colony Optimization Algorithm for the Redundancy Allocation Problem (RAP)
Abstract
This paper uses an ant colony meta-heuristic optimization method to solve the redundancy allocation problem (RAP). The RAP is a well known NP-hard problem which has been the subject of much prior work, generally in a restricted form where each subsystem must consist of identical components in parallel to make computations tractable. Meta-heuristic methods overcome this limitation, and offer a practical way to solve large instances of the relaxed RAP where different components can be placed in parallel. The ant colony method has not yet been used in reliability design, yet it is a method that is expressly designed for combinatorial problems with a neighborhood structure, as in the case of the RAP. An ant colony optimization algorithm for the RAP is devised & tested on a well-known suite of problems from the literature. It is shown that the ant colony method performs with little variability over problem instance or random number seed. It is competitive with the best-known heuristics for redundancy allocation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ant system: optimization by a colony of cooperating agents
Dorigo, M., Maniezzo, V., & Colorni, A. (1996) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.484436 · Cited by 12,067
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
Optimization, Learning and Natural Algorithms
Dorigo, M. (1992) · Medical Entomology and Zoology · Cited by 3,307
Ant Algorithms for Discrete Optimization
Dorigo, M., Caro, G. D., & Gambardella, L. M. (1999) · Artificial Life · doi:10.1162/106454699568728 · Cited by 2,808
Ant colony optimization: a new meta-heuristic
Dorigo, M., & Di Caro, G. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.782657 · Cited by 2,137
Ant colonies for the travelling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · Biosystems · doi:10.1016/s0303-2647(97)01708-5 · Cited by 2,023
The Ant Colony Optimization Metaheuristic
(2004) · Ant Colony Optimization · doi:10.7551/mitpress/1290.003.0004 · Cited by 1,406
Reliability optimization of series-parallel systems using a genetic algorithm
Coit, D. W., & Smith, A. E. (1996) · IEEE Transactions on Reliability · doi:10.1109/24.510811 · Cited by 759
Self-citationThe ant system applied to the quadratic assignment problem
Maniezzo, V., & Colorni, A. (1999) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.806935 · Cited by 744
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows
Gambardella, L. M., Taillard, É. D., & Agazzi, G. (1999) · Cited by 725
An annotated overview of system-reliability optimization
Kuo, W., & Prasad, V. R. (2000) · IEEE Transactions on Reliability · doi:10.1109/24.877336 · Cited by 665
Ant system for Job-shop Scheduling
Colorni, A., Dorigo, M., Maniezzo, V., & Trubian, M. (1994) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 617
An improved Ant System algorithm for theVehicle Routing Problem
Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999) · Annals of Operations Research · doi:10.1023/a:1018940026670 · Cited by 548
Costa, D., & Hertz, A. (1997) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600357 · Cited by 497
Applying the ANT System to the Vehicle Routing Problem
Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999) · Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization · doi:10.1007/978-1-4615-5775-3_20 · Cited by 408
Genetic algorithms in optimization of system reliability
Painton, L., & Campbell, J. (1995) · IEEE Transactions on Reliability · doi:10.1109/24.387368 · Cited by 362
ACO algorithms for the quadratic assignment problem
Stützle, T., & Dorigo, M. (1999) · Cited by 262
Optimization Techniques for System Reliability with RedundancyߞA Review
Tillman, F. A., Hwang, C.-L., & Kuo, W. (1977) · IEEE Transactions on Reliability · doi:10.1109/tr.1977.5220100 · Cited by 246
Ant Colony Optimization for the Total Weighted Tardiness Problem
den Besten, M., Stützle, T., & Dorigo, M. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45356-3_60 · Cited by 219
Ant colonies for adaptive routing in packet-switched communications networks
Di Caro, G., & Dorigo, M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0056909 · Cited by 163
Dynamic Programming and the Reliability of Multicomponent Devices
Bellman, R., & Dreyfus, S. E. (1958) · Operations Research · doi:10.1287/opre.6.2.200 · Cited by 154
Redundancy allocation to maximize a lower percentile of the system time-to-failure distribution
Coit, D. W., & Smith, A. E. (1998) · IEEE Transactions on Reliability · doi:10.1109/24.690912 · Cited by 82
Self-citation
Cited by
A comprehensive review on solar PV maximum power point tracking techniques
Ram, J. P., Babu, T. S., & Rajasekar, N. (2017) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2016.09.076 · Cited by 511
Computation Offloading Toward Edge Computing
Lin, L., Liao, X., Jin, H., & Li, P. (2019) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2922285 · Cited by 456
Recent Advances in Optimal Reliability Allocation
Kuo, W., & Wan, R. (2007) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2006.889476 · Cited by 371
AVE: Autonomous Vehicular Edge Computing Framework with ACO-Based Scheduling
Feng, J., Liu, Z., Wu, C., & Ji, Y. (2017) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2017.2714704 · Cited by 330
Metadata
- Authors
- Liang, Y.-C., & Smith, A. E.
- Venue
- IEEE Transactions on Reliability
- Published
- 2004-09
- Volume
- 53
- Issue
- 3
- Pages
- 417-423
- ISSN
- 0018-9529 (ISSN-L)
- OpenAlex
- W2165046421
- Cited by
- 374
- References
- 22
- FWCI
- 55.32
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.