|
 ABSTRACT
We present an object oriented framework for designing and evaluating heuristic search algorithms that achieve a high level of generality and work well on a wide range of combinatorial optimization problems. Our framework, named HyFlex, differs from most software tools for meta-heuristics and evolutionary computation in that it provides the algorithm components that are problem-specific instead of those which are problem-independent. In this way, we simultaneously liberate algorithm designers from needing to know the details of the problem domains; and prevent them from incorporating additional problem specific information in their algorithms. The efforts need instead to be focused on designing high-level strategies to intelligently combine the provided problem specific algorithmic components. We plan to propose a challenge, based on our framework, where the winners will be those algorithms with a better overall performance across all of the different domains. Using an Olympic metaphor, we are not solely focussed on the 100 meters race, but instead on the decathlon of modern search methodologies.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
R. Bai, J. Blazewicz, E. K. Burke, G. Kendall, and B. McCollum. A simulated annealing hyper-heuristic methodology for flexible decision support. Technical report, School of Computer Science, University of Nottingham, 2007.
|
| |
2
|
S. Bleuler, M. Laumanns, L. Thiele, and E. Zitzler. PISA - A Platform and Programming Language Independent Interface for Search Algorithms. In C. M. Fonseca, P. J. Fleming, E. Zitzler, K. Deb, and L. Thiele, editors, Conference on Evolutionary Multi-Criterion Optimization (EMO 2003), volume 2632 of LNCS, pages 494--508, Berlin, 2003. Springer.
|
| |
3
|
E. K. Burke, T. Curtois, R. Qu, and G. Vanden Berghe. A scatter search for the nurse rostering problem. Technical report, School of Computer Science, University of Nottingham, 2007.
|
| |
4
|
E. K. Burke, T. Curtois, R. Qu, and G. Vanden Berghe. A time predefined variable depth search for nurse rostering. Technical report, School of Computer Science, University of Nottingham, 2007.
|
| |
5
|
E. K. Burke, E. Hart, G. Kendall, J. Newall, P. Ross, and S. Schulenburg. Hyper-heuristics: An emerging direction in modern search technology. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, pages 457--474. Kluwer, 2003.
|
| |
6
|
E. K. Burke, G. Kendall, and R. Qu. Hyper--heuristics and theier emploument on search problems. The 25th Workshop of the UK Planning AND Scheduling, PlanSIG 2006, December 2006. Keynote talk.
|
| |
7
|
|
| |
8
|
E.K. Burke, T. Curtois, G. Post, R. Qu, and B. Veltman. A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. European Journal of Operational Research, 188(2):330--341, 2008.
|
| |
9
|
|
| |
10
|
T. Curtois. A hyflex module for the personnel scheduling problem. Technical report, School of Computer Science, University of Nottingham, 2009.
|
| |
11
|
E Falkenauer. A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics, 2:5--30, 1996.
|
| |
12
|
|
| |
13
|
H. H. Hoos and T. Stützle. Satlib: An online resource for research on sat. In I. P. Gent, H. V. Maaren, and T. Walsh, editors, SAT 2000, pages 283--292. IOS Press, 2000. SATLIB is available online at www.satlib.org.
|
| |
14
|
M. Hyde. A hyflex module for the boolean satisfiability problem. Technical report, School of Computer Science, University of Nottingham, 2009.
|
| |
15
|
M. Hyde. A hyflex module for the one dimensional bin--packing problem. Technical report, School of Computer Science, University of Nottingham, 2009.
|
| |
16
|
D. Johnson, A. Demers, J. Ullman, M. Garey, and R. Graham. Worst-case performance bounds for simple one-dimensional packaging algorithms. SIAM Journal on Computing, 3(4):299--325, December 1974.
|
| |
17
|
M. Nawaz, E. Enscore Jr., and I. Ham. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA-International Journal of Management Science, 11(1):91--95, 1983.
|
| |
18
|
A. J. Parkes. A proposal for a hyper-heuristics software interface. Oral presentation, May 2007. Automated Scheduling, Optimisation and Planning Research Group. Internal Seminar.
|
| |
19
|
R. Ruiz and T. G. Stützle. An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. Journal of Operational Research, 187(10):1143--1159, 2007.
|
| |
20
|
P. Schwerin and G. Wascher. The bin-packing problem: A problem generator and some numerical experiments with ffd packing and mtp. International Transactions in Operational Research, 4(5):377--389, 1997.
|
| |
21
|
E. Taillard. Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2):278--285, 1993.
|
| |
22
|
J. A. Vazquez-Rodriguez. A hyflex module for the permutation flow shop problem. Technical report, School of Computer Science, University of Nottingham, 2009.
|
| |
23
|
J. Woodward, A. Parkes, and G. Ochoa. A mathematical framework for hyper-heuristics. Oral presentation, 2008 September. Workshop on Hyper-heuristics -- Automating the Heuristic Design Process, in conjunction with the 10th International Conference on Parallel Problem Solving From Nature (PPSN X), Dortmund, Germany.
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
I.2