Carlos Castro

Orcid: 0000-0003-4149-7730

Affiliations:
  • Federico Santa María Technical University, Valparaíso, Chile


According to our database1, Carlos Castro authored at least 76 papers between 1998 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
Inequalities in Computational Thinking Among Incoming Students in an STEM Chilean University.
IEEE Trans. Educ., April, 2024

2023
B-PSA: A Binary Pendulum Search Algorithm for the Feature Selection Problem.
Comput., November, 2023

A mixed-integer linear programming model and a metaheuristic approach for the selection and allocation of land parcels problem.
Int. Trans. Oper. Res., July, 2023

A framework for the generation of complex scenario instances in the Urban Transit Routing Problem.
Ann. Math. Artif. Intell., June, 2023

Resource-constrained multi-project scheduling problem: A survey.
Eur. J. Oper. Res., 2023

Pendulum Motion Based Optimization Algorithm To Solve The Feature Selection Problem.
Proceedings of the XLIX Latin American Computer Conference, 2023

2022
Entropy-Based Diversification Approach for Bio-Computing Methods.
Entropy, 2022

Predicting population size and termination criteria in metaheuristics: A case study based on spotted hyena optimizer and crow search algorithm.
Appl. Soft Comput., 2022

2021
Towards Complex Scenario Instances for the Urban Transit Routing Problem.
Proceedings of the Learning and Intelligent Optimization - 15th International Conference, 2021

Optimization of Green Pickup and Delivery Operations in Multi-depot Distribution Problems.
Proceedings of the Computational Logistics - 12th International Conference, 2021

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

Improving complex SMT strategies with learning.
Int. Trans. Oper. Res., 2020

Cumulative VRP with Time Windows: A Trade-Off Analysis.
Proceedings of the Computational Logistics - 11th International Conference, 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

Integrating a SMT Solver based Local Search in Ant Colony Optimization for Solving RCMPSP.
Proceedings of the IEEE Latin American Conference on Computational Intelligence, 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

Development of Computational Thinking in High School Students: A Case Study in Chile.
Proceedings of the 37th International Conference of the Chilean Computer Science Society, 2018

Optimizing SMT Solving Strategies by Learning with an Evolutionary Process.
Proceedings of the 2018 International Conference on High Performance Computing & Simulation, 2018

Cuckoo Search via Lévy Flight Applied to Optimal Water Supply System Design.
Proceedings of the Recent Trends and Future Technology in Applied Intelligence, 2018

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

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

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

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

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

2012
A Flexible and Adaptive Hyper-heuristic Approach for (Dynamic) Capacitated Vehicle Routing Problems.
Fundam. Informaticae, 2012

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

2011
Adaptive hybridization strategies.
Proceedings of the 2011 ACM Symposium on Applied Computing (SAC), TaiChung, Taiwan, March 21, 2011

A Hyperheuristic Approach for Dynamic Enumeration Strategy Selection in Constraint Satisfaction.
Proceedings of the New Challenges on Bioinspired Applications, 2011

A Framework for Autonomous Search in the Ecl<sup><i>i</i></sup>ps<sup><i>e</i></sup> Solver.
Proceedings of the Modern Approaches in Applied Intelligence, 2011

Constraint-Based Nurse Rostering for the Valparaíso Clinic Center in Chile.
Proceedings of the HCI International 2011 - Posters' Extended Abstracts, 2011

Extensible CP-Based Autonomous Search.
Proceedings of the HCI International 2011 - Posters' Extended Abstracts, 2011

2010
Using a Choice Function for Guiding Enumeration in Constraint Solving.
Proceedings of the 9th Mexican International Conference on Artificial Intelligence, 2010

2009
Some Results on the design of Balanced Academic Curricula.
CLEI Electron. J., 2009

A Choice Function to Dynamic Selection of Enumeration Strategies Solving Constraint Satisfaction Problems.
Proceedings of the First International Conference of Soft Computing and Pattern Recognition, 2009

A New ACO Transition Rule for Set Partitioning and Covering Problems.
Proceedings of the First International Conference of Soft Computing and Pattern Recognition, 2009

SAT Encoding and CSP Reduction for Interconnected Alldiff Constraints.
Proceedings of the MICAI 2009: Advances in Artificial Intelligence, 2009

Towards a Flexible and Adaptable Hyperheuristic Approach for VRPs.
Proceedings of the 2009 International Conference on Artificial Intelligence, 2009

Stable solving of CVRPs using hyperheuristics.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Multimodal Algorithm for Iris Recognition with Local Topological Descriptors.
Proceedings of the Progress in Pattern Recognition, 2009

