Search
Now showing items 1-10 of 22
Trajectory optimization of space vehicle in rendezvous proximity operation with evolutionary feasibility conserving techniques
Shirazi, A.
; Ceberio, J.; Lozano, J.A. (2022-10-09)
; Ceberio, J.; Lozano, J.A. (2022-10-09)
In this paper, a direct approach is developed for discovering optimal transfer trajectories of close-range rendezvous of satellites considering disturbances in elliptical orbits. The control vector representing the inputs ...
Implementing the Cumulative Difference Plot in the IOHanalyzer
Arza, E.; Ceberio, J.; Irurozki, E.; Pérez, A. (2022-07)
; Ceberio, J.; Irurozki, E.; Pérez, A. (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
Shirazi, A.; Ceberio, J.; Lozano, J.A. (2022-02-25)
; Ceberio, J.; Lozano, J.A. (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 ...
Statistical assessment of experimental results: a graphical approach for comparing algorithms
Arza, E.; Ceberio, J.; Irurozki, E.; Pérez, A. (2021-08-25)
; Ceberio, J.; Irurozki, E.; Pérez, A. (2021-08-25)
Non-deterministic measurements are common in real-world scenarios: the performance of a stochastic optimization algorithm or the total reward of a reinforcement learning agent in a chaotic environment are just two examples ...
On the symmetry of the Quadratic Assignment Problem through Elementary Landscape Decomposition
Benavides, X.; Ceberio, J.; Hernando, L. (2021-07)
; Ceberio, J.; Hernando, L. (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 ...
On the fair comparison of optimization algorithms in different machines
Arza, E.; Pérez, A.; Ceberio, J.; Irurozki, E. (2021)
; Pérez, A.; Ceberio, J.; Irurozki, E. (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 ...
Simulation Framework for Orbit Propagation and Space Trajectory Visualization
Shirazi, A.; Ceberio, J.; Lozano, J.A. (2021)
; Ceberio, J.; Lozano, J.A. (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 ...
Kernels of Mallows Models under the Hamming Distance for solving the Quadratic Assignment Problem
Arza, E.; Pérez, A.; Irurozki, E.; Ceberio, J. (2020-07)
; Pérez, A.; Irurozki, E.; Ceberio, J. (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 ...
Alternative Representations for Codifying Solutions in Permutation-Based Problems
(2020-07-01)
Since their introduction, Estimation of Distribution Algorithms (EDAs) have proved to be very competitive algorithms to solve many optimization problems. However, despite recent developments, in the case of permutation-based ...
An adaptive neuroevolution-based hyperheuristic
Arza, E.; Ceberio, J.; Pérez, A.; Irurozki, E. (2020)
; Ceberio, J.; Pérez, A.; Irurozki, E. (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 ...