An Efficient Planning Algorithm for Multi-Head Surface Mounting Machines Using a Genetic Algorithm
| dc.creator | Lee,Wonsik | |
| dc.creator | Lee,Sunghan | |
| dc.creator | Lee,Beom | |
| dc.creator | Lee,Young | |
| dc.date | 1999 | |
| dc.date.accessioned | 2024-02-06T12:50:18Z | |
| dc.date.available | 2024-02-06T12:50:18Z | |
| dc.description | In this paper, a genetic algorithm based method is proposed to solve the problem of minimizing the PCB assembly time for multi-head surface mounting machines. By grouping the reels and by clustering the components the multi-head problem is transformed into a single_head one and then the single-head method is simply applied to the multi-head case. To implement the genetic algorithm, a partial link concept is proposed for genetic operations. Computer simulation results show that the proposed algorithm is superior to the heuristic algorithm that is currently used in industry. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-005-12-0833 | |
| dc.identifier | https://lib.jucs.org/article/27621/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/7664 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 5(12): 833-854 | |
| dc.subject | Genetic algorithm | |
| dc.subject | PCB assembly time | |
| dc.subject | multi-head surface mounting machine | |
| dc.title | An Efficient Planning Algorithm for Multi-Head Surface Mounting Machines Using a Genetic Algorithm | |
| dc.type | Research Article |