A Hybrid Tabu Search Method for Assembly Line Balancing

نویسندگان

  • SUPAPORN SUWANNARONGSRI
  • SUNPASIT LIMNARARAT
  • DEACHA PUANGDOWNREONG
چکیده

A new hybrid tabu search (HTS) method for solving assembly line balancing problems is proposed in this paper. The tabu search (TS) method is combined with the genetic algorithm (GA) to identify and provide solutions for assembly line balancing problems. With the proposed HTS method, the TS method can well address the number of tasks assigned for each workstation, while the GA can also assign the sequence of tasks for each workstation according to precedence constraints. In this paper, four single-model assembly line balancing problems from literature are tested against the proposed method. From the simulation results compared with the conventional method, it was found that the proposed HTS method is capable of producing solutions superior to the conventional method. It can be concluded that the HTS method is an alternative potential algorithm to solve assembly line balancing problems. Key-Words: assembly line balancing, tabu search, genetic algorithm, hybrid tabu search

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Unconscious Search Algorithm for Mixed-model Assembly Line Balancing Problem with SDST, Parallel Workstation and Learning Effect

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 met...

متن کامل

Online Distribution and Load Balancing Optimization Using the Robin Hood and Johnson Hybrid Algorithm

Proper planning of assembly lines is one of the production managers’ concerns at the tactical level so that it would be possible to use the machine capacity, reduce operating costs and deliver customer orders on time. The lack of an efficient method in balancing assembly line can create threatening problems for manufacturing organizations. The use of assembly line balancing methods cannot balan...

متن کامل

Metaheuristic Approach to Assembly Line Balancing

In this paper, the metaheuristic method consisting of the adaptive tabu search (ATS) and the practicing heuristic (PH) technique is proposed to provide optimal solutions of the assembly line balancing (ALB) problems. With the multi-objective approach, the ATS is used to address the number of tasks assigned for each workstation, while the PH is conducted to assign the sequence of tasks for each ...

متن کامل

Tabu Search With Target Analysis To The Assembly Line Balancing Problems -- An Artificial Intelligence Approach

This paper describes the application of tabu search, a recent heuristic technique for combinatorial optimization problems, to the assembly line balancing problems. Computational experiments with different search strategies have been performed for some assembly ine problems from literature. Computational results show that except for few cases tabu search always finds optimal solutions.

متن کامل

Assembly line balancing to minimize balancing loss and system loss

Assembly Line production is one of the widely used basic principles in production system. The problem of Assembly Line Balancing deals with the distribution of activities among the workstations so that there will be maximum utilization of human resources and facilities without disturbing the work sequence. Research works reported in the literature mainly deals with minimization of idle time i.e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001