Fernando Paredes

Orcid: 0000-0003-0223-6052

According to our database1, Fernando Paredes authored at least 77 papers between 2007 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
A binary monkey search algorithm variation for solving the set covering problem.
Nat. Comput., 2020

An Autonomous Galactic Swarm Optimization Algorithm Supported by Hidden Markov Model.
Proceedings of the 12th International Conference on Soft Computing and Pattern Recognition (SoCPaR 2020), 2020

Solving the 0/1 Knapsack Problem Using a Galactic Swarm Optimization with Data-Driven Binarization Approaches.
Proceedings of the Computational Science and Its Applications - ICCSA 2020, 2020

Ambidextrous Socio-Cultural Algorithms.
Proceedings of the Computational Science and Its Applications - ICCSA 2020, 2020

A Q-Learning Hyperheuristic Binarization Framework to Balance Exploration and Exploitation.
Proceedings of the Applied Informatics - Third International Conference, 2020

A Data-Driven Dynamic Discretization Framework to Solve Combinatorial Problems Using Continuous Metaheuristics.
Proceedings of the Innovations in Bio-Inspired Computing and Applications, 2020

2019
A self-adaptive biogeography-based algorithm to solve the set covering problem.
RAIRO Oper. Res., 2019

Solving the Manufacturing Cell Design Problem through Binary Cat Swarm Optimization with Dynamic Mixture Ratios.
Comput. Intell. Neurosci., 2019

Solving the Manufacturing Cell Design Problem Using Human Behavior-Based Algorithm Supported by Autonomous Search.
IEEE Access, 2019

Using a Social Media Inspired Optimization Algorithm to Solve the Set Covering Problem.
Proceedings of the Social Computing and Social Media. Design, Human Behavior and Analytics, 2019

2018
Automatic High-Frequency Trading: An Application to Emerging Chilean Stock Market.
Sci. Program., 2018

Comparing the Black Hole and the Soccer League Competition Algorithms Solving the Set Covering Problem.
POLIBITS, 2018

A k-means binarization framework applied to multidimensional knapsack problem.
Appl. Intell., 2018

Comparing Local Search Algorithms for the Beam Angles Selection in Radiotherapy.
IEEE Access, 2018

2017
Online control of enumeration strategies via bat algorithm and black hole optimization.
Nat. Comput., 2017

Solving the non-unicost set covering problem by using cuckoo search and black hole optimization.
Nat. Comput., 2017

Analyzing the effects of binarization techniques when solving the set covering problem through swarm optimization.
Expert Syst. Appl., 2017

Putting Continuous Metaheuristics to Work in Binary Search Spaces.
Complex., 2017

Parameter Tuning for Local-Search-Based Matheuristic Methods.
Complex., 2017

2016
Using autonomous search for solving constraint satisfaction problems via new modern approaches.
Swarm Evol. Comput., 2016

Efficient Parallel Sorting for Migrating Birds Optimization When Solving Machine-Part Cell Formation Problems.
Sci. Program., 2016

A Matheuristic Approach Combining Local Search and Mathematical Programming.
Sci. Program., 2016

A Firefly Algorithm to Solve the Manufacturing Cell Design Problem.
Proceedings of the Artificial Intelligence Perspectives in Intelligent Systems, 2016

Solving the Manufacturing Cell Design Problem via Invasive Weed Optimization.
Proceedings of the Artificial Intelligence Perspectives in Intelligent Systems, 2016

Firefly Algorithm to Solve a Project Scheduling Problem.
Proceedings of the Artificial Intelligence Perspectives in Intelligent Systems, 2016

2015
Boosting autonomous search for CSPs via skylines.
Inf. Sci., 2015

A Hybrid alldifferent-Tabu Search Algorithm for Solving Sudoku Puzzles.
Comput. Intell. Neurosci., 2015

Automated, Adaptive, and Optimized Search for CSPs via Cuckoo Search.
Proceedings of the Advances in Swarm and Computational Intelligence, 2015

Solving the Set Covering Problem with Binary Cat Swarm Optimization.
Proceedings of the Advances in Swarm and Computational Intelligence, 2015

Machine-part cell formation problems with constraint programming.
Proceedings of the 34th International Conference of the Chilean Computer Science Society, 2015

Solving Manufacturing Cell Design Problems Using an Artificial Fish Swarm Algorithm.
Proceedings of the Advances in Artificial Intelligence and Soft Computing, 2015

A Marriage Theorem Based-Algorithm for Solving Sudoku.
Proceedings of the Fourteenth Mexican International Conference on Artificial Intelligence, 2015

A Migrating Birds Optimization Algorithm for Machine-Part Cell Formation Problems.
Proceedings of the Advances in Artificial Intelligence and Soft Computing, 2015

The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic.
Proceedings of the Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, 2015

Online Control of Enumeration Strategies via Bat-Inspired Optimization.
Proceedings of the Bioinspired Computation in Artificial Systems, 2015

A Binary Cuckoo Search Algorithm for Solving the Set Covering Problem.
Proceedings of the Bioinspired Computation in Artificial Systems, 2015

Autonomous Tuning for Constraint Programming via Artificial Bee Colony Optimization.
Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

Comparing Cuckoo Search, Bee Colony, Firefly Optimization, and Electromagnetism-Like Algorithms for Solving the Set Covering Problem.
Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

A Binary Fruit Fly Optimization Algorithm to Solve the Set Covering Problem.
Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

