Applying min-max k postmen problems to the routing of security guards

@article{Willemse2012ApplyingMK,
  title={Applying min-max k postmen problems to the routing of security guards},
  author={Elias J. Willemse and Johan W. Joubert},
  journal={JORS},
  year={2012},
  volume={63},
  pages={245-260}
}
The most essential and alluring characteristic of a security estate is the estate’s ability to provide 24-hour security to its residents, of which the continual patrolling of roads and paths is vital. The objective of this paper is to address the lack of sufficient patrol route design procedures by presenting a tabu search algorithm capable of generating multiple patrol routes for an estate’s security guards. The paper shows that the problem of designing these routes can be modelled as an Arc… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 12 CITATIONS

Similar Papers

Loading similar papers…