Josu Ceberio

Nat. Comput., March, 2024

Time to Stop and Think: What kind of research do we want to do?

[BibT_eX]

[DOI]

Borja Calvo

CoRR, 2024

2023

Model-based Gradient Search for Permutation Problems.

[BibT_eX]

[DOI]

ACM Trans. Evol. Learn. Optim., December, 2023

Comparing Two Samples Through Stochastic Dominance: A Graphical Approach.

[BibT_eX]

[DOI]

J. Comput. Graph. Stat., April, 2023

On the elusivity of dynamic optimisation problems.

[BibT_eX]

[DOI]

Swarm Evol. Comput., 2023

Trajectory optimization of space vehicle in rendezvous proximity operation with evolutionary feasibility conserving techniques.

[BibT_eX]

[DOI]

Abolfazl Shirazi

Eng. Appl. Artif. Intell., 2023

On the Fair Comparison of Optimization Algorithms in Different Machines.

[BibT_eX]

[DOI]

CoRR, 2023

Doubly Stochastic Matrix Models for Estimation of Distribution Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2023

New Knowledge about the Elementary Landscape Decomposition for Solving the Quadratic Assignment Problem.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2023

2022

EDA++: Estimation of Distribution Algorithms With Feasibility Conserving Mechanisms for Constrained Continuous Optimization.

[BibT_eX]

[DOI]

Abolfazl Shirazi

IEEE Trans. Evol. Comput., 2022

Bayesian Performance Analysis for Algorithm Ranking Comparison.

[BibT_eX]

[DOI]

IEEE Trans. Evol. Comput., 2022

Estimation-of-Distribution Algorithms: Theory and Applications (Dagstuhl Seminar 22182).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2022

Neural Improvement Heuristics for Preference Ranking.

[BibT_eX]

[DOI]

Andoni I. Garmendia

CoRR, 2022

Neural Combinatorial Optimization: a New Player in the Field.

[BibT_eX]

[DOI]

Andoni I. Garmendia

CoRR, 2022

Analysing the Fitness Landscape Rotation for Combinatorial Optimisation.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Approaching epistemic and aleatoric uncertainty with evolutionary optimization: examples and challenges.

[BibT_eX]

[DOI]

Francisco Fernández de Vega

Juan Carlos Cortés

Oscar Garnica

José Ignacio Hidalgo

J. Manuel Velasco

Rafael-Jacinto Villanueva

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

Implementing the cumulative difference plot in the IOHanalyzer.

[BibT_eX]

[DOI]

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

Evolutionary approach to model calibration with uncertainty: an application to breast cancer growth model.

[BibT_eX]

[DOI]

Carlos Andreu-Vilarroig

Francisco Fernández de Vega

Juan Carlos Cortés

José Ignacio Hidalgo

Rafael-Jacinto Villanueva

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

2021

Exploratory analysis of the Monte Carlo tree search for solving the linear ordering problem.

[BibT_eX]

[DOI]

Andoni I. Garmendia

Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

On the symmetry of the quadratic assignment problem through elementary landscape decomposition.

[BibT_eX]

[DOI]

Xabier Benavides

Leticia Hernando

Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Towards the landscape rotation as a perturbation strategy on the quadratic assignment problem.

[BibT_eX]

[DOI]

Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

2020

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

[BibT_eX]

[DOI]

Swarm Evol. Comput., 2020

Virtual Network Function Placement Optimization With Deep Reinforcement Learning.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2020

Constrained Combinatorial Optimization with Reinforcement Learning.

[BibT_eX]

[DOI]

Ruben Solozabal

Martin Takác

CoRR, 2020

Using pairwise precedences for solving the linear ordering problem.

[BibT_eX]

[DOI]

Appl. Soft Comput., 2020

Gradient search in the space of permutations: an application for the linear ordering problem.

[BibT_eX]

[DOI]

Marco Baioletti

Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

An adaptive neuroevolution-based hyperheuristic.

[BibT_eX]

[DOI]

Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

Alternative Representations for Codifying Solutions in Permutation-Based Problems.

[BibT_eX]

[DOI]

Mikel Malagon

Ekhine Irurozki

