Zhiyang Shen, Kristiaan Kerstens, Vivian Valdmanis, Songkai Wang
During the production process of goods and services, sometimes undesirable outputs are difficult to avoid. However, this aspect is often ignored. Hospitals produce patient care, but undesirable outputs do arise. The novelty of this paper is to introduce the mortality as an undesirable output into the derivation of the public hospital efficiency measure. Similar to the production of economic goods and pollution where the latter increase along with the former, our description of mortality in hospital is considered as weakly disposable. Based on an extension model of Kuosmanen (2005), we evaluate the public hospital efficiency with and without incorporating mortality under four scenarios. We apply this model to measure public hospital efficiency in Chinese provinces. The results indicate that no matter whether one considers undesirable outputs within the objective functions, it has a significant impact on benchmarking once the mortality is included to define the production technology.
{"title":"Evaluation and optimization of hospital system in Chinese provinces: does mortality matter?","authors":"Zhiyang Shen, Kristiaan Kerstens, Vivian Valdmanis, Songkai Wang","doi":"10.1051/ro/2023164","DOIUrl":"https://doi.org/10.1051/ro/2023164","url":null,"abstract":"During the production process of goods and services, sometimes undesirable outputs are difficult to avoid. However, this aspect is often ignored. Hospitals produce patient care, but undesirable outputs do arise. The novelty of this paper is to introduce the mortality as an undesirable output into the derivation of the public hospital efficiency measure. Similar to the production of economic goods and pollution where the latter increase along with the former, our description of mortality in hospital is considered as weakly disposable. Based on an extension model of Kuosmanen (2005), we evaluate the public hospital efficiency with and without incorporating mortality under four scenarios. We apply this model to measure public hospital efficiency in Chinese provinces. The results indicate that no matter whether one considers undesirable outputs within the objective functions, it has a significant impact on benchmarking once the mortality is included to define the production technology.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136295953","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract: This paper considers a closed-loop supply chain with a manufacturer, an incumbent retailer and an entrant retailer. The two retailers order the same products from the common manufacturer and then sell to consumers, and the incumbent retailer possesses private forecast information with respect to the uncertain demand. The incumbent retailer could strategically share its forecast information to make great profits. We find that, when the incumbent retailer shares the information with its upstream manufacturer, the entrant retailer benefits from this information sharing arrangement because of the information leakage effect. However, the incumbent retailer will be motived to share the information with the manufacturer only when the manufacturer is high efficient in collection investment. To achieve information sharing, the research results show that, the manufacturer and the entrant retailer should pay the incumbent retailer for the demand information if the investment efficiency of the manufacturer meets certain conditions.
{"title":"Information sharing strategy for an incumbent retailer in a closed-loop supply chain","authors":"Keyuan Cai, Qianjiang Yin, Dali Huang","doi":"10.1051/ro/2023163","DOIUrl":"https://doi.org/10.1051/ro/2023163","url":null,"abstract":"Abstract: This paper considers a closed-loop supply chain with a manufacturer, an incumbent retailer and an entrant retailer. The two retailers order the same products from the common manufacturer and then sell to consumers, and the incumbent retailer possesses private forecast information with respect to the uncertain demand. The incumbent retailer could strategically share its forecast information to make great profits. We find that, when the incumbent retailer shares the information with its upstream manufacturer, the entrant retailer benefits from this information sharing arrangement because of the information leakage effect. However, the incumbent retailer will be motived to share the information with the manufacturer only when the manufacturer is high efficient in collection investment. To achieve information sharing, the research results show that, the manufacturer and the entrant retailer should pay the incumbent retailer for the demand information if the investment efficiency of the manufacturer meets certain conditions.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135645682","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Seyed Mohammad Javad Mirzapour Alehashem, Ramzi Hammami
In modern production-distribution supply chains, decentralization has increased significantly, due to increasing production network efficiency. This study investigates a production scheduling and vehicle routing problem in a make-to-order context under a decentralized decision-making structure. Specifically, two different decision makers hierarchically decide the production and distribution schedules to minimize their incurred costs and we formulate the problem as a bi-level mixed-integer optimization model as a static Stackelberg game between manufacturer and distributer. At the upper level, the manufacturer decides its best scheduling under a flexible job-shop manufacturing system, and at the lower level, the distributor decides its distribution scheduling (routing) which influences the upper level decisions. The model derives the best production-distribution scheduling scheme, with the objective of minimizing the cost of the manufacturer (leader) at the lowest possible cost for the distributor (follower). As the lower level represents a mixed-integer programming problem, it is challenging to solve the resulting bi-level model. Therefore, we extend an efficient decomposition algorithm based on Duplication Method and Column Generation. Finally, to discuss the decentralization value, the results of the presented bi-level model are compared with those of the centralized approach.
{"title":"A decentralized production-distribution scheduling problem: Solution and analysis","authors":"Seyed Mohammad Javad Mirzapour Alehashem, Ramzi Hammami","doi":"10.1051/ro/2023160","DOIUrl":"https://doi.org/10.1051/ro/2023160","url":null,"abstract":"In modern production-distribution supply chains, decentralization has increased significantly, due to increasing production network efficiency. This study investigates a production scheduling and vehicle routing problem in a make-to-order context under a decentralized decision-making structure. Specifically, two different decision makers hierarchically decide the production and distribution schedules to minimize their incurred costs and we formulate the problem as a bi-level mixed-integer optimization model as a static Stackelberg game between manufacturer and distributer. At the upper level, the manufacturer decides its best scheduling under a flexible job-shop manufacturing system, and at the lower level, the distributor decides its distribution scheduling (routing) which influences the upper level decisions. The model derives the best production-distribution scheduling scheme, with the objective of minimizing the cost of the manufacturer (leader) at the lowest possible cost for the distributor (follower). As the lower level represents a mixed-integer programming problem, it is challenging to solve the resulting bi-level model. Therefore, we extend an efficient decomposition algorithm based on Duplication Method and Column Generation. Finally, to discuss the decentralization value, the results of the presented bi-level model are compared with those of the centralized approach.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135548663","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Guoxin Wang, Mingyang Pei, Zengxin Wei, Shengwei Yao
In this paper, a three-dimensional subspace conjugate gradient method is proposed, in which the search direction is generated by minimizing the approximation model of the objective function in a three-dimensional subspace. The approximation model is not unique and is alternative between quadratic model and conic model by the specific criterions. The strategy of initial stepsize and nonmonotone line search are adopted, and the global convergence of the presented algorithm is established under mild assumptions. In numerical experiments, we use a collection of 80 unconstrained optimization test problems to show the competitive performance of the presented method.
{"title":"An alternative three-dimensional subspace method based on conic model for unconstrained optimization","authors":"Guoxin Wang, Mingyang Pei, Zengxin Wei, Shengwei Yao","doi":"10.1051/ro/2023161","DOIUrl":"https://doi.org/10.1051/ro/2023161","url":null,"abstract":"In this paper, a three-dimensional subspace conjugate gradient method is proposed, in which the search direction is generated by minimizing the approximation model of the objective function in a three-dimensional subspace. The approximation model is not unique and is alternative between quadratic model and conic model by the specific criterions. The strategy of initial stepsize and nonmonotone line search are adopted, and the global convergence of the presented algorithm is established under mild assumptions. In numerical experiments, we use a collection of 80 unconstrained optimization test problems to show the competitive performance of the presented method.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135591742","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
José André Brito, Gustavo Semaan, Leonardo Lima, Augusto Fadel
In sampling theory, stratification corresponds to a technique used in surveys, which allows segmenting a population into homogeneous subpopulations (strata) to produce statistics with a higher level of precision. In particular, this article proposes a heuristic to solve the univariate stratification problem - widely studied in the literature. One of its versions sets the number of strata and the precision level and seeks to determine the limits that define such strata to minimize the sample size allocated to the strata. A heuristic-based on a stochastic optimization method and an exact optimization method was developed to achieve this goal. The performance of this heuristic was evaluated through computational experiments, considering its application in various populations used in other works in the literature, based on 20 scenarios that combine different numbers of strata and levels of precision. From the analysis of the obtained results, it is possible to verify that the heuristic had a performance superior to four algorithms in the literature in more than 94% of the cases, particularly concerning the known algorithm of Lavallé-Hidiroglou.
{"title":"Heuristic algorithm for univariate stratification problem","authors":"José André Brito, Gustavo Semaan, Leonardo Lima, Augusto Fadel","doi":"10.1051/ro/2023158","DOIUrl":"https://doi.org/10.1051/ro/2023158","url":null,"abstract":"In sampling theory, stratification corresponds to a technique used in surveys, which allows segmenting a population into homogeneous subpopulations (strata) to produce statistics with a higher level of precision. In particular, this article proposes a heuristic to solve the univariate stratification problem - widely studied in the literature. One of its versions sets the number of strata and the precision level and seeks to determine the limits that define such strata to minimize the sample size allocated to the strata. A heuristic-based on a stochastic optimization method and an exact optimization method was developed to achieve this goal. The performance of this heuristic was evaluated through computational experiments, considering its application in various populations used in other works in the literature, based on 20 scenarios that combine different numbers of strata and levels of precision. From the analysis of the obtained results, it is possible to verify that the heuristic had a performance superior to four algorithms in the literature in more than 94% of the cases, particularly concerning the known algorithm of Lavallé-Hidiroglou.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"234 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135790727","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The rapid development of e-commerce and Internet technology impacts the consumer purchasing practices and the decision-making of the supply chain. In this regard, dealing with online reviews and reference price together for a competitive interaction in a two-period dual-channel scenario is one of the main challenges. To address this interaction, in the present research, we consider a dual-channel supply chain with a two-period. The selling price and the reference price impact on the retailer's demand in both channels. Whereas, the online reviews influence the demands of the direct channels only. The manufacturer, who announces wholesale prices and direct channel selling prices, is Stackelberg game's leader and the retailer is the follower. Two different decision-making strategies (I, II) are made by both players: (I) The manufacturer and the retailer both make all their decisions at the beginning of the selling season, (II) Here all decisions are made at the beginning of each selling period. In order to compare these strategies, we create a centralized policy as a benchmark scenario. The optimal solutions of the supply chain and each player are determined and analyzed. The numerical and sensitivity analysis suggests that the responsive pricing can bring additional benefits to both the players.
{"title":"Two-period decision strategies in a dual-channel supply chain considering reference price and online reviews","authors":"Dr. Srikumar Panda, Tarun Maiti","doi":"10.1051/ro/2023159","DOIUrl":"https://doi.org/10.1051/ro/2023159","url":null,"abstract":"The rapid development of e-commerce and Internet technology impacts the consumer purchasing practices and the decision-making of the supply chain. In this regard, dealing with online reviews and reference price together for a competitive interaction in a two-period dual-channel scenario is one of the main challenges. To address this interaction, in the present research, we consider a dual-channel supply chain with a two-period. The selling price and the reference price impact on the retailer's demand in both channels. Whereas, the online reviews influence the demands of the direct channels only. The manufacturer, who announces wholesale prices and direct channel selling prices, is Stackelberg game's leader and the retailer is the follower. Two different decision-making strategies (I, II) are made by both players: (I) The manufacturer and the retailer both make all their decisions at the beginning of the selling season, (II) Here all decisions are made at the beginning of each selling period. In order to compare these strategies, we create a centralized policy as a benchmark scenario. The optimal solutions of the supply chain and each player are determined and analyzed. The numerical and sensitivity analysis suggests that the responsive pricing can bring additional benefits to both the players.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135790596","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this study, we focus on a specific class of bilateral free boundaries problems. We approach this problem by formulating it as a shape optimization problem using a defined cost functional. The existence of an optimal solution for the optimization problem is proved. To tackle this problem, we propose an iterative approach that combines the particle swarm optimization and fuzzy logic methods. Additionally, we employ the finite element method as a discretization technique for the state equation. To validate our approaches, we investigate various types of domains. Furthermore, we compare the performance of these approaches in two scenarios: one with exact measurements used for identification and another with noisy measurements.
{"title":"A fuzzy particle swarm optimization method with application to shape design problem","authors":"Youness EL YAZIDI","doi":"10.1051/ro/2023157","DOIUrl":"https://doi.org/10.1051/ro/2023157","url":null,"abstract":"In this study, we focus on a specific class of bilateral free boundaries problems. We approach this problem by formulating it as a shape optimization problem using a defined cost functional. The existence of an optimal solution for the optimization problem is proved. To tackle this problem, we propose an iterative approach that combines the particle swarm optimization and fuzzy logic methods. Additionally, we employ the finite element method as a discretization technique for the state equation. To validate our approaches, we investigate various types of domains. Furthermore, we compare the performance of these approaches in two scenarios: one with exact measurements used for identification and another with noisy measurements.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135790245","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
To reduce human resource costs, the part-to-picker order fulfilment systems may have a single picker in charge of multiple workstations. And the picking speed of the picker becomes faster as the picking number increases due to the learning effect in the picking operation. In this paper, the scheduling problem to optimizing picking sequence of the picker is presented to minimize the maximum picking time, where one picker is responsible for multiple workstations. The learning effect and travel time between workstations are taken into account to improve scheduling accuracy. Two mixed integer programming (MIP) models are proposed to solve the problem, namely the rank-based model and disjunctive model. The performance of the two Mixed Integer Programming (MIP) models has been evaluated, and it has been found that they are only capable of solving small-scale problems. The rank-based model is limited to solving problems with up to 9 groups, whereas the disjunctive model can handle up to 20 groups. Therefore, the disjunctive model outperforms the rank-based model. Moreover, this paper proposes Interval Insertion NEH (IINEH) and iterative greedy (IG) algorithm to solve the large-scale problem. Numerical experiments demonstrate the effectiveness of the two methods to solve the problem, where IINEH operates faster while IG gives better results. Therefore, when faced with a large-scale problem, IINEH is recommended if a quick solution is needed. If better optimization results are needed, the decision maker can choose IG.
{"title":"Picking scheduling for single picker to multi-workstations of the part-to-picker order fulfilment system","authors":"Jinchang Hu, Xin Wang","doi":"10.1051/ro/2023156","DOIUrl":"https://doi.org/10.1051/ro/2023156","url":null,"abstract":"To reduce human resource costs, the part-to-picker order fulfilment systems may have a single picker in charge of multiple workstations. And the picking speed of the picker becomes faster as the picking number increases due to the learning effect in the picking operation. In this paper, the scheduling problem to optimizing picking sequence of the picker is presented to minimize the maximum picking time, where one picker is responsible for multiple workstations. The learning effect and travel time between workstations are taken into account to improve scheduling accuracy. Two mixed integer programming (MIP) models are proposed to solve the problem, namely the rank-based model and disjunctive model. The performance of the two Mixed Integer Programming (MIP) models has been evaluated, and it has been found that they are only capable of solving small-scale problems. The rank-based model is limited to solving problems with up to 9 groups, whereas the disjunctive model can handle up to 20 groups. Therefore, the disjunctive model outperforms the rank-based model. Moreover, this paper proposes Interval Insertion NEH (IINEH) and iterative greedy (IG) algorithm to solve the large-scale problem. Numerical experiments demonstrate the effectiveness of the two methods to solve the problem, where IINEH operates faster while IG gives better results. Therefore, when faced with a large-scale problem, IINEH is recommended if a quick solution is needed. If better optimization results are needed, the decision maker can choose IG.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134958138","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The information coordination of fresh agricultural products supply chain is conducive to improving the overall efficiency and competitiveness of the supply chain, and reducing carbon emissions. Under the carbon cap-and-trade policy, this paper constructed an evolutionary game model of supply chain information collaboration involving a fresh agricultural products supplier, a cold chain logistics service provider and a fresh agricultural products retailer, explored the selection of information collaboration strategies of each subject, and simulated it with system dynamics. The results show that: The stability strategy of the game system is related to the initial willingness of each subject. When any two parties participate in information collaboration, the other party will also choose to participate in collaboration. In addition, the choice of information collaboration strategy of the subject is also related to the collaborative planning ability, collaborative strategy formulation ability, consumers’ preference, the initial cost of each subject, revenue sharing and cost sharing mechanism, government subsidies, government regulation and carbon cap-and-trade policy. It is worth noting that the collaborative planning capability is more conducive to promoting the subject to choose information collaborative strategy than the collaborative strategy formulation capability; the carbon trading price has a greater impact on the subject's participation in collaboration, while the total amount of carbon quota has no impact on the choice of the subject's information collaboration strategy. Furthermore, based on the research results, the corresponding management suggestions are put forward from the two aspects of the government and the participants.
{"title":"Research on information collaboration strategy of fresh agricultural products supply chain under carbon cap-and-trade","authors":"Yang Yang, Guanxin Yao","doi":"10.1051/ro/2023155","DOIUrl":"https://doi.org/10.1051/ro/2023155","url":null,"abstract":"The information coordination of fresh agricultural products supply chain is conducive to improving the overall efficiency and competitiveness of the supply chain, and reducing carbon emissions. Under the carbon cap-and-trade policy, this paper constructed an evolutionary game model of supply chain information collaboration involving a fresh agricultural products supplier, a cold chain logistics service provider and a fresh agricultural products retailer, explored the selection of information collaboration strategies of each subject, and simulated it with system dynamics. The results show that: The stability strategy of the game system is related to the initial willingness of each subject. When any two parties participate in information collaboration, the other party will also choose to participate in collaboration. In addition, the choice of information collaboration strategy of the subject is also related to the collaborative planning ability, collaborative strategy formulation ability, consumers’ preference, the initial cost of each subject, revenue sharing and cost sharing mechanism, government subsidies, government regulation and carbon cap-and-trade policy. It is worth noting that the collaborative planning capability is more conducive to promoting the subject to choose information collaborative strategy than the collaborative strategy formulation capability; the carbon trading price has a greater impact on the subject's participation in collaboration, while the total amount of carbon quota has no impact on the choice of the subject's information collaboration strategy. Furthermore, based on the research results, the corresponding management suggestions are put forward from the two aspects of the government and the participants.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135817735","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Nan Zhang, Amir Kalhor, Roza Azizi, Reza Kazemi Matin
Conventional Network Data Envelopment Analysis (NDEA) models often make an assumption of data precision, which frequently does not align with the realities of many real-world scenarios. When dealing with ambiguous data, whether it involves input, output, or intermediate products represented as bounded or ordinal data, the accurate assessment of efficiency scores poses a significant challenge. This study addresses the crucial issue of handling interval data within NDEA structures by introducing an innovative methodology that integrates both optimistic and pessimistic strategies. Our proposed methodology goes beyond the mere determination of upper and lower bounds for efficiency scores; it also incorporates target-setting and improvement approaches. Through the calculation of interval efficiency for each decision-making unit (DMU), our approach offers a comprehensive framework for efficiency classification. To underscore the effectiveness of this methodology, the study presents empirical evidence through a case study in the agriculture industry. The results not only showcase the advantages of our proposed methodology but also emphasize its potential for practical application in diverse and complex real-world contexts.
传统的网络数据包络分析(Network Data Envelopment Analysis, NDEA)模型通常对数据精度进行假设，这往往与许多现实场景的实际情况不一致。在处理模棱两可的数据时，无论它是否涉及以有界数据或有序数据表示的输入、输出或中间产品，对效率分数的准确评估都是一个重大挑战。本研究通过引入一种结合乐观和悲观策略的创新方法，解决了NDEA结构中处理区间数据的关键问题。我们提出的方法超越了仅仅确定效率分数的上限和下限;它还包括目标设定和改进方法。该方法通过计算各决策单元的区间效率，为效率分类提供了一个全面的框架。为了强调该方法的有效性，本研究通过农业行业的案例研究提出了经验证据。结果不仅展示了我们提出的方法的优势，而且强调了它在不同和复杂的现实世界背景下实际应用的潜力。
{"title":"Improved efficiency assessment in network DEA through interval data analysis: An empirical study in agriculture","authors":"Nan Zhang, Amir Kalhor, Roza Azizi, Reza Kazemi Matin","doi":"10.1051/ro/2023154","DOIUrl":"https://doi.org/10.1051/ro/2023154","url":null,"abstract":"Conventional Network Data Envelopment Analysis (NDEA) models often make an assumption of data precision, which frequently does not align with the realities of many real-world scenarios. When dealing with ambiguous data, whether it involves input, output, or intermediate products represented as bounded or ordinal data, the accurate assessment of efficiency scores poses a significant challenge. This study addresses the crucial issue of handling interval data within NDEA structures by introducing an innovative methodology that integrates both optimistic and pessimistic strategies. Our proposed methodology goes beyond the mere determination of upper and lower bounds for efficiency scores; it also incorporates target-setting and improvement approaches. Through the calculation of interval efficiency for each decision-making unit (DMU), our approach offers a comprehensive framework for efficiency classification. To underscore the effectiveness of this methodology, the study presents empirical evidence through a case study in the agriculture industry. The results not only showcase the advantages of our proposed methodology but also emphasize its potential for practical application in diverse and complex real-world contexts.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135769637","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：