Please use this identifier to cite or link to this item:
http://dspace.unimap.edu.my:80/xmlui/handle/123456789/33928
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jeevan, Kanesan | - |
dc.contributor.author | Parthiban, A. | - |
dc.contributor.author | Seetharamu, Kankanhally N. | - |
dc.contributor.author | Ishak, Abdul Azid, Dr. | - |
dc.contributor.author | Ghulam, Abdul Quadir, Prof. Dr. | - |
dc.date.accessioned | 2014-04-23T01:54:51Z | - |
dc.date.available | 2014-04-23T01:54:51Z | - |
dc.date.issued | 2002 | - |
dc.identifier.citation | Journal of Electronics Manufacturing, vol. 11(1), 2002, pages 69-79 | en_US |
dc.identifier.issn | 0960-3131 | - |
dc.identifier.uri | http://dspace.unimap.edu.my:80/dspace/handle/123456789/33928 | - |
dc.description | Link to publisher's homepage at http://www.worldscientific.com/ | en_US |
dc.description.abstract | This paper focuses on optimization problems faced in automated assembly of Printed Circuit Board (PCB). In order to optimize the throughput rate of these automated machines, the time taken for the pick and place operation for each board has to be minimized. In this paper, the component placement sequence problem is modeled as a Traveling Salesman Problem (TSP) and is optimized by Genetic Algorithms (GAs). In this study, components are placed on PCB where the process of pick-up and placement occurs starting from an empty multi-headed placement machine moving to pick up the components from the feeder magazine. The number of components to be picked and placed can range from a minimum of one to a maximum of four, depending on its contribution to minimize tour distance. The difference in size of components is handled by the tool change process, which brings the optimization problem closer to real machine situation. The paper suggests GA as a better alternative to other heuristic solution approaches such as Variable Neighborhood Search (VNS) and local optimum search. GAs are more promising as a global and robust method of solution and it permits a simpler mathematical model to solve a component assembly problem. The tool change factor, which was not incorporated in previous studies have been included in the present paper for the first time. | en_US |
dc.language.iso | en | en_US |
dc.publisher | World Scientific Publishing | en_US |
dc.subject | Component placement | en_US |
dc.subject | Genetic algorithms | en_US |
dc.title | Optimization of PCB component placement using genetic algorithm | en_US |
dc.type | Article | en_US |
dc.identifier.url | 10.1142/S0960313102000230 | - |
dc.identifier.url | http://www.worldscientific.com/doi/abs/10.1142/S0960313102000230 | - |
dc.contributor.url | knseetharamu@hotmail.com | en_US |
dc.contributor.url | ishak@eng.usm.my | en_US |
dc.contributor.url | gaquadir@unimap.edu.my | en_US |
Appears in Collections: | Ghulam Abdul Quadir, Prof. Dr. |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Optimization of PCB component placement using genetic algorithm.pdf | 59.27 kB | Adobe PDF | View/Open |
Items in UniMAP Library Digital Repository are protected by copyright, with all rights reserved, unless otherwise indicated.