Ramiro Varela

Orcid: 0000-0002-1610-1792

Affiliations:
  • University of Oviedo, Department of Computer Science


According to our database1, Ramiro Varela authored at least 85 papers between 1994 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Evolving ensembles of heuristics for the travelling salesman problem.
Nat. Comput., December, 2023

Solving quantum circuit compilation problem variants through genetic algorithms.
Nat. Comput., December, 2023

Computational approaches to Explainable Artificial Intelligence: Advances in theory, applications and trends.
, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , ,
Inf. Fusion, December, 2023

Surrogate model for memetic genetic programming with application to the one machine scheduling problem with time-varying capacity.
Expert Syst. Appl., December, 2023

New coding scheme to compile circuits for Quantum Approximate Optimization Algorithm by genetic evolution.
Appl. Soft Comput., September, 2023

Ensembles of priority rules to solve one machine scheduling problem in real-time.
Inf. Sci., July, 2023

An analysis of heuristic templates in Genetic Programming for one-dimensional cutting and packing problems.
Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023

Multiobjective quantum circuit compilation (Short Paper).
Proceedings of the International Workshop on AI for Quantum and Quantum for AI (AIQxQIA 2023) co-located with 22nd International Conference of the Italian Association for Artificial Intelligence (AIxIA 2023), November 6, 2023

2022
Quantum circuit compilation by genetic algorithm for quantum approximate optimization algorithm applied to MaxCut problem.
Swarm Evol. Comput., 2022

A memetic algorithm for restoring feasibility in scheduling with limited makespan.
Nat. Comput., 2022

Combining hyper-heuristics to evolve ensembles of priority rules for on-line scheduling.
Nat. Comput., 2022

Building Heuristics and Ensembles for the Travel Salesman Problem.
Proceedings of the Bio-inspired Systems and Applications: from Robotics to Ambient Intelligence, 2022

Compiling Single Round QCCP-X Quantum Circuits by Genetic Algorithm.
Proceedings of the Bio-inspired Systems and Applications: from Robotics to Ambient Intelligence, 2022

2021
Genetic programming with local search to evolve priority rules for scheduling jobs on a machine with time-varying capacity.
Swarm Evol. Comput., 2021

Learning ensembles of priority rules for online scheduling by hybrid evolutionary algorithms.
Integr. Comput. Aided Eng., 2021

Efficient repairs of infeasible job shop problems by evolutionary algorithms.
Eng. Appl. Artif. Intell., 2021

The optimal filtering set problem with application to surrogate evaluation in genetic programming.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

2020
Exhaustive Search of Priority Rules for On-Line Scheduling.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

2019
Preface.
Nat. Comput., 2019

Evolutionary one-machine scheduling in the context of electric vehicles charging.
Integr. Comput. Aided Eng., 2019

Evolving priority rules for on-line scheduling of jobs on a single machine with variable capacity over time.
Appl. Soft Comput., 2019

Repairing Infeasibility in Scheduling via Genetic Algorithms.
Proceedings of the From Bioinspired Systems and Biomedical Applications to Machine Learning, 2019

Genetic Algorithm to Evolve Ensembles of Rules for On-Line Scheduling on Single Machine with Variable Capacity.
Proceedings of the From Bioinspired Systems and Biomedical Applications to Machine Learning, 2019

2017
Bio-inspired population-based meta-heuristics for problem solving.
Nat. Comput., 2017

Genetic Algorithm for Scheduling Charging Times of Electric Vehicles Subject to Time Dependent Power Availability.
Proceedings of the Natural and Artificial Computation for Biomedicine and Neuroscience, 2017

Electric Vehicle Charging Scheduling Using an Artificial Bee Colony Algorithm.
Proceedings of the Natural and Artificial Computation for Biomedicine and Neuroscience, 2017

2016
Self-adaptive SVDD integrated with AP clustering for one-class classification.
Pattern Recognit. Lett., 2016

Genetic algorithms for the scheduling problem with arbitrary precedence relations and skilled operators.
Integr. Comput. Aided Eng., 2016

2015
New schedule generation schemes for the job-shop problem with operators.
J. Intell. Manuf., 2015

Scatter search with path relinking for the flexible job shop scheduling problem.
Eur. J. Oper. Res., 2015

Scatter search with path relinking for the job shop with time lags and setup times.
Comput. Oper. Res., 2015

Electric vehicle charging under power and balance constraints as dynamic scheduling.
Comput. Ind. Eng., 2015

Memetic algorithms for the job shop scheduling problem with operators.
Appl. Soft Comput., 2015

Solving the job shop scheduling problem with operators by depth-first heuristic search enhanced with global pruning rules.
AI Commun., 2015

An advanced scatter search algorithm for solving job shops with sequence dependent and non-anticipatory setups.
AI Commun., 2015

Genetic Algorithm for the Job-Shop Scheduling with Skilled Operators.
Proceedings of the Bioinspired Computation in Artificial Systems, 2015

Schedule Generation Schemes and Genetic Algorithm for the Scheduling Problem with Skilled Operators and Arbitrary Precedence Relations.
Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

2014
A genetic algorithm for job-shop scheduling with operators enhanced by weak Lamarckian evolution and search space narrowing.
Nat. Comput., 2014

Non conventional computing and constraint optimization.
Nat. Comput., 2014

Intensified iterative deepening A* with application to job shop scheduling.
J. Intell. Manuf., 2014

2013
Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times.
J. Intell. Manuf., 2013

Depth-first heuristic search for the job shop scheduling problem.
Ann. Oper. Res., 2013

Solving Fuzzy Job-Shop Scheduling Problems with a Multiobjective Optimizer.
Proceedings of the Knowledge and Systems Engineering, 2013

