Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm
From MaRDI portal
(Redirected from Publication:972655)
Recommendations
- Variable neighbourhood search for redundancy allocation problems
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems
- Multicriteria redundancy optimization using an efficient search procedure
- Solving the redundancy allocation problem using a combined neural network/genetic algorithm approach
- An efficient simulation optimization method for the generalized redundancy allocation problem
- A robust loss function approach for a multi-objective redundancy allocation problem
- An adaptive variable neighborhood search for solving the multi-objective node placement problem
- A differential evolution algorithm to solve redundancy allocation problems
- Optimization for the redundancy allocation problem of reliability using an improved particle swarm optimization algorithm
Cites work
- A variable neighborhood search for graph coloring.
- An efficient algorithm to solve integer-programming problems arising in system-reliability design
- An efficient heuristic for series-parallel redundant reliability problems
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- Determining Component Reliability and Redundancy for Optimum System Reliability
- MOAQ and ant-Q algorithm for multiple objective optimization problems
- OPTIMIZATION OF COMPLEX SYSTEM RELIABILITY BY A MODIFIED GREAT DELUGE ALGORITHM
- On the computational complexity of reliability redundancy allocation in a series system
- Optimal Allocation of Redundant Components for Large Systems
- Pruned Pareto-optimal sets for the system redundancy allocation problem based on multiple prioritized objectives
- Solving the redundancy allocation problem using a combined neural network/genetic algorithm approach
- Surrogate Constraints Algorithm for Reliability Optimization Problems with Two Constraints
- Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems
- Variable Neighborhood Search
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
- Variable neighborhood search for the p-median
- Variable neighbourhood search for redundancy allocation problems
Cited in
(13)- Multi-objective variable neighborhood search: an application to combinatorial optimization problems
- Bi-objective sequence optimization in reliability problems with a matrix-analytic approach
- Evolutionary algorithms for multi-objective dual-resource constrained flexible job-shop scheduling problem
- Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems
- An adaptive variable neighborhood search for solving the multi-objective node placement problem
- scientific article; zbMATH DE number 5578202 (Why is no real title available?)
- Multi-objective home health care routing: a variable neighborhood search method
- A multiobjective hub-airport location problem for an airline network design
- An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem
- Design of a heuristic algorithm for the generalized multi-objective set covering problem
- Variable neighbourhood search for redundancy allocation problems
- An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems
- Two tuned multi-objective meta-heuristic algorithms for solving a fuzzy multi-state redundancy allocation problem under discount strategies
This page was built for publication: Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972655)
