Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Multi-disciplinary Studies | en_US |
| dc.contributor | Department of Applied Mathematics | en_US |
| dc.creator | Mok, Man-ho | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/2185 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | Applying simulated annealing for the maximal covering location problem with an enhanced algorithm | en_US |
| dcterms.abstract | Being a major class of Location problems, the Maximal Covering Location (MCL) Problem, first proposed by Church and ReVelle, involves the location of a fixed number of facilities in such a fashion that acceptable coverage within some distance standard is provided to the largest amount of demand possible. The MCL problem has been applied to the location of a wide range of emergency facilities, especially fire stations. Over the past couple of decades many algorithms have been developed for solving the MCL problem, including the Greedy Addition, Greedy Addition with Substitution, Linear Programming methods with Lagrangian Relaxation, Branch-and-Bound, and etc. Until 1996, Murray and Church developed an entirely different type of heuristic employing a stochastic approach to searching, known as Simulated Annealing (SA). In this dissertation, I develop an enhanced SA algorithm for solving the MCL problem. The algorithm is then implemented in C language and implemented on a microcomputer. Afterwards a series of computational experiments has been carried out on two test data with problem size of 55 and 88 respectively. It is found that the algorithm can produce desirable results, with an average solution deviate from the optimal by less than 3.6%. In terms of Hit Ratio and Mean Program Time, the performance of this enhanced algorithm is also proven satisfactory. Through the process of literature review, I have also studied many models for siting fire stations, all based on the MCL problem. For the sake of completeness, all of these Deterministic and Probabilistic models are stated in the concluding chapter for reference purpose. | en_US |
| dcterms.extent | ix, 92, [10] 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 | Land use -- Planning -- Mathematical models | en_US |
| dcterms.LCSH | Simulated annealing (Mathematics) | en_US |
| dcterms.LCSH | Combinatorial optimization | 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 | |
|---|---|---|---|---|
| b14773429.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 3.52 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/2185