Matthieu Basseur

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 15

Top Topics

Fitness Landscape

Top Venues

Appl. Soft Comput.

Publications

Rong-Qiang Zeng, Matthieu Basseur, Li-Yuan Xue
Multi-objective Path Relinking Algorithm for Solving Bi-objective Flowshop Scheduling Problem. ICIC (1) (2024)
Matthieu Basseur, Arnaud Liefooghe, Sara Tari
MOW-P: A Simple yet Efficient Partial Neighborhood Walk for Multiobjective Optimization. CEC (2024)
Rong-Qiang Zeng, Li-Yuan Xue, Matthieu Basseur
Detecting Community Structure in Complex Networks with Backbone Guided Search Algorithm. ICIC (1) (2023)
Sara Tari, Matthieu Basseur, Adrien Goëffon
Expansion-based Hill-climbing. Inf. Sci. 649 (2023)
Sara Tari, Gabriela Ochoa, Matthieu Basseur, Sébastien Vérel
On the Global Structure of PUBOi Fitness Landscapes. GECCO Companion (2023)
Rong-Qiang Zeng, Matthieu Basseur
Neighborhood Combination Strategies for Solving the Bi-objective Max-Bisection Problem. ICIC (1) (2022)
Sara Tari, Matthieu Basseur, Adrien Goëffon
Partial neighborhood local searches. Int. Trans. Oper. Res. 29 (5) (2022)
Sara Tari, Matthieu Basseur, Adrien Goëffon
On the use of (1, λ )-evolution strategy as efficient local search mechanism for discrete optimization: a behavioral analysis. Nat. Comput. 20 (3) (2021)
Brahim Chabane, Matthieu Basseur, Jin-Kao Hao
Lorenz dominance based algorithms to solve a practical multiobjective problem. Comput. Oper. Res. 104 (2019)
Sara Tari, Matthieu Basseur, Adrien Goëffon
Worst Improvement Based Iterated Local Search. EvoCOP (2018)
Imen Ben Mansour, Matthieu Basseur, Frédéric Saubion
A multi-population algorithm for multi-objective knapsack problem. Appl. Soft Comput. 70 (2018)
Sara Tari, Matthieu Basseur, Adrien Goëffon
Sampled Walk and Binary Fitness Landscapes Exploration. Artificial Evolution (2017)
Brahim Chabane, Matthieu Basseur, Jin-Kao Hao
R2-IBMOLS applied to a practical case of the multiobjective knapsack problem. Expert Syst. Appl. 71 (2017)
Sara Tari, Matthieu Basseur, Adrien Goëffon
Toward the Design of Efficient Pivoting Rules for Local Search. GECCO (Companion) (2016)
Matthieu Basseur, Bilel Derbel, Adrien Goëffon, Arnaud Liefooghe
dimensional Hypervolume Subset Selection. GECCO (2016)
Pierre Desport, Matthieu Basseur, Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion
Empirical Analysis of Operators for Permutation Based Problems. LION (2015)
Matthieu Basseur, Adrien Goëffon, Hugo Traverson
Exploring Non-neutral Landscapes with Neutrality-Based Local Search. LION (2015)
Brahim Chabane, Matthieu Basseur, Jin-Kao Hao
A Practical Case of the Multiobjective Knapsack Problem: Design, Modelling, Tests and Analysis. LION (2015)
Matthieu Basseur, Adrien Goëffon
Climbing combinatorial fitness landscapes. Appl. Soft Comput. 30 (2015)
Matthieu Basseur, Adrien Goëffon
On the efficiency of worst improvement for climbing NK-landscapes. GECCO (2014)
Matthieu Basseur, Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion, Vincent Vigneron
On the Attainability of NK Landscapes Global Optima. SOCS (2014)
Rong-Qiang Zeng, Matthieu Basseur, Jin-Kao Hao
Hypervolume-Based Multi-Objective Path Relinking Algorithm. EMO (2013)
Rong-Qiang Zeng, Matthieu Basseur, Jin-Kao Hao
Solving bi-objective flow shop problem with hybrid path relinking algorithm. Appl. Soft Comput. 13 (10) (2013)
Matthieu Basseur, Adrien Goëffon
Hill-climbing strategies on various landscapes: an empirical comparison. GECCO (2013)
Matthieu Basseur, Adrien Goëffon
Hill-Climbing Behavior on Quantized NK-Landscapes. LION (2013)
Matthieu Basseur, Adrien Goëffon, Arnaud Liefooghe, Sébastien Vérel
On set-based local search for multiobjective combinatorial optimization. GECCO (2013)
Matthieu Basseur, Rong-Qiang Zeng, Jin-Kao Hao
Hypervolume-based multi-objective local search. Neural Comput. Appl. 21 (8) (2012)
Arnaud Liefooghe, Matthieu Basseur, Jérémie Humeau, Laetitia Jourdan, El-Ghazali Talbi
On optimizing a bi-objective flowshop scheduling problem in an uncertain environment. Comput. Math. Appl. 64 (12) (2012)
El-Ghazali Talbi, Matthieu Basseur, Antonio J. Nebro, Enrique Alba
Multi-objective optimization using metaheuristics: non-standard algorithms. Int. Trans. Oper. Res. 19 (1-2) (2012)
Matthieu Basseur, Arnaud Liefooghe, Khoi N. Le, Edmund K. Burke
The efficiency of indicator-based local search for multi-objective combinatorial optimisation problems. J. Heuristics 18 (2) (2012)
Laetitia Jourdan, Matthieu Basseur, El-Ghazali Talbi
Hybridizing exact methods and metaheuristics: A taxonomy. Eur. J. Oper. Res. 199 (3) (2009)
Arnaud Liefooghe, Laetitia Jourdan, Matthieu Basseur, El-Ghazali Talbi
Métaheuristiques pour le flow-shop de permutation bi-objectif stochastique. Rev. d'Intelligence Artif. 22 (2) (2008)
Arnaud Liefooghe, Laetitia Jourdan, Matthieu Basseur, El-Ghazali Talbi, Edmund K. Burke
Metaheuristics for the Bi-objective Ring Star Problem. EvoCOP (2008)
Matthieu Basseur, Edmund K. Burke
Indicator-based multi-objective local search. IEEE Congress on Evolutionary Computation (2007)
Arnaud Liefooghe, Matthieu Basseur, Laetitia Jourdan, El-Ghazali Talbi
Combinatorial Optimization of Stochastic Multi-objective Problems: An Application to the Flow-Shop Scheduling Problem. EMO (2006)
Matthieu Basseur
Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. 4OR 4 (3) (2006)
Matthieu Basseur, Eckart Zitzler
A Preliminary Study on Handling Uncertainty in Indicator-Based Multiobjective Optimization. EvoWorkshops (2006)
Arnaud Liefooghe, Matthieu Basseur, Laetitia Jourdan, El-Ghazali Talbi
ParadisEO-MOEO: A Framework for Evolutionary Multi-objective Optimization. EMO (2006)
Matthieu Basseur, Franck Seynhaeve, El-Ghazali Talbi
Path Relinking in Pareto Multi-objective Genetic Algorithms. EMO (2005)
Matthieu Basseur, Julien Lemesre, Clarisse Dhaenens, El-Ghazali Talbi
Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop Problem. WEA (2004)
Matthieu Basseur, Franck Seynhaeve, El-Ghazali Talbi
Design of multi-objective evolutionary algorithms: application to the flow-shop scheduling problem. IEEE Congress on Evolutionary Computation (2002)