A Birnbaum-importance based genetic local search algorithm for component assignment problems

DOI10.1007/s10479-012-1223-1zbMath1286.90087OpenAlexW2000530291MaRDI QIDQ2449396

Xiaoyan Zhu, Way Kuo, Qingzhu Yao

Publication date: 8 May 2014

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-012-1223-1

zbMATH Keywords

reliabilitylocal searchgenetic algorithmBirnbaum importancecomponent assignment problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (3)

Ant Colony Optimization Algorithm with Three Types of Pheromones for the Component Assignment Problem in Linear Consecutive-k-out-of-n:F Systems ⋮ An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot ⋮ Reliability optimization and importance analysis of circular-consecutive \(k\)-out-of-\(n\) system

Cites Work

• Unnamed Item
• Assignment problems: a golden anniversary survey
• A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
• Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem
• Reliability importance and invariant optimal allocation
• Genetic and hybrid algorithms for graph coloring
• Importance measures in reliability and mathematical programming
• A genetic algorithm for robotic assembly line balancing
• Design and performance analysis of consecutive-K-out-of-n structure
• Optimal Consecutive-2-out-of-n:F Component Sequencing
• Optimum Link Allocation of Fixed Topology Networks
• Project scheduling with multiple modes: A genetic algorithm
• Simulated annealing for multi-mode resource-constrained project scheduling

This page was built for publication: A Birnbaum-importance based genetic local search algorithm for component assignment problems