☰

Victor Parada, Ph.D. - Publications

Affiliations: 
Ingenieria Informatica Universidad de Santiago de Chile, Santiago, Región Metropolitana, Chile 
Area:
Operations Research
Tree Info Grants Similar researchers Related pubs Distance to... Nearest Nobel PubMed Report error

35 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2023 Sáez P, Herrera C, Booth C, Belmokhtar-Berraf S, Parada V. A product-driven system with an evolutionary algorithm to increase flexibility in planning a job shop. Plos One. 18: e0281807. PMID 36795712 DOI: 10.1371/journal.pone.0281807  0.346
2020 Bello P, Gallardo P, Pradenas L, Ferland JA, Parada V. Best compromise nutritional menus for childhood obesity. Plos One. 15: e0216516. PMID 31978089 DOI: 10.1371/Journal.Pone.0216516  0.318
2020 Acevedo N, Rey C, Contreras-Bolton C, Parada V. Automatic design of specialized algorithms for the binary knapsack problem Expert Systems With Applications. 141: 112908. DOI: 10.1016/J.Eswa.2019.112908  0.478
2020 Pradenas L, Fuentes M, Parada V. Optimizing waste storage areas in health care centers Annals of Operations Research. 1-14. DOI: 10.1007/S10479-020-03713-6  0.309
2019 Duran J, Pradenas L, Parada V. Transit network design with pollution minimization Public Transport. 11: 189-210. DOI: 10.1007/S12469-019-00200-5  0.463
2018 Bertolini V, Rey C, Sepulveda M, Parada V. Novel Methods Generated by Genetic Programming for the Guillotine-Cutting Problem Scientific Programming. 2018: 1-13. DOI: 10.1155/2018/6971827  0.401
2017 Bravo M, Rojas LP, Parada V. An evolutionary algorithm for the multi-objective pick-up and delivery pollution-routing problem International Transactions in Operational Research. 26: 302-317. DOI: 10.1111/Itor.12376  0.412
2017 Parada L, Herrera C, Flores P, Parada V. Wind farm layout optimization using a Gaussian-based wake model Renewable Energy. 107: 531-541. DOI: 10.1016/J.Renene.2017.02.017  0.362
2016 Contreras-Bolton C, Rey C, Ramos-Cossio S, Rodríguez C, Gatica F, Parada V. Automatically Produced Algorithms for the Generalized Minimum Spanning Tree Problem Scientific Programming. 2016: 1-11. DOI: 10.1155/2016/1682925  0.493
2016 Loyola C, Sepúlveda M, Solar M, Lopez P, Parada V. Automatic design of algorithms for the traveling salesman problem Cogent Engineering. 3. DOI: 10.1080/23311916.2016.1255165  0.472
2016 Contreras-Bolton C, Gatica G, Barra CR, Parada V. A multi-operator genetic algorithm for the generalized minimum spanning tree problem Expert Systems With Applications. 50: 1-8. DOI: 10.1016/J.Eswa.2015.12.014  0.422
2015 Contreras-Bolton C, Parada V. Automatic Combination of Operators in a Genetic Algorithm to Solve the Traveling Salesman Problem. Plos One. 10: e0137724. PMID 26367182 DOI: 10.1371/Journal.Pone.0137724  0.369
2015 Sanchez M, Pradenas L, Deschamps JC, Parada V. Reducing the carbon footprint in a vehicle routing problem by pooling resources from different companies Netnomics: Economic Research and Electronic Networking. DOI: 10.1007/S11066-015-9099-2  0.394
2015 Parada L, Herrera C, Sepúlveda M, Parada V. Evolution of new algorithms for the binary knapsack problem Natural Computing. DOI: 10.1007/S11047-015-9483-8  0.5
2014 Arce T, Román PE, Velásquez J, Parada V. Identifying web sessions with simulated annealing Expert Systems With Applications. 41: 1593-1600. DOI: 10.1016/J.Eswa.2013.08.056  0.367
2013 Contreras Bolton C, Gatica G, Parada V. Automatically generated algorithms for the vertex coloring problem. Plos One. 8: e58551. PMID 23516506 DOI: 10.1371/Journal.Pone.0058551  0.47
2013 Parada L, Sepulveda M, Herrera C, Parada V. Automatic generation of algorithms for the binary knapsack problem 2013 Ieee Congress On Evolutionary Computation, Cec 2013. 3148-3152. DOI: 10.1109/CEC.2013.6557954  0.362
2013 Hinostroza I, Pradenas L, Parada V. Board cutting from logs: Optimal and heuristic approaches for the problem of packing rectangles in a circle International Journal of Production Economics. 145: 541-546. DOI: 10.1016/J.Ijpe.2013.04.047  0.479
2013 Pradenas L, Oportus B, Parada V. Mitigation of greenhouse gas emissions in vehicle routing problems with backhauling Expert Systems With Applications. 40: 2985-2991. DOI: 10.1016/J.Eswa.2012.12.014  0.345
2013 Pradenas L, Garcés J, Parada V, Ferland J. Genotype-phenotype heuristic approaches for a cutting stock problem with circular patterns Engineering Applications of Artificial Intelligence. 26: 2349-2355. DOI: 10.1016/J.Engappai.2013.08.003  0.46
2012 Solar M, Rojas J, Mendoza M, Monge R, Parada V. A Multiagent-Based Approach to the Grid-Scheduling Problem Clei Electronic Journal. 15. DOI: 10.19153/15.2.5  0.36
2012 Sabattin J, Contreras Bolton C, Arias M, Parada V. Evolutionary optimization of electric power distribution using the dandelion code Journal of Electrical and Computer Engineering. DOI: 10.1155/2012/738409  0.462
2012 Ferreira CS, Ochi LS, Parada V, Uchoa E. A GRASP-based approach to the generalized minimum spanning tree problem Expert Systems With Applications. 39: 3526-3536. DOI: 10.1016/J.Eswa.2011.09.043  0.462
2011 Palominos P, Parada V, Gatica G, Véjar A. Marriage in honeybee optimization to scheduling problems Hybrid Algorithms For Service, Computing and Manufacturing Systems: Routing and Scheduling Solutions. 158-177. DOI: 10.4018/978-1-61350-086-6.ch008  0.314
2011 Pradenas L, Campos A, Saldaña J, Parada V. Scheduling copper refining and casting operations by means of heuristics for the flexible flow shop problem Pesquisa Operacional. 31: 443-457. DOI: 10.1590/S0101-74382011000300002  0.42
2010 Acuña DE, Parada V. People efficiently explore the solution space of the computationally intractable traveling salesman problem to find near-optimal tours. Plos One. 5: e11685. PMID 20686597 DOI: 10.1371/Journal.Pone.0011685  0.612
2010 Parada V, Ferland JA, Arias M, Schwarzenberg P, Vargas LS. Heuristic determination of distribution trees Ieee Transactions On Power Delivery. 25: 861-869. DOI: 10.1109/Tpwrd.2009.2033929  0.416
2010 Pailla A, Trindade AR, Parada V, Ochi LS. A numerical comparison between simulated annealing and evolutionary approaches to the cell formation problem Expert Systems With Applications. 37: 5476-5483. DOI: 10.1016/J.Eswa.2010.02.064  0.473
2010 Elizondo R, Parada V, Pradenas L, Artigues C. An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport Journal of Heuristics. 16: 575-591. DOI: 10.1007/S10732-009-9102-X  0.495
2005 Acuña D, Parada V. Modeling expert players' behavior through data mining Proceedings - International Conference of the Chilean Computer Science Society, Sccc. 2005: 55-61. DOI: 10.1109/SCCC.2005.1587866  0.488
2004 Parada V, Ferland JA, Arias M, Daniels K. Optimization of electrical distribution feeders using simulated annealing Ieee Transactions On Power Delivery. 19: 1135-1141. DOI: 10.1109/Tpwrd.2004.829091  0.377
2002 Parada V, Pradenas L, Solar M, Palma R. A Hybrid Algorithm for the Non-Guillotine Cutting Problem Annals of Operations Research. 117: 151-163. DOI: 10.1023/A:1021521523118  0.427
2002 Solar M, Parada V, Urrutia R. A parallel genetic algorithm to solve the set-covering problem Computers and Operations Research. 29: 1221-1235. DOI: 10.1016/S0305-0548(01)00026-0  0.439
2000 Parada V, Palma R, Sales D, Gómes A. A comparative numerical analysis for the guillotine two-dimensional cutting problem Annals of Operations Research. 96: 245-254. DOI: 10.1023/A:1018915922011  0.464
1998 Parada V, Sepúlveda M, Solar M, Gómes A. Solution for the constrained guillotine cutting problem by simulated annealing Computers and Operations Research. 25: 37-47. DOI: 10.1016/S0305-0548(97)00036-1  0.481
Show low-probability matches.