AN OPTIMAL DISPATCH PLANNING OF GUARDS TO COUNTER TO A SUICIDE BOMBER

Counter terrorism operations become one of the great concerns in the recent military affairs. We will propose an optimal planning method for dispatching of security personnel to protect the lives of citizen from suicide bombing. Some security staffs, such as police or military personnel, are dispatched to patrol a certain area during a designated period. The whole operation time is divided into small mission periods and the limited number of securities take turns on the patrol for each period. In each mission period, there come some citizens there. Each of the dispatched guards firstly patrols there to search for a doubtful person. When they detect the man, they communicate with each other and try to neutralize him. Under such a situation, we develop a dispatch planning tool so as to maximize the expected number of surviving guards and the citizens from detonation within each divided period.