Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Multi-disciplinary Studies | en_US |
| dc.contributor | Department of Management | en_US |
| dc.creator | Ho, Chi-leung | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/1280 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | A study of simulated annealing technique and its application to traveling salesman problem | en_US |
| dcterms.abstract | Simulated Annealing is a global optimization method that distinguishes between different local optima. Starting from an initial point, the algorithm takes a step and function is evaluated. When minimizing a function, any downhill step is accepted and the process repeats from this new point. An uphill step may be accepted with certain probability. Thus, it can escape from local optima. This uphill decision is made by the Metropolis criteria. As the optimization process proceeds, the length of the steps decline and the algorithm closes in on the global optimum. Since the algorithm makes very few assumptions regarding the function to be optimized, it is quite robust with respect to non-quadratic functions. The degree of robustness can be adjusted by the user. The purpose of this project is to study the Simulated Annealing algorithm and apply it to, particularly, Traveling Salesman Problem. A computer program was written for this purpose. Moreover the effect of different parameters to the cooling schedule was also studied. In order to have the best result, most of the previous researches suggested that the initial temperature should be set high enough, the cooling process should be as slow and as long as possible. However the time required to obtaining the result will be increased substantially. In this project, different parameter sets were tested in order to achieve a near-optimal solution at the shortest time. | en_US |
| dcterms.extent | iv, 68 leaves : ill. ; 30 cm | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 1998 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Sc. | en_US |
| dcterms.LCSH | Simulated annealing (Mathematics) | en_US |
| dcterms.LCSH | Traveling-salesman problem -- Data processing | en_US |
| dcterms.LCSH | Combinatorial optimization | en_US |
| dcterms.LCSH | Mathematical optimization | en_US |
| dcterms.LCSH | Algorithms | 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 | |
|---|---|---|---|---|
| b14418617.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 2.29 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/1280