A Comparison of Three Recent Nature-Inspired Metaheuristics for the Set Covering Problem.
Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

A Scheduling Problem for Software Project Solved with ABC Metaheuristic.
Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

A Teaching-Learning-Based Optimization Algorithm for Solving Set Covering Problems.
Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

The Complexity of Designing and Implementing Metaheuristics.
Proceedings of the HCI International 2015 - Posters' Extended Abstracts, 2015

A Filtering Technique for Helping to Solve Sudoku Problems.
Proceedings of the HCI International 2015 - Posters' Extended Abstracts, 2015

Recent Harmony Search Algorithms for 0-1 Optimization Problems.
Proceedings of the HCI International 2015 - Posters' Extended Abstracts, 2015

Heuristic Feasibility and Preprocessing for a Set Covering Solver Based on Firefly Optimization.
Proceedings of the Artificial Intelligence Perspectives and Applications, 2015

Enumeration Strategies for Solving Constraint Satisfaction Problems: A Performance Evaluation.
Proceedings of the Artificial Intelligence Perspectives and Applications, 2015

Pre-processing, Repairing and Transfer Functions Can Help Binary Electromagnetism-Like Algorithms.
Proceedings of the Artificial Intelligence Perspectives and Applications, 2015

WSM Tuning in Autonomous Search via Gravitational Search Algorithms.
Proceedings of the Artificial Intelligence Perspectives and Applications, 2015

Modified Binary FireFly Algorithms with Different Transfer Functions for Solving Set Covering Problems.
Proceedings of the Software Engineering in Intelligent Systems, 2015

Binarization Methods for Shuffled Frog Leaping Algorithms That Solve Set Covering Problems.
Proceedings of the Software Engineering in Intelligent Systems, 2015

A Timetabling Applied Case Solved with Ant Colony Optimization.
Proceedings of the Artificial Intelligence Perspectives and Applications, 2015

Solving Manufacturing Cell Design Problems Using a Shuffled Frog Leaping Algorithm.
Proceedings of the 1st International Conference on Advanced Intelligent System and Informatics, 2015

A XOR-Based ABC Algorithm for Solving Set Covering Problems.
Proceedings of the 1st International Conference on Advanced Intelligent System and Informatics, 2015

Solving the Set Covering Problem with a Shuffled Frog Leaping Algorithm.
Proceedings of the Intelligent Information and Database Systems - 7th Asian Conference, 2015

2014
A Bicriteria Approach Identifying Nondominated Portfolios.
J. Appl. Math., 2014

A Max-Min Ant System algorithm to solve the Software Project Scheduling Problem.
Expert Syst. Appl., 2014

A 2-level Approach for the Set Covering Problem: Parameter Tuning of Artificial Bee Colony Algorithm by Using Genetic Algorithm.
Proceedings of the Advances in Swarm Intelligence - 5th International Conference, 2014

The Use of Metaheuristics to Software Project Scheduling Problem.
Proceedings of the Computational Science and Its Applications - ICCSA 2014 - 14th International Conference, Guimarães, Portugal, June 30, 2014

Easy Modeling of Open Pit Mining Problems via Constraint Programming.
Proceedings of the HCI International 2014 - Posters' Extended Abstracts, 2014

Modeling Manufacturing Cell Design Problems: CP vs. MH.
Proceedings of the HCI International 2014 - Posters' Extended Abstracts, 2014

Using the Firefly Optimization Method to Solve the Weighted Set Covering Problem.
Proceedings of the HCI International 2014 - Posters' Extended Abstracts, 2014

Autonomous Search: Towards the Easy Tuning of Constraint Programming Solvers.
Proceedings of the HCI International 2014 - Posters' Extended Abstracts, 2014

Using the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem.
Proceedings of the HCI International 2014 - Posters' Extended Abstracts, 2014

A Better Understanding of the Behaviour of Metaheuristics: A Psychological View.
Proceedings of the HCI International 2014 - Posters' Extended Abstracts, 2014

An Artificial Bee Colony Algorithm for the Set Covering Problem.
Proceedings of the Modern Trends and Techniques in Computer Science, 2014

A Binary Firefly Algorithm for the Set Covering Problem.
Proceedings of the Modern Trends and Techniques in Computer Science, 2014

A New Approach to Solve the Software Project Scheduling Problem Based on Max-Min Ant System.
Proceedings of the Modern Trends and Techniques in Computer Science, 2014

2013
A reactive and hybrid constraint solver.
J. Exp. Theor. Artif. Intell., 2013

A hybrid AC3-tabu search algorithm for solving Sudoku puzzles.
Expert Syst. Appl., 2013

Parameter tuning of a choice-function based hyperheuristic using Particle Swarm Optimization.
Expert Syst. Appl., 2013

2012
A 2-level Metaheuristic for the Set Covering Problem.
Int. J. Comput. Commun. Control, 2012

Cell formation in group technology using constraint programming and Boolean satisfiability.
Expert Syst. Appl., 2012

A Hyperheuristic Approach for Guiding Enumeration in Constraint Solving.
Proceedings of the EVOLVE, 2012

2008
Flexibility and Amplification Measures in a Supply Chain Model.
Proceedings of IEEE International Conference on Communications, 2008

2007
A Cultural Algorithm for Solving the Set Covering Problem.
Proceedings of the Analysis and Design of Intelligent Systems using Soft Computing Techniques, 2007

A Evolutionary Approach to Solve Set Covering.
Proceedings of the ICEIS 2007, 2007


  Loading...