Adrien Goëffon

Orcid: 0000-0001-9688-0222

According to our database1, Adrien Goëffon authored at least 42 papers between 2005 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A large population island framework for the unconstrained binary quadratic problem.
Comput. Oper. Res., 2024

Emergence of Strategies for Univariate Estimation-of-Distribution Algorithms with Evolved Neural Networks.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2024

Emergence of New Local Search Algorithms with Neuro-Evolution.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2024

2023
Expansion-based Hill-climbing.
Inf. Sci., November, 2023

2022
Partial neighborhood local searches.
Int. Trans. Oper. Res., 2022

From fitness landscapes evolution to automatic local search algorithm generation.
Int. Trans. Oper. Res., 2022

2021
On the use of (1, λ )-evolution strategy as efficient local search mechanism for discrete optimization: a behavioral analysis.
Nat. Comput., 2021

2020
Evolution of Deterministic Hill-climbers.
Proceedings of the 32nd IEEE International Conference on Tools with Artificial Intelligence, 2020

Evolving search trajectories.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

2019
Evolving Fitness Landscapes with Complementary Fitness Functions.
Proceedings of the Artificial Evolution, 2019

2018
Worst Improvement Based Iterated Local Search.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2018

2017
PUSH: A generalized operator for the Maximum Vertex Weight Clique Problem.
Eur. J. Oper. Res., 2017

Sampled Walk and Binary Fitness Landscapes Exploration.
Proceedings of the Artificial Evolution, 2017

2016
A three-phased local search approach for the clique partitioning problem.
J. Comb. Optim., 2016

Simulating non-stationary operators in search algorithms.
Appl. Soft Comput., 2016

Toward the Design of Efficient Pivoting Rules for Local Search.
Proceedings of the Genetic and Evolutionary Computation Conference, 2016

Experiments on Greedy and Local Search Heuristics for <i>d</i>dimensional Hypervolume Subset Selection.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

2015
Climbing combinatorial fitness landscapes.
Appl. Soft Comput., 2015

Empirical Analysis of Operators for Permutation Based Problems.
Proceedings of the Learning and Intelligent Optimization - 9th International Conference, 2015

Exploring Non-neutral Landscapes with Neutrality-Based Local Search.
Proceedings of the Learning and Intelligent Optimization - 9th International Conference, 2015

Combining Mutation and Recombination to Improve a Distributed Model of Adaptive Operator Selection.
Proceedings of the Artificial Evolution, 2015

2014
On the Attainability of NK Landscapes Global Optima.
Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

On the efficiency of worst improvement for climbing NK-landscapes.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

2013
Parameter Setting with Dynamic Island Models.
Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013

Hill-Climbing Behavior on Quantized NK-Landscapes.
Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013

Non stationary operator selection with island models.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

On set-based local search for multiobjective combinatorial optimization.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Hill-climbing strategies on various landscapes: an empirical comparison.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

2012
Minimum multiple characterization of biological data using partially defined boolean formulas.
Proceedings of the ACM Symposium on Applied Computing, 2012

Autonomous Local Search Algorithms with Island Representation.
Proceedings of the Learning and Intelligent Optimization - 6th International Conference, 2012

A dynamic island model for adaptive operator selection.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

2011
The bacterial strains characterization problem.
Proceedings of the 2011 ACM Symposium on Applied Computing (SAC), TaiChung, Taiwan, March 21, 2011

Optimal One-Max Strategy with Dynamic Island Models.
Proceedings of the IEEE 23rd International Conference on Tools with Artificial Intelligence, 2011

Experimental Approach for Bacterial Strains Characterization.
Proceedings of the Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics, 2011

2010
A Dynamic Island-Based Genetic Algorithms Framework.
Proceedings of the Simulated Evolution and Learning - 8th International Conference, 2010

2009
Swarming along the evolutionary branches sheds light on genome rearrangement scenarios.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

A Memetic Algorithm for Phylogenetic Reconstruction with Maximum Parsimony.
Proceedings of the Evolutionary Computation, 2009

2008
Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem.
IEEE ACM Trans. Comput. Biol. Bioinform., 2008

An efficient probabilistic population-based descent for the median genome problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008

2006
Nouvelles heuristiques de voisinage et mémétiques pour le problème Maximum de Parcimonie. (New neighborhood and memetic heuristics for theMaximum Parsimony problem).
PhD thesis, 2006

A Distance-Based Information Preservation Tree Crossover for the Maximum Parsimony Problem.
Proceedings of the Parallel Problem Solving from Nature, 2006

2005
Local Search for the Maximum Parsimony Problem.
Proceedings of the Advances in Natural Computation, First International Conference, 2005


  Loading...