Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJuly 2019
Multi-point infill sampling strategies exploiting multiple surrogate models
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 1559–1567https://doi.org/10.1145/3319619.3328527This work presents interesting multi-point search algorithms exploiting several surrogate models, implemented in MI-NAMO, the multi-disciplinary optimization platform of Cenaero. Many types of surrogate models are used in the literature with their own ...
- research-articleJuly 2019
Dynamic compartmental models for algorithm analysis and population size estimation
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 2044–2047https://doi.org/10.1145/3319619.3326912Dynamic Compartmental Models (DCM) can be used to study the population dynamics of Multi- and Many-objective Optimization Evolutionary Algorithms (MOEAs). These models track the composition of the instantaneous population by grouping them in ...
- research-articleJuly 2019
Knowledge-driven reference-point based multi-objective optimization: first results
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 2060–2063https://doi.org/10.1145/3319619.3326911Multi-objective optimization problems in the real world often involve a decision maker who has certain preferences for the objective functions. When such preferences can be expressed as a reference point, the goal of optimization changes from generating ...
- research-articleJuly 2019
Ensemble-based constraint handling in multiobjective optimization
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 2072–2075https://doi.org/10.1145/3319619.3326909Many real-world optimization problems involve both multiple objectives and constraints. Although constraint handling in multiobjective optimization has been considered in the literature, there is still a high demand for more advanced and versatile ...
- research-articleJuly 2019
On the construction of pareto-compliant quality indicators
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 2024–2027https://doi.org/10.1145/3319619.3326902The performance comparison of multi-objective evolutionary algorithms (MOEAs) has been a broadly studied research area. For almost two decades, quality indicators (QIs) have been employed to quantitatively compare the Pareto front approximations ...
-
- research-articleJuly 2019
Binary 100-digit challenge using IEEE-754 coded numerical optimization scenarios (100b-digit) and V-shape binary distance-based success history differential evolution (DISHv)
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 1821–1828https://doi.org/10.1145/3319619.3326898This paper proposes a new discrete optimization benchmark 100b-Digit, a binary discretized version for the 100-Digit Challenge. The continuous version 100-Digit Challenge utilizing continuous input parameters for a fitness function was suggested for the ...
- research-articleJuly 2019
SAPIAS concept: towards an independent self-adaptive per-instance algorithm selection for metaheuristics
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 1474–1477https://doi.org/10.1145/3319619.3326881Per-Instance Algorithm Selection and Automatic Algorithm Configuration have recently gained important interests. However, these approaches face many limitations. For instance, the performance of these methods is deeply influenced by factors like the ...
- research-articleJuly 2019
Generalized incremental orthant search: towards efficient steady-state evolutionary multiobjective algorithms
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 1357–1365https://doi.org/10.1145/3319619.3326880Some of the modern evolutionary multiobjective algorithms have a high computational complexity of the internal data processing. To further complicate this problem, researchers often wish to alter some of these procedures, and to do it with little ...
- research-articleJuly 2019
Deadline-driven approach for multi-fidelity surrogate-assisted environmental model calibration: SWAN wind wave model case study
- Nikolay O. Nikitin,
- Pavel Vychuzhanin,
- Alexander Hvatov,
- Irina Deeva,
- Anna V. Kalyuzhnaya,
- Sergey V. Kovalchuk
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 1583–1591https://doi.org/10.1145/3319619.3326876This paper describes the approach for calibration of environmental models with the presence of time and quality restrictions. Advantages of the suggested strategy are based on two main concepts. The first advantage was provided by reducing the overall ...
- research-articleJuly 2019
Immune and genetic hybrid optimization algorithm for data relay satellite with microwave and laser links
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 2008–2015https://doi.org/10.1145/3319619.3326874Aiming at the problem of oversubscription of data relay access request of user stars in future Space-Based Information System, the problem of resource scheduling optimization for data relay satellite system with microwave and laser hybrid links is ...
- research-articleJuly 2019
Computing rational border curves of melanoma and other skin lesions from medical images with bat algorithm
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 1675–1682https://doi.org/10.1145/3319619.3326873Border detection of melanoma and other skin lesions from images is an important step in the medical image processing pipeline. Although this task is typically carried out manually by the dermatologists, some recent papers have applied evolutionary ...
- research-articleJuly 2019
Hybrid techniques for detecting changes in less detectable dynamic multiobjective optimization problems
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 1449–1456https://doi.org/10.1145/3319619.3326867Detecting the environmental changes in dynamic optimization problems is an essential phase for a dynamic evolutionary algorithm. By determining the time points of change in the problem, the evolutionary algorithm is capable of adapting and responding to ...
- research-articleJuly 2019
Differential evolution for multi-modal multi-objective problems
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 1399–1406https://doi.org/10.1145/3319619.3326862Multi-modal multi-objective problems (MMMOPs) have two or more distinct Pareto-optimal sets (PSs) mapping to the same Pareto-front (PF). Identifying all such PSs assists in informed decision-making. However, existing multi-objective evolutionary ...
- research-articleJuly 2019
Empirical evidence of the effectiveness of primitive granularity control for hyper-heuristics
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 1478–1486https://doi.org/10.1145/3319619.3326860The set of primitive operations available to a generative hyper-heuristic can have a dramatic impact on the overall performance of the heuristic search in terms of efficiency and final solution quality. When constructing a primitive set, users are faced ...
- research-articleJuly 2019
Automated design of random dynamic graph models
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 1504–1512https://doi.org/10.1145/3319619.3326859Dynamic graphs are an essential tool for representing a wide variety of concepts that change over time. Examples include modeling the evolution of relationships and communities in a social network or tracking the activity of users within an enterprise ...
- research-articleJuly 2019
Landscape analysis under measurement error
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 1415–1418https://doi.org/10.1145/3319619.3326858There are situations where the need for optimisation with a global precision tolerance arises - for example, due to measurement, numerical or evaluation errors in the objective function. In such situations, a global tolerance ϵ > 0 can be predefined ...
- research-articleJuly 2019
A survey of formal theoretical advances regarding XCS
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 1295–1302https://doi.org/10.1145/3319619.3326848Learning Classifier Systems (LCSs) are a unique machine learning paradigm. The probably most well-known and investigated instance of these is XCS. LCSs, and with them, XCS, have developed in parallel to mathematically more rigorously founded paradigms ...
- research-articleJuly 2019
Nature-inspired metaheuristics for optimizing information dissemination in vehicular networks
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 1312–1320https://doi.org/10.1145/3319619.3326847Connected vehicles are revolutionizing the way in which transport and mobility are conceived. The main technology behind is the so-called Vehicular Ad-Hoc Networks (VANETs), which are communication networks that connect vehicles and facilitate various ...
- research-articleJuly 2019
Game AI hyperparameter tuning in rinascimento
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 1742–1746https://doi.org/10.1145/3319619.3326842Hyperparameter tuning is an important mixed-integer optimisation problem, especially in the context of real-world applications such as games. In this paper, we propose a function suite around hyperparameter optimisation of game AI based on the card game ...
- research-articleJuly 2019
On the definition of dynamic permutation problems under landscape rotation
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 1518–1526https://doi.org/10.1145/3319619.3326840Dynamic optimisation problems (DOPs) are optimisation problems that change over time. Typically, DOPs have been defined as a sequence of static problems, and the dynamism has been inserted into existing static problems using different techniques. In the ...