For a positive integer k, a subset S of vertices of a graph G=(V,E) is k-independent if each vertex in S has at most k - 1 neighbors in S. We consider k-independent sets in two graph products: Cartesian and complementary prism. We show that k-independence remains NP-complete even for Cartesian products and complementary prisms. Furthermore, we present results on k-independence in grid graphs, which is a Cartesian product of two paths.
对于正整数 k，如果 S 中的每个顶点在 S 中最多有 k - 1 个相邻顶点，则图 G=(V,E)的顶点子集 S 是 k-independent 的：笛卡尔图和互补棱镜图。我们证明，即使对于笛卡尔积和互补棱图，k-independence 仍然是 NP-complete。此外，我们还介绍了网格图中的 k-independence 结果，网格图是两条路径的笛卡尔积。
{"title":"Complexity results on k-independence in some graph products","authors":"Márcia Cappelle, Erika Coelho, Otavio Mortosa, Julliano Nascimento","doi":"10.1051/ro/2024098","DOIUrl":"https://doi.org/10.1051/ro/2024098","url":null,"abstract":"For a positive integer k, a subset S of vertices of a graph G=(V,E) is k-independent if each vertex in S has at most k - 1 neighbors in S. We consider k-independent sets in two graph products: Cartesian and complementary prism. We show that k-independence remains NP-complete even for Cartesian products and complementary prisms. Furthermore, we present results on k-independence in grid graphs, which is a Cartesian product of two paths.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"106 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141002305","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}
Reza Lotfi, Pedram MohajerAnsari, Mohammad Mehdi Sharifi Nevisi, Seyed Mahdi Sharifmousavi, Mohamad Afshar, Mojtaba Sadreddini Mehrjardi
In challenging circumstances such as war, governments are shifting their focus towards Solar Energy (SE) as a Renewable Energy (RE) option through photovoltaic panels due to the rising costs associated with fossil fuel extraction and exploration. This model recommends a SE Location (SEL) that prioritizes Robustness, Resilience, and Risk awareness (3R) which is called 3RSEL. As a result, a Bi-Level Programming (BLP) is proposed to solve this problem for the first time. A heuristic approach is defined for a BLP mathematical model. This research generates a lower and upper bound to solve the model quickly. The results show that Yazd and Kerman are the optimal location for SEL. The main problem is compared to a situation where risk and robustness are not considered. It can be observed that the supplier's profit and energy production are lower than without risk and robustness, with a gap of -4.4%. The variability of the conservatism coefficient, discount rate, confidence level of Conditional Value at Risk (CVaR), and problem scale are considered. Increasing the conservatism coefficient decreases the supplier's profit function and energy output. Alternatively, increasing the discount rate decreases the supplier's profit function without affecting the energy output. Conversely, boosting the confidence level does not alter suppliers' profit function but results in declining energy output. Finally, as stated, it can be observed that the computation time increases with an increase in the scale of the problem.
在战争等充满挑战的环境下，由于化石燃料开采和勘探的成本不断上升，各国政府正将重点转向太阳能（Solar Energy，SEL），将其作为可再生能源（Renewable Energy，RE）的一种选择。该模型推荐的 SE 位置（SEL）优先考虑稳健性、复原力和风险意识（3R），即 3RSEL。因此，首次提出了一种双层编程（BLP）方法来解决这一问题。为 BLP 数学模型定义了一种启发式方法。这项研究为快速求解该模型提供了下限和上限。结果表明，亚兹德和克尔曼是 SEL 的最佳地点。主要问题与不考虑风险和稳健性的情况进行了比较。可以看出，供应商的利润和能源产量低于不考虑风险和稳健性的情况，差距为-4.4%。考虑了稳健性系数、贴现率、风险条件值（CVaR）置信度和问题规模的变化。提高保守系数会降低供应商的利润函数和能源产出。或者，提高贴现率会降低供应商的利润函数，但不会影响能源产出。相反，提高置信度不会改变供应商的利润函数，但会导致能源产出下降。最后，如前所述，计算时间会随着问题规模的扩大而增加。
{"title":"A robust, resilience and risk-aware solar energy farm location by bi-level programming approach","authors":"Reza Lotfi, Pedram MohajerAnsari, Mohammad Mehdi Sharifi Nevisi, Seyed Mahdi Sharifmousavi, Mohamad Afshar, Mojtaba Sadreddini Mehrjardi","doi":"10.1051/ro/2024100","DOIUrl":"https://doi.org/10.1051/ro/2024100","url":null,"abstract":"In challenging circumstances such as war, governments are shifting their focus towards Solar Energy (SE) as a Renewable Energy (RE) option through photovoltaic panels due to the rising costs associated with fossil fuel extraction and exploration. This model recommends a SE Location (SEL) that prioritizes Robustness, Resilience, and Risk awareness (3R) which is called 3RSEL. As a result, a Bi-Level Programming (BLP) is proposed to solve this problem for the first time. A heuristic approach is defined for a BLP mathematical model. This research generates a lower and upper bound to solve the model quickly. The results show that Yazd and Kerman are the optimal location for SEL. The main problem is compared to a situation where risk and robustness are not considered. It can be observed that the supplier's profit and energy production are lower than without risk and robustness, with a gap of -4.4%. The variability of the conservatism coefficient, discount rate, confidence level of Conditional Value at Risk (CVaR), and problem scale are considered. Increasing the conservatism coefficient decreases the supplier's profit function and energy output. Alternatively, increasing the discount rate decreases the supplier's profit function without affecting the energy output. Conversely, boosting the confidence level does not alter suppliers' profit function but results in declining energy output. Finally, as stated, it can be observed that the computation time increases with an increase in the scale of the problem.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"5 18","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141004386","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 majorization approximation procedure consists in replacing the resolution of a nonlinear optimization problem by solving a sequence of simpler ones, whose objective and constraint functions upper estimate those of the original problem. For generalized fractional programming, i.e., constrained minimization programs whose objective functions are maximums of finite ratios of functions, we propose an adapted scheme that simultaneously upper approximates parametric functions formed by the objective and constraint functions. For directionally convex functions, that is, functions whose directional derivatives are convex with respect to directions, we will establish that every cluster point of the generated sequence satisfies Karush-Kuhn-Tucker type conditions expressed in terms of directional derivatives. The proposed procedure unifies several existing methods and gives rise to new ones. Numerical problems are solved to test the efficiency of our methods, and comparisons with different approaches are given.
{"title":"Successive upper approximation methods for generalized fractional programs\u0000\u0000 ","authors":"K. Boufi, Abdessamad Fadil, A. Roubi","doi":"10.1051/ro/2024097","DOIUrl":"https://doi.org/10.1051/ro/2024097","url":null,"abstract":"The majorization approximation procedure consists in replacing the resolution of a nonlinear optimization problem by solving a sequence of simpler ones, whose objective and constraint functions upper estimate those of the original problem. For generalized fractional programming, i.e., constrained minimization programs whose objective functions are maximums of finite ratios of functions, we propose an adapted scheme that simultaneously upper approximates parametric functions formed by the objective and constraint functions. For directionally convex functions, that is, functions whose directional derivatives are convex with respect to directions, we will establish that every cluster point of the generated sequence satisfies Karush-Kuhn-Tucker type conditions expressed in terms of directional derivatives. The proposed procedure unifies several existing methods and gives rise to new ones. Numerical problems are solved to test the efficiency of our methods, and comparisons with different approaches are given.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"35 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141047373","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}
Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Y. Kohayakawa, Guilherme Oliveira Mota, Tássio Naia
We investigate the threshold [[EQUATION]] for the Ramsey-type property [[EQUATION]], where [[EQUATION]] is the binomial random graph and [[EQUATION]] indicates that every orientation of the graph [[EQUATION]] contains the oriented graph [[EQUATION]] as a subdigraph. Similarly to the classical Ramsey setting, the upper bound [[EQUATION]] is known to hold for some constant [[EQUATION]], where [[EQUATION]] denotes the maximum 2-density of the underlying graph [[EQUATION]] of [[EQUATION]]. While this upper bound is indeed the threshold for some [[EQUATION]], this is not always the case. We obtain examples arising from rooted products of orientations of sparse graphs (such as forests, cycles and, more generally, subcubic [[EQUATION]]-free graphs) and arbitrarily rooted transitive triangles.
{"title":"Directed graphs with lower orientation Ramsey thresholds","authors":"Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Y. Kohayakawa, Guilherme Oliveira Mota, Tássio Naia","doi":"10.1051/ro/2024090","DOIUrl":"https://doi.org/10.1051/ro/2024090","url":null,"abstract":"We investigate the threshold [[EQUATION]] for the Ramsey-type property [[EQUATION]], where [[EQUATION]] is the binomial random graph and [[EQUATION]] indicates that every orientation of the graph [[EQUATION]] contains the oriented graph [[EQUATION]] as a subdigraph. Similarly to the classical Ramsey setting, the upper bound [[EQUATION]] is known to hold for some constant [[EQUATION]], where [[EQUATION]] denotes the maximum 2-density of the underlying graph [[EQUATION]] of [[EQUATION]]. While this upper bound is indeed the threshold for some [[EQUATION]], this is not always the case. We obtain examples arising from rooted products of orientations of sparse graphs (such as forests, cycles and, more generally, subcubic [[EQUATION]]-free graphs) and arbitrarily rooted transitive triangles.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"13 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140660514","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}
Leila Kolahdoozi, Reza Kazemi Matin, G. Tohidi, S. Razavyan
Data Envelopment Analysis (DEA) plays a pivotal role in assessing production unit efficiency. This study extends group efficiency assessment within the banking sector by utilizing the Modified Semi-Oriented Radial Measure (MSORM) model, specifically designed to handle negative data. It introduces two distinct efficiency definitions and develops models for their evaluation within these groups. Focusing on banks as decision-making units, the MSORM model delves into the intricacies of group efficiency. By effectively addressing negative data complexities, it enables a comprehensive evaluation of bank efficiency across various group frameworks. The study further examines the efficacy of efficiency definitions based on average and weakest performances within the MSORM framework. Empirical findings reveal significant variations in group efficiency assessment under different paradigms, highlighting the impact of the evaluation approach. This research contributes valuable insights into performance variations within the banking industry and aids in enhancing efficiency evaluations in banking systems.
{"title":"Advancing group efficiency evaluation in DEA with negative data: An empirical application in the banking industry","authors":"Leila Kolahdoozi, Reza Kazemi Matin, G. Tohidi, S. Razavyan","doi":"10.1051/ro/2024089","DOIUrl":"https://doi.org/10.1051/ro/2024089","url":null,"abstract":"Data Envelopment Analysis (DEA) plays a pivotal role in assessing production unit efficiency. This study extends group efficiency assessment within the banking sector by utilizing the Modified Semi-Oriented Radial Measure (MSORM) model, specifically designed to handle negative data. It introduces two distinct efficiency definitions and develops models for their evaluation within these groups. Focusing on banks as decision-making units, the MSORM model delves into the intricacies of group efficiency. By effectively addressing negative data complexities, it enables a comprehensive evaluation of bank efficiency across various group frameworks. The study further examines the efficacy of efficiency definitions based on average and weakest performances within the MSORM framework. Empirical findings reveal significant variations in group efficiency assessment under different paradigms, highlighting the impact of the evaluation approach. This research contributes valuable insights into performance variations within the banking industry and aids in enhancing efficiency evaluations in banking systems.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"50 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140666203","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}
More research should shed light on discovering the optimal investment strategy for folk sports tourism destination (FSTD) projects. Therefore, in this paper, we develop a dynamic game model of FSTD considering the dynamic characteristics of FSTD investment, the mode of division of labor and cooperation between public and private operators, and the uncertainty of consumer demand. Public capital is responsible for constructing infrastructures such as venues, and private capital is responsible for services such as catering and accommodation. To promote the development of the FSTD project, the higher-level government subsidizes public investment. Consumer demand for the program is affected by factors such as the size of the two types of capital, the price and quality of services, and demand uncertainty. The study finds that the subsidy leads to an increase in the quantity of public investment and consumption demand, but private sector investment and the prices of both public and private projects are unaffected by the subsidy; the public sector's net return varies in an inverted U-shape with the rate of subsidy, but the private sector's net return rises monotonically. Demand disturbances widen the gap in the net returns of operators between the subsidized and unsubsidized scenarios.
更多的研究应有助于发现民俗体育旅游目的地（FSTD）项目的最优投资策略。因此，考虑到民俗体育旅游目的地投资的动态特征、公共运营商与私人运营商的分工合作模式以及消费者需求的不确定性，本文建立了民俗体育旅游目的地动态博弈模型。公共资本负责场馆等基础设施建设，私人资本负责餐饮、住宿等服务。为促进 FSTD 项目的发展，上级政府对公共投资进行补贴。消费者对该项目的需求受到两类资本规模、服务价格和质量以及需求不确定性等因素的影响。研究发现，补贴会导致公共投资数量和消费需求的增加，但私人部门的投资以及公共和私人项目的价格不受补贴影响；公共部门的净回报率随补贴率呈倒 U 型变化，但私人部门的净回报率则单调上升。需求扰动拉大了有补贴和无补贴情况下运营商净收益的差距。
{"title":"Dynamic investment strategies for a folk sports tourism destination under uncertain demand","authors":"Xinjiao Lv, Bowen Deng, Kui Deng","doi":"10.1051/ro/2024088","DOIUrl":"https://doi.org/10.1051/ro/2024088","url":null,"abstract":"More research should shed light on discovering the optimal investment strategy for folk sports tourism destination (FSTD) projects. Therefore, in this paper, we develop a dynamic game model of FSTD considering the dynamic characteristics of FSTD investment, the mode of division of labor and cooperation between public and private operators, and the uncertainty of consumer demand. Public capital is responsible for constructing infrastructures such as venues, and private capital is responsible for services such as catering and accommodation. To promote the development of the FSTD project, the higher-level government subsidizes public investment. Consumer demand for the program is affected by factors such as the size of the two types of capital, the price and quality of services, and demand uncertainty. The study finds that the subsidy leads to an increase in the quantity of public investment and consumption demand, but private sector investment and the prices of both public and private projects are unaffected by the subsidy; the public sector's net return varies in an inverted U-shape with the rate of subsidy, but the private sector's net return rises monotonically. Demand disturbances widen the gap in the net returns of operators between the subsidized and unsubsidized scenarios.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"14 4","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140673656","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 addresses the unconstrained binary quadratic problem (UQP). This problem consists in minimizing a quadratic function a binary variables (0-1 variables). Accordingly, in this work, a hybrid algorithm called (HA), based on simulated annealing algorithm with some combination procedures, have been proposed and a branch and bound procedure, based on this algorithm (HA) and semi definite programing problem (SDP), has been applied. The purpose of this approach is to facilitate the resolution of the initial problem and reduce its dimension by using some fixing criteria in a repeat loop. Numerical results are presented to consolidate the demonstrated theoretical results and prove effectiveness and performance in speed and quality of our new approach.
{"title":"New approach to solve unconstrained binary quadratic problem","authors":"Rabih Battikh","doi":"10.1051/ro/2024087","DOIUrl":"https://doi.org/10.1051/ro/2024087","url":null,"abstract":"This paper addresses the unconstrained binary quadratic problem (UQP). This problem consists in minimizing a quadratic function a binary variables (0-1 variables). Accordingly, in this work, a hybrid algorithm called (HA), based on simulated annealing algorithm with some combination procedures, have been proposed and a branch and bound procedure, based on this algorithm (HA) and semi definite programing problem (SDP), has been applied. The purpose of this approach is to facilitate the resolution of the initial problem and reduce its dimension by using some fixing criteria in a repeat loop. Numerical results are presented to consolidate the demonstrated theoretical results and prove effectiveness and performance in speed and quality of our new approach.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":" 4","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140688005","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 discusses a two-stage capacitated time minimization transportation problem with the restricted flow (TSCTMTP-F) in which the transportation takes place in two stages and only a specified amount of commodity is transported in both stages. The total amount F_1 is transported during Stage-I and F_2 during Stage-II, and the objective is to minimize the sum of the transportation times for Stage-I and Stage-II. In 2017, Kaur et al. (2017) studied this problem and developed a polynomially bounded iterative algorithm (Algorithm-A) to solve TSCTMTP-F. However, their proposed algorithm has some flaws and may not always yield an optimal solution to the problem TSCTMTP-F. An improved iterative algorithm (Algorithm-C) is proposed in this paper that guarantees an optimal solution to the problem. Various theoretical results prove the convergence and efficiency of Algorithm-C to obtain an optimal solution to the problem TSCTMTP-F. Numerical problems are included in the support of theory along with a counter-example for which Algorithm-A fails to obtain its optimal solution. Computational experiments on a variety of test problems have been carried out to validate the convergence and efficiency of Algorithm-C.
{"title":"An efficient algorithm for two-stage capacitated time minimization transportation problem with restricted flow","authors":"Supinder Kaur, Ekta Jain, Anuj Sharma, Kalpana Dahiya","doi":"10.1051/ro/2024086","DOIUrl":"https://doi.org/10.1051/ro/2024086","url":null,"abstract":"This paper discusses a two-stage capacitated time minimization transportation problem with the restricted flow (TSCTMTP-F) in which the transportation takes place in two stages and only a specified amount of commodity is transported in both stages. The total amount F_1 is transported during Stage-I and F_2 during Stage-II, and the objective is to minimize the sum of the transportation times for Stage-I and Stage-II. In 2017, Kaur et al. (2017) studied this problem and developed a polynomially bounded iterative algorithm (Algorithm-A) to solve TSCTMTP-F. However, their proposed algorithm has some flaws and may not always yield an optimal solution to the problem TSCTMTP-F. An improved iterative algorithm (Algorithm-C) is proposed in this paper that guarantees an optimal solution to the problem. Various theoretical results prove the convergence and efficiency of Algorithm-C to obtain an optimal solution to the problem TSCTMTP-F. Numerical problems are included in the support of theory along with a counter-example for which Algorithm-A fails to obtain its optimal solution. Computational experiments on a variety of test problems have been carried out to validate the convergence and efficiency of Algorithm-C.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"24 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140720453","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}
Government intervention plays an indispensable role in the development of the elderly care service supply chain (ECSSC). However, no research has focused on the optimal decision-making of the ECSSC considering government intervention under different channel power structures. This study establishes a three-stage ECSSC model, including the government sector, elderly care service provider and elderly care service integrator, while considering different government intervention measures and channel power structures. The service-level elasticity coefficient is defined as an uncertain variable, that can affect service demand and ESI service costs. This study explores the optimal decisions and market performance of the government and ECSSC under different channel power structures and government intervention, providing guidance for the ECSSC development and government decision-making. The results show that, first, government intervention is beneficial for the ECSSC, customers, and social welfare. Compared with the subsidy and service-level regulation scenario, only the former is beneficial for the supply chain, social welfare, and unit customer expenditure, but at the cost of lower service level and higher government expenditure. Second, different channel power structures do not affect service level, social welfare, and unit customer expenditure. However, the ESI-dominated structure favors ECSSC development. Third, the setting of the reward-penalty factor should not be too high, as, in this case, supply chain members, customers, and social welfare will benefit from the increased expected value of service level elasticity. At last, managerial insights are presented based on theoretical analysis and numerical experiment results.
政府干预在养老服务供应链（ECSSC）的发展中扮演着不可或缺的角色。然而，还没有研究关注不同渠道权力结构下考虑政府干预的养老服务供应链优化决策。本研究建立了一个包括政府部门、养老服务提供商和养老服务集成商的三阶段 ECSSC 模型，同时考虑了不同的政府干预措施和渠道权力结构。服务水平弹性系数被定义为不确定变量，会影响服务需求和 ESI 服务成本。本研究探讨了在不同渠道权力结构和政府干预措施下，政府和中心的最优决策和市场绩效，为中心发展和政府决策提供指导。研究结果表明：第一，政府干预有利于 ECSSC、客户和社会福利。与补贴和服务水平监管方案相比，只有前者有利于供应链、社会福利和客户单位支出，但代价是降低服务水平和增加政府支出。其次，不同的渠道权力结构不会影响服务水平、社会福利和单位客户支出。然而，ESI 主导的结构有利于 ECSSC 的发展。第三，奖惩系数的设置不宜过高，因为在这种情况下，供应链成员、客户和社会福利都会从服务水平弹性预期值的增加中受益。最后，基于理论分析和数值实验结果提出了管理启示。
{"title":"Optimal decisions of elderly care service supply chain with government intervention","authors":"Jiahuan He, X.G. Luo, Yang Yu, Zhongliang Zhang","doi":"10.1051/ro/2024085","DOIUrl":"https://doi.org/10.1051/ro/2024085","url":null,"abstract":"Government intervention plays an indispensable role in the development of the elderly care service supply chain (ECSSC). However, no research has focused on the optimal decision-making of the ECSSC considering government intervention under different channel power structures. This study establishes a three-stage ECSSC model, including the government sector, elderly care service provider and elderly care service integrator, while considering different government intervention measures and channel power structures. The service-level elasticity coefficient is defined as an uncertain variable, that can affect service demand and ESI service costs. This study explores the optimal decisions and market performance of the government and ECSSC under different channel power structures and government intervention, providing guidance for the ECSSC development and government decision-making. The results show that, first, government intervention is beneficial for the ECSSC, customers, and social welfare. Compared with the subsidy and service-level regulation scenario, only the former is beneficial for the supply chain, social welfare, and unit customer expenditure, but at the cost of lower service level and higher government expenditure. Second, different channel power structures do not affect service level, social welfare, and unit customer expenditure. However, the ESI-dominated structure favors ECSSC development. Third, the setting of the reward-penalty factor should not be too high, as, in this case, supply chain members, customers, and social welfare will benefit from the increased expected value of service level elasticity. At last, managerial insights are presented based on theoretical analysis and numerical experiment results.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"239 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140730502","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}
Turkish Cashier Problem (TCP) is a new application area of the traveling salesman problem that was introduced to the literature recently. In this problem, the cashier can use public transportation or take a taxi where the cashier must visit multiple customer locations while minimizing the total transportation cost. In this study, we introduce a more realistic version of this problem where time has been integrated. This aspect is achieved by imposing time intervals within which the cashier must visit the customers. We name this problem as the TCP with time windows (TCPwTW). We develop several matheuristic algorithms to solve the TCPwTW: a modified version of the Simplify and Conquer (SAC) algorithm that was suggested for the TCP, simulated annealing (SA), original and modified versions of the migrating birds optimization (MBO) algorithm coupled with mathematical programming. We also tried to find the exact optimum using a Solver where for complex problems, only lower bounds were found. Numerical experimentation reveals that while for problems with loose time intervals, an exact solver can be considered. Once the time intervals tighten up, the best solutions can be obtained using matheuristics involving SA and MBO.
土耳其收银员问题（TCP）是旅行推销员问题的一个新应用领域，最近才被引入文献中。在这个问题中，收银员可以使用公共交通工具，也可以乘坐出租车，收银员必须访问多个客户地点，同时使总运输成本最小化。在本研究中，我们引入了这个问题的一个更现实的版本，其中融入了时间因素。收银员必须在规定的时间间隔内拜访客户，从而实现这一点。我们将这一问题命名为带时间窗口的 TCP（TCPwTW）。我们开发了几种数学启发式算法来解决 TCPwTW 问题：简化与征服（SAC）算法的改进版（该算法曾被推荐用于 TCP）、模拟退火（SA）、与数学编程相结合的候鸟优化（MBO）算法的原始版和改进版。我们还尝试使用求解器找到精确的最佳值，对于复杂问题，只能找到下限。数值实验表明，对于时间间隔宽松的问题，可以考虑使用精确求解器。一旦时间间隔变紧，就可以使用涉及 SA 和 MBO 的数学启发式方法获得最佳解决方案。
{"title":"Turkish cashier problem with time windows and its solution by matheuristic algorithms","authors":"Ahmad Bassaleh, Ekrem Duman","doi":"10.1051/ro/2024084","DOIUrl":"https://doi.org/10.1051/ro/2024084","url":null,"abstract":"Turkish Cashier Problem (TCP) is a new application area of the traveling salesman problem that was introduced to the literature recently. In this problem, the cashier can use public transportation or take a taxi where the cashier must visit multiple customer locations while minimizing the total transportation cost. In this study, we introduce a more realistic version of this problem where time has been integrated. This aspect is achieved by imposing time intervals within which the cashier must visit the customers. We name this problem as the TCP with time windows (TCPwTW). We develop several matheuristic algorithms to solve the TCPwTW: a modified version of the Simplify and Conquer (SAC) algorithm that was suggested for the TCP, simulated annealing (SA), original and modified versions of the migrating birds optimization (MBO) algorithm coupled with mathematical programming. We also tried to find the exact optimum using a Solver where for complex problems, only lower bounds were found. Numerical experimentation reveals that while for problems with loose time intervals, an exact solver can be considered. Once the time intervals tighten up, the best solutions can be obtained using matheuristics involving SA and MBO.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"50 4","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140730254","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
扫码关注我们
求助内容：
应助结果提醒方式：