Publications – Dr. Jorge A. Ruiz-Vanoye

Show all

2021
1.	Ruiz-Vanoye, Jorge A; Díaz-Parra, Ocotlán; Trejo-Macotela, Francisco Rafael; Ramos-Fernández, Julio Cesar P versus NP problem from Formal Languages Theory View Journal Article In: International Journal of Combinatorial Optimization Problems and Informatics, 12 (1), pp. 1-8, 2021, ISSN: 2007-1558. Abstract \| Links \| BibTeX \| Tags: CONACYT, ESCI @article{2021-1, title = {P versus NP problem from Formal Languages Theory View}, author = {Jorge A. Ruiz-Vanoye and Ocotlán Díaz-Parra and Francisco Rafael Trejo-Macotela and Julio Cesar Ramos-Fernández }, url = {https://ijcopi.org/ojs/article/view/207}, issn = {2007-1558}, year = {2021}, date = {2021-01-04}, journal = {International Journal of Combinatorial Optimization Problems and Informatics}, volume = {12}, number = {1}, pages = {1-8}, abstract = {P versus NP is an unsolved problem in mathematics and computational complexity. In this paper, we use the formal language theory to the computational complexity to analyze P versus NP problem from a new point of view. P versus NP problem is to determine whether some deterministic algorithm also accepts every language accepted by some nondeterministic algorithm in polynomial time in polynomial time. Then, we use the theory of formal languages to determine whether some deterministic algorithm also accepts every language accepted by some nondeterministic algorithm in polynomial time in polynomial time. We use different problems to display the question of P versus NP from Formal Languages Theory View.}, keywords = {CONACYT, ESCI}, pubstate = {published}, tppubtype = {article} } Close P versus NP is an unsolved problem in mathematics and computational complexity. In this paper, we use the formal language theory to the computational complexity to analyze P versus NP problem from a new point of view. P versus NP problem is to determine whether some deterministic algorithm also accepts every language accepted by some nondeterministic algorithm in polynomial time in polynomial time. Then, we use the theory of formal languages to determine whether some deterministic algorithm also accepts every language accepted by some nondeterministic algorithm in polynomial time in polynomial time. We use different problems to display the question of P versus NP from Formal Languages Theory View. Close https://ijcopi.org/ojs/article/view/207 Close
2020
2.	Díaz-Parra, Ocotlán; Ruiz-Vanoye, Jorge A; Fuentes-Penna, Alejandro; Zezzatti, Alberto Ochoa; Cruz-Hernández, Ernesto; Estrada-García, Salma; Alvarado-Pérez, Antonio Editorial for Volume 11 Number 2: Electric School Bus Routing Problem for Smart Cities Journal Article In: International Journal of Combinatorial Optimization Problems and Informatics, 11 (2), pp. 1-8, 2020, ISSN: 2007-1558. Abstract \| Links \| BibTeX \| Tags: CONACYT, ESCI @article{jo20201, title = {Editorial for Volume 11 Number 2: Electric School Bus Routing Problem for Smart Cities}, author = { Ocotlán Díaz-Parra and Jorge A. Ruiz-Vanoye and Alejandro Fuentes-Penna and Alberto Ochoa Zezzatti and Ernesto Cruz-Hernández and Salma Estrada-García and Antonio Alvarado-Pérez}, url = {https://ijcopi.org/index.php/ojs/article/view/167/124}, issn = {2007-1558}, year = {2020}, date = {2020-01-02}, journal = {International Journal of Combinatorial Optimization Problems and Informatics}, volume = {11}, number = {2}, pages = {1-8}, abstract = {The use of electric vehicles (cars, motorcycles, scooters, trucks, buses) in the cities is an essential component so that cities can be considered smart cities. In this paper, we propose a mathematical model for the Electric School Bus Routing Problem which aims to minimise costs and optimise transportation times and cost of the students. We propose a Genetic Algorithm with a pre-Selection Operator, Tournament Selection Operator, Crossover-K Operator, and Mutation-S Operator to solve the Electric School Bus Routing Problem (SBRP).}, keywords = {CONACYT, ESCI}, pubstate = {published}, tppubtype = {article} } Close The use of electric vehicles (cars, motorcycles, scooters, trucks, buses) in the cities is an essential component so that cities can be considered smart cities. In this paper, we propose a mathematical model for the Electric School Bus Routing Problem which aims to minimise costs and optimise transportation times and cost of the students. We propose a Genetic Algorithm with a pre-Selection Operator, Tournament Selection Operator, Crossover-K Operator, and Mutation-S Operator to solve the Electric School Bus Routing Problem (SBRP). Close https://ijcopi.org/index.php/ojs/article/view/167/124 Close
2019
3.	Moreno-Gutiérrez, Silvia S; Toriz-Palacios, Alfredo; López-Pérez, Sócrates; Ruiz-Vanoye, Jorge A Evaluador inteligente de daño fenológico en la planta de trigo Journal Article In: CIENCIA ergo-sum, 26 (3), pp. 1-12, 2019, ISSN: 2395-8782. Abstract \| Links \| BibTeX \| Tags: CONACYT, ESCI @article{JESCI2019, title = { Evaluador inteligente de daño fenológico en la planta de trigo}, author = { Silvia S. Moreno-Gutiérrez and Alfredo Toriz-Palacios and Sócrates López-Pérez and Jorge A. Ruiz-Vanoye}, url = {https://doi.org/10.30878/ces.v26n3a7 }, doi = {10.30878/ces.v26n3a7}, issn = {2395-8782}, year = {2019}, date = {2019-11-04}, journal = {CIENCIA ergo-sum}, volume = {26}, number = {3}, pages = {1-12}, abstract = {El cambio climático en el planeta ha afectado la producción mundial de trigo. En este sentido, los pronósticos aseguran que estos cambios y efectos serán mayores conforme pase el tiempo. Considerando la importancia de este cereal como alimento de la dieta básica de los seres humanos, se propone una nueva forma de evaluación del cultivo que permita pronosticar el daño probable por etapa fenológica por medio de una red neuronal artificial entrenada con datos históricos del comportamiento climático global e impacto fenológico. Un sistema de resultados interpreta la salida y constituye la interfaz de usuario. La propuesta fue validada y mostró su capacidad de generalización alcanzando alta precisión de 84%, por lo que se considera adecuada.}, keywords = {CONACYT, ESCI}, pubstate = {published}, tppubtype = {article} } Close El cambio climático en el planeta ha afectado la producción mundial de trigo. En este sentido, los pronósticos aseguran que estos cambios y efectos serán mayores conforme pase el tiempo. Considerando la importancia de este cereal como alimento de la dieta básica de los seres humanos, se propone una nueva forma de evaluación del cultivo que permita pronosticar el daño probable por etapa fenológica por medio de una red neuronal artificial entrenada con datos históricos del comportamiento climático global e impacto fenológico. Un sistema de resultados interpreta la salida y constituye la interfaz de usuario. La propuesta fue validada y mostró su capacidad de generalización alcanzando alta precisión de 84%, por lo que se considera adecuada. Close https://doi.org/10.30878/ces.v26n3a7 doi:10.30878/ces.v26n3a7 Close
4.	Lezama-León, Evangelina; Lezama-León, Myrna; Ruiz-Vanoye, Jorge A; Díaz-Parra, Ocotlán; Barrera-Cámara, Ricardo A; Fuentes-Penna, Alejandro Editorial for Volume 10 Number 1: Review of heuristic algorithms applied to the solution problem of land transportation of perishable products Journal Article In: International Journal of Combinatorial Optimization Problems and Informatics, 10 (1), pp. 1-5, 2019, ISSN: 2007-1558. Links \| BibTeX \| Tags: CONACYT, ESCI @article{jr18, title = {Editorial for Volume 10 Number 1: Review of heuristic algorithms applied to the solution problem of land transportation of perishable products}, author = {Evangelina Lezama-León and Myrna Lezama-León and Jorge A. Ruiz-Vanoye and Ocotlán Díaz-Parra and Ricardo A. Barrera-Cámara and Alejandro Fuentes-Penna}, url = {https://ijcopi.org/index.php/ojs/article/view/110}, issn = {2007-1558}, year = {2019}, date = {2019-08-05}, journal = {International Journal of Combinatorial Optimization Problems and Informatics}, volume = {10}, number = {1}, pages = {1-5}, keywords = {CONACYT, ESCI}, pubstate = {published}, tppubtype = {article} } Close https://ijcopi.org/index.php/ojs/article/view/110 Close
5.	Díaz-Parra, Ocotlán; Fuentes-Penna, Alejandro; Lezama-León, Evangelina; Lezama-León, Myrna; Ruiz-Jaimes, Miguel A; Barrera-Cámara, Ricardo A; Ruiz-Vanoye, Jorge A Editorial for Volume 10 Number 2: Surveying the Transportation of the E-Waste Journal Article In: International Journal of Combinatorial Optimization Problems and Informatics, 10 (2), pp. 1-7, 2019, ISSN: 2007-1558. Links \| BibTeX \| Tags: CONACYT, ESCI @article{jr25, title = {Editorial for Volume 10 Number 2: Surveying the Transportation of the E-Waste }, author = {Ocotlán Díaz-Parra and Alejandro Fuentes-Penna and Evangelina Lezama-León and Myrna Lezama-León and Miguel A. Ruiz-Jaimes and Ricardo A. Barrera-Cámara and Jorge A. Ruiz-Vanoye }, url = {https://ijcopi.org/index.php/ojs/article/view/117/101}, issn = {2007-1558}, year = {2019}, date = {2019-05-10}, journal = {International Journal of Combinatorial Optimization Problems and Informatics}, volume = {10}, number = {2}, pages = {1-7}, keywords = {CONACYT, ESCI}, pubstate = {published}, tppubtype = {article} } Close https://ijcopi.org/index.php/ojs/article/view/117/101 Close
6.	Barrera-Cámara, Ricardo A; Canepa-Sáenz, Ana; del Santiago-Pérez, Judith C; Barrientos-Vera, Veronica; Ruiz-Vanoye, Jorge A; Díaz-Parra, Ocotlán Business processes in technology and information services Journal Article In: Universidad & Empresa, 21 (37), pp. 204-227, 2019, ISSN: 0124-4639. Abstract \| Links \| BibTeX \| Tags: ESCI @article{jr190319, title = {Business processes in technology and information services}, author = {Ricardo A. Barrera-Cámara and Ana Canepa-Sáenz and Judith del C. Santiago-Pérez and Veronica Barrientos-Vera and Jorge A. Ruiz-Vanoye and Ocotlán Díaz-Parra}, url = {https://revistas.urosario.edu.co/index.php/empresa/article/view/6639/7275}, issn = {0124-4639}, year = {2019}, date = {2019-03-22}, journal = {Universidad & Empresa}, volume = {21}, number = {37}, pages = {204-227}, abstract = {In this work, we defned and simulated the processes in an information technology services company with the purpose of enhancing attention and functions defned for each of them. We analyzed several works related to the business management process and simulation. For model development, we designed a methodology based on business process management. For modeling and simulating the procedures and activities, we used a software tool establishing times and number of possible instances to be performed. The software allowed adapting these times and processes to a desired level of performance. Resulting processes contribute to adequately and time effciently perform business activities to provide a higher quality service.}, keywords = {ESCI}, pubstate = {published}, tppubtype = {article} } Close In this work, we defned and simulated the processes in an information technology services company with the purpose of enhancing attention and functions defned for each of them. We analyzed several works related to the business management process and simulation. For model development, we designed a methodology based on business process management. For modeling and simulating the procedures and activities, we used a software tool establishing times and number of possible instances to be performed. The software allowed adapting these times and processes to a desired level of performance. Resulting processes contribute to adequately and time effciently perform business activities to provide a higher quality service. Close https://revistas.urosario.edu.co/index.php/empresa/article/view/6639/7275 Close
7.	Ruiz-Vanoye, Jorge A; Barrera-Cámara, Ricardo A; Díaz-Parra, Ocotlán; Fuentes-Penna, Alejandro; Barrera-Cámara, Ricardo A; Ruiz-Jaimes, Miguel A; Pérez-Ortega, Joaquín Editorial for Volume 10 Number 3: Can Machines Play Musical Instruments? Journal Article In: International Journal of Combinatorial Optimization Problems and Informatics, 10 (3), pp. 1-6, 2019, ISSN: 2007-1558. Abstract \| Links \| BibTeX \| Tags: CONACYT, ESCI @article{jr19, title = {Editorial for Volume 10 Number 3: Can Machines Play Musical Instruments? }, author = {Jorge A. Ruiz-Vanoye and Ricardo A. Barrera-Cámara and Ocotlán Díaz-Parra and Alejandro Fuentes-Penna and Ricardo A. Barrera-Cámara and Miguel A. Ruiz-Jaimes and Joaquín Pérez-Ortega }, url = {https://ijcopi.org/index.php/ojs/article/view/125}, issn = {2007-1558}, year = {2019}, date = {2019-03-16}, journal = {International Journal of Combinatorial Optimization Problems and Informatics}, volume = {10}, number = {3}, pages = {1-6}, abstract = {The robots are designed to help with difficult tasks for the human being, currently carried out activities that were a main feature of the human how to perform surgeries, injections, run musical instruments among others. This paper aims to highlight the Musical Artificial Intelligent and the history of the Musicians Robots.}, keywords = {CONACYT, ESCI}, pubstate = {published}, tppubtype = {article} } Close The robots are designed to help with difficult tasks for the human being, currently carried out activities that were a main feature of the human how to perform surgeries, injections, run musical instruments among others. This paper aims to highlight the Musical Artificial Intelligent and the history of the Musicians Robots. Close https://ijcopi.org/index.php/ojs/article/view/125 Close
2018
8.	Ruiz-Vanoye, Jorge A; Fuentes-Penna, Alejandro; Díaz-Parra, Ocotlán; Barrera-Cámara, Ricardo A; Lezama-León, Myrna; Lezama-León, Evangelina Editorial for Volume 9 Number 3: Models, Resources and Activities of Project Scheduling Problems Journal Article In: International Journal of Combinatorial Optimization Problems and Informatics, 9 (3), pp. 1-17, 2018, ISSN: 2007-1558. Abstract \| Links \| BibTeX \| Tags: CONACYT, ESCI @article{CONA22, title = {Editorial for Volume 9 Number 3: Models, Resources and Activities of Project Scheduling Problems}, author = {Jorge A. Ruiz-Vanoye and Alejandro Fuentes-Penna and Ocotlán Díaz-Parra and Ricardo A. Barrera-Cámara and Myrna Lezama-León and Evangelina Lezama-León}, url = {https://www.researchgate.net/publication/323663022_Editorial_for_Volume_9_Number_3_Models_Resources_and_Activities_of_Project_Scheduling_Problems}, issn = {2007-1558}, year = {2018}, date = {2018-03-09}, journal = {International Journal of Combinatorial Optimization Problems and Informatics}, volume = {9}, number = {3}, pages = {1-17}, abstract = {The Project Scheduling Problem (PSP) is a generic name given to a whole class of problems in which the best form, time, resources and costs for project scheduling are necessary. The PSP is an application area related to the project management. This paper aims at being a guide to understand PSP by presenting a survey of the general parameters of PSP: the Resources (those elements that realize the activities of a project), and the Activities (set of operations or own tasks of a person or organization); the mathematical models of the main variants of PSP and the algorithms used to solve the variants of the PSP. The project scheduling is an important task in project management. This paper contains mathematical models, resources, activities, and algorithms of project scheduling problems. The project scheduling problem has attracted researchers of the automotive industry, steel manufacturer, medical research, pharmaceutical research, telecommunication, industry, aviation industry, development of the software, manufacturing management, innovation and technology management, construction industry, government project management, financial services, machine scheduling, transportation management, and others. The project managers need to finish a project with the minimum cost and the maximum quality.}, keywords = {CONACYT, ESCI}, pubstate = {published}, tppubtype = {article} } Close The Project Scheduling Problem (PSP) is a generic name given to a whole class of problems in which the best form, time, resources and costs for project scheduling are necessary. The PSP is an application area related to the project management. This paper aims at being a guide to understand PSP by presenting a survey of the general parameters of PSP: the Resources (those elements that realize the activities of a project), and the Activities (set of operations or own tasks of a person or organization); the mathematical models of the main variants of PSP and the algorithms used to solve the variants of the PSP. The project scheduling is an important task in project management. This paper contains mathematical models, resources, activities, and algorithms of project scheduling problems. The project scheduling problem has attracted researchers of the automotive industry, steel manufacturer, medical research, pharmaceutical research, telecommunication, industry, aviation industry, development of the software, manufacturing management, innovation and technology management, construction industry, government project management, financial services, machine scheduling, transportation management, and others. The project managers need to finish a project with the minimum cost and the maximum quality. Close https://www.researchgate.net/publication/323663022_Editorial_for_Volume_9_Number[...] Close
9.	Pérez-Ortega, Joaquín; Almanza-Ortega, Nelva Nely; Ruiz-Vanoye, Jorge A; R., Rodolfo Pazos A; Sáenz-Sánchez, Socorro; Rodríguez-Lelis, José María; Martínez-Rebollar, Alicia A-means: improving the cluster assignment phase of k-means for Big Data Journal Article In: International Journal of Combinatorial Optimization Problems and Informatics, 9 (2), pp. 3-10, 2018, ISSN: 2007-1558. Abstract \| Links \| BibTeX \| Tags: CONACYT, ESCI @article{oj18, title = {A-means: improving the cluster assignment phase of k-means for Big Data }, author = { Joaquín Pérez-Ortega and Nelva Nely Almanza-Ortega and Jorge A. Ruiz-Vanoye and Rodolfo A. Pazos R. and Socorro Sáenz-Sánchez and José María Rodríguez-Lelis and Alicia Martínez-Rebollar }, url = {https://ijcopi.org/index.php/ojs/article/view/91}, issn = {2007-1558}, year = {2018}, date = {2018-02-23}, journal = {International Journal of Combinatorial Optimization Problems and Informatics}, volume = {9}, number = {2}, pages = {3-10}, abstract = {This paper proposes a new criterion for reducing the processing time of the assignment of data points to clusters for algorithms of the k-means family, when they are applied to instances where the number n of points is large. Our criterion allows a point to be classified in an early stage, excluding it from distance calculations to cluster centroids in subsequent iterations. The proposed criterion uses knowledge of the distance of a point to its two closest centroids and their shifts in the last two iterations. By computer experimentation using synthetic and real instances, we found that this criterion reduces execution time to approximately 2/100 of the time by k-means and generates solutions whose quality is approximately reduced by less than 3%. These findings suggest the usefulness of our criterion for problems like those found in Big Data. The NP-hardness of k-means motivates the use of this heuristics.}, keywords = {CONACYT, ESCI}, pubstate = {published}, tppubtype = {article} } Close This paper proposes a new criterion for reducing the processing time of the assignment of data points to clusters for algorithms of the k-means family, when they are applied to instances where the number n of points is large. Our criterion allows a point to be classified in an early stage, excluding it from distance calculations to cluster centroids in subsequent iterations. The proposed criterion uses knowledge of the distance of a point to its two closest centroids and their shifts in the last two iterations. By computer experimentation using synthetic and real instances, we found that this criterion reduces execution time to approximately 2/100 of the time by k-means and generates solutions whose quality is approximately reduced by less than 3%. These findings suggest the usefulness of our criterion for problems like those found in Big Data. The NP-hardness of k-means motivates the use of this heuristics. Close https://ijcopi.org/index.php/ojs/article/view/91 Close
10.	Ruiz-Vanoye, Jorge A; Díaz-Parra, Ocotlán; Fuentes-Penna, Alejandro; Ruiz-Jaimes, Miguel A; Toledo-Navarro, Yadira Editorial for Volume 9 Number 1: Eye Tracking Interfaces Journal Article In: International Journal of Combinatorial Optimization Problems and Informatics, 9 (1), pp. 1-2, 2018, ISSN: 2007-1558. Links \| BibTeX \| Tags: ESCI @article{jrnal201911, title = { Editorial for Volume 9 Number 1: Eye Tracking Interfaces }, author = {Jorge A. Ruiz-Vanoye and Ocotlán Díaz-Parra and Alejandro Fuentes-Penna and Miguel A. Ruiz-Jaimes and Yadira Toledo-Navarro}, url = {https://ijcopi.org/index.php/ojs/article/view/73/66}, issn = {2007-1558}, year = {2018}, date = {2018-01-30}, journal = {International Journal of Combinatorial Optimization Problems and Informatics}, volume = {9}, number = {1}, pages = {1-2}, keywords = {ESCI}, pubstate = {published}, tppubtype = {article} } Close https://ijcopi.org/index.php/ojs/article/view/73/66 Close
2017
11.	Ruiz-Vanoye, Jorge A; Díaz-Parra, Ocotlán; Fuentes-Penna, Alejandro; Ruiz-Jaimes, Miguel A Editorial Infant Monrtality and the data-mining applied to the prediction of treatment of diseases Journal Article In: International Journal of Combinatorial Optimization Problems and Informatics, 8 (3), pp. 1, 2017, ISSN: 2007-1558. BibTeX \| Tags: CONACYT, ESCI @article{ijcopi20170, title = {Editorial Infant Monrtality and the data-mining applied to the prediction of treatment of diseases}, author = {Jorge A. Ruiz-Vanoye and Ocotlán Díaz-Parra and Alejandro Fuentes-Penna and Miguel A. Ruiz-Jaimes}, issn = {2007-1558}, year = {2017}, date = {2017-12-01}, journal = {International Journal of Combinatorial Optimization Problems and Informatics}, volume = {8}, number = {3}, pages = {1}, keywords = {CONACYT, ESCI}, pubstate = {published}, tppubtype = {article} } Close
12.	Díaz-Parra, Ocotlán; Ruiz-Vanoye, Jorge A; Fuentes-Penna, Alejandro; Bernabe-Loranca, Beatriz; Pérez-Ortega, Joaquín; Barrera-Cámara, Ricardo A; Vélez-Díaz, Daniel; Pérez-Olguin, Nubia B Oil Platform Transport Problem (OPTP) is NP-hard Journal Article In: International Journal of Combinatorial Optimization Problems and Informatics, 8 (3), pp. 2-19, 2017, ISSN: 2007-1558. Abstract \| Links \| BibTeX \| Tags: CONACYT, ESCI, Oil Platform Transport Problem @article{CONA10, title = {Oil Platform Transport Problem (OPTP) is NP-hard}, author = {Ocotlán Díaz-Parra and Jorge A. Ruiz-Vanoye and Alejandro Fuentes-Penna and Beatriz Bernabe-Loranca and Joaquín Pérez-Ortega and Ricardo A. Barrera-Cámara and Daniel Vélez-Díaz and Nubia B Pérez-Olguin}, url = {https://ijcopi.org/index.php/ojs/article/view/14}, issn = {2007-1558}, year = {2017}, date = {2017-11-11}, journal = {International Journal of Combinatorial Optimization Problems and Informatics}, volume = {8}, number = {3}, pages = {2-19}, abstract = {The Oil Platform Transport Problem is considered as a combination/interlink of the two well-studied NP-Hard/NP-Complete problems: the Helicopter Routing Problem-HRP (a generalization of the Split Delivery Vehicle Routing Problem) and the one-dimensional Bin Packing Problem (BPP-1). The Oil Platform Transport Problem consist of to minimize the cost of carry resources, goods or people from one location (airport/platform) to another location (airport/platform) using helicopters with some restrictions as capacity and time windows. We provide the proof that this problem is NP-Hard/NP-Complete Problem by the polynomial transformation using formal languages between the Vehicle Routing Problem and the Oil Platform Transport Problem. We propose a new mathematical model to the Oil Platform Transport problem, and we present the parameters or characterization of Oil Platform Transport Problem instances of Mexican state-owned petroleum company (PEMEX). We generated 5 instance set, each instance set has 50 cases of randomly generated instances and real instances (with GIS data) of PEMEX Oil Platforms. We use the CPLEX solver to find the optimal cost of carrier resources, goods or people contains in the Oil Platform Transport Problem. The Oil Platform Transport Problem is considered as a combination/interlink of the two well-studied NP-Hard/NP-Complete problems: the Helicopter Routing Problem-HRP (a generalization of the Split Delivery Vehicle Routing Problem) and the one-dimensional Bin Packing Problem (BPP-1). The Oil Platform Transport Problem consist of to minimize the cost of carry resources, goods or people from one location (airport/platform) to another location (airport/platform) using helicopters with some restrictions as capacity and time windows. We provide the proof that this problem is NP-Hard/NP-Complete Problem by the polynomial transformation using formal languages between the Vehicle Routing Problem and the Oil Platform Transport Problem. We propose a new mathematical model to the Oil Platform Transport problem, and we present the parameters or characterization of Oil Platform Transport Problem instances of Mexican state-owned petroleum company (PEMEX). We generated 5 instance set, each instance set has 50 cases of randomly generated instances and real instances (with GIS data) of PEMEX Oil Platforms. We use the CPLEX solver to find the optimal cost of carrier resources, goods or people contains in the Oil Platform Transport Problem.}, keywords = {CONACYT, ESCI, Oil Platform Transport Problem}, pubstate = {published}, tppubtype = {article} } Close The Oil Platform Transport Problem is considered as a combination/interlink of the two well-studied NP-Hard/NP-Complete problems: the Helicopter Routing Problem-HRP (a generalization of the Split Delivery Vehicle Routing Problem) and the one-dimensional Bin Packing Problem (BPP-1). The Oil Platform Transport Problem consist of to minimize the cost of carry resources, goods or people from one location (airport/platform) to another location (airport/platform) using helicopters with some restrictions as capacity and time windows. We provide the proof that this problem is NP-Hard/NP-Complete Problem by the polynomial transformation using formal languages between the Vehicle Routing Problem and the Oil Platform Transport Problem. We propose a new mathematical model to the Oil Platform Transport problem, and we present the parameters or characterization of Oil Platform Transport Problem instances of Mexican state-owned petroleum company (PEMEX). We generated 5 instance set, each instance set has 50 cases of randomly generated instances and real instances (with GIS data) of PEMEX Oil Platforms. We use the CPLEX solver to find the optimal cost of carrier resources, goods or people contains in the Oil Platform Transport Problem. The Oil Platform Transport Problem is considered as a combination/interlink of the two well-studied NP-Hard/NP-Complete problems: the Helicopter Routing Problem-HRP (a generalization of the Split Delivery Vehicle Routing Problem) and the one-dimensional Bin Packing Problem (BPP-1). The Oil Platform Transport Problem consist of to minimize the cost of carry resources, goods or people from one location (airport/platform) to another location (airport/platform) using helicopters with some restrictions as capacity and time windows. We provide the proof that this problem is NP-Hard/NP-Complete Problem by the polynomial transformation using formal languages between the Vehicle Routing Problem and the Oil Platform Transport Problem. We propose a new mathematical model to the Oil Platform Transport problem, and we present the parameters or characterization of Oil Platform Transport Problem instances of Mexican state-owned petroleum company (PEMEX). We generated 5 instance set, each instance set has 50 cases of randomly generated instances and real instances (with GIS data) of PEMEX Oil Platforms. We use the CPLEX solver to find the optimal cost of carrier resources, goods or people contains in the Oil Platform Transport Problem. Close https://ijcopi.org/index.php/ojs/article/view/14 Close
13.	Díaz-Parra, Ocotlán; Fuentes-Penna, Alejandro; Ruiz-Jaimes, Miguel A Editorial for Volume 8 Number 3 - Mexican Infant Mortality and the data-mining applied to the prediction of treatment of diseases Journal Article In: International Journal of Combinatorial Optimization Problems and Informatics, 8 (3), pp. 1, 2017, ISBN: 2007-1558. Links \| BibTeX \| Tags: CONACYT, data-mining, ESCI @article{CONA11, title = {Editorial for Volume 8 Number 3 - Mexican Infant Mortality and the data-mining applied to the prediction of treatment of diseases}, author = {Ocotlán Díaz-Parra and Alejandro Fuentes-Penna and Miguel A. Ruiz-Jaimes}, url = {https://ijcopi.org/index.php/ojs/article/view/12}, isbn = {2007-1558}, year = {2017}, date = {2017-11-11}, journal = {International Journal of Combinatorial Optimization Problems and Informatics}, volume = {8}, number = {3}, pages = {1}, keywords = {CONACYT, data-mining, ESCI}, pubstate = {published}, tppubtype = {article} } Close https://ijcopi.org/index.php/ojs/article/view/12 Close
14.	Ruiz-Vanoye, Jorge A; Díaz-Parra, Ocotlán; Fuentes-Penna, Alejandro; Vélez-Díaz, Daniel; García-Munguía, Mónica; Ruiz-Díaz, Jorge; Ruiz-Díaz, Fernando Motivation Index to Improve the Soccer Performance Journal Article In: International Journal of Combinatorial Optimization Problems and Informatics, 8 (3), pp. 45-57, 2017, ISSN: 2007-1558. Abstract \| Links \| BibTeX \| Tags: CONACYT, ESCI, Soccer Performance @article{CONA8, title = {Motivation Index to Improve the Soccer Performance}, author = {Jorge A. Ruiz-Vanoye and Ocotlán Díaz-Parra and Alejandro Fuentes-Penna and Daniel Vélez-Díaz and Mónica García-Munguía and Jorge Ruiz-Díaz and Fernando Ruiz-Díaz}, url = {https://ijcopi.org/index.php/ojs/article/view/18}, issn = {2007-1558}, year = {2017}, date = {2017-11-10}, journal = {International Journal of Combinatorial Optimization Problems and Informatics}, volume = {8}, number = {3}, pages = {45-57}, abstract = {The soccer players always have sought to improve its performance. There are methodologies, diets, and an excellent coach to improve the soccer skills. In this paper, we propose the use of metrics or statistical indicators for improving the soccer performance. Additionally we take into consideration the rating of the individual errors with negative points: Goals Shots Off Target, Not goals from direct free-kicks and indirect free-kicks, Unsuccessful dribbles, Caught Opposition Offside, Unsuccessful Shots free-kicks or indirect free-kicks, Head Shots Off the target, Shots Off Target, Unsuccessful Long /short passes, Pass Directions incorrect, Pass Lengths incorrect, Pass Locations incorrect, Duels lost on the offensive/defensive, Aerial duels lost on the offensive/defensive, Own goals, Penalties conceded, Defensive mistakes, Fouls Committed, Corner Crosses / direct or indirect free-kicks conceded, Throw-ins conceded, Yellow or red cards, Substituted off, and others, which significantly affects the soccer performance of the team, to the metric called Motivation Index or lack of motivation. A European soccer match was analyzed to obtain the index of motivation and thereby determine the relationship of the index with the final outcome of the match. We use the NacSports software to perform an analysis of videos of a soccer match.}, keywords = {CONACYT, ESCI, Soccer Performance}, pubstate = {published}, tppubtype = {article} } Close The soccer players always have sought to improve its performance. There are methodologies, diets, and an excellent coach to improve the soccer skills. In this paper, we propose the use of metrics or statistical indicators for improving the soccer performance. Additionally we take into consideration the rating of the individual errors with negative points: Goals Shots Off Target, Not goals from direct free-kicks and indirect free-kicks, Unsuccessful dribbles, Caught Opposition Offside, Unsuccessful Shots free-kicks or indirect free-kicks, Head Shots Off the target, Shots Off Target, Unsuccessful Long /short passes, Pass Directions incorrect, Pass Lengths incorrect, Pass Locations incorrect, Duels lost on the offensive/defensive, Aerial duels lost on the offensive/defensive, Own goals, Penalties conceded, Defensive mistakes, Fouls Committed, Corner Crosses / direct or indirect free-kicks conceded, Throw-ins conceded, Yellow or red cards, Substituted off, and others, which significantly affects the soccer performance of the team, to the metric called Motivation Index or lack of motivation. A European soccer match was analyzed to obtain the index of motivation and thereby determine the relationship of the index with the final outcome of the match. We use the NacSports software to perform an analysis of videos of a soccer match. Close https://ijcopi.org/index.php/ojs/article/view/18 Close
15.	Fuentes-Penna, Alejandro; Ruiz-Vanoye, Jorge A; Díaz-Parra, Ocotlán Project Management for Farm Production Journal Article In: International Journal of Combinatorial Optimization Problems and Informatics, 8 (3), pp. 39-44, 2017, ISSN: 2007-1558. Links \| BibTeX \| Tags: CONACYT, ESCI, Project Management @article{CONA9, title = {Project Management for Farm Production}, author = {Alejandro Fuentes-Penna and Jorge A. Ruiz-Vanoye and Ocotlán Díaz-Parra}, url = {https://ijcopi.org/index.php/ojs/article/view/17}, issn = {2007-1558}, year = {2017}, date = {2017-11-10}, journal = {International Journal of Combinatorial Optimization Problems and Informatics}, volume = {8}, number = {3}, pages = {39-44}, keywords = {CONACYT, ESCI, Project Management}, pubstate = {published}, tppubtype = {article} } Close https://ijcopi.org/index.php/ojs/article/view/17 Close
16.	Díaz-Parra, Ocotlán; Ruiz-Vanoye, Jorge A; Fuentes-Penna, Alejandro; Pérez-Ortega, Joaquín; Pérez-Olguin, Nubia B; Benítez, Fernando Torres Editorial for Volume 8 Number 1- Characterization in the Transfer of Resources to the International Space Station Journal Article In: International Journal of Combinatorial Optimization Problems and Informatics, 8 (1), pp. 1-5, 2017, ISSN: 2007-1558. BibTeX \| Tags: CONACYT, ESCI, International Space Station @article{CONA6, title = {Editorial for Volume 8 Number 1- Characterization in the Transfer of Resources to the International Space Station}, author = {Ocotlán Díaz-Parra and Jorge A. Ruiz-Vanoye and Alejandro Fuentes-Penna and Joaquín Pérez-Ortega and Nubia B Pérez-Olguin and Fernando Torres Benítez}, issn = {2007-1558}, year = {2017}, date = {2017-01-07}, journal = {International Journal of Combinatorial Optimization Problems and Informatics}, volume = {8}, number = {1}, pages = {1-5}, keywords = {CONACYT, ESCI, International Space Station}, pubstate = {published}, tppubtype = {article} } Close
2016
17.	Zurita-Barron, Mario A; Ruiz-Vanoye, Jorge A; Díaz-Parra, Ocotlán; Fuentes-Penna, Alejandro Desarrollo y prueba de un modelo matemático orientado a optimizar los recursos de los Proyectos de Innovación Tecnológica presentados en el CONACYT Journal Article In: Computación y Sistemas, 20 (4), pp. 749-761, 2016, ISSN: 1405-5546. Links \| BibTeX \| Tags: CONACYT, ESCI, Proyectos de Innovación Tecnológica @article{CONA5, title = {Desarrollo y prueba de un modelo matemático orientado a optimizar los recursos de los Proyectos de Innovación Tecnológica presentados en el CONACYT}, author = {Mario A. Zurita-Barron and Jorge A. Ruiz-Vanoye and Ocotlán Díaz-Parra and Alejandro Fuentes-Penna}, url = {http://www.redalyc.org/html/615/61549258014/index.html}, issn = {1405-5546}, year = {2016}, date = {2016-02-07}, journal = {Computación y Sistemas}, volume = {20}, number = {4}, pages = {749-761}, keywords = {CONACYT, ESCI, Proyectos de Innovación Tecnológica}, pubstate = {published}, tppubtype = {article} } Close http://www.redalyc.org/html/615/61549258014/index.html Close
18.	Ruiz-Vanoye, Jorge A; Cedillo-Campos, Miguel G; Fuentes-Penna, Alejandro; Díaz-Parra, Ocotlán Editorial for Volume 7 Number 1: The Space Transportation Journal Article In: International Journal of Combinatorial Optimization Problems and Informatics, 7 (1), pp. 1-2, 2016, ISSN: 2007-1558. Links \| BibTeX \| Tags: CONACYT, ESCI, Space Transportation @article{CONA7, title = {Editorial for Volume 7 Number 1: The Space Transportation}, author = {Jorge A. Ruiz-Vanoye and Miguel G Cedillo-Campos and Alejandro Fuentes-Penna and Ocotlán Díaz-Parra}, url = {https://ijcopi.org/index.php/ojs/article/view/40}, issn = {2007-1558}, year = {2016}, date = {2016-02-07}, journal = {International Journal of Combinatorial Optimization Problems and Informatics}, volume = {7}, number = {1}, pages = {1-2}, keywords = {CONACYT, ESCI, Space Transportation}, pubstate = {published}, tppubtype = {article} } Close https://ijcopi.org/index.php/ojs/article/view/40 Close
2015
19.	Ruiz-Vanoye, Jorge A; Diaz-Parra, Ocotlán; López-Pérez, Sócrates; Fuentes-Penna, Alejandro; Bernabé-Loranca, Beatriz; Zavala-Díaz, José C; Barrera-Cámara, Ricardo A Editorial for Volume 6 Number 1: Dissemination of Academic Books on the Book Citation Index Journal Article In: International Journal of Combinatorial Optimization Problems and Informatics, 6 (1), pp. 1-6, 2015, ISSN: 2007-1558. Links \| BibTeX \| Tags: Book Citation Index, CONACYT, ESCI @article{CONA2, title = {Editorial for Volume 6 Number 1: Dissemination of Academic Books on the Book Citation Index}, author = {Jorge A. Ruiz-Vanoye and Ocotlán Diaz-Parra and Sócrates López-Pérez and Alejandro Fuentes-Penna and Beatriz Bernabé-Loranca and José C. Zavala-Díaz and Ricardo A. Barrera-Cámara}, url = {https://ijcopi.org/index.php/ojs/article/view/57}, issn = {2007-1558}, year = {2015}, date = {2015-02-07}, journal = {International Journal of Combinatorial Optimization Problems and Informatics}, volume = {6}, number = {1}, pages = {1-6}, keywords = {Book Citation Index, CONACYT, ESCI}, pubstate = {published}, tppubtype = {article} } Close https://ijcopi.org/index.php/ojs/article/view/57 Close
20.	Ruiz-Vanoye, Jorge A; Díaz-Parra, Ocotlán; Fuentes-Penna, Alejandro; Ochoa, Alberto; Barrera-Cámara, Ricardo A; Velez-Díaz, Daniel Editorial for Volume 6 Number 2: Books Content Manager of Open Access - Open Monograph Press Journal Article In: International Journal of Combinatorial Optimization Problems and Informatics, 6 (2), pp. 1-10, 2015, ISSN: 2007-1558. Links \| BibTeX \| Tags: CONACYT, ESCI, Open Monograph Press @article{CONA3, title = {Editorial for Volume 6 Number 2: Books Content Manager of Open Access - Open Monograph Press}, author = {Jorge A. Ruiz-Vanoye and Ocotlán Díaz-Parra and Alejandro Fuentes-Penna and Alberto Ochoa and Ricardo A. Barrera-Cámara and Daniel Velez-Díaz}, url = {https://ijcopi.org/index.php/ojs/article/view/52}, issn = {2007-1558}, year = {2015}, date = {2015-02-07}, journal = {International Journal of Combinatorial Optimization Problems and Informatics}, volume = {6}, number = {2}, pages = {1-10}, keywords = {CONACYT, ESCI, Open Monograph Press}, pubstate = {published}, tppubtype = {article} } Close https://ijcopi.org/index.php/ojs/article/view/52 Close
21.	Ruiz-Vanoye, Jorge A; Díaz-Parra, Ocotlán; Fuentes-Penna, Alejandro; Ochoa, Alberto; Bernábe-Loranca, Beatriz Editorial for Volume 6 Number 3 - Computing Solutions inspired in Biology Journal Article In: International Journal of Combinatorial Optimization Problems and Informatics, 6 (3), pp. 1-4, 2015, ISSN: 2007-1558. Links \| BibTeX \| Tags: Computing Solutions, CONACYT, ESCI @article{CONA4, title = {Editorial for Volume 6 Number 3 - Computing Solutions inspired in Biology}, author = {Jorge A. Ruiz-Vanoye and Ocotlán Díaz-Parra and Alejandro Fuentes-Penna and Alberto Ochoa and Beatriz Bernábe-Loranca}, url = {https://ijcopi.org/index.php/ojs/article/view/47}, issn = {2007-1558}, year = {2015}, date = {2015-02-07}, journal = {International Journal of Combinatorial Optimization Problems and Informatics}, volume = {6}, number = {3}, pages = {1-4}, keywords = {Computing Solutions, CONACYT, ESCI}, pubstate = {published}, tppubtype = {article} } Close https://ijcopi.org/index.php/ojs/article/view/47 Close

2021

2020

2019

2018

2017

2016

2015