Title: An analysis of generalised heuristics for vehicle routing and personnel rostering problems
Authors: Misir, Mustafa ×
Smet, Pieter
Vanden Berghe, Greet #
Issue Date: 2015
Publisher: Published by Pergamon Press for Operational Research Society
Series Title: Journal of the Operational Research Society vol:66 pages:858-870
Abstract: The present study investigates the performance of heuristics while solving problems with routing and rostering characteristics. The target problems include scheduling and routing home care, security and maintenance personnel. In analysing the behaviour of the heuristics and determining the requirements for solving the aforementioned problems, the winning hyper-heuristic from the First International Cross-domain Heuristic Search Challenge (CHeSC 2011) is employed. The completely new application of a hyper-heuristic as an analysis tool offers promising perspectives for supporting dedicated heuristic development. The experimental results reveal that different low-level heuristics perform better on different problems and that their performance varies during a search process. The following characteristics affect the performance of the heuristics: the planning horizon, the number of activities and lastly the number of resources. The body of this paper details both these characteristics and also discusses the required features for embedding in an algorithm to solve problems particularly with a vehicle routing component.
ISSN: 0160-5682
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Computer Science Technology TC, Technology Campuses Ghent and Aalst
Technologiecluster Computerwetenschappen
Computer Science, Campus Kulak Kortrijk
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
misir2012analysisJORS-rev1.pdf Accepted 1011KbAdobe PDFView/Open Request a copy

These files are only available to some KU Leuven Association staff members


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

© Web of science