Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Multi-disciplinary Studies | en_US |
| dc.contributor | Department of Management | en_US |
| dc.creator | Wong, Tak-ming | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/3991 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | A study of genetic algorithms and its application to travelling salesman problem | en_US |
| dcterms.abstract | For the last three decades, there has been a tremendous growing interests in the Genetic Algorithms (GAs), which mimicking the natural reproduction process. With the advance in electronic computation technology, the use of GAs to solve NP-hard problems by finding near-optimal solution becomes very popular. Being a postgraduate management degree student, I have very strong interest in these algorithms. In this dissertation, I would like to study the GAs, thus I can apply it to solve a real life business issue in my job (Manager, Asia IT, Nike Int. Ltd.). More important is to try to stress test my implementation, in an attempt to find out the effects of the system/algorithm parameters on the solution set. It is also interesting to see that the characteristics (quality and efficiency) of the solution is highly depended on the supplied parameters. This dissertation report can be divided into four main sessions. The first one describes the objectives of this dissertation, summarizes some background information, regarding the history of GA and its comparison with other traditional algorithms. The second session mainly focuses on what GA is all about. The third session presents a literature survey for the recent works in GA and the Travelling Salesman Problem (TSP). Finally, my implementation of the GA in a TSP is presented, which is a reflection of a real life business management problem that I need to tackle in my company. As Phil. Knights, the Chief Executive Officer of Nike Int., said "there is no finish line", I have provided some of my personal thinking of what the future works should be focusing on if someone would like to further research on this topic. | en_US |
| dcterms.extent | iii, 82 leaves : ill. ; 30 cm | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 1999 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Sc. | en_US |
| dcterms.LCSH | Genetic algorithms | en_US |
| dcterms.LCSH | Traveling-salesman problem | en_US |
| dcterms.LCSH | Management -- Mathematical models | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | restricted access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b1457133x.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 2.96 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/3991