Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/18800
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Qiu, Bu Gui. | - |
dc.date.accessioned | 2009-07-20T02:11:50Z | - |
dc.date.available | 2009-07-20T02:11:50Z | - |
dc.date.copyright | 2008 | en_US |
dc.date.issued | 2008 | - |
dc.identifier.uri | http://hdl.handle.net/10356/18800 | - |
dc.description.abstract | The traffic condition keeps changing for vehicles traveling along the track in automated material handling system in semiconductor industry. The handling of this dynamism is important to optimize the delivery of materials by vehicles. This dissertation discusses the modeling of the system for finding out the least cost routes for vehicles to carry out tasks in a dynamic environment. Ant colony system algorithm developed by Dr, Dorigo in 1992 was used in the modeling and analysis. Dijkstra algorithm was used to test its dynamical aspect. It is proved that the new model put forward in this dissertation is more accurate and thus more useful to solve physical problems, although more computing power is required. | en_US |
dc.format.extent | 63 p. | en_US |
dc.language.iso | en | en_US |
dc.subject | DRNTU::Engineering::Manufacturing::Production management | en_US |
dc.title | Dynamic least cost route in automated material handling system in semiconductor industry | en_US |
dc.type | Thesis | - |
dc.contributor.supervisor | Zhong Zhaowei | en_US |
dc.contributor.school | School of Mechanical and Aerospace Engineering | en_US |
dc.description.degree | Master of Science (Computer Integrated Manufacturing) | en_US |
item.fulltext | With Fulltext | - |
item.grantfulltext | restricted | - |
Appears in Collections: | MAE Theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
QiuBuGui08.pdf Restricted Access | 2.98 MB | Adobe PDF | View/Open |
Page view(s) 50
443
Updated on Mar 28, 2024
Download(s)
6
Updated on Mar 28, 2024
Google ScholarTM
Check
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.