Proceedings of the IEEE Congress on Evolutionary Computation, 2020

2019

Multi-Objectivising Combinatorial Optimisation Problems by Means of Elementary Landscape Decompositions.

[BibT_eX]

[DOI]

Evol. Comput., 2019

Evolving Neural Networks in Reinforcement Learning by means of UMDAc.

[BibT_eX]

[DOI]

Mikel Malagon

CoRR, 2019

Bayesian performance analysis for black-box optimization benchmarking.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Approaching the quadratic assignment problem with kernels of mallows models under the hamming distance.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

On the definition of dynamic permutation problems under landscape rotation.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Hybrid Heuristics for the Linear Ordering Problem.

[BibT_eX]

[DOI]

Erik Garcia

Ademir Aparecido Constantino

Proceedings of the IEEE Congress on Evolutionary Computation, 2019

2018

Algorithm 989: perm_mateda: A Matlab Toolbox of Estimation of Distribution Algorithms for Permutation-based Combinatorial Optimization Problems.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2018

A decomposition-based kernel of Mallows models algorithm for bi- and tri-objective permutation flowshop scheduling problem.

[BibT_eX]

[DOI]

Murilo Zangari

Appl. Soft Comput., 2018

Distance-based exponential probability models on constrained combinatorial optimization problems.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

Bayesian inference for algorithm ranking analysis.

[BibT_eX]

[DOI]

Borja Calvo

Ademir Aparecido Constantino

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

A Decomposition-Based Local Search Algorithm for Multi-Objective Sequence Dependent Setup Times Permutation Flowshop Scheduling.

[BibT_eX]

[DOI]

Murilo Zangari

Proceedings of the 2018 IEEE Congress on Evolutionary Computation, 2018

Are the Artificially Generated Instances Uniform in Terms of Difficulty?

[BibT_eX]

[DOI]

Aritz Pérez

Proceedings of the 2018 IEEE Congress on Evolutionary Computation, 2018

Balancing the Diversification-Intensification Trade-off Using Mixtures of Probability Models.

[BibT_eX]

[DOI]

Joan Alza

Borja Calvo

Proceedings of the 2018 IEEE Congress on Evolutionary Computation, 2018

Distance-Based Exponential Probability Models for Constrained Combinatorial Problems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Artificial Intelligence, 2018

2017

Evolutionary algorithms to optimize low-thrust trajectory design in spacecraft orbital precession mission.

[BibT_eX]

[DOI]

Abolfazl Shirazi

Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017

Are we generating instances uniformly at random?

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017

A square lattice probability model for optimising the Graph Partitioning Problem.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017

2016

Bayesian optimization for parameter tuning in evolutionary algorithms.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2016

A Note on the Boltzmann Distribution and the Linear Ordering Problem.

[BibT_eX]

[DOI]

Proceedings of the Advances in Artificial Intelligence, 2016

2015

The linear ordering problem revisited.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

A review of distances for the Mallows and Generalized Mallows estimation of distribution algorithms.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2015

Kernels of Mallows Models for Solving Permutation-based Problems.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Mixtures of Generalized Mallows models for solving the quadratic assignment problem.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2015

Multi-objectivising the Quadratic Assignment Problem by Means of an Elementary Landscape Decomposition.

[BibT_eX]

[DOI]

Proceedings of the Advances in Artificial Intelligence, 2015

2014

A Distance-Based Ranking Model Estimation of Distribution Algorithm for the Flowshop Scheduling Problem.

[BibT_eX]

[DOI]

IEEE Trans. Evol. Comput., 2014

Extending distance-based ranking models in estimation of distribution algorithms.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2014

2013

Understanding Instance Complexity in the Linear Ordering Problem.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Data Engineering and Automated Learning - IDEAL 2013, 2013

The Plackett-Luce ranking model on permutation-based optimization problems.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2013

2012

A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems.

[BibT_eX]

[DOI]

Prog. Artif. Intell., 2012

2011

Introducing the Mallows Model on Estimation of Distribution Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Neural Information Processing - 18th International Conference, 2011

A preliminary study on EDAs for permutation problems based on marginal-based models.

[BibT_eX]

[DOI]