Title: Security personnel routing and rostering: a hyper-heuristic approach
Authors: Misir, Mustafa ×
Smet, Pieter
Verbeeck, Katja
Vanden Berghe, Greet #
Issue Date: Aug-2011
Publisher: Tadbir
Host Document: Proceedings of the 3rd International Conference on Applied Operational Research vol:3 pages:193-205
Series Title: Lecture Notes in Management Science
Conference: the 3rd International Conference on Applied Operational Research (ICAOR'11) location:Istanbul, Turkey date:24-26 August 2011
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.
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Computer Science Technology TC, Technology Campuses Ghent and Aalst
Technologiecluster Computerwetenschappen
Computer Science, Campus Kulak Kortrijk
Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
misir2011security.pdf Published 545KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.