Miguel Ángel González
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Miguel Ángel González has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Camino Rodríguez Vela
University of Oviedo, Gijón, Spain
12 shared publications - Ramiro Varela
Department of Computer Science, University of Oviedo, Gijón, Spain
10 shared publications - Angelo Oddi
CNR—Consiglio Nazionale delle Ricerche
7 shared publications Ramiro Varela
University of Oviedo
6 shared publicationsCamino R. Vela
5 shared publications- Inés González-Rodríguez
Dep. de Matemáticas, Estadística y Computación, Universidad de Cantabria. Santander, Spain
5 shared publications
Latest Publications
- Open Access
- 17 August 2023
- Published by Springer Nature in Natural Computing
- Vol. 22 (4) , 631-644
Solving quantum circuit compilation problem variants through genetic algorithms
The gate-based model is one of the leading quantum computing paradigms for representing quantum circuits. Within this paradigm, a quantum algorithm is expressed in terms of a set of quantum gates that are executed on the quantum hardware over time, subject to a number of constraints whose satisfaction must be guaranteed before running the circuit, to allow for feasible execution. The need to guarantee the previous feasibility condition gives rise to the Quantum Circuit Compilation Problem (QCCP). The QCCP has been demonstrated to be NP-Complete, and can be considered as a Planning and Scheduling problem. In this paper, we consider quantum compilation instances deriving from the general Quantum Approximation Optimization Algorithm (QAOA), applied to the MaxCut problem, devised to be executed on Noisy Intermediate Scale Quantum (NISQ) hardware architectures. More specifically, in addition to the basic QCCP version, we also tackle other variants of the same problem such as the QCCP-X (QCCP with crosstalk constraints), the QCCP-V (QCCP with variable qubit state initialization), as well as the QCCP-VX that includes both previous variants. All problem variants are solved using genetic algorithms. We perform an experimental study across a conventional set of instances taken from the literature, and show that the proposed genetic algorithm, termed $$GA_{VX}$$ , outperforms previous approaches in the literature.- 17 August 2023
- Published by Springer Nature in Natural Computing
- Vol. 22 (4) , 631-644
Open AccessSolving quantum circuit compilation problem variants through genetic algorithms
The gate-based model is one of the leading quantum computing paradigms for representing quantum circuits. Within this paradigm, a quantum algorithm is expressed in terms of a set of quantum gates that are executed on the quantum hardware over time, subject to a number of constraints whose satisfaction must be guaranteed before running the circuit, to allow for feasible execution. The need to guarantee the previous feasibility condition gives rise to the Quantum Circuit Compilation Problem (QCCP). The QCCP has been demonstrated to be NP-Complete, and can be considered as a Planning and Scheduling problem. In this paper, we consider quantum compilation instances deriving from the general Quantum Approximation Optimization Algorithm (QAOA), applied to the MaxCut problem, devised to be executed on Noisy Intermediate Scale Quantum (NISQ) hardware architectures. More specifically, in addition to the basic QCCP version, we also tackle other variants of the same problem such as the QCCP-X (QCCP with crosstalk constraints), the QCCP-V (QCCP with variable qubit state initialization), as well as the QCCP-VX that includes both previous variants. All problem variants are solved using genetic algorithms. We perform an experimental study across a conventional set of instances taken from the literature, and show that the proposed genetic algorithm, termed $$GA_{VX}$$ , outperforms previous approaches in the literature. - Open Access
- 25 May 2023
- Published by Elsevier in Applied Soft Computing
- Vol. 144
New coding scheme to compile circuits for Quantum Approximate Optimization Algorithm by genetic evolution
- 25 May 2023
- Published by Elsevier in Applied Soft Computing
- Vol. 144
Open AccessNew coding scheme to compile circuits for Quantum Approximate Optimization Algorithm by genetic evolution
- Open Access
- 30 January 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (3) , 693
Optimal Designs for Antoine’s Equation: Compound Criteria and Multi-Objective Designs via Genetic Algorithms
Antoine’s Equation is commonly used to explain the relationship between vapour pressure and temperature for substances of industrial interest. This paper sets out a combined strategy to obtain optimal designs for the Antoine Equation for D- and I-optimisation criteria and different variance structures for the response. Optimal designs strongly depend not only on the criterion but also on the response’s variance, and their efficiency can be strongly affected by a lack of foresight in this selection. Our approach determines compound and multi-objective designs for both criteria and variance structures using a genetic algorithm. This strategy provides a backup for the experimenter providing high efficiencies under both assumptions and for both criteria. One of the conclusions of this work is that the differences produced by using the compound design strategy versus the multi-objective one are very small.
- 30 January 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (3) , 693
Open AccessOptimal Designs for Antoine’s Equation: Compound Criteria and Multi-Objective Designs via Genetic Algorithms
Antoine’s Equation is commonly used to explain the relationship between vapour pressure and temperature for substances of industrial interest. This paper sets out a combined strategy to obtain optimal designs for the Antoine Equation for D- and I-optimisation criteria and different variance structures for the response. Optimal designs strongly depend not only on the criterion but also on the response’s variance, and their efficiency can be strongly affected by a lack of foresight in this selection. Our approach determines compound and multi-objective designs for both criteria and variance structures using a genetic algorithm. This strategy provides a backup for the experimenter providing high efficiencies under both assumptions and for both criteria. One of the conclusions of this work is that the differences produced by using the compound design strategy versus the multi-objective one are very small.
- Open Access
- 4 August 2022
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 115
Metaheuristics for multiobjective optimization in energy-efficient job shops
- 4 August 2022
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 115
Open AccessMetaheuristics for multiobjective optimization in energy-efficient job shops
- 24 May 2022
- Published by Springer Nature
- p. 88-97
Compiling Single Round QCCP-X Quantum Circuits by Genetic Algorithm
- 24 May 2022
- Published by Springer Nature
- p. 88-97
Compiling Single Round QCCP-X Quantum Circuits by Genetic Algorithm
- 1 June 2019
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 167 (1-2) , 93-132
Efficient Approaches for Solving a Multiobjective Energy-aware Job Shop Scheduling Problem
One of the most recent and interesting trends in intelligent scheduling is trying to reduce the energy consumption in order to obtain lower production costs and smaller carbon footprint. In this work we consider the energy-aware job shop scheduling p
- 1 June 2019
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 167 (1-2) , 93-132
Efficient Approaches for Solving a Multiobjective Energy-aware Job Shop Scheduling Problem
One of the most recent and interesting trends in intelligent scheduling is trying to reduce the energy consumption in order to obtain lower production costs and smaller carbon footprint. In this work we consider the energy-aware job shop scheduling p
- 9 November 2018
- Published by Springer Nature
- p. 474-486
Energy-Aware Multiple State Machine Scheduling for Multiobjective Optimization
- 9 November 2018
- Published by Springer Nature
- p. 474-486
Energy-Aware Multiple State Machine Scheduling for Multiobjective Optimization
- Open Access
Electric Vehicle Charging Scheduling by an Enhanced Artificial Bee Colony Algorithm
Scheduling the charging times of a large fleet of Electric Vehicles (EVs) may be a hard problem due to the physical structure and conditions of the charging station. In this paper, we tackle an EV’s charging scheduling problem derived from a charging station designed to be installed in community parking where each EV has its own parking lot. The main goals are to satisfy the user demands and at the same time to make the best use of the available power. To solve the problem, we propose an artificial bee colony (ABC) algorithm enhanced with local search and some mating strategies borrowed from genetic algorithms. The proposal is analyzed experimentally by simulation and compared with other methods previously proposed for the same problem. The results of the experimental study provided interesting insights about the problem and showed that the proposed algorithm is quite competitive with previous methods.
Open AccessElectric Vehicle Charging Scheduling by an Enhanced Artificial Bee Colony Algorithm
Scheduling the charging times of a large fleet of Electric Vehicles (EVs) may be a hard problem due to the physical structure and conditions of the charging station. In this paper, we tackle an EV’s charging scheduling problem derived from a charging station designed to be installed in community parking where each EV has its own parking lot. The main goals are to satisfy the user demands and at the same time to make the best use of the available power. To solve the problem, we propose an artificial bee colony (ABC) algorithm enhanced with local search and some mating strategies borrowed from genetic algorithms. The proposal is analyzed experimentally by simulation and compared with other methods previously proposed for the same problem. The results of the experimental study provided interesting insights about the problem and showed that the proposed algorithm is quite competitive with previous methods.
- 1 July 2018
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 121, 51-61
Genetic fuzzy schedules for charging electric vehicles
- 1 July 2018
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 121, 51-61
Genetic fuzzy schedules for charging electric vehicles
- 1 April 2018
- Published by Elsevier in Applied Soft Computing
- Vol. 65, 292-306
Metaheuristics for solving a real-world electric vehicle charging scheduling problem
- 1 April 2018
- Published by Elsevier in Applied Soft Computing
- Vol. 65, 292-306
Metaheuristics for solving a real-world electric vehicle charging scheduling problem