Víctor Parada

According to our database1, Víctor Parada authored at least 30 papers between 1998 and 2020.

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



In proceedings 
PhD thesis 


On csauthors.net:


Automatic design of specialized algorithms for the binary knapsack problem.
Expert Syst. Appl., 2020

Optimizing waste storage areas in health care centers.
Ann. Oper. Res., 2020

Transit network design with pollution minimization.
Public Transp., 2019

An evolutionary algorithm for the multi-objective pick-up and delivery pollution-routing problem.
Int. Trans. Oper. Res., 2019

Novel Algorithms Automatically Generated for Optimization Problems.
Proceedings of the 38th International Conference of the Chilean Computer Science Society, 2019

Novel Methods Generated by Genetic Programming for the Guillotine-Cutting Problem.
Sci. Program., 2018

Automatically Produced Algorithms for the Generalized Minimum Spanning Tree Problem.
Sci. Program., 2016

Evolution of new algorithms for the binary knapsack problem.
Nat. Comput., 2016

A multi-operator genetic algorithm for the generalized minimum spanning tree problem.
Expert Syst. Appl., 2016

A Holonic Manufacturing System for a Copper Smelting Process.
Proceedings of the Service Orientation in Holonic and Multi-Agent Manufacturing, 2015

Chilean virtual observatory.
Proceedings of the 2015 Latin American Computing Conference, 2015

Identifying web sessions with simulated annealing.
Expert Syst. Appl., 2014

A Maturity Model for Assessing the Use of ICT in School Education.
J. Educ. Technol. Soc., 2013

Mitigation of greenhouse gas emissions in vehicle routing problems with backhauling.
Expert Syst. Appl., 2013

Genotype-phenotype heuristic approaches for a cutting stock problem with circular patterns.
Eng. Appl. Artif. Intell., 2013

Automatic generation of algorithms for the binary knapsack problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

Evolutionary Optimization of Electric Power Distribution Using the Dandelion Code.
J. Electr. Comput. Eng., 2012

A GRASP-based approach to the generalized minimum spanning tree problem.
Expert Syst. Appl., 2012

A Multiagent-Based Approach to the Grid-Scheduling Problem.
CLEI Electron. J., 2012

An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport.
J. Heuristics, 2010

A numerical comparison between simulated annealing and evolutionary approaches to the cell formation problem.
Expert Syst. Appl., 2010

CODELCO, Chile Programs Its Copper-Smelting Operations.
Interfaces, 2006

A Shared-Memory Multiprocessor Scheduling Algorithm.
Proceedings of the Toward Category-Level Object Recognition, 2006

Modeling expert players' behavior through data mining.
Proceedings of the XXV International Conference of the Chilean Computer Science Society, 2005

A parallel genetic algorithm to solve the set-covering problem.
Comput. Oper. Res., 2002

A Hybrid Algorithm for the Non-Guillotine Cutting Problem.
Ann. Oper. Res., 2002

A client-broker-server architecture of a virtual enterprise for cutting stock applications.
Int. J. Comput. Integr. Manuf., 2001

Storyboard aided design to specify multimedia projects.
Comput. Appl. Eng. Educ., 2000

A comparative numerical analysis for the guillotine two-dimensional cutting problem.
Ann. Oper. Res., 2000

Solution for the constrained guillotine cutting problem by simulated annealing.
Comput. Oper. Res., 1998