Jesús-Adolfo Mejía-de-Dios

Jesús-Adolfo Mejía-de-Dios
Universidad Veracruzana | UV · Departamento de Inteligencia Artificial

PhD Student

About

8
Publications
1,037
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
25
Citations
Introduction
Research Interest in: Bilevel optimization, Global Optimization, Evolutionary Computation, Automated Parameter Tuning and Machine Learning. https://bi-level.org
Education
August 2016 - August 2018
Universidad Veracruzana
Field of study
  • Artificial Intelligence
August 2011 - August 2016
Universidad Veracruzana
Field of study
  • Mathematics

Publications

Publications (8)
Article
This work presents a study about a special class of infeasible solutions called here as pseudo-feasible solutions in bilevel optimization. This work is focused on determining how such solutions can affect the performance of an evolutionary algorithm. After its formal definition, and based on theoretical results, two conditions to detect and deal wi...
Article
Full-text available
This work presents a proposal for the automated parameter tuning problem (APTP) modeled as a bilevel optimization problem. Different definitions and theoretical results are given in order to formalize the APTP in the context of this hierarchical optimization problem. The obtained bilevel optimization problem is solved via a population-based algorit...
Chapter
Full-text available
Physical phenomena have been the inspiration for proposing different optimization methods such as electro-search algorithm, central force optimization, and charged system search among others. This work presents a new optimization algorithm based on some principles from physics and mechanics, which is called Evolutionary Centers Algorithm (ECA). We...

Projects

Project (1)
Project
Design of a version of the ECA algorithm to solve bilevel optimization problems with competitive results and with a lower number of evaluations than metaheuristic algorithms of the state of the art.