Mathieu Brévilliers
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mathieu Brévilliers has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Julien Lepagnot
Université de Haute-Alsace, IRIMAS UR 7499, Mulhouse, France
8 shared publications - Lhassane Idoumghar
IRIMAS, Université de Haute-Alsace, Mulhouse, France
8 shared publications - Julien Kritter
IRIMAS, Université de Haute-Alsace, 12 Rue des Frères Lumière, 68 093 Mulhouse, France
3 shared publications Lhassane Idoumghar
3 shared publicationsJulien Lepagnot
2 shared publications- Mahmoud Golabi
IRIMAS, Université de Haute-Alsace, Mulhouse, France
2 shared publications
Latest Publications
- 24 January 2024
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 188
Surrogate-assisted metaheuristics for the facility location problem with distributed demands on network edges
- 24 January 2024
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 188
Surrogate-assisted metaheuristics for the facility location problem with distributed demands on network edges
- 23 March 2022
- Published by Elsevier in Applied Soft Computing
- Vol. 121
Ensembles strategies for backtracking search algorithm with application to engineering design optimization problems
- 23 March 2022
- Published by Elsevier in Applied Soft Computing
- Vol. 121
Ensembles strategies for backtracking search algorithm with application to engineering design optimization problems
- 1 October 2021
- Published by Elsevier in Applied Soft Computing
- Vol. 110
On the performance of deep learning for numerical optimization: An application to protein structure prediction
- 1 October 2021
- Published by Elsevier in Applied Soft Computing
- Vol. 110
On the performance of deep learning for numerical optimization: An application to protein structure prediction
- Open Access
- 8 July 2021
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 55 (4) , 2069-2091
On the computational cost of the set cover approach for the optimal camera placement problem and possible set-cover-inspired trade-offs for surveillance infrastructure design
The 𝒩𝒫-hard minimum set cover problem (SCP) is a very typical model to use when attempting to formalise optimal camera placement (OCP) applications. In a generic form, the OCP problem relates to the positioning of individual cameras such that the overall network is able to cover a given area while meeting a set of application-specific requirements (image quality, redundancy, ...) and optimising an objective, typically minimum cost or maximum coverage. In this paper, we focus on an application called global or persistent surveillance: camera networks which ensure full coverage of a given area. As preliminary work, an instance generation pipeline is proposed to create OCP instances from real-world data and solve them using existing literature. The computational cost of both the instance generation process and the solving algorithms however highlights a need for more efficient methods for decision makers to use in real-world settings. In this paper, we therefore propose to review the suitability of the approach, and more specifically to question two key elements: the impact of sampling frequencies and the importance of rigid full-coverage constraints. The results allow us to quickly provide decision makers with an overview of available solutions and trade-offs.
- 8 July 2021
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 55 (4) , 2069-2091
Open AccessOn the computational cost of the set cover approach for the optimal camera placement problem and possible set-cover-inspired trade-offs for surveillance infrastructure design
The 𝒩𝒫-hard minimum set cover problem (SCP) is a very typical model to use when attempting to formalise optimal camera placement (OCP) applications. In a generic form, the OCP problem relates to the positioning of individual cameras such that the overall network is able to cover a given area while meeting a set of application-specific requirements (image quality, redundancy, ...) and optimising an objective, typically minimum cost or maximum coverage. In this paper, we focus on an application called global or persistent surveillance: camera networks which ensure full coverage of a given area. As preliminary work, an instance generation pipeline is proposed to create OCP instances from real-world data and solve them using existing literature. The computational cost of both the instance generation process and the solving algorithms however highlights a need for more efficient methods for decision makers to use in real-world settings. In this paper, we therefore propose to review the suitability of the approach, and more specifically to question two key elements: the impact of sampling frequencies and the importance of rigid full-coverage constraints. The results allow us to quickly provide decision makers with an overview of available solutions and trade-offs.
- 1 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 106-111
An Enhanced NSGA-II for Multiobjective UAV Path Planning in Urban Environments
This paper considers multiobjective UAV path planning in a real 3D environment with the objective to find a safe energy-efficient path. An Enhanced Non-dominated Sorting Genetic Algorithm-II, called ENSGA-II, is proposed and combines several sorts of heuristic information to customize crossover and mutation operators. Furthermore, a local search and a ranking-based roulette wheel selection are incorporated for the mating procedure. Experiment results confirm that ENSGA-II has a better convergence rate and spread of solutions on several new real-world datasets. The effectiveness of the local search component is also validated on the CrazyS robot operating system (ROS) package which consists of a pelican quadcopter's modeling.
- 1 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 106-111
An Enhanced NSGA-II for Multiobjective UAV Path Planning in Urban Environments
This paper considers multiobjective UAV path planning in a real 3D environment with the objective to find a safe energy-efficient path. An Enhanced Non-dominated Sorting Genetic Algorithm-II, called ENSGA-II, is proposed and combines several sorts of heuristic information to customize crossover and mutation operators. Furthermore, a local search and a ranking-based roulette wheel selection are incorporated for the mating procedure. Experiment results confirm that ENSGA-II has a better convergence rate and spread of solutions on several new real-world datasets. The effectiveness of the local search component is also validated on the CrazyS robot operating system (ROS) package which consists of a pelican quadcopter's modeling.
- 29 April 2020
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 1-12
From Feature Selection to Continuous Optimization
- 29 April 2020
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 1-12
From Feature Selection to Continuous Optimization
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 713-720
An Eigenvector-Enhanced Parallel Adaptive Differential Evolution for Electric Motor Design
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 713-720
An Eigenvector-Enhanced Parallel Adaptive Differential Evolution for Electric Motor Design
- 12 November 2018
- Published by Emerald Publishing in Journal of Systems and Information Technology
- Vol. 20 (4) , 446-467
Hybrid differential evolution algorithms for the optimal camera placement problem
Purpose: This paper aims to investigate to what extent hybrid differential evolution (DE) algorithms can be successful in solving the optimal camera placement problem.Design/methodology/approach: This problem is stated as a unicost set covering problem (USCP) and 18 problem instances are defined according to practical operational needs. Three methods are selected from the literature to solve these instances: a CPLEX solver, greedy algorithm and row weighting local search (RWLS). Then, it is proposed to hybridize these algorithms with two hybrid DE approaches designed for combinatorial optimization problems. The first one is a set-based approach (DEset) from the literature. The second one is a new similarity-based approach (DEsim) that takes advantage of the geometric characteristics of a camera to find better solutions.Findings: The experimental study highlights that RWLS and DEsim-CPLEX are the best proposed algorithms. Both easily outperform CPLEX, and it turns out that RWLS performs better on one class of problem instances, whereas DEsim-CPLEX performs better on another class, depending on the minimal resolution needed in practice.Originality/value: Up to now, the efficiency of RWLS and the DEset approach has been investigated only for a few problems. Thus, the first contribution is to apply these methods for the first time in the context of camera placement. Moreover, new hybrid DE algorithms are proposed to solve the optimal camera placement problem when stated as a USCP. The second main contribution is the design of the DEsim approach that uses the distance between camera locations to fully benefit from the DE mutation scheme.
- 12 November 2018
- Published by Emerald Publishing in Journal of Systems and Information Technology
- Vol. 20 (4) , 446-467
Hybrid differential evolution algorithms for the optimal camera placement problem
Purpose: This paper aims to investigate to what extent hybrid differential evolution (DE) algorithms can be successful in solving the optimal camera placement problem.Design/methodology/approach: This problem is stated as a unicost set covering problem (USCP) and 18 problem instances are defined according to practical operational needs. Three methods are selected from the literature to solve these instances: a CPLEX solver, greedy algorithm and row weighting local search (RWLS). Then, it is proposed to hybridize these algorithms with two hybrid DE approaches designed for combinatorial optimization problems. The first one is a set-based approach (DEset) from the literature. The second one is a new similarity-based approach (DEsim) that takes advantage of the geometric characteristics of a camera to find better solutions.Findings: The experimental study highlights that RWLS and DEsim-CPLEX are the best proposed algorithms. Both easily outperform CPLEX, and it turns out that RWLS performs better on one class of problem instances, whereas DEsim-CPLEX performs better on another class, depending on the minimal resolution needed in practice.Originality/value: Up to now, the efficiency of RWLS and the DEset approach has been investigated only for a few problems. Thus, the first contribution is to apply these methods for the first time in the context of camera placement. Moreover, new hybrid DE algorithms are proposed to solve the optimal camera placement problem when stated as a USCP. The second main contribution is the design of the DEsim approach that uses the distance between camera locations to fully benefit from the DE mutation scheme.
- 20 March 2018
- Published by Springer Nature
- p. 115-128
A New High-Level Relay Hybrid Metaheuristic for Black-Box Optimization Problems
- 20 March 2018
- Published by Springer Nature
- p. 115-128
A New High-Level Relay Hybrid Metaheuristic for Black-Box Optimization Problems
- 1 February 2018
- Published by IACSIT Press in International Journal of Modeling and Optimization
- Vol. 8 (1) , 33-40
Parallel Preprocessing for the Optimal Camera Placement Problem
- 1 February 2018
- Published by IACSIT Press in International Journal of Modeling and Optimization
- Vol. 8 (1) , 33-40
Parallel Preprocessing for the Optimal Camera Placement Problem