8 research outputs found
Hyper-heuristic decision tree induction
A hyper-heuristic is any algorithm that searches or operates in the space of
heuristics as opposed to the space of solutions. Hyper-heuristics are
increasingly used in function and combinatorial optimization. Rather than
attempt to solve a problem using a fixed heuristic, a hyper-heuristic
approach attempts to find a combination of heuristics that solve a problem
(and in turn may be directly suitable for a class of problem instances).
Hyper-heuristics have been little explored in data mining. This work presents
novel hyper-heuristic approaches to data mining, by searching a space of
attribute selection criteria for decision tree building algorithm. The search is
conducted by a genetic algorithm. The result of the hyper-heuristic search in
this case is a strategy for selecting attributes while building decision trees.
Most hyper-heuristics work by trying to adapt the heuristic to the state of
the problem being solved. Our hyper-heuristic is no different. It employs a
strategy for adapting the heuristic used to build decision tree nodes
according to some set of features of the training set it is working on. We
introduce, explore and evaluate five different ways in which this problem
state can be represented for a hyper-heuristic that operates within a decisiontree
building algorithm. In each case, the hyper-heuristic is guided by a rule
set that tries to map features of the data set to be split by the decision tree
building algorithm to a heuristic to be used for splitting the same data set.
We also explore and evaluate three different sets of low-level heuristics that
could be employed by such a hyper-heuristic.
This work also makes a distinction between specialist hyper-heuristics and
generalist hyper-heuristics. The main difference between these two hyperheuristcs
is the number of training sets used by the hyper-heuristic genetic
algorithm. Specialist hyper-heuristics are created using a single data set from
a particular domain for evolving the hyper-heurisic rule set. Such algorithms
are expected to outperform standard algorithms on the kind of data set used
by the hyper-heuristic genetic algorithm. Generalist hyper-heuristics are
trained on multiple data sets from different domains and are expected to
deliver a robust and competitive performance over these data sets when
compared to standard algorithms.
We evaluate both approaches for each kind of hyper-heuristic presented in
this thesis. We use both real data sets as well as synthetic data sets. Our
results suggest that none of the hyper-heuristics presented in this work are
suited for specialization – in most cases, the hyper-heuristic’s performance on
the data set it was specialized for was not significantly better than that of
the best performing standard algorithm. On the other hand, the generalist
hyper-heuristics delivered results that were very competitive to the best
standard methods. In some cases we even achieved a significantly better
overall performance than all of the standard methods
Algoritmos evolutivos multiobjectivo para afectação de recursos e sua aplicação à geração de horários em universidades
Esta dissertação tem por objectivo aplicar algoritmos evolutivos multiobjectivo a
problemas de afectação de recursos, particulamente a problemas de geração de horários
de exames e problemas de geração de horários de aulas em Universidades. Estes
problemas são normalmente caracterizados pela existência de múltiplos objectivos
conflituosos. Neste sentido, uma formalização multiobjectivo para estes problemas é
apresentada, com base no conceito de metas e prioridades.
Vários aspectos dos algoritmos evolutivos são propostos e analisados para esta
classe de problemas, nomeadamente, métodos de selecção e tipo e parâmetros de
operadores de mutação. A escolha da representação e dos operadores utilizados é feita
tendo em conta a necessidade de não privilegiar demasiadamente certos objectivos em
relação a outros ao nível dos mecanismos de exploração.
São apresentados estudos comparativos entre os algoritmos propostos por meio de
métodos de inferência estatística em problemas reais na Universidade do Algarve. O
conceito de função de aproveitamento é utilizado para avaliação de algoritmos evolutivos
multiobjectivo. Finalmente, a análise da evolução do custo das soluções encontradas ao
longo do tempo de execução através de funções de aproveitamento é apresentada
Genetic algorithms for multiple-choice problems
This thesis investigates the use of problem-specific knowledge to enhance a genetic algorithm approach to multiple-choice optimisation problems. It shows that such information can significantly enhance performance, but that the choice of information and the way it is included are important factors for success. Two multiple-choice problems are considered. The first is constructing a feasible nurse roster that considers as many requests as possible. In the second problem, shops are allocated to locations in a mall subject to constraints and maximising the overall income. Genetic algorithms are chosen for their well-known robustness and ability to solve large and complex discrete optimisation problems. However, a survey of the literature reveals room for further research into generic ways to include constraints into a genetic algorithm framework. Hence, the main theme of this work is to balance feasibility and cost of solutions. In particular, co-operative co-evolution with hierarchical sub-populations, problem structure exploiting repair schemes and indirect genetic algorithms with self-adjusting decoder functions are identified as promising approaches. The research starts by applying standard genetic algorithms to the problems and explaining the failure of such approaches due to epistasis. To overcome this, problem-specific information is added in a variety of ways, some of which are designed to increase the number of feasible solutions found whilst others are intended to improve the quality of such solutions. As well as a theoretical discussion as to the underlying reasons for using each operator, extensive computational experiments are carried out on a variety of data. These show that the indirect approach relies less on problem structure and hence is easier to implement and superior in solution quality. The most successful variant of our algorithm has a more than 99% chance of finding a feasible solution which is either optimal or within a few percent of optimality
A study of evoluntionary perturbative hyper-heuristics for the nurse rostering problem.
Master of Science in Computer Science. University of KwaZulu-Natal, Pietermaritzburg 2017.Hyper-heuristics are an emerging field of study for combinatorial optimization. The aim of a hyper-heuristic is to produce good results across a set of problems rather than producing the best results. There has been little investigation of hyper-heuristics for the nurse rostering problem. The majority of hyper-heuristics for the nurse rostering problem fit into a single type of hyper-heuristic, the selection perturbative hyper-heuristic. There is no work in using evolutionary algorithms employed as selection perturbative hyper-heuristics for the nurse rostering problem. There is also no work in using the generative perturbative type of hyper-heuristic for the nurse rostering problem. The first objective of this dissertation is to investigate the selection perturbative hyper-heuristic for the nurse rostering problem and the effectiveness of employing an evolutionary algorithm (SPHH). The second objective is to investigate a generative perturbative hyper-heuristic to evolve perturbation heuristics for the nurse rostering problem using genetic programming (GPHH). The third objective is to compare the performance of SPHH and GPHH.
SPHH and GPHH were evaluated using the INRC2010 benchmark data set and the results obtained were compared to available results from literature. The INRC2010 benchmark set is comprised of sprint, medium and long instance types. SPHH and GPHH produced good results for the INRC2010 benchmark data set. GPHH and SPHH were found to have different strengths and weaknesses. SPHH found better results than GPHH for the medium instances. GPHH found better results than SPHH for the long instances. SPHH produced better average results. GPHH produced results that were closer to the best known results. These results suggest future research should investigate combining SPHH and GPHH to benefit from the strengths of both perturbative hyper-heuristics
Background Examples of Literature Searches on Topics of Interest
A zip file of various literature searches & some resources related to our work related to exposure after the Chernobyl accident and as we began looking at helping in Semey Kazakhstan----a collection of literature reviews on various topics we were interested in... eg. establishing a registry of those exposed for longterm follow-up, what we knew about certain areas like genetics and some resources like A Guide to Environmental Resources on the Internet by Carol Briggs-Erickson and Toni Murphy which could be found on the Internet and was written to be used by researchers, environmentalists, teachers and any person who is interested in knowing and doing something about the health of our planet. See more at https://archives.library.tmc.edu/dm-ms211-012-0060
The drivers of Corporate Social Responsibility in the supply chain. A case study.
Purpose: The paper studies the way in which a SME integrates CSR into its corporate strategy, the practices it puts in place and
how its CSR strategies reflect on its suppliers and customers relations.
Methodology/Research limitations: A qualitative case study methodology is used. The use of a single case study limits the
generalizing capacity of these findings.
Findings: The entrepreneur’s ethical beliefs and value system play a fundamental role in shaping sustainable corporate strategy.
Furthermore, the type of competitive strategy selected based on innovation, quality and responsibility clearly emerges both in
terms of well defined management procedures and supply chain relations as a whole aimed at involving partners in the process of
sustainable innovation.
Originality/value: The paper presents a SME that has devised an original innovative business model. The study pivots on the
issues of innovation and eco-sustainability in a context of drivers for CRS and business ethics. These values are considered
fundamental at International level; the United Nations has declared 2011 the “International Year of Forestry”
Investigating and Writing Achitectural History: Subjects, Methodologies and Frontiers.
The volume contains the abstracts and full texts of the 157 papers and position statements presented and discussed at the III EAHN (European Architectural History) International Meeting, Torino 19-21 June 201