Browsing by Author "Ceberio, J."
Now showing items 117 of 17

An adaptive neuroevolutionbased hyperheuristic
Arza, E.; Ceberio, J.; Pérez, A.; Irurozki, E. (2020)According to the NoFreeLunch theorem, an algorithm that performs efficiently on any type of problem does not exist. In this sense, algorithms that exploit problemspecific knowledge usually outperform more generic ... 
Approaching the Quadratic Assignment Problem with Kernels of Mallows Models under the Hamming Distance
Arza, E.; Ceberio, J.; Pérez, A.; Irurozki, E. (201907)The Quadratic Assignment Problem (QAP) is a specially challenging permutationbased nphard combinatorial optimization problem, since instances of size $n>40$ are seldom solved using exact methods. In this sense, many ... 
Are the artificially generated instances uniform in terms of difficulty?
Pérez, A.; Ceberio, J.; Lozano, J.A. (201806)In the field of evolutionary computation, it is usual to generate artificial benchmarks of instances that are used as a testbed to determine the performance of the algorithms at hand. In this context, a recent work on ... 
Bayesian inference for algorithm ranking analysis
Calvo, B.; Ceberio, J.; Lozano, J.A. (20180830)The statistical assessment of the empirical comparison of algorithms is an essential step in heuristic optimization. Classically, researchers have relied on the use of statistical tests. However, recently, concerns about ... 
Distancebased exponential probability models on constrained combinatorial optimization problems
Ceberio, J.; Mendiburu, A.; Lozano, J.A. (20180830)Estimation of distribution algorithms have already demonstrated their utility when solving a broad range of combinatorial problems. However, there is still room for methodological improvements when approaching constrained ... 
Evolutionary algorithms to optimize lowthrust trajectory design in spacecraft orbital precession mission
Shirazi, A.; Ceberio, J.; Lozano, J.A. (20170606)In space environment, perturbations make the spacecraft lose its predefined orbit in space. One of these undesirable changes is the inplane rotation of space orbit, denominated as orbital precession. To overcome this ... 
An evolutionary discretized Lambert approach for optimal longrange rendezvous considering impulse limit
Shirazi, A.; Ceberio, J.; Lozano, J.A. (20190918)In this paper, an approach is presented for finding the optimal longrange space rendezvous in terms of fuel and time, considering limited impulse. In this approach , the Lambert problem is expanded towards a discretized ... 
Hybrid Heuristics for the Linear Ordering Problem
Garcia, E.; Ceberio, J.; Lozano, J.A. (2019)The linear ordering problem (LOP) is one of the classical NPHard combinatorial optimization problems. Motivated by the difficulty of solving it up to optimality, in recent decades a great number of heuristic and metaheuristic ... 
Kernels of Mallows Models under the Hamming Distance for solving the Quadratic Assignment Problem
Arza, E.; Pérez, A.; Irurozki, E.; Ceberio, J. (202007)The Quadratic Assignment Problem (QAP) is a wellknown permutationbased combinatorial optimization problem with real applications in industrial and logistics environments. Motivated by the challenge that this NPhard ... 
Multiobjectivising Combinatorial Optimisation Problems by means of Elementary Landscape Decompositions
Ceberio, J.; Calvo, B.; Mendiburu, A.; Lozano, J.A. (201712)In the last decade, many works in combinatorial optimisation have shown that, due to the advances in multiobjective optimisation, the algorithms from this field could be used for solving singleobjective problems as well. ... 
A note on the Boltzmann distribution and the linear ordering problem
Ceberio, J.; Mendiburu, A.; Lozano, J.A. (20161001)The Boltzmann distribution plays a key role in the field of optimization as it directly connects this field with that of probability. Basically, given a function to optimize, the Boltzmann distribution associated to this ... 
On the fair comparison of optimization algorithms in different machines
Arza, E.; 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 ... 
On the symmetry of the Quadratic Assignment Problem through Elementary Landscape Decomposition
Benavides, X.; Ceberio, J.; Hernando, L. (202107)When designing metaheuristic 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 ... 
Optimal multiimpulse space rendezvous considering limited impulse using a discretized Lambert problem combined with evolutionary algorithms
Shirazi, A.; Ceberio, J.; Lozano, J.A. (20190701)In this paper, a direct approach is presented to tackle the multiimpulse rendezvous problem considering the impulse limit. Particularly, the standard Lambert problem is extended toward several consequential orbit transfers ... 
perm mateda: A matlab toolbox of estimation of distribution algorithms for permutationbased combinatorial optimization problems
Irurozki, E.; Ceberio, J.; Santamaria, J.; Santana, R.; Mendiburu, A. (2018)Permutation problems are combinatorial optimization problems whose solutions are naturally codified as permutations. Due to their complexity, motivated principally by the factorial cardinality of the search space of ... 
Simulation Framework for Orbit Propagation and Space Trajectory Visualization
Shirazi, A.; 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 Earthorbiting satellites are provided, which ... 
Spacecraft Trajectory Optimization: A review of Models, Objectives, Approaches and Solutions
Shirazi, A.; Ceberio, J.; Lozano, J.A. (2018)This article is a survey paper on solving spacecraft trajectory optimization problems. The solving process is decomposed into four key steps of mathematical modeling of the problem, defining the objective functions, ...