VGU RESEARCH REPOSITORY
Please use this identifier to cite or link to this item:
https://epub.vgu.edu.vn/handle/dlibvgu/741
Title: | Comparison of DABC and dream algorithm for optimal sensor placement | Authors: | Huynh Hong Tram | Keywords: | Sensor placement;Discrete artificial bee colony | Issue Date: | 2017 | Publisher: | Vietnamese - German University | Abstract: | There are many methods and algorithms proposed today to solve the optimal sensor placement problem which is defined as finding a sensor configuration that gives as much information as possible of the system structure. In the area of this report, the optimal sensor placement problem is formulated as an optimization problem. There are two methods are introduced here to solve the discrete optimal sensor placement, which is “Discrete Artificial Bee Colony” (DABC) and “Discrete differential evolution Markov chain” (discrete DREAM). Discrete DREAM is the proposed method of DREAM, which is based on the rounding method introduced in DABC. After that, both methods are applied to solve the travel sale man problem and the optimal sensor placement problem to compare the performance and the calculating time |
URI(1): | http://epub.vgu.edu.vn/handle/dlibvgu/741 |
Appears in Collections: | Computational Engineering (CompEng) |
Files in This Item:
File | Description | Size | Format | Existing users please Login |
---|---|---|---|---|
Comparison of DABC and dream algorithm for optimal sensor placement.pdf | 1.43 MB | Adobe PDF |
Page view(s)
37
checked on Mar 29, 2024
Download(s)
8
checked on Mar 29, 2024
Google ScholarTM
Check
Items are protected by © Copyright of Vietnamese - German University Library