A branch-and-bound algorithm for the cell formation problem
| Autor: | Mikhail Batsyn, Ekaterina Batsyna, Irina Utkina |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Mathematical optimization
021103 operations research Optimization problem Computational complexity theory Branch and bound Computer science Strategy and Management 0211 other engineering and technologies 02 engineering and technology Management Science and Operations Research Upper and lower bounds Industrial and Manufacturing Engineering Biclustering 0202 electrical engineering electronic engineering information engineering Benchmark (computing) Combinatorial optimization 020201 artificial intelligence & image processing Heuristics |
| Zdroj: | International Journal of Production Research. 56:3262-3273 |
| ISSN: | 1366-588X 0020-7543 |
| Popis: | The cell formation problem (CFP) is an NP-hard optimization problem considered for cell manufacturing systems. Because of its high computational complexity several heuristics have been developed for solving this problem. In this paper we present a branch and bound algorithm which provides exact solutions of the CFP. This algorithm finds optimal solutions for 13 problems of the 35 popular benchmark instances from the literature. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
| Nepřihlášeným uživatelům se plný text nezobrazuje | K zobrazení výsledku je třeba se přihlásit. |