VGU RESEARCH REPOSITORY
Please use this identifier to cite or link to this item:
https://epub.vgu.edu.vn/handle/dlibvgu/1274
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bui Xuan Phuoc | en_US |
dc.date.accessioned | 2022-01-18T04:22:51Z | - |
dc.date.available | 2022-01-18T04:22:51Z | - |
dc.date.issued | 2021 | - |
dc.identifier.uri | http://epub.vgu.edu.vn/handle/dlibvgu/1274 | - |
dc.description.abstract | In this paper, a heuristic algorithm for the optimal trajectories and the scheduling of air quality measuring sensors is proposed. In order to be able to monitor the air quality of large urban areas, an adequate system of sensors must first be deployed. The objective is to be able to monitor as many important areas as possible with the sensors network with limitations to the number of sensors and their capabilities. To achieve this goal, we proposed an effective genetic algorithm and multiple strategies to generate initial populations for the process. Together, the genetic algorithm with different initial populations is tested using real-world bus routes of Hanoi and Ho Chi Minh City which resulted in statistically significant better results when compared to previous approaches to the problem. | en_US |
dc.language.iso | en | en_US |
dc.subject | Sensor on bus problem | en_US |
dc.subject | Genetic algorithm | en_US |
dc.subject | Two-layers encoding | en_US |
dc.subject | Target coverage problem | en_US |
dc.title | Heuristic methods for target coverage problem in mobile air quality monitoring systems | en_US |
dc.type | Thesis | en_US |
item.grantfulltext | restricted | - |
item.fulltext | With Fulltext | - |
item.languageiso639-1 | other | - |
Appears in Collections: | Computer Science (CS) |
Files in This Item:
File | Description | Size | Format | Existing users please Login |
---|---|---|---|---|
Heuristic methods for target coverage problem in mobile air quality monitoring systems.pdf | 1.31 MB | Adobe PDF |
Items are protected by © Copyright of Vietnamese - German University Library