Publications

@article{jorn20201,

title = {Fuzzy infrared sensor for liquid level measurement: A multi-model approach},

author = {Óscar Alonso-Hernández and Julio C. Ramos-Fernández and Marco Antonio Márquez-Vera and Jorge A. Ruiz-Vanoye and Virgilio Lopez-Morales},

url = {https://doi.org/10.1016/j.flowmeasinst.2020.101696},

issn = {0955-5986},

year  = {2020},

date = {2020-02-02},

journal = {Flow Measurement and Instrumentation},

volume = {72},

abstract = {The measurement of fuel level is critical in the automotive industry, incorrect fuel level approximations cause problems in the work area because of vehicle displacement and autonomy. The present work describes the design, simulation and development of a fuel consumption approximation system for the measurement and estimation of the fuel volume level of in a non-uniform tank. Obtaining experimental data is critical to perform fuzzy identification and fuzzy modeling, different experiments were performed varying the number of membership functions. The efficiency obtained in each

experiment is compared with the obtained with fuzzy logic. It is concluded that a model with five fuzzy sets has a higher precision than by using two sets in the fuzzy partition. For the case of study, the fuzzy system had an error of

35 milliliters in a tank of 8000 milliliters.},

keywords = {Papers in the Science Citation Index Expanded},

pubstate = {published},

tppubtype = {article}

}

@article{JCR1,

title = {Surveying the Optimization Problems of the Water Distribution Networks},

author = {Jorge A. Ruiz-Vanoye and Ricardo A. Barrera-Cámara and Ocotlán Díaz-Parra and Alejandro Fuentes-Penna and Beatriz Bernabe-Loranca and Joaquín Pérez-Ortega and Ana Canepa-Saenz and Judith del C. Santiago-Pérez},

doi = {10.15244/pjoes/76502},

issn = {1230-1485},

year  = {2018},

date = {2018-02-16},

journal = {Polish Journal of Environmental Studies},

volume = {27},

number = {4},

pages = {1-8},

abstract = {This paper aims at being a guide to understanding the different types of optimization problems of the Water Distribution Network by presenting a survey of mathematical models and algorithms used to solve the variants of the Water Distribution Networks. Some problems are Water Resource Planning, Water Quality Management, Water Supply Networks, Water Distribution Systems, Water Flow and Chemical Transport and Water Distribution Network. Optimize resources to transport water is an issue of global interest, it is important to minimize the costs of construction of pipeline to supply water, repair costs, and the water transportation.},

keywords = {Papers in the Science Citation Index Expanded, Water Distribution Networks},

pubstate = {published},

tppubtype = {article}

}

@article{scs15,

title = {Experiment Design for a Multi-Objective Partitioning Problem},

author = {Beatriz Bernabe-Loranca and Jorge A. Ruiz-Vanoye and M. Bustillo and Rogelio González-Velázquez and Alberto Ochoa-Zezzatti and Gerardo Martínez-Guzman},

issn = {1548-0992},

year  = {2016},

date = {2016-05-02},

journal = {IEEE Latin America Transactions},

volume = {14},

number = {5},

pages = {2389-2401},

keywords = {Papers in the Science Citation Index Expanded},

pubstate = {published},

tppubtype = {article}

}

@article{JCR2,

title = {An Overview of the Project Scheduling Problem of Technological Innovation},

author = {Ocotlán Díaz-Parra and Jorge A. Ruiz-Vanoye and Alejandro Fuentes-Penna and José C. Zavala-Díaz and Mario A. Zurita-Barrón and Beatriz Bernabe-Loranca and Daniel Velez-Díaz},

url = {https://www.revistadyna.com/busqueda/un-resumen-de-planificacion-de-proyectos-de-innovacion-tecnologica},

doi = {10.6036/7849},

issn = {0012-7361},

year  = {2016},

date = {2016-02-07},

journal = {DYNA},

volume = {91},

number = {2},

abstract = {El presente trabajo de investigación muestra un modelo matemático del problema de asignación de recursos económicos a proyectos de innovación tecnológica y una solución mediante estrategias de optimización y herramientas informáticas. Un proyecto de innovación tecnológica generalmente presenta propuestas de nuevas ideas que permiten el desarrollo de nuevos procesos de mejora en la producción, comercialización, producto, actividad comercial, modelo de negocio, modelo de logística o de servicio al cliente de una empresa. Los planes de apoyo económico para las empresas son mediante los Consejos Nacionales de Ciencia y Tecnología. Los consejos nacionales permiten asignar apoyos económicos a las empresas proponentes. Con la finalidad de contribuir a que más empresas se vean beneficiadas con dicho apoyo, la presente investigación muestra una nueva estrategia de cálculo optimizado del recurso de cada propuesta de innovación tecnológica permitiendo establecer el recurso económico requerido para su desarrollo. El método utilizado para encontrar una solución a la optimización del recurso solicitado se realizó por medio de la conceptualización matemática de un modelo, generando instancias basadas en comportamientos reales y estocásticos. La herramienta utilizada para encontrar el costo óptimo de cada propuesta de innovación tecnológica fue mediante el modelo CPLEX. El resultado de la experimentación utilizando instancias generadas presentó ahorros considerables que pueden utilizarse para apoyar más propuestas de empresas proponentes. A futuro se espera establecer convenios con el concejo nacional de ciencia y tecnología de México para la utilización de la herramienta.},

keywords = {Papers in the Science Citation Index Expanded, Project Scheduling Problem of Technological Innovation},

pubstate = {published},

tppubtype = {article}

}

@article{JC3,

title = {Nursing Process Problem Characterization For Patient Diagnosis},

author = {Alejandro Fuentes-Penna and Jorge A. Ruiz-Vanoye and Ocotlán Díaz-Parra and Joaquín Pérez-Ortega and Sócrates López-Pérez},

url = {http://www.revistadyna.com/search/nursing-process-problem-characterization-for-patien-diagnosis},

doi = {10.6036/7855},

issn = {0012-7361},

year  = {2016},

date = {2016-02-07},

journal = {DYNA},

volume = {91},

number = {2},

abstract = {The Nursing Process Problem (NPP) has the main objective of defining the nursing diagnosis based on the initial patient diagnosis, his/her medical history and the classifications of NANDA, NIC and NOC nomenclatures. The main objective is to propose the characterization of NPP, where the health initial conditions and the medical history of patients can be treated through the assignment of interventions nurses who must comply with the objectives of nurses. We present an AIMMS simulation for The NPP problem using CPLEX technique for solving NPP instances to generate a staff nurse assignation.},

keywords = {Nursing Process Problem, Papers in the Science Citation Index Expanded},

pubstate = {published},

tppubtype = {article}

}

@article{JCR4,

title = {A Survey of Transportation Problems},

author = {Ocotlán Díaz-Parra and Jorge A. Ruiz-Vanoye and Beatriz Bernábe-Loranca and Alejandro Fuentes-Penna and Ricardo A. Barrera-Cámara},

url = {https://www.hindawi.com/journals/jam/2014/848129/},

doi = {10.1155/2014/848129},

issn = {1110-757X},

year  = {2014},

date = {2014-02-07},

journal = {Journal of Applied Mathematics},

volume = {2014},

pages = {1-17},

abstract = {This paper aims at being a guide to understand the different types of transportation problems by presenting a survey of mathematical models and algorithms used to solve different types of transportation modes (ship, plane, train, bus, truck, Motorcycle, Cars, and others) by air, water, space, cables, tubes, and road. Some problems are as follows: bus scheduling problem, delivery problem, combining truck trip problem, open vehicle routing problem, helicopter routing problem, truck loading problem, truck dispatching problem, truck routing problem, truck transportation problem, vehicle routing problem and variants, convoy routing problem, railroad blocking problem (RBP), inventory routing problem (IRP), air traffic flow management problem (TFMP), cash transportation vehicle routing problem, and so forth.},

keywords = {Papers in the Science Citation Index Expanded, Transportation Problems},

pubstate = {published},

tppubtype = {article}

}

@article{JCR5,

title = {Application of formal languages in the polynomial transformations of instances between NP-complete problems},

author = {Jorge A. Ruiz-Vanoye and Joaquín Pérez-Ortega and Rodolfo A. Pazos R. and Ocotlán Díaz-Parra and Hector J. Fraire-Huacuja and Juan Frausto-Solis and Gerardo Reyes-Salgado and Laura Cruz-Reyes},

url = {http://link.springer.com/article/10.1631/jzus.C1200349},

doi = {10.1631/jzus.C1200349},

issn = {1869-196X},

year  = {2013},

date = {2013-02-07},

journal = {Journal of Zhejiang University-SCIENCE C (Computers & Electronics)},

volume = {14},

number = {8},

pages = {623-633},

abstract = {We propose the usage of formal languages for expressing instances of NP-complete problems for their application in polynomial transformations. The proposed approach, which consists of using formal language theory for polynomial transformations, is more robust, more practical, and faster to apply to real problems than the theory of polynomial transformations. In this paper we propose a methodology for transforming instances between NP-complete problems, which differs from Garey and Johnson’s. Unlike most transformations which are used for proving that a problem is NP-complete based on the NP-completeness of another problem, the proposed approach is intended for extrapolating some known characteristics, phenomena, or behaviors from a problem A to another problem B. This extrapolation could be useful for predicting the performance of an algorithm for solving B based on its known performance for problem A, or for taking an algorithm that solves A and adapting it to solve B.},

keywords = {Papers in the Science Citation Index Expanded, polynomial transformations},

pubstate = {published},

tppubtype = {article}

}

@article{JCR6,

title = {Strategic Planning for Computer Science Security of Networks and Systems in SMEs},

author = {Jorge A. Ruiz-Vanoye and Ocotlán Díaz-Parra and José C. Zavala-Díaz},

url = {http://www.academicjournals.org/article/article1380698144_Ruiz-Vanoye%20et%20al.pdf},

doi = {10.5897/AJBM10.1615},

issn = {1993-8233},

year  = {2012},

date = {2012-02-07},

journal = {African Journal of Business Management},

volume = {6},

number = {3},

pages = {762-779},

abstract = {The strategic planning adapted in the computer science security is observed in many senses as a military strategy, which takes advantage of their forces to operate the vulnerabilities of the organizations, attackers or competitors. The need of the companies and organizations to continuously adapt to the technological changes of the computer science formulated the following key questions: what type of security and management is needed by small and medium enterprise (SME) in wireless network systems and devices? and how can the risk f or cyber attack on mission-critical devices on the organization be measured? This study proposes to apply the strategic planning for the computer science security of network and systems in SMEs with the following characteristics: easy to understand, easy to apply, and economical in its adoption.},

keywords = {Computer Science Security, Papers in the Science Citation Index Expanded},

pubstate = {published},

tppubtype = {article}

}

@article{JCR7,

title = {Survey of Polynomial Transformations between NP-Complete problems},

author = {Jorge A. Ruiz-Vanoye and Joaquín Pérez-Ortega and Rodolfo A. Pazos R. and Ocotlán Díaz-Parra and Juan Frausto-Solís and Hector J. Fraire-Huacuja and Laura Cruz-Reyes and José A. Martínez-Flores},

url = {http://dx.doi.org/doi:10.1016/j.cam.2011.02.018},

doi = {10.1016/j.cam.2011.02.018},

issn = {0377-0427},

year  = {2011},

date = {2011-02-07},

journal = {Journal of Computational and Applied Mathematics},

volume = {235},

number = {16},

pages = {4851-4865},

abstract = {This paper aims at being a guide to understand polynomial transformations and polynomial reductions between NP-complete problems by presenting the methodologies for polynomial reductions/transformations and the differences between reductions and transformations. To this end the article shows examples of polynomial reductions/transformations and the restrictions to reduce/transform between NP-complete problems. Finally, this paper includes a digraph with the historical reductions/transformations between instances of NP-complete problems and introduces the term family of polynomial transformations.},

keywords = {Papers in the Science Citation Index Expanded, polynomial transformations},

pubstate = {published},

tppubtype = {article}

}

@article{JCR8,

title = {Analysis of risk in linear multi-objective model and its evaluation for selection of a portfolio of investment in the Mexican stock Exchange},

author = {José C. Zavala-Díaz and Jorge A. Ruiz-Vanoye and Ocotlán Díaz-Parra},

url = {https://www.researchgate.net/publication/267371415_Analysis_of_risk_in_linear_multi-objective_model_and_its_evaluation_for_selection_of_a_portfolio_of_investment_in_the_Mexican_Stock_Exchange},

issn = {1993-8233},

year  = {2011},

date = {2011-02-07},

journal = {African Journal of Business Management},

volume = {5},

number = {19},

pages = {7876-7884},

abstract = {Each model designed to select an investment portfolio is based on different assumptions for estimating the risk and the return. These assumptions determine feasible solutions area and the front of efficient portfolios. Therefore, the assumptions of Markowitz model, capital assets pricing model and the linear multi-objective model are discussed. A portfolio of investments in different scenarios was determined by the last two models, and it is showed that the portfolio of investment determined by linear multi-objective model has higher return at lower risk. These tests also evaluated the assumptions of the models. It concludes that it is possible to gain a competitive advantage if another point of view will be considered in the selection of the investment portfolio. 

 

Analysis of risk in linear multi-objective model and its evaluation for selection of a portfolio of investment in the Mexican Stock Exchange (PDF Download Available). Available from: https://www.researchgate.net/publication/267371415_Analysis_of_risk_in_linear_multi-objective_model_and_its_evaluation_for_selection_of_a_portfolio_of_investment_in_the_Mexican_Stock_Exchange [accessed Feb 02 2018].},

keywords = {multi-objective model, Papers in the Science Citation Index Expanded},

pubstate = {published},

tppubtype = {article}

}

@article{JCR9,

title = {Similarities between meta-heuristics algorithms and the science of life},

author = {Jorge A. Ruiz-Vanoye and Ocotlán Díaz-Parra},

url = {https://link.springer.com/article/10.1007/s10100-010-0135-x},

doi = {10.1007/s10100-010-0135-x},

issn = {445–466},

year  = {2011},

date = {2011-02-07},

journal = {Central European Journal of Operations Research},

volume = {19},

number = {4},

pages = {445–466},

abstract = {In this paper, we show the functional similarities between Meta-heuristics and the aspects of the science of life (biology): (a) Meta-heuristics based on gene transfer: Genetic algorithms (natural evolution of genes in an organic population), Transgenic Algorithm (transfers of genetic material to another cell that is not descending); (b) Meta-heuristics based on interactions among individual insects: Ant Colony Optimization (on interactions among individuals insects, Ant Colonies), Firefly algorithm (fireflies of the family Lampyridze), Marriage in honey bees Optimization algorithm (the process of reproduction of Honey Bees), Artificial Bee Colony algorithm (the process of recollection of Honey Bees); and (c) Meta-heuristics based on biological aspects of alive beings: Tabu Search Algorithm (Classical Conditioning on alive beings), Simulated Annealing algorithm (temperature control of spiders), Particle Swarm Optimization algorithm (social behavior and movement dynamics of birds and fish) and Artificial Immune System (immunological mechanism of the vertebrates).},

keywords = {meta-heuristics algorithms, Papers in the Science Citation Index Expanded},

pubstate = {published},

tppubtype = {article}

}

@article{JCR10,

title = {A Genetic Distance Metric to Discriminate the Selection of Algorithms for General ATSP Problem},

author = {Joaquín Pérez-Ortega and Rodolfo A. Pazos R. and Jorge A. Ruiz-Vanoye and Juan Frausto-Solís and Juan J. González-Barbosa and Hector J. Fraire-Huacuja and Ocotlán Díaz-Parra},

url = {http://content.iospress.com/articles/journal-of-intelligent-and-fuzzy-systems/ifs00435},

doi = {10.3233/IFS-2010-0435},

issn = {1064-1246},

year  = {2010},

date = {2010-02-07},

journal = {Journal of Intelligent & Fuzzy Systems},

volume = {21},

number = {1-2},

pages = {57-64},

abstract = {The only metric that had existed so far to determine the best algorithm for solving an general Asymmetric Traveling Salesman Problem (ATSP) instance is based on the number of cities; nevertheless, it is not sufficiently adequate for discriminating the best algorithm for solving an ATSP instance, thus the necessity for devising a new metric through the use of data-mining techniques. In this paper we propose: (1) the use of a genetic distance metric for improving the selection of the algorithms that best solve a given instance of the ATSP and (2) the use of discriminant analysis as a means for predictive learning (data-mining techniques) aiming at selecting meta-heuristic algorithms.},

keywords = {Algorithms, Papers in the Science Citation Index Expanded},

pubstate = {published},

tppubtype = {article}

}

@article{JCR11,

title = {Population pre-selection operators used for generating a non-random initial population to solve vehicle routing problem with time windows},

author = {Ocotlán Díaz-Parra and Jorge A. Ruiz-Vanoye and José C. Zavala-Díaz},

url = {https://www.researchgate.net/publication/264848520_Population_pre-selection_operators_used_for_generating_a_non-random_initial_population_to_solve_vehicle_routing_problem_with_time_windows},

issn = {1992- 2248},

year  = {2010},

date = {2010-02-07},

journal = {Scientific Research and Essays},

volume = {5},

number = {22},

pages = {3529-3528},

abstract = {In this paper, we propose two population pre-selection operators to improve by the k-means algorithm (clustering) and neighborhood techniques the determination of the in-itial population (not-randomly population) used in the evolutionary and genetic algo-rithms to solve the Vehicle Routing Problem with Time Windows (VRPTW). The re-sults provide individual or chromosomes in the initial population near to the optimal in VRPTW instances.},

keywords = {Papers in the Science Citation Index Expanded, vehicle routing problem with time windows},

pubstate = {published},

tppubtype = {article}

}