Name
Abstract | ||
|---|---|---|
This paper shows the results of our study on the pick-and-place optimization problem. To solve this problem efficiently, an iterated hybrid local search algorithm (IHLS) which combines local search with integer programming is proposed. In the section of local search, the greedy algorithm with distance weight strategy and the convex-hull strategy is developed to determine the pick-and-place sequence; in the section of integer programming, an integer programming model is built to complete the feeder assignment problem. The experimental results show that the IHLS algorithm we proposed has high computational efficiency. Furthermore, compared with the genetic algorithm and the memetic algorithm, the IHLS is less time-consuming and more suitable in solving a large-scale problem. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.3390/sym10110633 | SYMMETRY-BASEL |
Keywords | Field | DocType |
hybrid algorithm,local search,integer programming,pick-and-place sequence | Combinatorics,Algorithm,SMT placement equipment,Local search (optimization),Iterated function,Mathematics | Journal |
Volume | Issue | ISSN |
10 | 11 | 2073-8994 |
Citations | PageRank | References |
0 | 0.34 | 14 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jinsheng Gao | 1 | 0 | 1.35 |
| Xiaomin Zhu | 2 | 28 | 5.47 |
| Anbang Liu | 3 | 0 | 0.34 |
| Qingyang Meng | 4 | 4 | 2.95 |
| Runtong Zhang | 5 | 134 | 30.80 |