RAIRO - Operations Research最新文献_第6页

Complexity results on k-independence in some graph products 关于某些图积中 k-independence 的复杂性结果

RAIRO - Operations Research Pub Date : 2024-05-07 DOI: 10.1051/ro/2024098

Márcia Cappelle, Erika Coelho, Otavio Mortosa, Julliano Nascimento

引用次数: 0

A robust, resilience and risk-aware solar energy farm location by bi-level programming approach 通过双级编程方法确定稳健、弹性和风险意识强的太阳能发电场位置

RAIRO - Operations Research Pub Date : 2024-05-07 DOI: 10.1051/ro/2024100

Reza Lotfi, Pedram MohajerAnsari, Mohammad Mehdi Sharifi Nevisi, Seyed Mahdi Sharifmousavi, Mohamad Afshar, Mojtaba Sadreddini Mehrjardi

{"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}

引用次数: 0

Successive upper approximation methods for generalized fractional programs 广义分式程序的连续上近似方法

RAIRO - Operations Research Pub Date : 2024-05-01 DOI: 10.1051/ro/2024097

K. Boufi, Abdessamad Fadil, A. Roubi

引用次数: 0

Directed graphs with lower orientation Ramsey thresholds 具有较低定向拉姆齐阈值的有向图

RAIRO - Operations Research Pub Date : 2024-04-24 DOI: 10.1051/ro/2024090

Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Y. Kohayakawa, Guilherme Oliveira Mota, Tássio Naia

引用次数: 0

Advancing group efficiency evaluation in DEA with negative data: An empirical application in the banking industry 利用负数据推进 DEA 中的集团效率评估：银行业的经验应用

RAIRO - Operations Research Pub Date : 2024-04-23 DOI: 10.1051/ro/2024089

Leila Kolahdoozi, Reza Kazemi Matin, G. Tohidi, S. Razavyan

引用次数: 0

Dynamic investment strategies for a folk sports tourism destination under uncertain demand 需求不确定情况下民间体育旅游目的地的动态投资战略

RAIRO - Operations Research Pub Date : 2024-04-22 DOI: 10.1051/ro/2024088

Xinjiao Lv, Bowen Deng, Kui Deng

{"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}

引用次数: 0

New approach to solve unconstrained binary quadratic problem 解决无约束二元二次方程问题的新方法

RAIRO - Operations Research Pub Date : 2024-04-18 DOI: 10.1051/ro/2024087

Rabih Battikh

引用次数: 0

An efficient algorithm for two-stage capacitated time minimization transportation problem with restricted flow 限制流量的两阶段容时最小化运输问题的高效算法

RAIRO - Operations Research Pub Date : 2024-04-10 DOI: 10.1051/ro/2024086

Supinder Kaur, Ekta Jain, Anuj Sharma, Kalpana Dahiya

{"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}

引用次数: 0

Optimal decisions of elderly care service supply chain with government intervention 政府干预下养老服务供应链的最优决策

RAIRO - Operations Research Pub Date : 2024-04-08 DOI: 10.1051/ro/2024085

Jiahuan He, X.G. Luo, Yang Yu, Zhongliang Zhang

{"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}

引用次数: 0

Turkish cashier problem with time windows and its solution by matheuristic algorithms 带时间窗口的土耳其出纳问题及其数理算法解决方案

RAIRO - Operations Research Pub Date : 2024-04-08 DOI: 10.1051/ro/2024084

Ahmad Bassaleh, Ekrem Duman

{"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}

引用次数: 0