SECURITY PERSONNEL ROUTING AND ROSTERING: A HYPER-HEURISTIC APPROACH

 

Mustafa Misir, Pieter Smet, Katja Verbeeck, Greet Vanden Berghe

 

Abstract

 

In the present study, a large scale, structured problem regarding the routing and rostering of security personnel is investigated. Structured problems are combinatorial optimization problems that encompass characteristics of more than one known problem in operational research. The problem deals with assigning the available personnel to visits associated with a set of customers. This objective just described, reflects the rostering characteristic of the problem. In addition, the different geographic locations of the customers indicate the requirement of routing. A new benchmark dataset for this complex problem is presented. A group of high-level problem-independent methods, i.e. hyper-heuristics, is used to solve this novel problem. The performance and behaviour of different hyper-heuristics for the presented benchmark dataset are analysed.

 

Lecture Notes in Management Science (2011) Vol. 3: 193-206

3rd International Conference on Applied Operational Research, Proceedings

© Tadbir Operational Research Group Ltd. All rights reserved.

www.tadbir.ca

 

ISSN 2008-0050 (Print)

ISSN 1927-0097 (Online)

 

ARTICLE OUTLINE

 

·         Introduction

·         Problem Description

·         Selection Hyper-Heuristics

·         Heuristic Selection

·         Move Acceptance

·         A Two-Phase Approach

·         Experiments

·         Adaptive Dynamic Heuristic Set Strategy

·         Conclusion

·         Acknowledgement

·         References

 

Full Text PDF