Please use this identifier to cite or link to this item:
https://ptsldigital.ukm.my/jspui/handle/123456789/578183| Title: | A constructive heuristic for police patrol routing problems |
| Authors: | Esam Taha Yassen (UKM) Anas Arram (UKM) Masri Ayob (UKM) Mohd Zakree Ahmad Nazri (UKM) |
| Keywords: | Greedy heuristic Police patrol routing problem Vehicle routing |
| Issue Date: | Jun-2017 |
| Description: | Police patrol routing problem (PPRP) attracts researchers’ attention especially on artifitial inteligence. The challenge here is that a limited number of patrols cover a wide range of area that includes several hotspots. In this study, a new model for PPRP is proposed simulating the Solomon’s benchmark for vehicle routing problem with time windows. This model can solve this problem by maximising the coverage of hotspots with frequencies of high priority locations while ensuring the feasibility of routes. Two constructive greedy heuristics are developed to generate the initial solution of the PPRP: highest priority greedy heuristic (HPGH) and nearest neighbour greedy heuristic (NNGH). Experimental results show that the simulated Solomon’s benchmark is suitable to represent PPRP. In addition, results illustrate that NNGH is more efficient to construct feasible solution than HPGH. |
| News Source: | Pertanika Journals |
| ISSN: | 0128-7680 |
| Volume: | 25 |
| Pages: | 87-96 |
| Publisher: | Universiti Putra Malaysia Press |
| Appears in Collections: | Journal Content Pages/ Kandungan Halaman Jurnal |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| ukmvital_113367+Source01+Source010.PDF | 579.47 kB | Adobe PDF |  View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.