This paper deals with multi-server queueing system with two kinds of Working Vacations (WVs) and impatient customers. A random timer is started whenever a customer comes into the system. The customer may abandon the system if the service is not completed before the impatience timer expires. Each time after serving all the customers, the system becomes empty and then the server begins 1st kind of vacation. On returning from 1st kind of WV, the server begins 2nd kind of WV whenever a system has no customers. When the server comes back from either 1st kind or 2nd kind of WV, if there is at least one customer in the system, the server switches to busy period. The steady state probabilities have been derived using the Probability Generating Functions (PGFs) method. Various measures of performance are presented and numerical illustrations are also provided.
{"title":"Multi-server Markovian heterogeneous arrivals queue with two kinds of working vacations and impatient customers","authors":"R.S. Yohapriyadharsini, V. Suvitha","doi":"10.2298/yjor221117011y","DOIUrl":"https://doi.org/10.2298/yjor221117011y","url":null,"abstract":"This paper deals with multi-server queueing system with two kinds of Working Vacations (WVs) and impatient customers. A random timer is started whenever a customer comes into the system. The customer may abandon the system if the service is not completed before the impatience timer expires. Each time after serving all the customers, the system becomes empty and then the server begins 1st kind of vacation. On returning from 1st kind of WV, the server begins 2nd kind of WV whenever a system has no customers. When the server comes back from either 1st kind or 2nd kind of WV, if there is at least one customer in the system, the server switches to busy period. The steady state probabilities have been derived using the Probability Generating Functions (PGFs) method. Various measures of performance are presented and numerical illustrations are also provided.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79006705","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A stratified random sampling method is preferred for selecting varied populations with outliers. As opposed to plain random sampling, stratified sampling increases statistical precision by reducing estimator variance. Before reducing the estimator's variance, stratum boundary identification and data apportionment must be solved. In this study, a Neyman allocation strategy is used to address the stratum boundary determination issue in mixed populations. In addition to evaluating CSO on two groups of people, a comparison study was conducted using Kozak, GA, PSO, and Delanius and Hodge's approaches. Compared to previous algorithms, the numerical results indicate that the proposed technique can select the best-stratified boundaries for various standard populations and test functions.
{"title":"Cat swarm optimization for the determination of strata boundaries","authors":"Raghad M. Jasim","doi":"10.2298/yjor221015003j","DOIUrl":"https://doi.org/10.2298/yjor221015003j","url":null,"abstract":"A stratified random sampling method is preferred for selecting varied populations with outliers. As opposed to plain random sampling, stratified sampling increases statistical precision by reducing estimator variance. Before reducing the estimator's variance, stratum boundary identification and data apportionment must be solved. In this study, a Neyman allocation strategy is used to address the stratum boundary determination issue in mixed populations. In addition to evaluating CSO on two groups of people, a comparison study was conducted using Kozak, GA, PSO, and Delanius and Hodge's approaches. Compared to previous algorithms, the numerical results indicate that the proposed technique can select the best-stratified boundaries for various standard populations and test functions.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80998123","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This article deals with the new approach of finding the defuzzification / ranking index of various types of fuzzy sets. Traditionally, in most of the articles on fuzzy decision making the defuzzification methods are not justified with respect to that of highest aspiration levels. This study highlights an efficient defuzzification (ranking) method which links between the gaps on the defuzzified values obtained using ?-cuts and without ?-cuts of fuzzy numbers. Moreover, for a given problem different membership grades are found by different researchers which are confusing and contradicts the conceptual uniqueness of fuzzy set itself. To resolve these issues, first of all, we have studied a polygonal fuzzy set by means of an interpolating polynomial function. However, in fuzzy set theory we usually seek the highest membership grade for ranking any kind of decision-making problem therefore, maximizing the polynomial function, we get the index value of the proposed fuzzy set. An artificial intelligence (AI) based solution algorithm has also been developed to find the exact defuzzified value. Indeed, considering two numerical examples we have compared these ranking values with some of the existing state of- arts under higher aspiration levels. Finally, some graphical illustrations have also been done to justify the proposed approach.
{"title":"The exact defuzzification method under polynomial approximation of various fuzzy sets","authors":"S. De, Somnath Nandi","doi":"10.2298/yjor2306017d","DOIUrl":"https://doi.org/10.2298/yjor2306017d","url":null,"abstract":"This article deals with the new approach of finding the defuzzification / ranking index of various types of fuzzy sets. Traditionally, in most of the articles on fuzzy decision making the defuzzification methods are not justified with respect to that of highest aspiration levels. This study highlights an efficient defuzzification (ranking) method which links between the gaps on the defuzzified values obtained using ?-cuts and without ?-cuts of fuzzy numbers. Moreover, for a given problem different membership grades are found by different researchers which are confusing and contradicts the conceptual uniqueness of fuzzy set itself. To resolve these issues, first of all, we have studied a polygonal fuzzy set by means of an interpolating polynomial function. However, in fuzzy set theory we usually seek the highest membership grade for ranking any kind of decision-making problem therefore, maximizing the polynomial function, we get the index value of the proposed fuzzy set. An artificial intelligence (AI) based solution algorithm has also been developed to find the exact defuzzified value. Indeed, considering two numerical examples we have compared these ranking values with some of the existing state of- arts under higher aspiration levels. Finally, some graphical illustrations have also been done to justify the proposed approach.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89145718","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The main objective of this work is to present a modification of the Mittag- Leffler function to deduce a relatively new analytical approximate method (for short MMLFM) able to solve time-fractional nonlinear partial differential equations (PDEs). Moreover, we employ the MMLFM to solve the time-fractional coupled Korteweg-de Vries (KdV) model described by two nonlinear fractional partial differential equations (FPDEs) based upon Caputo fractional derivative (CFD). The simulation of projected results is presented in some figures and tables. Furthermore, we compare our solutions when ? = 1 with known exact solutions which indicate a good agreement, in addition, we compare our outcomes with the results obtained by other methods in the literature such as the Natural decomposing method (NDM) and homotopy decomposition method (HDM) in order to prove the reliability and efficiency of our used method. Also, we display solutions with different values of ? to present the effect of the fractional order on the proposed problem. The results of this article reveal the advantages of the MMLFM, which is simple, reliable, accurate, needs simple mathematical computations, is rapidly convergent to the exact solution, have a straightforward and easy algorithm compared to other analytical methods to study linear and nonlinear FPDEs, which makes this technique suited for real industrial or medical applications.
{"title":"A new analytical approximate solution of fractional coupled Korteweg-de Vries system","authors":"H. Ali, A. Noreldeen, Ali Ali","doi":"10.2298/yjor221215013a","DOIUrl":"https://doi.org/10.2298/yjor221215013a","url":null,"abstract":"The main objective of this work is to present a modification of the Mittag- Leffler function to deduce a relatively new analytical approximate method (for short MMLFM) able to solve time-fractional nonlinear partial differential equations (PDEs). Moreover, we employ the MMLFM to solve the time-fractional coupled Korteweg-de Vries (KdV) model described by two nonlinear fractional partial differential equations (FPDEs) based upon Caputo fractional derivative (CFD). The simulation of projected results is presented in some figures and tables. Furthermore, we compare our solutions when ? = 1 with known exact solutions which indicate a good agreement, in addition, we compare our outcomes with the results obtained by other methods in the literature such as the Natural decomposing method (NDM) and homotopy decomposition method (HDM) in order to prove the reliability and efficiency of our used method. Also, we display solutions with different values of ? to present the effect of the fractional order on the proposed problem. The results of this article reveal the advantages of the MMLFM, which is simple, reliable, accurate, needs simple mathematical computations, is rapidly convergent to the exact solution, have a straightforward and easy algorithm compared to other analytical methods to study linear and nonlinear FPDEs, which makes this technique suited for real industrial or medical applications.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80291854","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The retrial phenomenon occurs inherently in a wide range of queueing systems. The majority of retrial queueing models do not account for vacation. However, in practice, retrial queueing systems undergo vacations for maintenance or other reasons. In this study, we provide an in-depth analysis of the many possible retrial queueing systems when Bernoulli vacations are in effect. Moreover, this study outlines the key principles and reviews the relevant literature. The framework of a retrial queue with Bernoulli vacation has numerous applications in computer networking systems, manufacturing and production mechanisms, inventory systems, including network service, mail service and file transfer service, etc. Several retrial queueing systems have been investigated, notably M/M/1, M/M/C, M/G/1, M[X]/G/1, and Geo/G/1. Many other important situations, such as server interruption, feedback, G-queue, impatient customers, priority customers, etc., have been explored in relation to retrial queues with Bernoulli vacation and the results of these investigations are also highlighted. The foremost objective of this study is to help researchers, administrators and technical workers who want to use queuing theory to simulate congestion and need to know where to find details on the right models. Finally, some open problems and potential future lines of survey are also covered.
{"title":"A literature review on retrial queueing system with Bernoulli vacation","authors":"Mathavavisakan Micheal, Kandaiyan Indhira","doi":"10.2298/yjor230415020m","DOIUrl":"https://doi.org/10.2298/yjor230415020m","url":null,"abstract":"The retrial phenomenon occurs inherently in a wide range of queueing systems. The majority of retrial queueing models do not account for vacation. However, in practice, retrial queueing systems undergo vacations for maintenance or other reasons. In this study, we provide an in-depth analysis of the many possible retrial queueing systems when Bernoulli vacations are in effect. Moreover, this study outlines the key principles and reviews the relevant literature. The framework of a retrial queue with Bernoulli vacation has numerous applications in computer networking systems, manufacturing and production mechanisms, inventory systems, including network service, mail service and file transfer service, etc. Several retrial queueing systems have been investigated, notably M/M/1, M/M/C, M/G/1, M[X]/G/1, and Geo/G/1. Many other important situations, such as server interruption, feedback, G-queue, impatient customers, priority customers, etc., have been explored in relation to retrial queues with Bernoulli vacation and the results of these investigations are also highlighted. The foremost objective of this study is to help researchers, administrators and technical workers who want to use queuing theory to simulate congestion and need to know where to find details on the right models. Finally, some open problems and potential future lines of survey are also covered.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79484740","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper deals with an industrial problem of machining line design, which consists in partitioning a given set of operations into several subsets corresponding to workstations and sequencing the operations to satisfy the technical requirements and achieve the best performance of the line. The problem has a complex set of constraints that include partial order on operations, part positioning, inclusion, exclusion, cycle time, and installation of parallel machines on a workstation. The problem is NP-hard and even finding a feasible solution can be a difficult task from the practical point of view. A parallel evolutionary algorithm (EA) is proposed and implemented for execution on a Graphics Processing Unit (GPU). The parallelization in the EA is done by working on several parents in one iteration and in multiple application of mutation operator to the same parent to produce the best offspring. The proposed approach is evaluated on large scale instances and demonstrated superior performance compared to the algorithms from the literature in terms of running time and ability to obtain feasible solutions. It is shown that in comparison to the traditional populational EA scheme the newly proposed algorithm is more suitable for advanced GPUs with a large number of cores.
{"title":"Parallel evolutionary algorithms for the reconfigurable transfer line balancing problem","authors":"P. Borisovsky","doi":"10.2298/yjor230415018b","DOIUrl":"https://doi.org/10.2298/yjor230415018b","url":null,"abstract":"This paper deals with an industrial problem of machining line design, which consists in partitioning a given set of operations into several subsets corresponding to workstations and sequencing the operations to satisfy the technical requirements and achieve the best performance of the line. The problem has a complex set of constraints that include partial order on operations, part positioning, inclusion, exclusion, cycle time, and installation of parallel machines on a workstation. The problem is NP-hard and even finding a feasible solution can be a difficult task from the practical point of view. A parallel evolutionary algorithm (EA) is proposed and implemented for execution on a Graphics Processing Unit (GPU). The parallelization in the EA is done by working on several parents in one iteration and in multiple application of mutation operator to the same parent to produce the best offspring. The proposed approach is evaluated on large scale instances and demonstrated superior performance compared to the algorithms from the literature in terms of running time and ability to obtain feasible solutions. It is shown that in comparison to the traditional populational EA scheme the newly proposed algorithm is more suitable for advanced GPUs with a large number of cores.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89073403","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hengameh Mohamadinejad, A. Amirteimoori, S. Kordrostami, F. Lotfi
In resource allocation and target setting problems, a central decision makers? managerial standpoint has a pivotal role, especially when we encounter undesirable outputs such as the greenhouse gas (GHG) emissions. In such circumstances, firms have to cooperate with each other, to achieve the central planner?s aims. Looking into literature reveals that the existing resource allocation models based on data envelopment analysis (DEA) have not aptly considered the influence of managerial efforts and technological innovations in this sense. This study proposes a centralized model incorporating managerial disposability. This model not only reflects the leadership performance of the central planner and the technological novelty perspective in the resource allocation and target setting problem, but also has a positive modification against an environmental adaptation change. In order to illustrate the applicability of our resource allocation and target setting model, a case study of 23 US and Canadian oil and gas companies has been conducted. Analysis of the results reveals the appropriacy and efficiency of our proposed model in dealing with the current perspectives concerning the issue of resource allocation and target setting.
{"title":"A managerial approach in resource allocation models: an application in us and Canadian oil and gas companies","authors":"Hengameh Mohamadinejad, A. Amirteimoori, S. Kordrostami, F. Lotfi","doi":"10.2298/yjor221016004m","DOIUrl":"https://doi.org/10.2298/yjor221016004m","url":null,"abstract":"In resource allocation and target setting problems, a central decision makers? managerial standpoint has a pivotal role, especially when we encounter undesirable outputs such as the greenhouse gas (GHG) emissions. In such circumstances, firms have to cooperate with each other, to achieve the central planner?s aims. Looking into literature reveals that the existing resource allocation models based on data envelopment analysis (DEA) have not aptly considered the influence of managerial efforts and technological innovations in this sense. This study proposes a centralized model incorporating managerial disposability. This model not only reflects the leadership performance of the central planner and the technological novelty perspective in the resource allocation and target setting problem, but also has a positive modification against an environmental adaptation change. In order to illustrate the applicability of our resource allocation and target setting model, a case study of 23 US and Canadian oil and gas companies has been conducted. Analysis of the results reveals the appropriacy and efficiency of our proposed model in dealing with the current perspectives concerning the issue of resource allocation and target setting.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77774185","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this article, we propose a method based on a new ranking technique to find optimal solution for a pentagonal fuzzy transportation problem. Firstly, the proposed ranking method which is based on the centroid concept is applied. This transforms the pentagonal fuzzy transportation problem to crisp transportation problem and then the proposed algorithm is applied to find optimal solution of the problem in crisp form. Also, a new method to find initial basic feasible solution (IBFS) of crisp valued transportation problems is introduced in the paper. Further, we give two numerical illustrations for the newly proposed algorithm and compare the solution obtained with the solutions of existing methods. The proposed method can easily be understood and applied to real life transportation problems. Moreover, the proposed ranking method can be used to solve various other fuzzy problems of operations research.
{"title":"Optimal solution of pentagonal fuzzy transportation problem using a new ranking technique","authors":"Monika Bisht, Ismat Beg, R. Dangwal","doi":"10.2298/yjor221120002b","DOIUrl":"https://doi.org/10.2298/yjor221120002b","url":null,"abstract":"In this article, we propose a method based on a new ranking technique to find optimal solution for a pentagonal fuzzy transportation problem. Firstly, the proposed ranking method which is based on the centroid concept is applied. This transforms the pentagonal fuzzy transportation problem to crisp transportation problem and then the proposed algorithm is applied to find optimal solution of the problem in crisp form. Also, a new method to find initial basic feasible solution (IBFS) of crisp valued transportation problems is introduced in the paper. Further, we give two numerical illustrations for the newly proposed algorithm and compare the solution obtained with the solutions of existing methods. The proposed method can easily be understood and applied to real life transportation problems. Moreover, the proposed ranking method can be used to solve various other fuzzy problems of operations research.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80180415","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mathematical programming, and above all, the multi-objective scheduling problems stand as remarkably versatile tools, highly useful for optimizing the health care services. In this context, the present work is designed to put forward two-fold multi-objective mixed integer linear programs, simultaneously integrating the objectives of minimizing the patients? total waiting and flow time, while minimizing the doctors' work-load variations. For this purpose, the three major health-care system intervening actors are simultaneously considered, namely, the patients, doctors and machines. To the best of our knowledge, such an issue does not seem to be actually addressed in the relevant literature. To this end, we opt for implementing an appropriate lexicographic method, whereby, effective solutions enabling to minimize the performance of two-objective functions could be used to solve randomly generated small cases. Mathematical models of our study have been resolved using the CPLEX software. Then, results have been comparatively assessed in terms of both objectives and CPU times. A real laser-treatment case study, involving a set of diabetic retinopathy patients in the ophthalmology department in Habib Bourguiba Hospital in Sfax, Tunisia, helps in illustrating the effective practicality of our advanced approach. To resolve the treated problem, we use three relevant heuristics which have been compared to the first-come first-served rule. We find that the program based on our second formulation with time-limit provided the best solution in terms of total flow time.
{"title":"Multi-objective mathematical models to resolve parallel machine scheduling problems with multiple resources","authors":"Salma Kanoun, B. Jerbi, H. Kamoun, Lobna Kallel","doi":"10.2298/yjor221215008k","DOIUrl":"https://doi.org/10.2298/yjor221215008k","url":null,"abstract":"Mathematical programming, and above all, the multi-objective scheduling problems stand as remarkably versatile tools, highly useful for optimizing the health care services. In this context, the present work is designed to put forward two-fold multi-objective mixed integer linear programs, simultaneously integrating the objectives of minimizing the patients? total waiting and flow time, while minimizing the doctors' work-load variations. For this purpose, the three major health-care system intervening actors are simultaneously considered, namely, the patients, doctors and machines. To the best of our knowledge, such an issue does not seem to be actually addressed in the relevant literature. To this end, we opt for implementing an appropriate lexicographic method, whereby, effective solutions enabling to minimize the performance of two-objective functions could be used to solve randomly generated small cases. Mathematical models of our study have been resolved using the CPLEX software. Then, results have been comparatively assessed in terms of both objectives and CPU times. A real laser-treatment case study, involving a set of diabetic retinopathy patients in the ophthalmology department in Habib Bourguiba Hospital in Sfax, Tunisia, helps in illustrating the effective practicality of our advanced approach. To resolve the treated problem, we use three relevant heuristics which have been compared to the first-come first-served rule. We find that the program based on our second formulation with time-limit provided the best solution in terms of total flow time.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88630712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A combination of the single-valued neutrosophic set (SV-NS) and the probabilistic hesitant fuzzy set is the single-valued neutrosophic probabilistic hesitant fuzzy (SV-NPHF) environment (PHFS). It is intended for some unsatisfactory, ambiguous, and contradictory circumstances in which each element has a number of various values that are brought about by the situation?s actuality. The decision-maker can quickly gather and analyze the facts by employing a strategic decision-making technique. On the other hand, uncertainty will be a big part of our daily lives when we are learning. We present a decision-making strategy for the SV-NPHF context to address this data ambiguity. The fundamental operational concepts for SV-NPHF information under Dombi aggregation operators were initially developed on the basis of this study. The SV-NPHF Dombi weighted arithmetic average (SV-NPHFDWAA) operator and SV-NPHF Dombi weighted arithmetic geometric (SV-NPHFDWAG) operators are two SV-NPHF Dombi aggregation Operators that are then examined. Following that, we look into further characterizations of the proposed operators, including idempotency, boundedness, and monotonicity. Forthe derived operators, we additionally developed the score and accuracy functions. When using SV-NPHF data in a multi attribute decision support system (MADSS), it is necessary to compare the effectiveness of various (AOs) in order to make the best decision. In addition, it is demonstrated how to use symmetry analysis to choose the optimal social media platform for earning and learning in a practical application of SV-NPHFDWAA and SV-NPHFDWAG.
{"title":"A promising approach for decision modeling with single-valued neutrosophic probabilistic hesitant fuzzy Dombi operators","authors":"Muhammad Kamran, Shahzaib Ashraf, Muhammad Naeem","doi":"10.2298/yjor230115007s","DOIUrl":"https://doi.org/10.2298/yjor230115007s","url":null,"abstract":"A combination of the single-valued neutrosophic set (SV-NS) and the probabilistic hesitant fuzzy set is the single-valued neutrosophic probabilistic hesitant fuzzy (SV-NPHF) environment (PHFS). It is intended for some unsatisfactory, ambiguous, and contradictory circumstances in which each element has a number of various values that are brought about by the situation?s actuality. The decision-maker can quickly gather and analyze the facts by employing a strategic decision-making technique. On the other hand, uncertainty will be a big part of our daily lives when we are learning. We present a decision-making strategy for the SV-NPHF context to address this data ambiguity. The fundamental operational concepts for SV-NPHF information under Dombi aggregation operators were initially developed on the basis of this study. The SV-NPHF Dombi weighted arithmetic average (SV-NPHFDWAA) operator and SV-NPHF Dombi weighted arithmetic geometric (SV-NPHFDWAG) operators are two SV-NPHF Dombi aggregation Operators that are then examined. Following that, we look into further characterizations of the proposed operators, including idempotency, boundedness, and monotonicity. Forthe derived operators, we additionally developed the score and accuracy functions. When using SV-NPHF data in a multi attribute decision support system (MADSS), it is necessary to compare the effectiveness of various (AOs) in order to make the best decision. In addition, it is demonstrated how to use symmetry analysis to choose the optimal social media platform for earning and learning in a practical application of SV-NPHFDWAA and SV-NPHFDWAG.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83224024","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：