Please use this identifier to cite or link to this item:
https://ptsldigital.ukm.my/jspui/handle/123456789/395101
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | C.P. Chen | - |
dc.contributor.author | S.P. Koh | - |
dc.contributor.author | I. B. Aris | - |
dc.contributor.author | F. Y C. Albert | - |
dc.contributor.author | S.K. Tiong | - |
dc.date.accessioned | 2023-06-15T07:55:09Z | - |
dc.date.available | 2023-06-15T07:55:09Z | - |
dc.identifier.other | ukmvital:122962 | - |
dc.identifier.uri | https://ptsldigital.ukm.my/jspui/handle/123456789/395101 | - |
dc.description.abstract | Laser marking is superior in quality and flexibility to conventional marking techniques such as ink stamping marking. The beam deflected scanning has been commonly applied in the industries. In this paper, the genetic algorithm (GA) has been proposed to optimize the scanning sequence, thus shortening the required laser scanning path. The GA would base on the real-number representation, namely Real-Coded Genetic Algorithm (RCGA). It employs the Dynamic Variable Length Two Point Crossover (DVL-2PC). The simulation results indicating that the proposed algorithm has good convergent speed and manage to solve the sequencing problem of efficiently. | - |
dc.language.iso | eng | - |
dc.publisher | Institute of Electrical and Electronics Engineers (IEEE),Piscataway, US | - |
dc.subject | Genetic algorithm | - |
dc.subject | Laser scanning system | - |
dc.title | Path optimization using genetic algorithm in laser scanning system | - |
dc.type | Seminar Papers | - |
dc.format.pages | 5 | - |
dc.identifier.callno | T58.5.C634 2008 kat sem j.3 | - |
dc.contributor.conferencename | International Symposium on Information Technology | - |
dc.coverage.conferencelocation | Kuala Lumpur Convention Centre | - |
dc.date.conferencedate | 26/08/2008 | - |
Appears in Collections: | Seminar Papers/ Proceedings / Kertas Kerja Seminar/ Prosiding |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.