Shortest Coverage Sequences for Covering Moving Targets in Networks

Zusammenfassung

Parades of highly controversial groups or political demonstration marches challenge the decision makers in urban security, since the diametrically opposed opinions of participants and opponents may result in violence. Efficient and reliable location planning and rostering of the civil security personnel provides the basis of a successful deployment of the civil security staff. We introduce a model for planning the mission of civil security staff whose task is to intervene only in the case a major incident occurs. For the basic problem, an integer program formulation as well as a combinatorial solution algorithm are given. The model is then extended to the case of multiple teams. As before, complexity results and solution strategies are presented.