Results 81 to 90 of about 7,821 (233)

A new index‐based hyper‐heuristic algorithm for global optimisation problems

open access: yesIET Software, 2022
In this research study, a new combination search algorithm, based on indexing its constituent processes, is proposed to solve global optimisation problems.
Mohammad Reza Hasanzadeh   +2 more
doaj   +1 more source

Multi-objective optimisation with a sequence-based selection hyper-heuristic [PDF]

open access: yes, 2016
Hyper-heuristics have been used widely to solve optimisation problems, often single-objective and discrete in nature. Herein, we extend a recently-proposed selection hyper-heuristic to the multiobjective domain and with it optimise continuous problems ...
Keedwell, EK, Walker, DJ
core   +1 more source

The power of expressed humility: Early stage investors' reaction to humble entrepreneurs

open access: yesStrategic Entrepreneurship Journal, EarlyView.
Abstract Research Summary We examine how entrepreneur‐expressed humility affects early stage investors' willingness to fund new ventures. In pitching contexts where investors rely on relational cues and implicit prototypes of entrepreneurs, we theorize three distinct pathways through which expressed humility shapes funding decisions. First, building on
Laurent Vilanova, Ivana Vitanova
wiley   +1 more source

Student Surpasses the Teacher: Apprenticeship Learning for Quadratic Unconstrained Binary Optimisation

open access: yesAlgorithms
This study introduces a novel train-and-test approach referred to as apprenticeship learning (AL) for generating selection hyper-heuristics to solve the Quadratic Unconstrained Binary Optimisation (QUBO) problem.
Jack Cakebread   +4 more
doaj   +1 more source

CUSTOMHyS: Customising Optimisation Metaheuristics via Hyper-heuristic Search

open access: yesSoftwareX, 2020
There is a colourful palette of metaheuristics for solving continuous optimisation problems in the literature. Unfortunately, it is not easy to pick a suitable one for a specific practical scenario. Moreover, oftentimes the selected metaheuristic must be
Jorge M. Cruz-Duarte   +4 more
doaj   +1 more source

Fragment‐Block: A Novel Approach for Managing Variability in Software Product Lines

open access: yesSoftware: Practice and Experience, EarlyView.
ABSTRACT Objective Changes in the functionality of a software product line (SPL) can generate various issues in the SPL source code. Their complexity depends primarily on the amount of changes in the SPL source code and the internal mechanisms for managing variability. Further, modern development frameworks rely on a variety of artefacts besides source
Junior Cupe Casquina, Leonardo Montecchi
wiley   +1 more source

Automated construction of evolutionary algorithm operators for the bi-objective water distribution network design problem using a genetic programming based hyper-heuristic approach [PDF]

open access: yes, 2015
The water distribution network (WDN) design problem is primarily concerned with finding the optimal pipe sizes that provide the best service for minimal cost; a problem of continuing importance both in the UK and internationally.
Keedwell, Edward   +3 more
core   +1 more source

Evolution of group-theoretic cryptology attacks using hyper-heuristics

open access: yesJournal of Mathematical Cryptology, 2021
In previous work, we developed a single evolutionary algorithm (EA) to solve random instances of the Anshel–Anshel–Goldfeld (AAG) key exchange protocol over polycyclic groups. The EA consisted of six simple heuristics which manipulated strings.
Craven Matthew J., Woodward John R.
doaj   +1 more source

A software interface for supporting the application of data science to optimisation [PDF]

open access: yes, 2015
Many real world problems can be solved effectively by metaheuristics in combination with neighbourhood search. However, implementing neighbourhood search for a particular problem domain can be time consuming and so it is important to get the most value ...
EK Burke   +4 more
core   +3 more sources

A Universal Meta‐Heuristic Framework for Influence Maximisation in Hypergraphs

open access: yesCAAI Transactions on Intelligence Technology, EarlyView.
ABSTRACT Influence maximisation (IM) aims to select a small number of nodes that are able to maximise their influence in a network and covers a wide range of applications. Despite numerous attempts to provide effective solutions in simple networks, higher‐order interactions between entities in various real‐world systems are usually not taken into ...
Ming Xie   +5 more
wiley   +1 more source

Home - About - Disclaimer - Privacy