dc.contributor.author | Li, Zixiang | |
dc.contributor.author | Küçükkoç, İbrahim | |
dc.contributor.author | Tang, Qiuhua | |
dc.date.accessioned | 2022-03-23T08:27:11Z | |
dc.date.available | 2022-03-23T08:27:11Z | |
dc.date.issued | 2021 | en_US |
dc.identifier.issn | 0305-0548 - 1873-765X | |
dc.identifier.uri | https://doi.org/10.1016/j.cor.2021.105235 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12462/12131 | |
dc.description | Küçükkoç, İbrahim (Balikesir Author) | en_US |
dc.description.abstract | This study presents an enhanced iterative branch, bound and remember (IBBRe) algorithm as an exact
method and an enhanced iterative beam search (IBSe) approach as a heuristic method to tackle the type
II assembly line balancing problem. The proposed IBBRe is enhanced by utilizing additional lower bounds,
a new search strategy and a new sequence of applying the lower bounds and dominance rules. The pro-
posed IBSe is also enhanced by utilizing additional lower bounds, more dominance rules and a new sta-
tion load selection criterion. The computational study demonstrates that both the proposed methods,
namely IBBRe and IBSe, outperform the current state-of-the-art method (iterative beam search), and they
update the upper bounds for seven cases which have been open for over two decades. Furthermore, IBBRe
outperforms IBSe by achieving the best-known solutions in 301 out of the 302 test cases and might be
regarded as the new state-of-the-art methodology. | en_US |
dc.description.sponsorship | National Natural Science Foundation of China (NSFC) 61803287
51875421 | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Pergamon-Elsevier Science Ltd | en_US |
dc.relation.isversionof | 10.1016/j.cor.2021.105235 | en_US |
dc.rights | info:eu-repo/semantics/embargoedAccess | en_US |
dc.subject | Assembly Line Balancing Type II | en_US |
dc.subject | Combinatorial Optimization | en_US |
dc.subject | Heuristics | en_US |
dc.subject | Branch and Bound | en_US |
dc.subject | Beam Search | en_US |
dc.title | Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem | en_US |
dc.type | article | en_US |
dc.relation.journal | Computers and Operations Research | en_US |
dc.contributor.department | Mühendislik Fakültesi | en_US |
dc.contributor.authorID | 0000-0001-6042-6896 | en_US |
dc.identifier.volume | 131 | en_US |
dc.identifier.startpage | 1 | en_US |
dc.identifier.endpage | 9 | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |