Please use this identifier to cite or link to this item:
Appears in Collections:Computing Science and Mathematics Conference Papers and Proceedings
Peer Review Status: Refereed
Author(s): Ochoa, Gabriela
Hyde, Matthew
Curtois, Tim
Vazquez-Rodriguez, Jose Antonio
Walker, James
Gendreau, Michel
Kendall, Graham
McCollum, Barry
Parkes, Andrew J
Petrovic, Sanja
Burke, Edmund
Contact Email:
Title: HyFlex: A benchmark framework for cross-domain heuristic search
Editor(s): Hao, J-K
Middendorf, M
Citation: Ochoa G, Hyde M, Curtois T, Vazquez-Rodriguez JA, Walker J, Gendreau M, Kendall G, McCollum B, Parkes AJ, Petrovic S & Burke E (2012) HyFlex: A benchmark framework for cross-domain heuristic search. In: Hao J & Middendorf M (eds.) Evolutionary Computation in Combinatorial Optimization 12th European Conference, EvoCOP 2012, Málaga, Spain, April 11-13, 2012. Proceedings. Lecture Notes in Computer Science, Vol. 7245. 12th European Conference, EvoCOP 2012, Málaga, Spain, 11.04.2012-12.04.2012. Amsterdam: Springer, pp. 136-147.
Issue Date: 2012
Date Deposited: 6-Jun-2013
Series/Report no.: Lecture Notes in Computer Science, Vol. 7245
Conference Name: 12th European Conference, EvoCOP 2012
Conference Dates: 2012-04-11 - 2012-04-12
Conference Location: Málaga, Spain
Abstract: This paper presents HyFlex, a software framework for the development of cross-domain search methodologies. The framework features a common software interface for dealing with different combinatorial optimisation problems and provides the algorithm components that are problem specific. In this way, the algorithm designer does not require a detailed knowledge of the problem domains and thus can concentrate his/her efforts on designing adaptive general-purpose optimisation algorithms. Six hard combinatorial problems are fully implemented: maximum satisfiability, one dimensional bin packing, permutation flow shop, personnel scheduling, traveling salesman and vehicle routing. Each domain contains a varied set of instances, including real-world industrial data and an extensive set of state-of-the-art problem specific heuristics and search operators. HyFlex represents a valuable new benchmark of heuristic search generality, with which adaptive cross-domain algorithms are being easily developed and reliably compared.This article serves both as a tutorial and a as survey of the research achievements and publications so far using HyFlex.
Status: VoR - Version of Record
Rights: The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.
Licence URL(s):

Files in This Item:
File Description SizeFormat 
Ochoa et al_HyFlex_2012.pdfFulltext - Published Version252.07 kBAdobe PDFUnder Embargo until 3000-03-31    Request a copy

Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.

This item is protected by original copyright

Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved

If you believe that any material held in STORRE infringes copyright, please contact providing details and we will remove the Work from public display in STORRE and investigate your claim.