The application of a tabu search metaheuristic to the assembly line balancing problem

Wen-Chyuan Chiang

Annals of Operations Research, 1998, vol. 77, issue 0, 209-227

Abstract: This paper describes the application of tabu search, a metaheuristic technique for optimization problems, to assembly line balancing problems. Four different versions of algorithms are developed. They all share the same tabu search strategy except that the first one uses the best improvement with task aggregation, the second one uses best improvement without task aggregation, the third one uses the first improvement with task aggregation, and the last one uses the first improvement without task aggregation. Computational experiments with these different search strategies have been performed for some assembly line problems from the open literature. The results show that tabu search performs extremely well. Except for a few cases, tabu search always finds optimal solutions. Copyright Kluwer Academic Publishers 1998

Keywords: assembly line balancing; tabu search; metaheuristic (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018925411397 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:77:y:1998:i:0:p:209-227:10.1023/a:1018925411397

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018925411397

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().