Isnaini Rosyida
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Isnaini Rosyida has a total of 63 co-authors. Here are the top co-authors by number of shared publications:
- Christiana Rini Indrati
Universitas Gadjah Mada
5 shared publications - Diari Indriati
Faculty of Mathematics and Natural Sciences, Universitas Sebelas Maret, Surakarta, Indonesia
5 shared publications Widodo
5 shared publications- Mulyono
Mathematics Department, Universitas Negeri Semarang, Semarang, Indonesia
3 shared publications D Indriati
Department of Mathematics, Universitas Sebelas Maret, Surakarta, Indonesia
2 shared publicationsNurhaida
2 shared publications
Latest Publications
- Open Access
- 1 September 2026
- Published by IOP Publishing in IOP Conference Series: Earth and Environmental Science
- Vol. 1671 (1)
Best Route Planning for Fuel Distribution using Bellman-Ford Algorithm and Sugeno Fuzzy Weighted Method to Support Green Environment
The Delays in fuel distribution are often caused by inefficient route planning, which increases travel time, fuel consumption, and operational costs, thereby increasing the total costs incurred by the company. This study aims to determine the best fuel distribution routes from the Semarang Integrated Fuel Terminal to gas stations in Semarang City within a 4 km radius. We represent the fuel distribution network from the Integrated Fuel Terminal to gas stations using a weighted directed graph model. The arc weights are calculated using the Sugeno FIS. Two input variables are used in determining the arc weights, i.e., distance and travel time for each road segment. The data obtained from Google Maps and Google Earth. The Sugeno FIS successfully handles uncertainty in distance variable which is categorized as near, medium, and far. Meanwhile, time variable is fuzzified into fast, medium, and long. The arc weights are obtained using the weighted average method, producing a crisp output. The Bellman-Ford algorithm generates 16 optimal routes that can improve fuel distribution efficiency and reduce operational costs.
- 1 September 2026
- Published by IOP Publishing in IOP Conference Series: Earth and Environmental Science
- Vol. 1671 (1)
Open AccessBest Route Planning for Fuel Distribution using Bellman-Ford Algorithm and Sugeno Fuzzy Weighted Method to Support Green Environment
The Delays in fuel distribution are often caused by inefficient route planning, which increases travel time, fuel consumption, and operational costs, thereby increasing the total costs incurred by the company. This study aims to determine the best fuel distribution routes from the Semarang Integrated Fuel Terminal to gas stations in Semarang City within a 4 km radius. We represent the fuel distribution network from the Integrated Fuel Terminal to gas stations using a weighted directed graph model. The arc weights are calculated using the Sugeno FIS. Two input variables are used in determining the arc weights, i.e., distance and travel time for each road segment. The data obtained from Google Maps and Google Earth. The Sugeno FIS successfully handles uncertainty in distance variable which is categorized as near, medium, and far. Meanwhile, time variable is fuzzified into fast, medium, and long. The arc weights are obtained using the weighted average method, producing a crisp output. The Bellman-Ford algorithm generates 16 optimal routes that can improve fuel distribution efficiency and reduce operational costs.
- Open Access
- 27 November 2025
- Published by Universitas Negeri Gorontalo in Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi
- Vol. 13 (3) , 293-299
Penentuan Spektrum pada Variasi Graf Barbel
This study aims to analyze the determination of the spectrum of barbell graph variations, where the variations are made by modifying the number of nodes on the bridge between complete graphs in a barbell structure. The spectrum contains the eigenvalues of the adjacency matrix of the barbell graph variations along with their multiplicities. The analysis is conducted manually using linear algebra approaches such as cofactor expansion, characteristic polynomial factorization, the rational root theorem, and Horner’s scheme. The results are then validated using Python programming. The findings of this study show that the longer and more complex the bridge connecting the two complete graphs, the greater the diversity of eigenvalues produced. The spectrum of the barbell graph B(n,1)B(n, 1)B(n,1) consists of the eigenvalues λ1,n−1,λ2,−1,λ3\lambda_1, n - 1, \lambda_2, -1, \lambda_3λ1,n−1,λ2,−1,λ3 with multiplicities 1,1,1,2n−3,11, 1, 1, 2n - 3, 11,1,1,2n−3,1. Furthermore, the spectrum of the barbell graph B(n,2)B(n, 2)B(n,2) consists of the eigenvalues λ1,λ2,λ3,λ4,−1,λ5,λ6\lambda_1, \lambda_2, \lambda_3, \lambda_4, -1, \lambda_5, \lambda_6λ1,λ2,λ3,λ4,−1,λ5,λ6 with multiplicities 1,1,1,1,2n−4,11, 1, 1, 1, 2n - 4, 11,1,1,1,2n−4,1, respectively. This research provides theoretical contributions regarding the relationship between complex graph structures and their spectral representations.
- 27 November 2025
- Published by Universitas Negeri Gorontalo in Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi
- Vol. 13 (3) , 293-299
Open AccessPenentuan Spektrum pada Variasi Graf Barbel
This study aims to analyze the determination of the spectrum of barbell graph variations, where the variations are made by modifying the number of nodes on the bridge between complete graphs in a barbell structure. The spectrum contains the eigenvalues of the adjacency matrix of the barbell graph variations along with their multiplicities. The analysis is conducted manually using linear algebra approaches such as cofactor expansion, characteristic polynomial factorization, the rational root theorem, and Horner’s scheme. The results are then validated using Python programming. The findings of this study show that the longer and more complex the bridge connecting the two complete graphs, the greater the diversity of eigenvalues produced. The spectrum of the barbell graph B(n,1)B(n, 1)B(n,1) consists of the eigenvalues λ1,n−1,λ2,−1,λ3\lambda_1, n - 1, \lambda_2, -1, \lambda_3λ1,n−1,λ2,−1,λ3 with multiplicities 1,1,1,2n−3,11, 1, 1, 2n - 3, 11,1,1,2n−3,1. Furthermore, the spectrum of the barbell graph B(n,2)B(n, 2)B(n,2) consists of the eigenvalues λ1,λ2,λ3,λ4,−1,λ5,λ6\lambda_1, \lambda_2, \lambda_3, \lambda_4, -1, \lambda_5, \lambda_6λ1,λ2,λ3,λ4,−1,λ5,λ6 with multiplicities 1,1,1,1,2n−4,11, 1, 1, 1, 2n - 4, 11,1,1,1,2n−4,1, respectively. This research provides theoretical contributions regarding the relationship between complex graph structures and their spectral representations.
- Open Access
- 5 November 2025
- Published by New York Business Global LLC in European Journal of Pure and Applied Mathematics
- Vol. 18 (4) , 6601
Edge Irregular Reflexive Labeling of Ladder Graph Corona Null Graph Families
Given a graph $G(V,E)$ or simply written as $G$. The graph labeling was first introduced in 1960, it is a function that mapping integers or labels to graph elements (vertices, edges, or both of them) which must satisfy some certain criteria. This concepts was applied in some real problems. In 2007, there was a new concept on labeling, i.e., ``vertex irregular total labeling" and ``edge irregular total labeling". In 2017, there was a new concept, i.e., ``vertex irregular reflexive labeling" and ``edge irregular reflexive labeling". The ``edge irregular reflexive $k-$ labeling" of $G$ is a mapping that puts an even number label from $0$ to $2k_v$ to every vertex and a positive integer label from $1$ to $k_e$ to every edge with different weights for each edge. The minimum $k$ of the biggest label among all possible ``edge irregular reflexive $k-$ labeling" of $G$ is called the ``reflexive edge strength" of $G$, denoted as $res(G)$. There are only few result on ``vertex irregular reflexive labeling" or ``edge irregular reflexive labeling" of corona product graphs. Hence, the purpose of this research are to investigate $res$ of corona product of some ladder graphs and null graphs. Therefore, the goal of this study is to examine the $res$ of corona product of some ladder graphs and null graphs. We get the results as follows: $res(SL_n \odot N_m)$ for ``$n \ge 2$ and $m \ge 1$" are ``$\left \lceil \frac{2nm+3n-3}{3} \right \rceil$" for ``$2nm+3n-3 \not \equiv 2,3 \pmod{6}$" and ``$\left \lceil \frac{2nm+3n-3}{3} \right \rceil+1$" for ``$2nm+3n-3 \equiv 2,3 \pmod{6}$". Moreover, $res(DL_n \odot N_m)$ for $n\geq2$ and $m\geq1$ are ``$\left \lceil \frac{2nm+5n-4}{3} \right \rceil$" for ``$2nm+5n-4 \not \equiv 2,3 \pmod{6}$" and ``$\left \lceil \frac{2nm+5n-4}{3} \right \rceil+1$" for ``$2nm+5n-4 \equiv 2,3 \pmod{6}$". These results contribute to developing the theory of reflexive labeling.- 5 November 2025
- Published by New York Business Global LLC in European Journal of Pure and Applied Mathematics
- Vol. 18 (4) , 6601
Open AccessEdge Irregular Reflexive Labeling of Ladder Graph Corona Null Graph Families
Given a graph $G(V,E)$ or simply written as $G$. The graph labeling was first introduced in 1960, it is a function that mapping integers or labels to graph elements (vertices, edges, or both of them) which must satisfy some certain criteria. This concepts was applied in some real problems. In 2007, there was a new concept on labeling, i.e., ``vertex irregular total labeling" and ``edge irregular total labeling". In 2017, there was a new concept, i.e., ``vertex irregular reflexive labeling" and ``edge irregular reflexive labeling". The ``edge irregular reflexive $k-$ labeling" of $G$ is a mapping that puts an even number label from $0$ to $2k_v$ to every vertex and a positive integer label from $1$ to $k_e$ to every edge with different weights for each edge. The minimum $k$ of the biggest label among all possible ``edge irregular reflexive $k-$ labeling" of $G$ is called the ``reflexive edge strength" of $G$, denoted as $res(G)$. There are only few result on ``vertex irregular reflexive labeling" or ``edge irregular reflexive labeling" of corona product graphs. Hence, the purpose of this research are to investigate $res$ of corona product of some ladder graphs and null graphs. Therefore, the goal of this study is to examine the $res$ of corona product of some ladder graphs and null graphs. We get the results as follows: $res(SL_n \odot N_m)$ for ``$n \ge 2$ and $m \ge 1$" are ``$\left \lceil \frac{2nm+3n-3}{3} \right \rceil$" for ``$2nm+3n-3 \not \equiv 2,3 \pmod{6}$" and ``$\left \lceil \frac{2nm+3n-3}{3} \right \rceil+1$" for ``$2nm+3n-3 \equiv 2,3 \pmod{6}$". Moreover, $res(DL_n \odot N_m)$ for $n\geq2$ and $m\geq1$ are ``$\left \lceil \frac{2nm+5n-4}{3} \right \rceil$" for ``$2nm+5n-4 \not \equiv 2,3 \pmod{6}$" and ``$\left \lceil \frac{2nm+5n-4}{3} \right \rceil+1$" for ``$2nm+5n-4 \equiv 2,3 \pmod{6}$". These results contribute to developing the theory of reflexive labeling. - Open Access
- 30 January 2025
- Published by LPPM Universitas Singaperbangsa Karawang - Research Department in Indonesia University in SJME (Supremum Journal of Mathematics Education)
- Vol. 9 (1) , 75-86
Meta Analysis: The Effect of Treffinger Learning Model on Students' Mathematical Creative Thinking Ability
This study aims to determine the effect of Treffinger learning model on students' mathematical creative thinking ability, based on previous research articles. The method used in this research is meta-analysis. The results of the analysis through the calculation of the t-test and effect size show that , indicating that the average mathematical creative thinking ability of students who use the Treffinger model is higher than the average students who follow conventional learning. Thus, there is a significant influence between the mathematical creative thinking ability of students using the Treffinger model, with an effect size of 1.02, which is classified in the large category.
- 30 January 2025
- Published by LPPM Universitas Singaperbangsa Karawang - Research Department in Indonesia University in SJME (Supremum Journal of Mathematics Education)
- Vol. 9 (1) , 75-86
Open AccessMeta Analysis: The Effect of Treffinger Learning Model on Students' Mathematical Creative Thinking Ability
This study aims to determine the effect of Treffinger learning model on students' mathematical creative thinking ability, based on previous research articles. The method used in this research is meta-analysis. The results of the analysis through the calculation of the t-test and effect size show that , indicating that the average mathematical creative thinking ability of students who use the Treffinger model is higher than the average students who follow conventional learning. Thus, there is a significant influence between the mathematical creative thinking ability of students using the Treffinger model, with an effect size of 1.02, which is classified in the large category.
- Open Access
- 10 December 2024
- Published by Cahaya Ilmu Cendekia in Journal Evaluation in Education (JEE)
- Vol. 6 (1) , 89-101
Meta Analysis: Analysis of Students' Mathematical Critical Thinking Ability Through the Inquiry Learning Model
Purpose of the study: The importance of critical mathematical thinking skills in mathematics learning in the current era of the industrial revolution and globalization has encouraged research to evaluate the impact of learning models, one of which is the inquiry model, on students' critical mathematical thinking skills. Methodology: This meta-analysis review was conducted using the stages of data collection, literature review using PRISMA, statistical analysis, qualitative study, and conclusions. Data were collected through national and international journals and proceedings indexed by Sinta or Scopus to make the information obtained more credible. This study uses the PRISMA framework with the steps identification, screening, eligibility, and inclusion to help transparency, consistency, and completeness of reporting the results of the meta-analysis review. Main Findings: Based on the research results, inquiry learning significantly influences students' critical mathematical thinking skills. This is evidenced by increased motivation, curiosity, and student involvement in learning. However, this finding requires follow-up in the future, for example, the development of innovations in textbook learning in the form of textbooks or other learning media. Novelty/Originality of this study: The study analysis of the process of students' critical mathematical thinking skills towards the inquiry learning model in this study was conducted by citing various cross-disciplinary studies and studies from multiple countries or regions to balance more detailed analysis perspectives globally.
- 10 December 2024
- Published by Cahaya Ilmu Cendekia in Journal Evaluation in Education (JEE)
- Vol. 6 (1) , 89-101
Open AccessMeta Analysis: Analysis of Students' Mathematical Critical Thinking Ability Through the Inquiry Learning Model
Purpose of the study: The importance of critical mathematical thinking skills in mathematics learning in the current era of the industrial revolution and globalization has encouraged research to evaluate the impact of learning models, one of which is the inquiry model, on students' critical mathematical thinking skills. Methodology: This meta-analysis review was conducted using the stages of data collection, literature review using PRISMA, statistical analysis, qualitative study, and conclusions. Data were collected through national and international journals and proceedings indexed by Sinta or Scopus to make the information obtained more credible. This study uses the PRISMA framework with the steps identification, screening, eligibility, and inclusion to help transparency, consistency, and completeness of reporting the results of the meta-analysis review. Main Findings: Based on the research results, inquiry learning significantly influences students' critical mathematical thinking skills. This is evidenced by increased motivation, curiosity, and student involvement in learning. However, this finding requires follow-up in the future, for example, the development of innovations in textbook learning in the form of textbooks or other learning media. Novelty/Originality of this study: The study analysis of the process of students' critical mathematical thinking skills towards the inquiry learning model in this study was conducted by citing various cross-disciplinary studies and studies from multiple countries or regions to balance more detailed analysis perspectives globally.
- Open Access
- 30 November 2023
- Published by MDPI AG in Algorithms
- Vol. 16 (12) , 551
An Algorithm for Coloring of Picture Fuzzy Graphs Based on Strong and Weak Adjacencies, and Its Application
The idea of strong and weak adjacencies between vertices has been generalized into fuzzy graphs and intuitionistic fuzzy graphs (IFGs), and it is an important part of making decisions. However, one or two membership degrees are not always sufficient for making decisions on real-world problems that need an answer of types “yes, neutral, and no”. Consequently, in previous work, we generalized the concept into picture fuzzy graphs (PFGs) where each element in the PFG has membership, neutral, and non-membership degrees. Moreover, we constructed the notion of the coloring of PFGs based on strong and weak adjacencies between vertices. In this paper, we investigate some properties of the chromatic number of PFGs based on the concept of strong and weak adjacencies between vertices. According to these properties, we construct an algorithm to find the chromatic number of PFGs. The algorithm is useful when we work with large PFGs. Further, we improve the method to implement the PFG’s coloring for determining traffic signal phasing at an intersection. A case study has also been carried to evaluate the method.
- 30 November 2023
- Published by MDPI AG in Algorithms
- Vol. 16 (12) , 551
Open AccessAn Algorithm for Coloring of Picture Fuzzy Graphs Based on Strong and Weak Adjacencies, and Its Application
The idea of strong and weak adjacencies between vertices has been generalized into fuzzy graphs and intuitionistic fuzzy graphs (IFGs), and it is an important part of making decisions. However, one or two membership degrees are not always sufficient for making decisions on real-world problems that need an answer of types “yes, neutral, and no”. Consequently, in previous work, we generalized the concept into picture fuzzy graphs (PFGs) where each element in the PFG has membership, neutral, and non-membership degrees. Moreover, we constructed the notion of the coloring of PFGs based on strong and weak adjacencies between vertices. In this paper, we investigate some properties of the chromatic number of PFGs based on the concept of strong and weak adjacencies between vertices. According to these properties, we construct an algorithm to find the chromatic number of PFGs. The algorithm is useful when we work with large PFGs. Further, we improve the method to implement the PFG’s coloring for determining traffic signal phasing at an intersection. A case study has also been carried to evaluate the method.
- Open Access
- 7 November 2023
- Published by MDPI AG in Preprints.org
An Algorithm for Coloring of Picture Fuzzy Graphs Based on Strong and Weak Adjacencies and its Application
The idea of strong and weak adjacencies between vertices has been generalized into fuzzy graphs and intuitionistic fuzzy graphs (IFGs) and it is an important part of making decisions. However, one or two membership degrees are not always sufficient for making decisions on real-world problems that need an answer of types “yes, neutral, and no". Consequently, in previous work, we generalized the concept into picture fuzzy graphs (PFGs) where each element in the PFG has membership, neutral, and non-membership degrees. Moreover, we constructed the notion of the coloring of PFGs based on strong and weak adjacencies between vertices. In this paper, we investigate some properties of the chromatic number of PFGs based on the concept of strong and weak adjacencies between vertices. According to the properties, we construct an algorithm to find the chromatic number of PFGs. The algorithm is usefull when we work with large PFGs. Further, we improve the method to implement the PFG’s coloring for determining traffic signal phasing at an intersection. A case study has also been done to evaluate the method.
- 7 November 2023
- Published by MDPI AG in Preprints.org
Open AccessAn Algorithm for Coloring of Picture Fuzzy Graphs Based on Strong and Weak Adjacencies and its Application
The idea of strong and weak adjacencies between vertices has been generalized into fuzzy graphs and intuitionistic fuzzy graphs (IFGs) and it is an important part of making decisions. However, one or two membership degrees are not always sufficient for making decisions on real-world problems that need an answer of types “yes, neutral, and no". Consequently, in previous work, we generalized the concept into picture fuzzy graphs (PFGs) where each element in the PFG has membership, neutral, and non-membership degrees. Moreover, we constructed the notion of the coloring of PFGs based on strong and weak adjacencies between vertices. In this paper, we investigate some properties of the chromatic number of PFGs based on the concept of strong and weak adjacencies between vertices. According to the properties, we construct an algorithm to find the chromatic number of PFGs. The algorithm is usefull when we work with large PFGs. Further, we improve the method to implement the PFG’s coloring for determining traffic signal phasing at an intersection. A case study has also been done to evaluate the method.
- Open Access
- 6 October 2023
- Published by Universitas Muhammadiyah Mataram in JTAM (Jurnal Teori dan Aplikasi Matematika)
- Vol. 7 (4) , 999-1010
Application of Compatible Graph and Webster Methods for Traffic Light Arrangement in Jepara
The problem of congestion has become a common problem that is often found on the highways, especially at the crossroads, without exception in Jepara Regency. The Mayong-Jepara Highway intersection is classified as a busy intersection that is full of vehicles during every departure and return hours, which are dominated by factory employees. Congestion often occurs at these intersections even though there are traffic lights that regulate the movement of vehicles. So, This study aims to find the solutions to congestion problems at Mayong-Jepara Highway intersection through compatible graph modeling and optimizing traffic light cycle time using the Webster method. Compatible graphs are used to determine traffic flows that are worked to move simultaneously without causing collisions, and that are used to carry out the graph weighting to determine the number of phases. The variables used in this applied research are the data on the number of vehicles, road width, and traffic light duration that taken directly in the field. Because the traffic density in the morning and afternoon is different for each intersection arm. Thus, the cycle time is determined in 2 sessions namely the morning and the afternoon. From the modeling of the compatible graph that has been weighted, it is obtained that the morning and afternoon sessions have 3 phases as the total which are then used to determine the traffic light cycle time. As a result, the cycle times for the morning session are 98 seconds, and the afternoon session is 155 seconds. The results were then simulated with PTV Vissim software and assessed to be quite effective in dealing with congestion and heavy traffic at the Mayong-Jepara Highway intersection especially in the afternoon session.
- 6 October 2023
- Published by Universitas Muhammadiyah Mataram in JTAM (Jurnal Teori dan Aplikasi Matematika)
- Vol. 7 (4) , 999-1010
Open AccessApplication of Compatible Graph and Webster Methods for Traffic Light Arrangement in Jepara
The problem of congestion has become a common problem that is often found on the highways, especially at the crossroads, without exception in Jepara Regency. The Mayong-Jepara Highway intersection is classified as a busy intersection that is full of vehicles during every departure and return hours, which are dominated by factory employees. Congestion often occurs at these intersections even though there are traffic lights that regulate the movement of vehicles. So, This study aims to find the solutions to congestion problems at Mayong-Jepara Highway intersection through compatible graph modeling and optimizing traffic light cycle time using the Webster method. Compatible graphs are used to determine traffic flows that are worked to move simultaneously without causing collisions, and that are used to carry out the graph weighting to determine the number of phases. The variables used in this applied research are the data on the number of vehicles, road width, and traffic light duration that taken directly in the field. Because the traffic density in the morning and afternoon is different for each intersection arm. Thus, the cycle time is determined in 2 sessions namely the morning and the afternoon. From the modeling of the compatible graph that has been weighted, it is obtained that the morning and afternoon sessions have 3 phases as the total which are then used to determine the traffic light cycle time. As a result, the cycle times for the morning session are 98 seconds, and the afternoon session is 155 seconds. The results were then simulated with PTV Vissim software and assessed to be quite effective in dealing with congestion and heavy traffic at the Mayong-Jepara Highway intersection especially in the afternoon session.
- 17 August 2023
- Published by Springer Nature
- p. 293-303
A Method Based on Picture Fuzzy Graph Coloring for Determining Traffic Signal Phasing on an Intersection
- 17 August 2023
- Published by Springer Nature
- p. 293-303
A Method Based on Picture Fuzzy Graph Coloring for Determining Traffic Signal Phasing on an Intersection
- Open Access
- 8 May 2023
- Published by Surya Hijau Manfaat in Journal of Soft Computing Exploration
- Vol. 4 (2)
Implementation of a faster R-CNN algorithm for identification of metastatic tissue using lymphoma histopathological images
Procedures for diagnosis of lymphoma includes blood tests, CT scan or MRI, and histopathological examination through a biopsy. Histopathological examination is the gold standard of diagnosis. Pathology diagnosis of lymphoma is challenging and difficult in the field of diagnostic pathology. This study aims to identify lymph node metastases using the Faster R-CNN algorithm using histopathological images of lymph nodes so that the Faster RCNN system design can help the medical team to make diagnostic decisions. Identification carried out by Faster R-CNN is by classifying histopathological images into normal classes and metastatic classes. Loss values that are not indicated for underfitting and overfitting are shown from the 10th epoch to the 20th epoch. The optimizer and the number of epochs for the optimal value of 83.3% accuracy and 71.8% recall are ADAM with 20 epochs. The accuracy and recall results obtained are quite good. 1113 metastatic images and 1478 normal images were predicted correctly, while 437 metastatic images and 82 normal images were predicted incorrectly.
- 8 May 2023
- Published by Surya Hijau Manfaat in Journal of Soft Computing Exploration
- Vol. 4 (2)
Open AccessImplementation of a faster R-CNN algorithm for identification of metastatic tissue using lymphoma histopathological images
Procedures for diagnosis of lymphoma includes blood tests, CT scan or MRI, and histopathological examination through a biopsy. Histopathological examination is the gold standard of diagnosis. Pathology diagnosis of lymphoma is challenging and difficult in the field of diagnostic pathology. This study aims to identify lymph node metastases using the Faster R-CNN algorithm using histopathological images of lymph nodes so that the Faster RCNN system design can help the medical team to make diagnostic decisions. Identification carried out by Faster R-CNN is by classifying histopathological images into normal classes and metastatic classes. Loss values that are not indicated for underfitting and overfitting are shown from the 10th epoch to the 20th epoch. The optimizer and the number of epochs for the optimal value of 83.3% accuracy and 71.8% recall are ADAM with 20 epochs. The accuracy and recall results obtained are quite good. 1113 metastatic images and 1478 normal images were predicted correctly, while 437 metastatic images and 82 normal images were predicted incorrectly.