Hyper-heuristics for cross-domain search

• Autorzy: Cichowicz T.. , Drozdowski M. , Frankiewicz M. , Pawlak G. , Rytwinski F. , Wasilewski J.
• Języki publikacji: EN

Abstrakty

EN

In this paper we present two hyper-heuristics developed for the Cross-Domain Heuristic Search Challenge. Hyper-heuristics solve hard combinatorial problems by guiding low level heuristics, rather than by manipulating problem solutions directly. Two hyper-heuristics are presented: Five Phase Approach and Genetic Hive. Development paths of the algorithms and testing methods are outlined. Performance of both methods is studied. Useful and interesting experience gained in construction of the hyper-heuristics are presented. Conclusions and recommendations for the future advancement of hyper-heuristic methodologies are discussed.

Słowa kluczowe

EN

hyper-heuristics; cross-domain heuristic search; HyFlex

• Wydawca: Polska Akademia Nauk, Wydział IV Nauk Technicznych
• Czasopismo: Bulletin of the Polish Academy of Sciences. Technical Sciences
• Rocznik: 2012
• Tom: Vol. 60, nr 4
• Strony: 801--808
• Opis fizyczny: Bibliogr. 12 poz., rys., tab.

Twórcy

autor

Cichowicz T..

autor

Drozdowski M.

autor

Frankiewicz M.

autor

Pawlak G.

autor

Rytwinski F.

autor

Wasilewski J.

• Institute of Computing Science, Poznań University of Technology, 2 Piotrowo St., 60-965 Poznań, Poland

Bibliografia

• [1] J. Blazewicz, E. Pesch, M. Sterna, and F.Werner, “Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date”, Computers& Operations Research 35, 574-599 (2008).
• [2] J. Blazewicz, W. Domschke, and E. Pesch, “The job shop scheduling problem: Conventional and new solution techniques”, Eur. J. Operational Research 93, 1-33 (1996).
• [3] K.S. Hindi and E. Toczylowski, “Detailed scheduling of batch production in a cell with parallel facilities and common renewable resources”, Computers and Industrial Engineering 28, 839-850 (1995).
• [4] P. Jantos, D. Grzechca, and J. Rutkowski, “Evolutionary algorithms for global parametric fault diagnosis in analogue integrated circuits”, Bull. Pol. Ac.: Tech. 60 (1), 133-142 (2012).
• [5] S. Dinu and G. Bordea, “A new genetic approach for transport network design and optimization”, Bull. Pol. Ac.: Tech. 59 (3), 263-272 (2011).
• [6] P. Rohlfshagen and J. Bullinaria, “A genetic algorithm with exon shuffling crossover for hard bin packing problems”, Proc.9th Annual Conf. on Genetic and Evolutionary ComputationGECCO’07 1, 1365-1371 (2007).
• [7] M. Kaleta and E. Toczylowski, “Restriction techniques for the unit-commitment problem with total procurement costs”, EnergyPolicy 36 (7), 2439-2448 (2008).
• [8] M. Hyde, G. Ochoa, and A.Parkes, “Cross-domain heuristic search challenge”, http://www.asap.cs.nott.ac.uk/chesc2011/ (2011).
• [9] G. Ochoa, M. Hyde, T. Curtois, J.A. Vazquez-Rodriguez, J. Walker, M. Gendreau, G. Kendall, B. McCollum, A.J. Parkes, S. Petrovic, and E.K. Burke, “HyFlex: a benchmark framework for cross-domain heuristic search”, Eur. Conf. on EvolutionaryComputation in Combinatorial Optimisation (EvoCOP 2012), Lecture Notes on Computing Science 7245, 136-147 (2012).
• [10] M.Hyde and G. Ochoa, “ASAP Default Hyper-heuristics”, http://www.asap.cs.nott.ac.uk/chesc2011/defaulthh.html (2011).
• [11] D.T. Pham, A. Ghanbarzadeh, E. Koc, S. Otri, S. Rahim, and M.Zaidi, “The bees algorithm”, Manufacturing EngineeringCentre, Cardiff University, Cardiff, 2005.
• [12] K. Chakhlevitch and P. Cowling, “Hyperheuristics: recent developments”, Adaptive and Multilevel Metaheuristics, SCI 136, 3-29 (2008).