Abstract
This main focus of this thesis is to solve a combinatorial optimization problem called the Participant Selection Problem (PSP). PSP aims to find an assignment of selected participants assigned to regions that their reports can eliminate blind spots and improve resolution in sensor coverage. We formulated four variants of PSP to take into account of requirements and constraints in the participant selection for some disaster scenarios. This thesis presents the performance evaluation of PSP-Frugal and PSP-Practical because they are practical assignments for real situations. We generated synthetic parameters of PSS and TAS with different probability distributions by MATLAB. PSS includes the number of volunteers, the benefit and cost values of each volunteer, and the total budget. TAS includes the number of regions and the values of the regions. We use the evaluated solvers and the PSP-G heuristic algorithm to solve the PSP, and compared relative performance by figure of merits. We hope to show some insights that which evaluated solvers and the PSP-G algorithm can produce good solutions in available time with different characteristics of problem instances.