Documents disponibles écrits par cet auteur

Applying min–max k postmen problems to the routing of security guards / E. J. Willemse in Journal of the operational research society (JORS), Vol. 63 N° 2 (Fevrier 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 245–260 Titre : Applying min–max k postmen problems to the routing of security guards Type de document : texte imprimé Auteurs : E. J. Willemse, Auteur ; J. W. Joubert, Auteur Année de publication : 2012 Article en page(s) : pp. 245–260 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Arc  routing  Chinese  postman  problem  Rural  postman  problem  Tabu  search  algorithm  Security  guard  routing Index. décimale : 001.424 Résumé : The most essential and alluring characteristic of a security estate is the estate's ability to provide 24-h 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 Routing Problem, specifically as min–max k postmen problems. The algorithm is illustrated with a real problem instance from an estate in Gauteng, South Africa. The patrol routes generated by the algorithm provide a significant improvement in the even patrolling of the road network, and a more balanced work distribution among guards. The algorithm is also tested on several benchmark problems from literature. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors201126a.html [article] Applying min–max k postmen problems to the routing of security guards [texte imprimé] / E. J. Willemse, Auteur ; J. W. Joubert, Auteur . - 2012 . - pp. 245–260. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 245–260 Mots-clés : Arc  routing  Chinese  postman  problem  Rural  postman  problem  Tabu  search  algorithm  Security  guard  routing Index. décimale : 001.424 Résumé : The most essential and alluring characteristic of a security estate is the estate's ability to provide 24-h 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 Routing Problem, specifically as min–max k postmen problems. The algorithm is illustrated with a real problem instance from an estate in Gauteng, South Africa. The patrol routes generated by the algorithm provide a significant improvement in the even patrolling of the road network, and a more balanced work distribution among guards. The algorithm is also tested on several benchmark problems from literature. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors201126a.html