Affiliations: [a]
Department of M-Commerce and Multimedia Applications, Asia University, Taichung, Taiwan
| [b]
Department of Information Management, National Formosa University, Yunlin, Taiwan
| [c]
Department of Finance, Asia University, Taichung, Taiwan
Abstract: This study is to investigate the nonlinearly constrained various signal detector location allocation problems in which the types of detectors and the corresponding numbers and locations can be determined at the same time so as to minimize the maximum detecting failure rate in a specified area. In other words, the objective of the detector location allocation problem is to minimize the maximum failure rate by determining the best possible conjunction of three types of decision variables, i.e., the type of detector, the numbers of each detector type and where to build up each of them with a limited resources. So, the quality of reliability of event detecting can be assured and consistent. By the way, the signal intensity usually disintegrates proportionally to some power of the distance from the detector. That makes the longer distance far away the detector, the bigger failure rate in detection of the event. The signal detector allocation problem is described as a mixed-integer nonlinear programming model, usually using math programming or heuristic optimization methods for finding the optimal solution or near optimal solution. While using the both methods, the difficulties encountered are the amount of decision variables and the difficulty of not violating the constraints. In this study, a two-phase evolutionary computation approach based on the immune algorithm and particle swarm optimization has been developed for overcoming the difficulties and finding the optimal solutions for the detector allocation problems effectively. Finally, the performance of the proposed methodology has been evaluated with the commercial optimization software. Numerical results illustrate that our approach is with well performance for the constrained detector allocation problems considered in this paper. As reported, solutions acquired by using our approach are as well as or better than those found by using LINGO®.