An Efficient Memetic Algorithm for the Flexible Job Shop with Setup Times.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

2012
An efficient hybrid evolutionary algorithm for scheduling with setup times and weighted tardiness minimization.
Soft Comput., 2012

Solving problems with natural computing.
Nat. Comput., 2012

A competent memetic algorithm for complex scheduling.
Nat. Comput., 2012

2011
Genetic Algorithm for Job-Shop Scheduling with Operators.
Proceedings of the New Challenges on Bioinspired Applications, 2011

Optimally Scheduling a Job-Shop with Operators and Total Flow Time Minimization.
Proceedings of the Advances in Artificial Intelligence, 2011

Weighted Tardiness Minimization in Job Shops with Setup Times by Hybrid Genetic Algorithm.
Proceedings of the Advances in Artificial Intelligence, 2011

2010
Pruning by dominance in best-first search for the job shop Scheduling problem with total flow time.
J. Intell. Manuf., 2010

Pruning search spaces by dominance rules: a case study in the job shop scheduling.
Int. J. Reason. based Intell. Syst., 2010

Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times.
J. Heuristics, 2010

Partially Informed Depth-First Search for the Job Shop Problem.
Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

2009
An effective solution for a real cutting stock problem in manufacturing plastic rolls.
Ann. Oper. Res., 2009

Genetic Algorithm Combined with Tabu Search for the Job Shop Scheduling Problem with Setup Times.
Proceedings of the Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira.s Scientific Legacy, 2009

A Tabu Search Algorithm to Minimize Lateness in Scheduling Problems with Setup Times.
Proceedings of the Current Topics in Artificial Intelligence, 2009

2008
Semantics of Schedules for the Fuzzy Job-Shop Problem.
IEEE Trans. Syst. Man Cybern. Part A, 2008

Pruning Search Space by Dominance Rules in Best First Search for the Job Shop Scheduling Problem.
Proceedings of the ICSOFT 2008, 2008

A Study of Schedule Robustness for Job Shop with Uncertainty.
Proceedings of the Advances in Artificial Intelligence, 2008

A New Local Search for the Job Shop Problem with Uncertain Durations.
Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, 2008

A New Hybrid Genetic Algorithm for the Job Shop Scheduling Problem with Setup Times.
Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, 2008

2007
Improving Cutting-Stock Plans with Multi-objective Genetic Algorithms.
Proceedings of the Bio-inspired Modeling of Cognitive Tasks, 2007

Improving Cutting-Stock Plans with Multi-objective Genetic Algorithm.
Proceedings of the Software and Data Technologies - Second International Conference, 2007

A Multi-Objective Genetic Algorithm for Cutting-Stock in Plastic Rolls Industry.
Proceedings of the ICSOFT 2007, 2007

2006
Comparing Schedule Generation Schemes in Memetic Algorithms for the Job Shop Scheduling Problem with Sequence Dependent Setup Times.
Proceedings of the MICAI 2006: Advances in Artificial Intelligence, 2006

Combining metaheuristics for the job shop scheduling problem with sequence dependent setup times.
Proceedings of the ICSOFT 2006, 2006

Scheduling with Memetic Algorithms over the Spaces of Semi-active and Active Schedules.
Proceedings of the Artificial Intelligence and Soft Computing, 2006

2005
New Codification Schemas for Scheduling with Genetic Algorithms.
Proceedings of the Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach: First International Work-Conference on the Interplay Between Natural and Artificial Computation, 2005

Genetic Algorithms Hybridized with Greedy Algorithms and Local Search over the Spaces of Active and Semi-active Schedules.
Proceedings of the Current Topics in Artificial Intelligence, 2005

Optimal Scheduling with Heuristic Best First Search.
Proceedings of the AI*IA 2005: Advances in Artificial Intelligence, 2005

2003
A knowledge-based evolutionary strategy for scheduling problems with bottlenecks.
Eur. J. Oper. Res., 2003

Computación Evolutiva para Resolución de CSPs.
Inteligencia Artif., 2003

Hybridizing a Genetic Algorithm with Local Search and Heuristic Seeding.
Proceedings of the Artificial Neural Nets Problem Solving Methods, 2003

Heuristic Rules and Genetic Algorithms for Open Shop Scheduling Problem.
Proceedings of the Current Topics in Artificial Intelligence, 2003

2002
A New Chromosome Codification for Scheduling Problems.
Proceedings of the 6th Joint Conference on Information Science, 2002

Scheduling as Heuristic Search with State Space Reduction.
Proceedings of the Advances in Artificial Intelligence, 2002

2001
Ordered structures for parallel rule-based computations.
Int. J. Comput. Math., 2001

Initialization in Genetic Algorithms for Constraint Satisfaction Problems.
Proceedings of the Connectionist Models of Neurons, 2001

2000
Parallel Logic Programming for Problem Solving.
Int. J. Parallel Program., 2000

1999
Heuristic Generation of the Initial Population in Solving Job Shop Problems by Evolutionary Strategies.
Proceedings of the Foundations and Tools for Neural Modeling, 1999

1998
A Parallel Programming Approach to Job Shop Scheduling Constrain Satisfaction Problems.
Proceedings of the 1998 Joint Conference on Declarative Programming, 1998

1997
A Genetic Approach to Computing Independent AND Parallelism in Logic Programs.
Proceedings of the Biological and Artificial Computation: From Neuroscience to Technology, 1997

1996
Efficient Producer/Consumer Parallelism in Logic Programming.
Proceedings of the 1996 Joint Conf. on Declarative Programming, 1996

1994
El modelo RPS para la gestion del paralelismo AND independiente en programas logicos.
Proceedings of the 1994 Joint Conference on Declarative Programming, 1994


  Loading...