Configuration, Deployment, and Scheduling Models for Management and Optimization of Patrol Services

Algorithm 1

Node selection for besiege program.

Input   : the traveling time between two nodes and ;

    : the initial node set anticipating the blockade;

    : The minimal number of nodes anticipating the blockade;

    : the minimal length of time between nodes anticipating blockade.

Output    : the node set anticipating the blockade.

Process

Step  1. Calculate the minimal traveling time among the nodes in by:

     .

Step  2. The termination criterion of the algorithm:

     If     Then

       Return

     End IF

Step  3.  Determine the node to be removed by: .

Step  4.  Update the set by: ∖.