A genetic algorithm for the set covering problem

1996 ◽  
Vol 94 (2) ◽  
pp. 392-404 ◽  
Author(s):  
J.E Beasley ◽  
P.C Chu
2017 ◽  
Vol 5 (3) ◽  
pp. 337-347 ◽  
Author(s):  
Wei Jing ◽  
Kenji Shimada

Abstract Model-based view planning is to find a near-optimal set of viewpoints that cover the surface of a target geometric model. It has been applied to many building inspection and surveillance applications with Unmanned Aerial Vehicle (UAV). Previous approaches proposed in the past few decades suffer from several limitations: many of them work exclusively for 2D problems, generate only a sub-optimal set of views for target surfaces in 3D environment, and/or generate a set of views that cover only part of the target surfaces in 3D environment. This paper presents a novel two-step computational method for finding near-optimal views to cover the surface of a target set of buildings using voxel dilation, Medial Objects (MO), and Random-Key Genetic Algorithm (RKGA). In the first step, the proposed method inflates the building surfaces by voxel dilation to define a sub-volume around the buildings. The MO of this sub-volume is then calculated, and candidate viewpoints are sampled using Gaussian sampling around the MO surface. In the second step, an optimization problem is formulated as (partial) Set Covering Problem and solved by searching through the candidate viewpoints using RKGA and greedy search. The performance of the proposed two-step computational method was measured with several computational cases, and the performance was compared with two previously proposed methods: the optimal-scan-zone method and the randomized sampling-based method. The results demonstrate that the proposed method outperforms the previous methods by finding a better solution with fewer viewpoints and higher coverage ratio compared to the previous methods. Highlights A two-step “generate-test” view planning method is proposed. Voxel dilation, Medial Objects and Gaussian sampling are used to generate viewpoints. Random-Key GA and Greedy search are combined to solve the Set Covering Problem. The proposed method is benchmarked and outperforms two existing methods.


1996 ◽  
Vol 47 (5) ◽  
pp. 702 ◽  
Author(s):  
K. S. Al-Sultan ◽  
M. F. Hussain ◽  
J. S. Nizami

2002 ◽  
Vol 29 (9) ◽  
pp. 1221-1235 ◽  
Author(s):  
Mauricio Solar ◽  
Vı́ctor Parada ◽  
Rodrigo Urrutia

2016 ◽  
Vol 16 (3) ◽  
pp. 125-132
Author(s):  
Valeriy Kobak ◽  
Igor- Konovalov- ◽  
Vladimir- Fathi-

Author(s):  
Phan Thị Hoài Phương ◽  
Nguyễn Minh Hằng ◽  
Lương Chi Mai

Sign in / Sign up

Export Citation Format

Share Document