Please use this identifier to cite or link to this item:
https://ptsldigital.ukm.my/jspui/handle/123456789/476340Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Salwani Abdullah, Prof. Dr. | |
| dc.contributor.author | Mohanad Muayad John Jurjee (P72206) | |
| dc.date.accessioned | 2023-10-06T09:16:42Z | - |
| dc.date.available | 2023-10-06T09:16:42Z | - |
| dc.date.issued | 2016-02-03 | |
| dc.identifier.other | ukmvital:82203 | |
| dc.identifier.uri | https://ptsldigital.ukm.my/jspui/handle/123456789/476340 | - |
| dc.description | Recently, there has been a growing attention to employ evolutionary algorithms (EAs) in addressing dynamic optimisation problems (DOPs) due to its significance in real world applications. The most notable challenge when solving DOPs is that the objective should not only attempt to seek the global optimum by an efficient way, but be able to keep track the optimal solution during the environmental changes. Thus, several mechanisms have been developed for EAs in order to improve the search performance of the algorithm in accommodating the dynamic changes such as by increasing the diversity of the population. Among these strategies, the multi-population mechanism has been found beneficial for EAs for DOPs. Dynamic travelling salesman problems (DTSPs) are categorised under DOPs. In the Travelling Salesman Problem (TSP), a salesman wants to distribute items sold in different cities starting from his home city and returning after he visited all the cities to his starting city again by optimising his time and tour efficiently. However, in the DTSPs, it is more challenging to consider the traffic delays that may affect the route of the salesman and change the time planned beforehand. Therefore, the salesman will optimise his time again and find a new alternative route to avoid long traffic delays. In this thesis, the presented research work aims to build upon the state of the art research methodologies for the DTSPs with traffic factors, where in order to cope with the dynamic behaviour, a multi-population approach is applied to harmony search (HS) algorithm that mimics the musical process of trying to find a state of harmony. Moreover, a multiple pitch adjustment rate (PAR) strategy is proposed since PAR assumed to be the moving rate from one city to the nearest city in the TSP. The performance of the proposed multi-population HS algorithm is verified on two variations of DTSPs with traffic factors, i.e., random and cyclic traffic delays. Based on different DTSP test cases, the experimental results show that the proposed approach is able to obtain competitive results when compared to the best-known results in the scientific literatures.,Certification of Master's/Doctoral Thesis" is not available | |
| 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 | Dynamic travelling salesman | |
| dc.subject | Traffic factors | |
| dc.subject | Environmental changes | |
| dc.subject | Dissertations, Academic -- Malaysia | |
| dc.title | A multi-population harmony search algorithm for the dynamic travelling salesman problem with traffic factors | |
| dc.type | theses | |
| dc.format.pages | 121 | |
| dc.identifier.barcode | 002316(2016) | |
| Appears in Collections: | Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| ukmvital_82203+SOURCE1+SOURCE1.0.PDF Restricted Access | 940.84 kB | Adobe PDF |  View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.