Adrien Goëffon
- Full professor (Computer Science), University of Angers (France).
- Research interests : evolutionary computation, metaheuristics, local search, fitness landscapes, discrete optimization, soft computing, neuroevolution.
Contact
- E-mail: adrien.goeffon@univ-angers.fr
- Postal mail: Adrien Goëffon, UNIV Angers - UFR sciences, 2 bd Lavoisier, 49045 Angers cedex 1, FRANCE
- Phone: +33 2 41 73 50 78
Selected publications
- Journal papers
- A Large Population Island Framework for the Unconstrained Binary Quadratic Problem | Computers and Operations Research (to appear) | Elsevier | 2024 (with O. Goudet, J.K. Hao)
- Expansion-based Hill-Climbing | Information Sciences 649 | Elsevier | 2023 (with S. Tari, M. Basseur)
- From Fitness Landscapes Evolution to Automatic Local Search Algorithm Generation | International Transactions in Operational Research 29(5) 2737-2760 | Wiley | 2021 (with V. Hénaux, F. Saubion)
- Partial Neighborhood Local Searches | International Transactions in Operational Research 29(5) 2761-2788 | Wiley | 2021 (avec S. Tari, M. Basseur)
- On the Use of (1,λ)-Evolution Strategy as Efficient Local Search Mechanism for Discrete Optimization: A Behavioral Analysis | Natural Computing 20(3): 345-361 | Springer | 2021 (with S. Tari, M. Basseur)
- PUSH: A generalized operator for the Maximum Vertex Weight Clique Problem | European Journal of Operational Research 257(1): 41-54 | Elsevier | 2017 (with Y. Zhou, J.K. Hao) | pdf
- A Three-phased Local Search Approach for the Clique Partitioning Problem | Journal of Combinatorial Optimization 32(2): 469-491 | Springer | 2016 (with Y. Zhou, J.K. Hao) | pdf
- Simulating Non Stationary Operators in Search Algorithms | Applied Soft Computing 38:257-268 | Elsevier | 2016 (with F. Lardeux, F. Saubion) | pdf
- Climbing Combinatorial Fitness Landscapes | Applied Soft Computing 30:688-704 | Elsevier | 2015 (with M. Basseur)
- Comparative genomics of protoploid Saccharomycetaceae | Genome Research 19:1696-1709 | CSHL Press | 2009 (with the Genolevures consortium) | html pdf
- Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem | Transactions on Computational Biology and Bioinformatics 5(1):136-145 | IEEE/ACM | 2008 (with J.M. Richer, J.K. Hao) | pdf
- Book chapters
- An Extended Neighborhood Vision for Hill-climbing Move Strategy Design | Recent Developments of Metaheuristics (ed: L. Amodeo, E-G. Talbi, F. Yalaoui) | Springer | 2018 (with S. Tari, M. Basseur) | book
- Heuristic Methods for Phylogenetic Reconstruction with Maximum Parsimony | Algorithms In Computational Molecular Biology: Techniques, Approaches and Applications (ed: M. Elloumi, Y. Zomaya) | Wiley | 2011 (with J.M. Richer, J.K. Hao) | book
- Fully refereed conference papers
- Emergence of New Local Search Algorithms with Neuro-evolution | EvoCOP 2024 (with O. Goudet, M.S. Amri Sakhri, F. Saubion)
- Evolution of Deterministic Hill-climbers | ICTAI 2020 (with V. Hénaux, F. Saubion)
- Evolving Search Trajectories | GECCO 2020 (with V. Hénaux, F. Saubion)
- Evolving Fitness Landscapes with Complementary Fitness Functions | EA 2019 (with V. Hénaux, F. Saubion)
- Worst Improvement based Iterated Local Search | EvoCOP 2018 (with S. Tari, M. Basseur) | best paper | pdf
- Sampled Walk and Binary Fitness Landscapes Exploration | EA 2017 (with S. Tari, M. Basseur) | pdf
- Experiments on greedy and local search heuristics for d–dimensional hypervolume subset selection | GECCO 2016 (with M. Basseur, B. Derbel, A. Liefooghe) | pdf
- Toward the Design of Efficient Move Strategies for Local Search | GECCO 2016 (with S. Tari, M. Basseur)
- Combining Mutation and Recombination to Improve a Distributed Model of Adaptive Operator Selection | EA 2015 (with J.A. Soria-Alcaraz, G. Ochoa, F. Lardeux, F. Saubion) | pdf
- Empirical Analysis of Operators for Permutation Based Problems | LION 2015 (with P. Desport, M. Basseur, F. Lardeux, F. Saubion) | pdf
- Exploring non-neutral Landscapes with neutrality-based Local Search | LION 2015 (with M. Basseur, H. Traverson) | pdf
- On the Attainability of NK Landscapes Global Optima | SOCS 2014 (with M. Basseur, F. Lardeux, F. Saubion, V. Vigneron) | pdf
- On the Efficiency of Worst Improvement for Climbing NK Landscapes | GECCO 2014 (with M. Basseur) | pdf
- On Set-based Local Search for Multiobjective Combinatorial Optimization | GECCO 2013 (with M. Basseur, A. Liefooghe, S. Verel) | pdf
- Hill-climbing Strategies on Various Landscapes: An Empirical Comparison | GECCO 2013 (with M. Basseur) | pdf
- Non Stationary Operators Selection with Island Models | GECCO 2013 (with C. Candan, F. Lardeux, F. Saubion) | pdf
- Parameter Setting with Dynamic Island Models | LION 2013 (with C. Candan, F. Lardeux, F. Saubion)
- Hill-Climbing Behavior on Quantized NK Landscapes | LION 2013 (with M. Basseur)
- A Dynamic Island Model for Adaptive Operator Selection | GECCO 2012 (with C. Candan, F. Lardeux, F. Saubion) | pdf
- Minimum Multiple Characterization of Biological Data using Partially Defined Boolean Formulas | SAC 2012 (with F. Chhel, F. Lardeux, F. Saubion) | pdf
- Autonomous Local Search Algorithms with Island Representation | LION 2012 (with F. Lardeux)
- Experimental Approach for Bacterial Strains Characterization | EVOBIO 2011 (with F. Chhel, F. Lardeux, F. Saubion, G. Hunault, T. Boureau)
- Optimal One-Max Strategy with Dynamic Island Models | ICTAI 2011 (with F. Lardeux)
- The Bacterial Strains Characterization Problem | SAC 2011 (with F. Chhel, A. Lafosse, F. Lardeux, F. Saubion, G. Hunault, T. Bourreau)
- A Dynamic Island-Based Genetic Algorithms Framework | SEAL 2010 (with F. Lardeux) | pdf
- Swarming Along the Evolutionary Branches Sheds Light on Genome Rearrangement Scenarios | GECCO 2009 (with N. Vyahhi, M. Nikolski, D.J. Sherman) | pdf
- A Memetic Algorithm for Phylogenetic Reconstruction with Maximum Parsimony | EVOBIO 2009 (with J.M. Richer, J.K. Hao) | pdf
- An Efficient Probabilistic Population-based Descent for the Median Genome Problem | GECCO 2008 (with M. Nikolski, D.J. Sherman) | best paper nominee | pdf
- A Distance-based Information Preservation Tree Crossover for the Maximum Parsimony Problem | PPSN 2006 (with J.M. Richer, J.K. Hao) | pdf
- Local Search for the Maximum Parsimony Problem | ICNC 2005 (with J.M. Richer, J.K. Hao) | pdf
--- Version française ici ---