Javad Tayyebi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Javad Tayyebi has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Adrian Marius Deaconu
Department of Mathematics and Computer Science, Faculty of Mathematics and Computer Science, Transilvania University of Brasov, 50003 Brașov, Romania
10 shared publications - Massoud Aman
Department of mathematics, Faculty of science, University of Birjand, Birjand, Iran
4 shared publications - Malihe Niksirat
Department of Computer Sciences, Birjand University of Technology, Birjand, Iran
3 shared publications Abumoslem Mohammadi
Imam Ali Univ, Dept Math, Fac Sci, Tehran, Iran
2 shared publications- Delia Elena Spridon
Department of Mathematics and Computer Science, Faculty of Mathematics and Computer Science, Transilvania University of Brasov, 50003 Brașov, Romania
2 shared publications - Muhammad Bilal Khan
Department of Mathematics and Computer Science, Transilvania University of Brasov, Brasov 500036, Romania
2 shared publications
Latest Publications
- 18 June 2025
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 71 (5) , 6321-6341
Minimum $st$-cut interdiction problems with convex piecewise-linear costs- 18 June 2025
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 71 (5) , 6321-6341
Minimum $st$-cut interdiction problems with convex piecewise-linear costs- Open Access
- 29 May 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (11) , 1816
Developing a Model to Predict the Effectiveness of Vaccination on Mortality Caused by COVID-19
The Coronavirus Disease 2019 (COVID-19) pandemic highlighted the urgent need for effective vaccination strategies to control the virus’s spread and reduce mortality. Machine learning (ML) algorithms offer promising tools for predicting vaccine effectiveness and aiding public health decisions. This study explores the application of various ML techniques, including artificial neural network (ANN), decision tree (DT), K-nearest neighbor (KNN), random forest (RF), and support vector machine (SVM) to model and forecast the impact of vaccination on COVID-19 mortality. The algorithms were evaluated using accuracy, precision, recall, specificity, F-measure, and area under the curve (AUC) metrics. The findings revealed that DT outperformed other ML algorithms, achieving the highest metrics across multiple evaluation criteria. It recorded an accuracy of 92.27%, precision of 92.54%, recall of 91.95%, specificity of 87.92%, F-measure of 92.24%, and an AUC of 94.50%, highlighting its exceptional predictive performance. Moreover, DT demonstrated this high level of accuracy while maintaining minimal computational time. These findings suggest that ML models, particularly DTs, can be valuable in assessing vaccine effectiveness and informing health strategies against COVID-19.
- 29 May 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (11) , 1816
Open AccessDeveloping a Model to Predict the Effectiveness of Vaccination on Mortality Caused by COVID-19
The Coronavirus Disease 2019 (COVID-19) pandemic highlighted the urgent need for effective vaccination strategies to control the virus’s spread and reduce mortality. Machine learning (ML) algorithms offer promising tools for predicting vaccine effectiveness and aiding public health decisions. This study explores the application of various ML techniques, including artificial neural network (ANN), decision tree (DT), K-nearest neighbor (KNN), random forest (RF), and support vector machine (SVM) to model and forecast the impact of vaccination on COVID-19 mortality. The algorithms were evaluated using accuracy, precision, recall, specificity, F-measure, and area under the curve (AUC) metrics. The findings revealed that DT outperformed other ML algorithms, achieving the highest metrics across multiple evaluation criteria. It recorded an accuracy of 92.27%, precision of 92.54%, recall of 91.95%, specificity of 87.92%, F-measure of 92.24%, and an AUC of 94.50%, highlighting its exceptional predictive performance. Moreover, DT demonstrated this high level of accuracy while maintaining minimal computational time. These findings suggest that ML models, particularly DTs, can be valuable in assessing vaccine effectiveness and informing health strategies against COVID-19.
- Open Access
- 1 March 2025
- Published by Elsevier in Results in Control and Optimization
- Vol. 18
A note on “Study on multi-objective linear fractional programming problem involving pentagonal intuitionistic fuzzy number”
- 1 March 2025
- Published by Elsevier in Results in Control and Optimization
- Vol. 18
Open AccessA note on “Study on multi-objective linear fractional programming problem involving pentagonal intuitionistic fuzzy number”
- Open Access
- 1 January 2025
- Published by Wiley in International Journal of Mathematics and Mathematical Sciences
- Vol. 2025 (1)
On Introduction to ( q 1 , q 2 )‐Linear Diophantine Fuzzy Sets and Their Applications
The notion of parameter mappings is about creating and managing a structured relationship between parameters across different systems or processes. This concept is vital in ensuring that data remains consistent, correctly interpreted, and accurately transformed as it moves through different parts of a system or between different systems. In this paper, the concept of reference parameter mappings is introduced to handle reference parameters that will help the decision makers. To overcome the uncertainty by giving direct value to reference parameters without any rule, a new class of fuzzy sets is presented which is known as ( q 1 , q 2 )‐linear Diophantine fuzzy set (( q 1 , q 2 ) L D F S ), where q 1 and q 2 are reference parameter mappings. Because the q 1 and q 2 can reflect a wider variety of reference parameters than LDFSs and q ‐rung LDFSs, ( q 1 , q 2 ) L D F S s can provide more ambiguous conditions. There is symmetry in the values of both the membership grades function and the nonmembership grades function. Furthermore, when discussing the symmetry between two or more objects, the evolution of a (( q 1 , q 2 ) L D F S s via q 1 and q 2 is more adaptable than the diffused concept of a q ‐rung orthopair fuzzy sets or a LDFSs. The primary benefit of ( q 1 , q 2 ) L D F S s , which are useful in a variety of decision‐making situations, is that they are able to characterize a greater number of uncertainties with respect to reference parameter mappings q 1 and q 2 than LDFSs. Next, we propose several geometric and averaging operators for a ( q 1 , q 2 ) linear Diophantine fuzzy numbers, based on established operating rules. In the latter half of the paper, different ranking algorithms based on proposed aggregation operators are presented to address a realistic assessment of the patient’s high blood pressure conditions is conducted to demonstrate the viability and value of the suggested strategies.
- 1 January 2025
- Published by Wiley in International Journal of Mathematics and Mathematical Sciences
- Vol. 2025 (1)
Open AccessOn Introduction to ( q 1 , q 2 )‐Linear Diophantine Fuzzy Sets and Their Applications
The notion of parameter mappings is about creating and managing a structured relationship between parameters across different systems or processes. This concept is vital in ensuring that data remains consistent, correctly interpreted, and accurately transformed as it moves through different parts of a system or between different systems. In this paper, the concept of reference parameter mappings is introduced to handle reference parameters that will help the decision makers. To overcome the uncertainty by giving direct value to reference parameters without any rule, a new class of fuzzy sets is presented which is known as ( q 1 , q 2 )‐linear Diophantine fuzzy set (( q 1 , q 2 ) L D F S ), where q 1 and q 2 are reference parameter mappings. Because the q 1 and q 2 can reflect a wider variety of reference parameters than LDFSs and q ‐rung LDFSs, ( q 1 , q 2 ) L D F S s can provide more ambiguous conditions. There is symmetry in the values of both the membership grades function and the nonmembership grades function. Furthermore, when discussing the symmetry between two or more objects, the evolution of a (( q 1 , q 2 ) L D F S s via q 1 and q 2 is more adaptable than the diffused concept of a q ‐rung orthopair fuzzy sets or a LDFSs. The primary benefit of ( q 1 , q 2 ) L D F S s , which are useful in a variety of decision‐making situations, is that they are able to characterize a greater number of uncertainties with respect to reference parameter mappings q 1 and q 2 than LDFSs. Next, we propose several geometric and averaging operators for a ( q 1 , q 2 ) linear Diophantine fuzzy numbers, based on established operating rules. In the latter half of the paper, different ranking algorithms based on proposed aggregation operators are presented to address a realistic assessment of the patient’s high blood pressure conditions is conducted to demonstrate the viability and value of the suggested strategies.
- Open Access
- 19 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 176171-176183
Diamond Intuitionistic Fuzzy Sets and Their Applications
The primary purpose of this study is to introduce diamond intuitionistic fuzzy sets ( D-IFS s). Although several generalizations of intuitionistic fuzzy sets have been introduced in the literature, the constraints of IFS s limit decision-makers ability to freely choose the degree of membership (validity, etc.) and non-membership (non-validity, etc.). The D-IFS , however, offers this flexibility, which is why these new sets are introduced. By applying a mild restriction on the D-IFS , a novel generalization, known as the lozenge intuitionistic fuzzy set has been acquired. Some properties of these intuitionistic fuzzy sets are characterized geometrically. The main aim of this research is also to establish some basic operations and inclusions for D-IFS s, along with some well-known rules. On the other hand, Szmidt and Kacprzyk’s forms of Hamming distance and, Euclidean distance for D-IFS s are defined. Additionally, new score and accuracy functions are presented to compare newly defined diamond intuitionistic fuzzy relations ( D-IFR s). Moreover, two new max-min operations have been derived to analyze the decomposition of D-IFR s. Finally, a practical assessment of medical diagnosis in patients is conducted to demonstrate the feasibility and value of the proposed approaches.
- 19 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 176171-176183
Open AccessDiamond Intuitionistic Fuzzy Sets and Their Applications
The primary purpose of this study is to introduce diamond intuitionistic fuzzy sets ( D-IFS s). Although several generalizations of intuitionistic fuzzy sets have been introduced in the literature, the constraints of IFS s limit decision-makers ability to freely choose the degree of membership (validity, etc.) and non-membership (non-validity, etc.). The D-IFS , however, offers this flexibility, which is why these new sets are introduced. By applying a mild restriction on the D-IFS , a novel generalization, known as the lozenge intuitionistic fuzzy set has been acquired. Some properties of these intuitionistic fuzzy sets are characterized geometrically. The main aim of this research is also to establish some basic operations and inclusions for D-IFS s, along with some well-known rules. On the other hand, Szmidt and Kacprzyk’s forms of Hamming distance and, Euclidean distance for D-IFS s are defined. Additionally, new score and accuracy functions are presented to compare newly defined diamond intuitionistic fuzzy relations ( D-IFR s). Moreover, two new max-min operations have been derived to analyze the decomposition of D-IFR s. Finally, a practical assessment of medical diagnosis in patients is conducted to demonstrate the feasibility and value of the proposed approaches.
- Open Access
- 13 September 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (18) , 2844
Fuzzy Multi-Objective, Multi-Period Integrated Routing–Scheduling Problem to Distribute Relief to Disaster Areas: A Hybrid Ant Colony Optimization Approach
This paper explores a multi-objective, multi-period integrated routing and scheduling problem under uncertain conditions for distributing relief to disaster areas. The goals are to minimize costs and maximize satisfaction levels. To achieve this, the proposed mathematical model aims to speed up the delivery of relief supplies to the most affected areas. Additionally, the demands and transportation times are represented using fuzzy numbers to more accurately reflect real-world conditions. The problem was formulated using a fuzzy multi-objective integer programming model. To solve it, a hybrid algorithm combining a multi-objective ant colony system and simulated annealing algorithm was proposed. This algorithm adopts two ant colonies to obtain a set of nondominated solutions (the Pareto set). Numerical analyses have been conducted to determine the optimal parameter values for the proposed algorithm and to evaluate the performance of both the model and the algorithm. Furthermore, the algorithm’s performance was compared with that of the multi-objective cat swarm optimization algorithm and multi-objective fitness-dependent optimizer algorithm. The numerical results demonstrate the computational efficiency of the proposed method.
- 13 September 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (18) , 2844
Open AccessFuzzy Multi-Objective, Multi-Period Integrated Routing–Scheduling Problem to Distribute Relief to Disaster Areas: A Hybrid Ant Colony Optimization Approach
This paper explores a multi-objective, multi-period integrated routing and scheduling problem under uncertain conditions for distributing relief to disaster areas. The goals are to minimize costs and maximize satisfaction levels. To achieve this, the proposed mathematical model aims to speed up the delivery of relief supplies to the most affected areas. Additionally, the demands and transportation times are represented using fuzzy numbers to more accurately reflect real-world conditions. The problem was formulated using a fuzzy multi-objective integer programming model. To solve it, a hybrid algorithm combining a multi-objective ant colony system and simulated annealing algorithm was proposed. This algorithm adopts two ant colonies to obtain a set of nondominated solutions (the Pareto set). Numerical analyses have been conducted to determine the optimal parameter values for the proposed algorithm and to evaluate the performance of both the model and the algorithm. Furthermore, the algorithm’s performance was compared with that of the multi-objective cat swarm optimization algorithm and multi-objective fitness-dependent optimizer algorithm. The numerical results demonstrate the computational efficiency of the proposed method.
- 10 August 2024
- Published by Springer Nature in Sādhanā
- Vol. 49 (3) , 1-15
Hierarchically ranking geological and geotechnical risk responses: a fuzzy game theory approach
- 10 August 2024
- Published by Springer Nature in Sādhanā
- Vol. 49 (3) , 1-15
Hierarchically ranking geological and geotechnical risk responses: a fuzzy game theory approach
- 1 June 2024
- Published by Tsinghua University Press in Tsinghua Science and Technology
- Vol. 29 (3) , 753-765
Increasing the Maximum Capacity Path in a Network and Its Application for Improving the Connection Between Two Routers
This paper addresses the problem of improving the optimal value of the Maximum Capacity Path (MCP) through expansion in a flexible network, and minimizing the involved costs. The only condition applied to the cost functions is to be non-decreasing monotone. This is a non-restrictive condition, reflecting the reality in practice, and is considered for the first time in the literature. Moreover, the total cost of expansion is a combination of max-type cost (e.g., for supervision) and sum-type cost (e.g. for building infrastructures, price of materials, price of labor, etc.). For this purpose, two types of strategies are combined: (I) increasing the capacity of the existing arcs, and (II) adding potential new arcs. Two different problems are introduced and solved. Both the problems have immediate applications in Internet routing infrastructure. The first one is to extend the network, so that the capacity of an MCP in the modified network becomes equal to a prescribed value, therefore the cost of modifications is minimized. A strongly polynomial-time algorithm is deduced to solve this problem. The second problem is a network expansion under a budget constraint, so that the capacity of an MCP is maximized. A weakly polynomial-time algorithm is presented to deal with it. In the special case when all the costs are linear, a Meggido's parametric search technique is used to develop an algorithm for solving the problem in strongly polynomial time. This new approach has a time complexity of $O(n^{4})$ , which is better than the time complexity of $O(n^{4}\log^{2}(n))$ of the previously known method from literature.- 1 June 2024
- Published by Tsinghua University Press in Tsinghua Science and Technology
- Vol. 29 (3) , 753-765
Increasing the Maximum Capacity Path in a Network and Its Application for Improving the Connection Between Two Routers
This paper addresses the problem of improving the optimal value of the Maximum Capacity Path (MCP) through expansion in a flexible network, and minimizing the involved costs. The only condition applied to the cost functions is to be non-decreasing monotone. This is a non-restrictive condition, reflecting the reality in practice, and is considered for the first time in the literature. Moreover, the total cost of expansion is a combination of max-type cost (e.g., for supervision) and sum-type cost (e.g. for building infrastructures, price of materials, price of labor, etc.). For this purpose, two types of strategies are combined: (I) increasing the capacity of the existing arcs, and (II) adding potential new arcs. Two different problems are introduced and solved. Both the problems have immediate applications in Internet routing infrastructure. The first one is to extend the network, so that the capacity of an MCP in the modified network becomes equal to a prescribed value, therefore the cost of modifications is minimized. A strongly polynomial-time algorithm is deduced to solve this problem. The second problem is a network expansion under a budget constraint, so that the capacity of an MCP is maximized. A weakly polynomial-time algorithm is presented to deal with it. In the special case when all the costs are linear, a Meggido's parametric search technique is used to develop an algorithm for solving the problem in strongly polynomial time. This new approach has a time complexity of $O(n^{4})$ , which is better than the time complexity of $O(n^{4}\log^{2}(n))$ of the previously known method from literature.- Open Access
Widest Path in Networks with Gains/Losses
In this paper, the generalized widest path problem (or generalized maximum capacity problem) is studied. This problem is denoted by the GWPP. The classical widest path problem is to find a path from a source (s) to a sink (t) with the highest capacity among all possible s-t paths. The GWPP takes into account the presence of loss/gain factors on arcs as well. The GWPP aims to find an s-t path considering the loss/gain factors while satisfying the capacity constraints. For solving the GWPP, three strongly polynomial time algorithms are presented. Two algorithms only work in the case of losses. The first one is less efficient than the second one on a CPU, but it proves to be more efficient on large networks if it parallelized on GPUs. The third algorithm is able to deal with the more general case of losses/gains on arcs. An example is considered to illustrate how each algorithm works. Experiments on large networks are conducted to compare the efficiency of the algorithms proposed.
Open AccessWidest Path in Networks with Gains/Losses
In this paper, the generalized widest path problem (or generalized maximum capacity problem) is studied. This problem is denoted by the GWPP. The classical widest path problem is to find a path from a source (s) to a sink (t) with the highest capacity among all possible s-t paths. The GWPP takes into account the presence of loss/gain factors on arcs as well. The GWPP aims to find an s-t path considering the loss/gain factors while satisfying the capacity constraints. For solving the GWPP, three strongly polynomial time algorithms are presented. Two algorithms only work in the case of losses. The first one is less efficient than the second one on a CPU, but it proves to be more efficient on large networks if it parallelized on GPUs. The third algorithm is able to deal with the more general case of losses/gains on arcs. An example is considered to illustrate how each algorithm works. Experiments on large networks are conducted to compare the efficiency of the algorithms proposed.
- Open Access
Maximum capacity path problem with loss factors
The maximum capacity path problem is to find a path from a source to a sink which has the maximum capacity among all paths. This paper addresses an extension of this problem which considers loss factors. It is called the generalized maximum capacity path problem. The problem is a network flow optimization problem whose network contains capacities as well as loss factors for arcs. The aim of the problem is to find a path from an origin to a destination so as to send a maximum flow along the path considering loss factors and respecting capacity constraints. The paper presents a zero-one formulation of the problem and moreover, it presents two efficient algorithms which solve the problem in polynomial time.
Open AccessMaximum capacity path problem with loss factors
The maximum capacity path problem is to find a path from a source to a sink which has the maximum capacity among all paths. This paper addresses an extension of this problem which considers loss factors. It is called the generalized maximum capacity path problem. The problem is a network flow optimization problem whose network contains capacities as well as loss factors for arcs. The aim of the problem is to find a path from an origin to a destination so as to send a maximum flow along the path considering loss factors and respecting capacity constraints. The paper presents a zero-one formulation of the problem and moreover, it presents two efficient algorithms which solve the problem in polynomial time.