Iván Amaya

Orcid: 0000-0002-8821-7137

Affiliations:
  • Tecnologico de Monterrey, School of Engineering and Sciences, Mexico
  • Industrial University of Santander, School of Electrical, Electronic and Telecommunications Engineerings, Colombia


According to our database1, Iván Amaya authored at least 47 papers between 2013 and 2024.

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

2024
A systematic review of metaheuristic algorithms in electric power systems optimization.
Appl. Soft Comput., January, 2024

Robotic Mobile Fulfillment System: A Systematic Review.
IEEE Access, 2024

2023
Automatic Design of Metaheuristics for Practical Engineering Applications.
IEEE Access, 2023

SIGNRL: A Population-Based Reinforcement Learning Method for Continuous Control.
Proceedings of the IEEE Symposium Series on Computational Intelligence, 2023

On the Feasibility of Using a High-Level Solver within Robotic Mobile Fulfillment Systems.
Proceedings of the IEEE Symposium Series on Computational Intelligence, 2023

Recursive Hyper-Heuristics for the Job Shop Scheduling Problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2023

Hyper-Heuristics Meet Controller Design: Improving Electrical Grid Performance through Microgrids.
Proceedings of the IEEE Congress on Evolutionary Computation, 2023

2022
MatHH: A Matlab-based Hyper-Heuristic framework.
SoftwareX, 2022

Beyond Hyper-Heuristics: A Squared Hyper-Heuristic Model for Solving Job Shop Scheduling Problems.
IEEE Access, 2022

A Primary Study on Hyper-Heuristics Powered by Artificial Neural Networks for Customising Population-based Metaheuristics in Continuous Optimisation Problems.
Proceedings of the IEEE Congress on Evolutionary Computation, 2022

A Transfer Learning Hyper-heuristic Approach for Automatic Tailoring of Unfolded Population-based Metaheuristics.
Proceedings of the IEEE Congress on Evolutionary Computation, 2022

2021
Hyper-Heuristics to customise metaheuristics for continuous optimisation.
Swarm Evol. Comput., 2021

SCSV_IPS: A software for the estimation of the <i>shear coefficient of spin viscosity</i> during the movement of a ferrofluid under the effect of an external rotating magnetic field.
SoftwareX, 2021

Enhancing Hyperheuristics for the Knapsack Problem through Fuzzy Logic.
Comput. Intell. Neurosci., 2021

Solving microelectronic thermal management problems using a generalized spiral optimization algorithm.
Appl. Intell., 2021

Tailoring Job Shop Scheduling Problem Instances Through Unified Particle Swarm Optimization.
IEEE Access, 2021

Sequence-Based Selection Hyper-Heuristic Model via MAP-Elites.
IEEE Access, 2021

Naïve Hyper-heuristic Online Learning to Generate Unfolded Population-based Metaheuristics to Solve Continuous Optimization Problems.
Proceedings of the IEEE Symposium Series on Computational Intelligence, 2021

Automated Design of Unfolded Metaheuristics and the Effect of Population Size.
Proceedings of the IEEE Congress on Evolutionary Computation, 2021

2020
SpinUpFlowDescriptor: A MATLAB toolbox for ferrofluids materials under moderate and high amplitude and frequency of magnetic rotating fields in a spin-up geometry.
SoftwareX, 2020

CUSTOMHyS: Customising Optimisation Metaheuristics via Hyper-heuristic Search.
SoftwareX, 2020

A Systematic Review of Hyper-Heuristics on Combinatorial Optimization Problems.
IEEE Access, 2020

Discovering Action Regions for Solving the Bin Packing Problem through Hyper-heuristics.
Proceedings of the 2020 IEEE Symposium Series on Computational Intelligence, 2020

Exploring Reward-based Hyper-heuristics for the Job-shop Scheduling Problem.
Proceedings of the 2020 IEEE Symposium Series on Computational Intelligence, 2020

A Genetic Programming Framework for Heuristic Generation for the Job-Shop Scheduling Problem.
Proceedings of the Advances in Soft Computing, 2020

A Preliminary Study on Score-Based Hyper-heuristics for Solving the Bin Packing Problem.
Proceedings of the Pattern Recognition - 12th Mexican Conference, 2020

A Preliminary Study on Feature-independent Hyper-heuristics for the 0/1 Knapsack Problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2020

A Fuzzy Hyper-Heuristic Approach for the 0-1 Knapsack Problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2020

Exploring Problem State Transformations to Enhance Hyper-heuristics for the Job-Shop Scheduling Problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2020

A Primary Study on Hyper-Heuristics to Customise Metaheuristics for Continuous optimisation.
Proceedings of the IEEE Congress on Evolutionary Computation, 2020

2019
Evolutionary-based tailoring of synthetic instances for the Knapsack problem.
Soft Comput., 2019

Influence of Instance Size on Selection Hyper-Heuristics for Job Shop Scheduling Problems.
Proceedings of the IEEE Symposium Series on Computational Intelligence, 2019

Improving Hyper-heuristic Performance for Job Shop Scheduling Problems Using Neural Networks.
Proceedings of the Advances in Soft Computing, 2019

A Simulated Annealing Hyper-heuristic for Job Shop Scheduling Problems.
Proceedings of the IEEE Congress on Evolutionary Computation, 2019

Hyper-heuristics Reversed: Learning to Combine Solvers by Evolving Instances.
Proceedings of the IEEE Congress on Evolutionary Computation, 2019

2018
Exploring the Impact of Early Decisions in Variable Ordering for Constraint Satisfaction Problems.
Comput. Intell. Neurosci., 2018

Enhancing Selection Hyper-Heuristics via Feature Transformations.
IEEE Comput. Intell. Mag., 2018

Tailoring Instances of the 1D Bin Packing Problem for Assessing Strengths and Weaknesses of Its Solvers.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

An Experimental Study on Ant Colony Optimization Hyper-Heuristics for Solving the Knapsack Problem.
Proceedings of the Pattern Recognition - 10th Mexican Conference, 2018

2017
A Quartile-Based Hyper-heuristic for Solving the 0/1 Knapsack Problem.
Proceedings of the Advances in Soft Computing, 2017

Applying automatic heuristic-filtering to improve hyper-heuristic performance.
Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017

Improving hyper-heuristic performance through feature transformation.
Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017

2015
Finding resonant frequencies of microwave cavities through a modified harmony search algorithm.
Int. J. Bio Inspired Comput., 2015

Harmony Search algorithm: a variant with Self-regulated Fretwidth.
Appl. Math. Comput., 2015

Design of an Optimal Heat Sink for Microelectronic Devices Using Entropy Generation Minimization.
Proceedings of the Fourteenth Mexican International Conference on Artificial Intelligence, 2015

2014
An improved variant of the conventional Harmony Search algorithm.
Appl. Math. Comput., 2014

2013
Numerical solution of certain exponential and non-linear Diophantine systems of equations by using a discrete particle swarm optimization algorithm.
Appl. Math. Comput., 2013


  Loading...