## Search

Now showing items 1-10 of 19

#### Implementing the Cumulative Difference Plot in the IOHanalyzer

(2022-07)

The IOHanalyzer is a web-based framework that enables an easy visualization and comparison of the quality of stochastic optimization algorithms. IOHanalyzer offers several graphical and statistical tools analyze the results ...

#### EDA++: Estimation of Distribution Algorithms with Feasibility Conserving Mechanisms for Constrained Continuous Optimization

(2022-02-25)

Handling non-linear constraints in continuous optimization is challenging, and finding a feasible solution is usually a difficult task. In the past few decades, various techniques have been developed to deal with linear ...

#### On the symmetry of the Quadratic Assignment Problem through Elementary Landscape Decomposition

(2021-07)

When designing meta-heuristic strategies to optimize the quadratic assignment problem (QAP), it is important to take into account the specific characteristics of the instance to be solved. One of the characteristics that ...

#### Simulation Framework for Orbit Propagation and Space Trajectory Visualization

(2021)

In this paper, an interactive tool for simulation of satellites dynamics and autonomous spacecraft guidance is presented. Different geopotential models for orbit propagation of Earth-orbiting satellites are provided, which ...

#### On the fair comparison of optimization algorithms in different machines

(2021)

An experimental comparison of two or more optimization algorithms requires the same computational resources to be assigned to each algorithm. When a maximum runtime is set as the stopping criterion, all algorithms need to ...

#### Kernels of Mallows Models under the Hamming Distance for solving the Quadratic Assignment Problem

(2020-07)

The Quadratic Assignment Problem (QAP) is a well-known permutation-based combinatorial optimization problem with real applications in industrial and logistics environments. Motivated by the challenge that this NP-hard ...

#### An adaptive neuroevolution-based hyperheuristic

(2020)

According to the No-Free-Lunch theorem, an algorithm that performs efficiently on any type of problem does not exist. In this
sense, algorithms that exploit problem-specific knowledge usually outperform more generic ...

#### An evolutionary discretized Lambert approach for optimal long-range rendezvous considering impulse limit

(2019-09-18)

In this paper, an approach is presented for finding the optimal long-range space rendezvous in terms of fuel and time, considering limited impulse. In this approach , the Lambert problem is expanded towards a discretized ...

#### Optimal multi-impulse space rendezvous considering limited impulse using a discretized Lambert problem combined with evolutionary algorithms

(2019-07-01)

In this paper, a direct approach is presented to tackle the multi-impulse rendezvous problem considering the impulse limit. Particularly, the standard Lambert problem is extended toward several consequential orbit transfers ...

#### Approaching the Quadratic Assignment Problem with Kernels of Mallows Models under the Hamming Distance

(2019-07)

The Quadratic Assignment Problem (QAP) is a specially challenging permutation-based np-hard combinatorial optimization problem, since instances of size $n>40$ are seldom solved using exact methods. In this sense, many ...