Hyper-heuristic approaches for the response time variability problem

Garcia-Villoria, Alberto, Salhi, Said, Corominas, Albert, Pastor, Rafael (2011) Hyper-heuristic approaches for the response time variability problem. European Journal of Operational Research, 211 (1). pp. 160-169. ISSN 0377-2217. (doi:10.1016/j.ejor.2010.12.005) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:27447)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided.
Official URL: http://dx.doi.org/10.1016/j.ejor.2010.12.005

Abstract

We propose two classes for the implementation of hyper-heuristic algorithms. The first is based on constructive heuristics, whereas the second uses improvement methods. Within the latter class, a general framework is designed for the use of local search procedures and metaheuristics as low-level heuristics. A dynamic scheme to guide the use of these approaches is also devised. These ideas are tested on an NP-hard scheduling problem known as the response time variability problem (RTVP). An intensive computational experiment shows, especially in the second class where the new best results are found, the effectiveness of the proposed hyper-heuristics.

Item Type:	Article
DOI/Identification number:	10.1016/j.ejor.2010.12.005
Subjects:	H Social Sciences > H Social Sciences (General)
Divisions:	Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems
Depositing User:	Said Salhi
Date Deposited:	01 Mar 2011 10:39 UTC
Last Modified:	05 Nov 2024 10:08 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/27447 (The current URI for this page, for reference purposes)

University of Kent Author Information

Salhi, Said.

Creator's ORCID:	https://orcid.org/0000-0002-3384-5240
CReDIT Contributor Roles:

Depositors only (login required):

Altmetric

Download Statistics

Total unique views for this document in KAR since July 2020. For more details click on the image.