Algorithm for Solving Optimal Arrangement Problem in Connected-$(r, s)$-out-of-$(m, n)$: F Lattice System.
Taishin NakamuraHisashi YamamotoPublished in: IEEE Trans. Reliab. (2020)
Keyphrases
- optimal solution
- dynamic programming
- preprocessing
- detection algorithm
- learning algorithm
- experimental evaluation
- computational complexity
- particle swarm optimization
- globally optimal
- recognition algorithm
- times faster
- matching algorithm
- simulated annealing
- computational cost
- cost function
- significant improvement
- search space
- neural network
- worst case
- np hard
- implicit enumeration
- optimization algorithm
- lattice structure
- objective function
- combinatorial optimization
- convergence rate
- space complexity
- locally optimal
- gradient projection
- convex hull
- closed form
- linear programming
- clustering algorithm