Matches in SemOpenAlex for { <https://semopenalex.org/work/W1628567638> ?p ?o ?g. }
- W1628567638 abstract "There is a growing interest towards self configuring/tuning automated general-purpose reusable heuristic approaches for combinatorial optimisation, such as, hyper-heuristics. Hyper-heuristics are search methodologies which explore the space of heuristics rather than the solutions to solve a broad range of hard computational problems without requiring any expert intervention. There are two common types of hyper-heuristics in the literature: selection and generation methodologies. This work focuses on the former type of hyper-heuristics. Almost all selection hyper-heuristics perform a single point based iterative search over the space of heuristics by selecting and applying a suitable heuristic to the solution in hand at each decision point. Then the newly generated solution is either accepted or rejected using an acceptance method. This improvement process is repeated starting from an initial solution until a set of termination criteria is satisfied. The number of studies on the design of hyper-heuristic methodologies has been rapidly increasing and currently, we already have a variety of approaches, each with their own strengths and weaknesses. It has been observed that different hyper-heuristics perform differently on a given subset of problem instances and more importantly, a hyper-heuristic performs differently as the set of low level heuristics vary. This thesis introduces a general hyper-heuristic framework enabling the use and exploitation of multiple selection hyper-heuristics at different stages during the search process. The goal is designing an approach utilising multiple hyper-heuristics for a more effective and efficient overall performance when compared to the performance of each constituent selection hyper-heuristic. The level of generality that a hyper-heuristic can achieve has always been of interest to the hyper-heuristic researchers. Hence, a variety of multi-stage hyper-heuristics based on the framework are not only applied to the real-world combinatorial optimisation problems of high school timetabling, multi-mode resource-constrained multi-project scheduling and construction of magic squares, but also tested on the well known hyper-heuristic benchmark of CHeSC 2011. The empirical results show that the multi-stage hyper-heuristics designed based on the proposed framework are still inherently general, easy-to-implement, adaptive and reusable. They can be extremely effective solvers considering their success in the competitions of ITC 2011 and MISTA 2013. Moreover, a particular multi-stage hyper-heuristic outperformed the state-of-the-art selection hyper-heuristic from CHeSC 2011." @default.
- W1628567638 created "2016-06-24" @default.
- W1628567638 creator A5017573824 @default.
- W1628567638 date "2014-12-09" @default.
- W1628567638 modified "2023-09-26" @default.
- W1628567638 title "Multi-stage hyper-heuristics for optimisation problems" @default.
- W1628567638 cites W140728773 @default.
- W1628567638 cites W1415548470 @default.
- W1628567638 cites W1498349744 @default.
- W1628567638 cites W1499849206 @default.
- W1628567638 cites W1501997272 @default.
- W1628567638 cites W1502125971 @default.
- W1628567638 cites W1518679956 @default.
- W1628567638 cites W1519597478 @default.
- W1628567638 cites W1520349147 @default.
- W1628567638 cites W1536647479 @default.
- W1628567638 cites W1542560614 @default.
- W1628567638 cites W1545459265 @default.
- W1628567638 cites W1549353496 @default.
- W1628567638 cites W1552774329 @default.
- W1628567638 cites W1552927435 @default.
- W1628567638 cites W1573699551 @default.
- W1628567638 cites W1574858090 @default.
- W1628567638 cites W1581822553 @default.
- W1628567638 cites W1583958891 @default.
- W1628567638 cites W1606498431 @default.
- W1628567638 cites W1631859655 @default.
- W1628567638 cites W1745341198 @default.
- W1628567638 cites W1766971425 @default.
- W1628567638 cites W1787640033 @default.
- W1628567638 cites W1794976143 @default.
- W1628567638 cites W1814515812 @default.
- W1628567638 cites W1819450536 @default.
- W1628567638 cites W18216792 @default.
- W1628567638 cites W182611020 @default.
- W1628567638 cites W1829921621 @default.
- W1628567638 cites W1857496909 @default.
- W1628567638 cites W187252670 @default.
- W1628567638 cites W1883366561 @default.
- W1628567638 cites W1955468472 @default.
- W1628567638 cites W1964072303 @default.
- W1628567638 cites W1964734388 @default.
- W1628567638 cites W1966068620 @default.
- W1628567638 cites W1967545722 @default.
- W1628567638 cites W1968390980 @default.
- W1628567638 cites W1969577093 @default.
- W1628567638 cites W1969848548 @default.
- W1628567638 cites W1970604725 @default.
- W1628567638 cites W1971274730 @default.
- W1628567638 cites W1972291640 @default.
- W1628567638 cites W1973131489 @default.
- W1628567638 cites W1973598584 @default.
- W1628567638 cites W1973812366 @default.
- W1628567638 cites W1974342535 @default.
- W1628567638 cites W1985778927 @default.
- W1628567638 cites W1987220363 @default.
- W1628567638 cites W1988376894 @default.
- W1628567638 cites W1989507398 @default.
- W1628567638 cites W1990255796 @default.
- W1628567638 cites W1997294113 @default.
- W1628567638 cites W1998471726 @default.
- W1628567638 cites W1998491558 @default.
- W1628567638 cites W2003088567 @default.
- W1628567638 cites W2003091800 @default.
- W1628567638 cites W2003160050 @default.
- W1628567638 cites W2005228957 @default.
- W1628567638 cites W2007516353 @default.
- W1628567638 cites W2008434012 @default.
- W1628567638 cites W2010611608 @default.
- W1628567638 cites W2011716148 @default.
- W1628567638 cites W2015277739 @default.
- W1628567638 cites W2018170131 @default.
- W1628567638 cites W2023947722 @default.
- W1628567638 cites W2024742034 @default.
- W1628567638 cites W2025369528 @default.
- W1628567638 cites W2026076687 @default.
- W1628567638 cites W2028379670 @default.
- W1628567638 cites W2030910540 @default.
- W1628567638 cites W2036112575 @default.
- W1628567638 cites W2038104061 @default.
- W1628567638 cites W2038345112 @default.
- W1628567638 cites W2047956445 @default.
- W1628567638 cites W2048560953 @default.
- W1628567638 cites W2049685376 @default.
- W1628567638 cites W2053175541 @default.
- W1628567638 cites W2053544685 @default.
- W1628567638 cites W2056433610 @default.
- W1628567638 cites W2056956492 @default.
- W1628567638 cites W2061011526 @default.
- W1628567638 cites W2068616350 @default.
- W1628567638 cites W2068996936 @default.
- W1628567638 cites W2070975460 @default.
- W1628567638 cites W2072441740 @default.
- W1628567638 cites W2078389146 @default.
- W1628567638 cites W2081591618 @default.
- W1628567638 cites W2084792706 @default.
- W1628567638 cites W2086961057 @default.
- W1628567638 cites W2089848835 @default.
- W1628567638 cites W2102807025 @default.
- W1628567638 cites W2103376860 @default.