2008
Undecimated Wavelet Based Autoregressive Model for Anchovy Catches Forecasting.
Proceedings of the MICAI 2008: Advances in Artificial Intelligence, 2008

Constraint Programming Can Help Ants Solving Highly Constrainted Combinatorial Problems.
Proceedings of the ICSOFT 2008, 2008

Local Search as a Fixed Point of Functions.
Proceedings of the ICEIS 2008, 2008

A Theoretical Framework for Local Search Techniques.
Proceedings of the 11th IEEE International Conference on Computational Science and Engineering, 2008

Hybrid Wavelet-RBFNN Model for Monthly Anchovy Catches Forecasting.
Proceedings of the Artificial Intelligence: Methodology, 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

Integration of Constraint Programming and Metaheuristics.
Proceedings of the Abstraction, 2007

Solving Dial-a-Ride Problems with a Low-Level Hybridization of Ants and Constraint Programming.
Proceedings of the Nature Inspired Problem-Solving Methods in Knowledge Engineering, 2007

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

Development of Algorithms to Solve Combinatorial Problems.
Proceedings of the ICEIS 2007, 2007

Knowledge Management in the Development of Optimization Algorithms.
Proceedings of the Human Interface and the Management of Information. Methods, 2007

A Quantitative Approach for the Design of Academic Curricula.
Proceedings of the Human Interface and the Management of Information. Interacting in Information Environments, 2007

Decomposition Approach to Solve Dial-a-Ride Problems Using Ant Computing and Constraint Programming.
Proceedings of the Advances in Brain, 2007

2006
A Hybrid Ant Algorithm for the Airline Crew Pairing Problem.
Proceedings of the MICAI 2006: Advances in Artificial Intelligence, 2006

Ant Colonies using Arc Consistency Techniques for the Set Partitioning Problem.
Proceedings of the Toward Category-Level Object Recognition, 2006

Solving the Balanced Academic Curriculum Problem with an Hybridization of Genetic Algorithm and Constraint Propagation.
Proceedings of the Artificial Intelligence and Soft Computing, 2006

Integrating Lookahead and Post Processing Procedures with ACO for Solving Set Partitioning and Covering Problems.
Proceedings of the Artificial Intelligence and Soft Computing, 2006

Using Local Search for Guiding Enumeration in Constraint Solving.
Proceedings of the Artificial Intelligence: Methodology, 2006

A Constructive Hybrid Algorithm for Crew Pairing Optimization.
Proceedings of the Artificial Intelligence: Methodology, 2006

Adaptive Enumeration Strategies and Metabacktracks for Constraint Solving.
Proceedings of the Advances in Information Systems, 4th International Conference, 2006

Knowledge Management in Different Software Development Approaches.
Proceedings of the Advances in Information Systems, 4th International Conference, 2006

2005
An Approach for Dynamic Split Strategies in Constraint Solving.
Proceedings of the MICAI 2005: Advances in Artificial Intelligence, 2005

Hybridization of Genetic Algorithms and Constraint Propagation for the BACP.
Proceedings of the Logic Programming, 21st International Conference, 2005

2004
A Cooperative Framework Based on Local Search and Constraint Programming for Solving Discrete Global Optimisation.
Proceedings of the Advances in Artificial Intelligence - SBIA 2004, 17th Brazilian Symposium on Artificial Intelligence, São Luis, Maranhão, Brazil, September 29, 2004

Designing Hybrid Cooperations with a Component Language for Solving Optimisation Problems.
Proceedings of the Artificial Intelligence: Methodology, 2004

A Component Language for Hybrid Solver Cooperations.
Proceedings of the Advances in Information Systems, Third International Conference, 2004

2003
Basic Components for Constraint Solver Cooperations.
Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), 2003

A Rule Language for Interaction.
Proceedings of the Recent Advances in Constraints, 2003

2000
The use of a strategy language for solving search problems.
Ann. Math. Artif. Intell., 2000

Basic Operators for Solving Constraints via Collaboration of Solvers.
Proceedings of the Artificial Intelligence and Symbolic Computation, 2000

1999
A Control Language for Designing Constraint Solvers.
Proceedings of the Perspectives of System Informatics, 1999

1998
Une approche déductive de la résolution de problèmes de satisfaction de contraintes.
PhD thesis, 1998

Cooperation of constraint solvers: using the new process control facilities of ELAN.
Proceedings of the 1998 International Workshop on Rewriting Logic and its Applications, 1998


  Loading...