Efficient tool loading heuristic for machines with modular feeders
| Autor: | Juha Mäkilä, Csaba Raduly-Baka, Olli S. Nevalainen, Mika Johnsson |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: |
ta113
0209 industrial biotechnology Sequence Mathematical optimization 021103 operations research Computer science business.industry Heuristic Group (mathematics) 0211 other engineering and technologies Value (computer science) 02 engineering and technology Modular design Upper and lower bounds Industrial and Manufacturing Engineering 020901 industrial engineering & automation Artificial Intelligence Component (UML) business Heuristics |
| Zdroj: | 28th International Conference on Flexible Automation and Intelligent Manufacturing (FAIM2018), June 11-14, 2018, Columbus, OH, USAGlobal Integration of Intelligent Manufacturing and Smart Industry for Good of Humanity. 17:968-975 |
| ISSN: | 2351-9789 |
| Popis: | Numerically controlled placement machines are often equipped with modular feeder units. These allow the group loading of a large number of component reels in one step. While the loading of individual component reels has been extensively studied in the past, there has not been any algorithmic solutions published for modular feeder loading. The problem in known to be NP-hard even for a fixed job sequence. A mathematical 0-1 formulation, a lower bound on the optimal result, and an efficient heuristics will be given in the present study. The heuristic is evaluated against the lower bound, and the ratio of the heuristic result and lower bound value is reported. We found that for randomly generated problems, this ratio is between 2 and 4, while for some of the large industrial problems we obtain a ratio between 6 and 12. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|