Ant colony approach to constrained redundancy optimization in binary systems
From MaRDI portal
Publication:969340
DOI10.1016/j.apm.2009.07.016zbMath1185.90055OpenAlexW2020305248MaRDI QIDQ969340
Vikas Kumar Sharma, Manju Lata Agarwal
Publication date: 6 May 2010
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2009.07.016
Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (6)
Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems ⋮ Optimization for the redundancy allocation problem of reliability using an improved particle swarm optimization algorithm ⋮ Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms ⋮ Strategy selection for multi-objective redundancy allocation problem in a k-out-of-n system considering the mean time to failure ⋮ Genetic algorithm for solving bi-objective redundancy allocation problem with \(k\)-out-of-\(n\) subsystems ⋮ A robust loss function approach for a multi-objective redundancy allocation problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Ant colonies for the quadratic assignment problem
- A New Heuristic Algorithm for Constrained Redundancy-Optimization in Complex Systems
- Reliability Optimization by Generalized Lagrangian-Function and Reduced-Gradient Methods
- A Reliability Optimization Method for Complex Systems with the Criterion of Local Optimality
- An Improved Algorithm for Network Reliability
- A heuristic method for solving redundancy optimization problems in complex systems
- Metaheuristics for Hard Optimization
- Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems
This page was built for publication: Ant colony approach to constrained redundancy optimization in binary systems
