Victor Parada, Ph.D.
Affiliations: | Ingenieria Informatica | Universidad de Santiago de Chile, Santiago, Región Metropolitana, Chile |
Area:
Operations ResearchGoogle:
"Victor Parada"Mean distance: 106866 (cluster 29)
Children
Sign in to add traineeDaniel E. Acuña | research assistant | 2003-2004 | Universidad de Santiago de Chile |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Sáez P, Herrera C, Booth C, et al. (2023) A product-driven system with an evolutionary algorithm to increase flexibility in planning a job shop. Plos One. 18: e0281807 |
Bello P, Gallardo P, Pradenas L, et al. (2020) Best compromise nutritional menus for childhood obesity. Plos One. 15: e0216516 |
Acevedo N, Rey C, Contreras-Bolton C, et al. (2020) Automatic design of specialized algorithms for the binary knapsack problem Expert Systems With Applications. 141: 112908 |
Pradenas L, Fuentes M, Parada V. (2020) Optimizing waste storage areas in health care centers Annals of Operations Research. 1-14 |
Duran J, Pradenas L, Parada V. (2019) Transit network design with pollution minimization Public Transport. 11: 189-210 |
Bertolini V, Rey C, Sepulveda M, et al. (2018) Novel Methods Generated by Genetic Programming for the Guillotine-Cutting Problem Scientific Programming. 2018: 1-13 |
Bravo M, Rojas LP, Parada V. (2017) An evolutionary algorithm for the multi-objective pick-up and delivery pollution-routing problem International Transactions in Operational Research. 26: 302-317 |
Parada L, Herrera C, Flores P, et al. (2017) Wind farm layout optimization using a Gaussian-based wake model Renewable Energy. 107: 531-541 |
Contreras-Bolton C, Rey C, Ramos-Cossio S, et al. (2016) Automatically Produced Algorithms for the Generalized Minimum Spanning Tree Problem Scientific Programming. 2016: 1-11 |
Loyola C, Sepúlveda M, Solar M, et al. (2016) Automatic design of algorithms for the traveling salesman problem Cogent Engineering. 3 |