A tabu search algorithm for the cost-oriented multi-manned assembly line balancing problem
Multi-manned assembly line balancing problems (MALBPs) can be usually found in plants producing large-sized high-volume products such as automobiles and trucks. In this paper, a cost-oriented version of MALBPs, namely, CMALBP, is addressed. This class of problems may arise in final assembly lines of...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Iran University of Science & Technology
2020-06-01
|
| Series: | International Journal of Industrial Engineering and Production Research |
| Subjects: | |
| Online Access: | http://ijiepr.iust.ac.ir/article-1-1052-en.html |
| _version_ | 1828147001943916544 |
|---|---|
| author | Abdolreza Roshani Davide Giglio |
| author_facet | Abdolreza Roshani Davide Giglio |
| author_sort | Abdolreza Roshani |
| collection | DOAJ |
| description | Multi-manned assembly line balancing problems (MALBPs) can be usually found in plants producing large-sized high-volume products such as automobiles and trucks. In this paper, a cost-oriented version of MALBPs, namely, CMALBP, is addressed. This class of problems may arise in final assembly lines of products in which the manufacturing process is very labor-intensive. Since CMALBP is NP-Hard, a heuristic approach based on a tabu search algorithm is developed to solve the problem. The proposed algorithm uses two neighborhood generation mechanisms, namely swap and mutation, that effectively collaborate with each other to build new feasible solutions; moreover, two separate tabu lists (associated with the two generation mechanisms) are used to check if moving to a new generated neighbor solution is forbidden or allowed. To examine the efficiency of the proposed algorithm, some experimental instances are collected from the literature and solved. The obtained results show the effectiveness of the proposed tabu search approach. |
| first_indexed | 2024-04-11T20:55:04Z |
| format | Article |
| id | doaj.art-de412b947cce4da3af4c0fbff7a9db89 |
| institution | Directory Open Access Journal |
| issn | 2008-4889 2345-363X |
| language | English |
| last_indexed | 2024-04-11T20:55:04Z |
| publishDate | 2020-06-01 |
| publisher | Iran University of Science & Technology |
| record_format | Article |
| series | International Journal of Industrial Engineering and Production Research |
| spelling | doaj.art-de412b947cce4da3af4c0fbff7a9db892022-12-22T04:03:44ZengIran University of Science & TechnologyInternational Journal of Industrial Engineering and Production Research2008-48892345-363X2020-06-01312189202A tabu search algorithm for the cost-oriented multi-manned assembly line balancing problemAbdolreza Roshani0Davide Giglio1 Department of Industrial Engineering, Faculty of Engineering Management, Kermanshah University of Technology, Kermanshah, Iran Department of Mechanical, Energy, Management, and Transportation Engineering (DIME), University of Genova, Genova, Italy. Multi-manned assembly line balancing problems (MALBPs) can be usually found in plants producing large-sized high-volume products such as automobiles and trucks. In this paper, a cost-oriented version of MALBPs, namely, CMALBP, is addressed. This class of problems may arise in final assembly lines of products in which the manufacturing process is very labor-intensive. Since CMALBP is NP-Hard, a heuristic approach based on a tabu search algorithm is developed to solve the problem. The proposed algorithm uses two neighborhood generation mechanisms, namely swap and mutation, that effectively collaborate with each other to build new feasible solutions; moreover, two separate tabu lists (associated with the two generation mechanisms) are used to check if moving to a new generated neighbor solution is forbidden or allowed. To examine the efficiency of the proposed algorithm, some experimental instances are collected from the literature and solved. The obtained results show the effectiveness of the proposed tabu search approach.http://ijiepr.iust.ac.ir/article-1-1052-en.htmlassembly line balancingmulti-manned workstationstabu searchcost-oriented optimization. |
| spellingShingle | Abdolreza Roshani Davide Giglio A tabu search algorithm for the cost-oriented multi-manned assembly line balancing problem International Journal of Industrial Engineering and Production Research assembly line balancing multi-manned workstations tabu search cost-oriented optimization. |
| title | A tabu search algorithm for the cost-oriented multi-manned assembly line balancing problem |
| title_full | A tabu search algorithm for the cost-oriented multi-manned assembly line balancing problem |
| title_fullStr | A tabu search algorithm for the cost-oriented multi-manned assembly line balancing problem |
| title_full_unstemmed | A tabu search algorithm for the cost-oriented multi-manned assembly line balancing problem |
| title_short | A tabu search algorithm for the cost-oriented multi-manned assembly line balancing problem |
| title_sort | tabu search algorithm for the cost oriented multi manned assembly line balancing problem |
| topic | assembly line balancing multi-manned workstations tabu search cost-oriented optimization. |
| url | http://ijiepr.iust.ac.ir/article-1-1052-en.html |
| work_keys_str_mv | AT abdolrezaroshani atabusearchalgorithmforthecostorientedmultimannedassemblylinebalancingproblem AT davidegiglio atabusearchalgorithmforthecostorientedmultimannedassemblylinebalancingproblem AT abdolrezaroshani tabusearchalgorithmforthecostorientedmultimannedassemblylinebalancingproblem AT davidegiglio tabusearchalgorithmforthecostorientedmultimannedassemblylinebalancingproblem |