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
  1. A Large Population Island Framework for the Unconstrained Binary Quadratic Problem  |  Computers and Operations Research 168: 106684  |  Elsevier  |  2024 (with O. Goudet, J.K. Hao)
  2. Expansion-based Hill-Climbing  |  Information Sciences 649  |  Elsevier  |  2023 (with S. Tari, M. Basseur)
  3. From Fitness Landscapes Evolution to Automatic Local Search Algorithm Generation  |  International Transactions in Operational Research 29(5) 2737-2760  |  Wiley  |  2022 (with V. Hénaux, F. Saubion)
  4. Partial Neighborhood Local Searches  |  International Transactions in Operational Research 29(5) 2761-2788  |  Wiley  |  2022 (avec S. Tari, M. Basseur)
  5. 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)
  6. 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
  7. 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
  8. Simulating Non Stationary Operators in Search Algorithms  |  Applied Soft Computing 38:257-268  |  Elsevier  |  2016 (with F. Lardeux, F. Saubion)  |  pdf
  9. Climbing Combinatorial Fitness Landscapes  |  Applied Soft Computing 30:688-704  |  Elsevier  |  2015 (with M. Basseur)
  10. Comparative genomics of protoploid Saccharomycetaceae  |  Genome Research 19:1696-1709  |  CSHL Press  |  2009 (with the Genolevures consortium)  |  html   pdf
  11. 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
  12. 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
  13. 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
  14. Emergence of Strategies for Univariate Estimation-of-Distribution Algorithms with Evolved Neural Networks.  |  GECCO 2024 (with O. Goudet, F. Saubion, S. Verel)
  15. Emergence of New Local Search Algorithms with Neuro-evolution  |  EvoCOP 2024 (with O. Goudet, M.S. Amri Sakhri, F. Saubion)
  16. Evolution of Deterministic Hill-climbers  |  ICTAI 2020 (with V. Hénaux, F. Saubion)
  17. Evolving Search Trajectories  |  GECCO 2020 (with V. Hénaux, F. Saubion)
  18. Evolving Fitness Landscapes with Complementary Fitness Functions  |  EA 2019 (with V. Hénaux, F. Saubion)
  19. Worst Improvement based Iterated Local Search  |  EvoCOP 2018 (with S. Tari, M. Basseur)  |  best paper |  pdf
  20. Sampled Walk and Binary Fitness Landscapes Exploration  |  EA 2017 (with S. Tari, M. Basseur) |  pdf
  21. Experiments on greedy and local search heuristics for d–dimensional hypervolume subset selection  |  GECCO 2016 (with M. Basseur, B. Derbel, A. Liefooghe)  |  pdf
  22. Toward the Design of Efficient Move Strategies for Local Search  |  GECCO 2016 (with S. Tari, M. Basseur)
  23. 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
  24. Empirical Analysis of Operators for Permutation Based Problems  |  LION 2015 (with P. Desport, M. Basseur, F. Lardeux, F. Saubion)  |  pdf
  25. Exploring non-neutral Landscapes with neutrality-based Local Search  |  LION 2015 (with M. Basseur, H. Traverson)  |  pdf
  26. On the Attainability of NK Landscapes Global Optima  |  SOCS 2014 (with M. Basseur, F. Lardeux, F. Saubion, V. Vigneron)  |  pdf
  27. On the Efficiency of Worst Improvement for Climbing NK Landscapes  |  GECCO 2014 (with M. Basseur)  |  pdf
  28. On Set-based Local Search for Multiobjective Combinatorial Optimization  |  GECCO 2013 (with M. Basseur, A. Liefooghe, S. Verel)  |  pdf
  29. Hill-climbing Strategies on Various Landscapes: An Empirical Comparison  |  GECCO 2013 (with M. Basseur)  |  pdf
  30. Non Stationary Operators Selection with Island Models  |  GECCO 2013 (with C. Candan, F. Lardeux, F. Saubion)  |  pdf
  31. Parameter Setting with Dynamic Island Models  |  LION 2013 (with C. Candan, F. Lardeux, F. Saubion)
  32. Hill-Climbing Behavior on Quantized NK Landscapes  |  LION 2013 (with M. Basseur)
  33. A Dynamic Island Model for Adaptive Operator Selection  |  GECCO 2012 (with C. Candan, F. Lardeux, F. Saubion)  |  pdf
  34. Minimum Multiple Characterization of Biological Data using Partially Defined Boolean Formulas  |  SAC 2012 (with F. Chhel, F. Lardeux, F. Saubion)  |  pdf
  35. Autonomous Local Search Algorithms with Island Representation  |  LION 2012 (with F. Lardeux)
  36. Experimental Approach for Bacterial Strains Characterization  |  EVOBIO 2011 (with F. Chhel, F. Lardeux, F. Saubion, G. Hunault, T. Boureau)
  37. Optimal One-Max Strategy with Dynamic Island Models  |  ICTAI 2011 (with F. Lardeux)
  38. The Bacterial Strains Characterization Problem  |  SAC 2011 (with F. Chhel, A. Lafosse, F. Lardeux, F. Saubion, G. Hunault, T. Bourreau)
  39. A Dynamic Island-Based Genetic Algorithms Framework  |  SEAL 2010 (with F. Lardeux)  |  pdf
  40. Swarming Along the Evolutionary Branches Sheds Light on Genome Rearrangement Scenarios  |  GECCO 2009 (with N. Vyahhi, M. Nikolski, D.J. Sherman)  |  pdf
  41. A Memetic Algorithm for Phylogenetic Reconstruction with Maximum Parsimony  |  EVOBIO 2009 (with J.M. Richer, J.K. Hao)  |  pdf
  42. An Efficient Probabilistic Population-based Descent for the Median Genome Problem  |  GECCO 2008 (with M. Nikolski, D.J. Sherman)  |  best paper nominee  |  pdf
  43. A Distance-based Information Preservation Tree Crossover for the Maximum Parsimony Problem  |  PPSN 2006 (with J.M. Richer, J.K. Hao)  |  pdf
  44. Local Search for the Maximum Parsimony Problem  |  ICNC 2005 (with J.M. Richer, J.K. Hao)  |  pdf

--- Version française ici ---