Please use this identifier to cite or link to this item:
https://ptsldigital.ukm.my/jspui/handle/123456789/513527Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Masri Ayob, Prof. Dr. | - |
| dc.contributor.author | Esam Taha Yassen (P63032) | - |
| dc.date.accessioned | 2023-10-16T04:37:39Z | - |
| dc.date.available | 2023-10-16T04:37:39Z | - |
| dc.date.issued | 2015-09-03 | - |
| dc.identifier.other | ukmvital:80437 | - |
| dc.identifier.uri | https://ptsldigital.ukm.my/jspui/handle/123456789/513527 | - |
| dc.description | Vehicle routing problem with time windows (VRPTW) is a combinatorial optimization problem that is a non-deterministic polynomial-time hard problem (NP-hard). Many algorithms have been proposed to address this problem, yet none of these succeeded to achieve good results across all instances. Most of these algorithms struggled of escaping from local optima. Moreover, the complex structure of these algorithms complicates the task of enhancing their performance. Consequently, the need to either improve the existing algorithms or utilize a new algorithm is still necessary. One of the recent algorithms is harmony search algorithm (HSA), which managed to solve many combinatorial optimization problems. However, as far as we are concerned, it has not been applied to solve VRPTW. HSA is characterized as being simple and flexible, so it motivates scholars to conduct several modifications to improve its performance. More importantly, HSA provides a possibility to attain balance between exploitation and exploration via tuning the HSA improvisation operators (memory consideration, pitch adjustment and random selection). Therefore, this thesis aims to answer the question on "how to design an effective heuristic that can tune the HSA improvisation operators in order to enhance the performance of HSA?. Thus | - |
| dc.language.iso | eng | - |
| dc.publisher | UKM, Bangi | - |
| dc.relation | Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat | - |
| dc.rights | UKM | - |
| dc.subject | System analysis | - |
| dc.subject | Vehicle routing problem | - |
| dc.subject | Transportation problems (Programming) | - |
| dc.subject | Universiti Kebangsaan Malaysia -- Dissertations | - |
| dc.subject | Dissertations, Academic -- Malaysia | - |
| dc.title | Harmony search algorithms for vehicle routing problem with time windows | - |
| dc.type | Theses | - |
| dc.format.pages | 215 | - |
| dc.identifier.callno | QA403.Y348 2015 3 tesis | - |
| dc.identifier.barcode | 002054 (2016) | - |
| Appears in Collections: | Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| ukmvital_80437+SOURCE1+SOURCE1.0.PDF Restricted Access | 578.9 kB | Adobe PDF |  View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.