Due to the variety of products, simultaneous production of different models has an important role in production systems. Moreover, considering the realistic constraints in designing production lines attracted a lot of attentions in recent researches. Since the assembly More
Due to the variety of products, simultaneous production of different models has an important role in production systems. Moreover, considering the realistic constraints in designing production lines attracted a lot of attentions in recent researches. Since the assembly line balancing problem is NP-hard, efficient methods are needed to solve this kind of problems. In this study, a new hybrid method based on unconscious search algorithm (USGA) is proposed to solve mixed-model assembly line balancing problem considering some realistic conditions such as parallel workstation, zoning constraints, sequence dependent setup times and learning effect. This method is a modified version of the unconscious search algorithm which applies the operators of genetic algorithm as the local search step. Performance of the proposed algorithm is tested on a set of test problems and compared with GA and ACOGA. The experimental results indicate that USGA outperforms GA and ACOGA.
Manuscript profile
