{"title":"An integrated vendor-buyer model with sustainability and remanufacturing of returned product","authors":"Magfura Pervin, Asim Paul, Sankar Kumar Roy, Dharma Lesmono, Leonidas Sakalauskas","doi":"10.1051/ro/2024104","DOIUrl":"https://doi.org/10.1051/ro/2024104","url":null,"abstract":"Carbon emission reduction is very crucial nowadays. A proper balance is required for carbon emission reduction and burning of fossils fuels because during fossil fuel burning carbon is emitted and it is essential for industrialization. This study presents an inventory model with green technology where production of new items and remanufacturing of returned items are allowed. Remembering the present global situation, the ordering cost is assumed as variable cost which contain order cancellation and reorder cost. Online order policy is considered with quality of product and a return rate. Keeping in mind the social, economic and environmental aspects, the demand function is considered as sustainability sensitive demand. A nonlinear model is designed based on the above concepts. The model is solved both theoretically and analytically. The main motives of the work are to find the effects of ordering cost, carbon emission cost and green technology investment on the inventory model for suggesting the best policy to the inventory manager. Sensitivity analysis is performed to validate the model. The numerical results prove that ignoring ordering cost, carbon emission cost and green technology investment can lead to a false optimal solution and this can be a huge economical loss for the inventory manager. The results also prove that a sustainable model with carbon emission and green technology investment is more realistic and profitable in compare with the other existing models.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"60 10","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140974768","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}
Mahmoud Muhammad Yahaya, P. Kumam, P. Chaipunya, Aliyu Muhammed Awwal, Lin Wang
{"title":"On diagonally structured scheme for nonlinear least squares and data-fitting problems","authors":"Mahmoud Muhammad Yahaya, P. Kumam, P. Chaipunya, Aliyu Muhammed Awwal, Lin Wang","doi":"10.1051/ro/2024102","DOIUrl":"https://doi.org/10.1051/ro/2024102","url":null,"abstract":"Recently, structured nonlinear least-squares (NLS) based algorithms gained considerable emphasis from researchers; this attention may result from increasingly applicable areas of these algorithms in different science and engineering domains. In this article, we coined a new efficient structured-based NLS algorithm. We developed a diagonal Hessian-based formulation for solving NLS problems. We derived the quasi-Newton update based on a diagonal matrix scheme subject to a modified structured secant condition. Also, we show that the algorithm search direction satisfies a sufficient descent condition under some standard assumptions. Subsequently, we also prove the global convergence of the algorithm and then eventually show the linear convergence rate for strongly convex functions. Furthermore, we numerically experimented with the proposed algorithm on benchmark test functions available in the literature. Finally, in the scheme, we apply the method to solve some data-fitting problems.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"132 22","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140977085","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}
{"title":"The cost bearing mechanism for advertising in a capital-constrained supply chain","authors":"Hongping Li, Han Zheng, Yang Xu","doi":"10.1051/ro/2024105","DOIUrl":"https://doi.org/10.1051/ro/2024105","url":null,"abstract":"With rising market competition, increasing numbers of firms are launching adverting to attract customers and promote product sales. The increase in operating costs caused by advertising places greater pressure on small retail businesses that are prone to capital shortages, leading them to seek financing from upstream firms. However, in the financing process, upstream and downstream firms may not be able to acquire all of one another's real information, which inevitably has a significant impact on their operating strategies. In this paper, by constructing a Stackelberg game, we study the effects of information asymmetry on the retailer's initial capital and the manufacturer's financing rate on their advertising strategies. We find that in a capital-constrained supply chain with symmetric information, when the advertising cost coefficient is low, manufacturer advertising is the superior strategy and increases the profits of the retailer and the manufacturer, consumer surplus and social welfare; when it is moderate, retailer advertising is the superior policy; but when it is high, retailer advertising is more beneficial for the manufacturer's profit, consumer surplus and social welfare but is more unfavorable for the retailer's profit. In addition, information asymmetry on the manufacturer's financing rate affects the advertising strategies of the manufacturer and the retailer, but information asymmetry on the retailer's initial capital fails. Additionally, we further extend the model to the Nash game scenario and cooperative advertising scenario and draw some different conclusions. The findings provide new theoretical implications for the formulation of firm advertising strategies.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"43 12","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140972736","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}
{"title":"Transient analysis of a bulk stream queue with arbitrarily distributed arrival intervals","authors":"Ashwini Soundararajan, F. P Barbhuiya","doi":"10.1051/ro/2024107","DOIUrl":"https://doi.org/10.1051/ro/2024107","url":null,"abstract":"We study the classical infinite buffer single server queueing model with renewal input of customers in batches of random size, having arbitrarily distributed arrival intervals and exponentially distributed service times. Using the technique of supplementary variable and shift operator we derive closed form expression of the time dependent system content distribution in terms of its Laplace transform. The analysis is mainly based on the root-finding technique of the non-linear characteristic equation in terms of the Laplace transform variable. Additionally, using asymptotic properties of Laplace transform, we deduce the corresponding steady-state distribution. We discuss some special cases of the model, thus providing an alternative approach in deriving the transient distribution. We further evaluate certain performance measures and present extensive numerical examples in tabular and graphical form to illustrate the applicability of our theoretical work. The effect of system parameters, interarrival time distribution and traffic intensity on the system behavior is also demonstrated.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"78 12","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140975958","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}
Shiling Song, Ye Zhang, Jianhui Xie, Sheng Ang, Feng Yang
{"title":"A simulation-based DEA approach for multiple criterion decision-making problems with uncertain mixed-criteria values","authors":"Shiling Song, Ye Zhang, Jianhui Xie, Sheng Ang, Feng Yang","doi":"10.1051/ro/2024113","DOIUrl":"https://doi.org/10.1051/ro/2024113","url":null,"abstract":"In ex-ante decision scenarios, predicting criterion values accurately is difficult for decision makers (DMs). Inconsiderable work is normally required for measuring criteria by uncertain random values or ordinal values. However, in the classical data envelopment analysis (DEA) model, criterion values are the constants that limit the application of the classical DEA model in ex-ante decision scenarios. This paper presents a simulation-based DEA approach, which captures random and ordinal criterion values by a simple and direct simulation-based approach. The approach includes three steps. In the first step, Monte Carlo simulation methods are used to convert uncertain random values or ordinal values into cardinal data. In the second step, we use traditional DEA methods to compute the efficiency score of decision-making units (DMUs). In the third step, we ranked all DMUs by calculating the DEA-efficient acceptability of each DMU in multiple simulations and then selected the optimal DMU. The proposed approach is illustrated by experimental examples and a case study of a municipal wastewater treatment system.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"55 5","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140972177","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}
Bilal Ahmad RATHER, Muhammad Imran, Zahid Raza, Fozia Bashir Farooq
{"title":"Spectral properties of sombor matrix of threshold graphs","authors":"Bilal Ahmad RATHER, Muhammad Imran, Zahid Raza, Fozia Bashir Farooq","doi":"10.1051/ro/2024111","DOIUrl":"https://doi.org/10.1051/ro/2024111","url":null,"abstract":"We investigate the Sombor spectral properties of threshold graphs, a formula for the Sombor index is presented, the Sombor eigenvalues are given, graphs with simple Sombor eigenvalues are characterized, bounds on the smallest/largest Sombor eigenvalues are presented, the multiplicities of the Sombor eigenvalues, formulae for trace and determinant of the associated quotient matrix are given, the Sombor spread bound and the bounds on the Sombor energy along with the characterization of extremal graphs. At the end, the conclusion states that all our results are valid for adjacency matrix and other adjacency type matrices.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"47 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140976384","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}
{"title":"Cost-sharing incentive for collaborative innovation between main manufacturer-core supplier based on risk factorsCost-sharing incentive for collaborative innovation between main manufacturer-core supplier based on risk factors","authors":"yuchen wang, zilong wang, Hechang Cai","doi":"10.1051/ro/2024112","DOIUrl":"https://doi.org/10.1051/ro/2024112","url":null,"abstract":"This paper considers the “main manufacturer-supplier” model in collaborative cooperation among firms which requires the leader to invest significant resources and bear huge risks. However, few scholars simultaneously consider innovation risks and incentive issues under the model. We construct a Stackelberg game incentive model with different cost-sharing ratios under the risk of technological innovation. We characterize the equilibrium of the model and highlight the key role played by the main manufacturer and supplier. The results are as follows: (a) Main manufacturer can implement the cost-sharing incentive strategy under certain conditions, which is, its profit coefficient is greater than 0.75 times that of supplier and the cost-sharing ratio’s expected coefficient is greater than the minimum threshold. (b) The optimal cost-sharing ratio is directly proportional to the profit coefficient of the main manufacturer, inversely proportional to that of the supplier, and shows an inverted U-shape function with the probability of successful technological innovation. (c)This strategy can motivate suppliers to invest more resources, reduce the investment of the main manufacturer, simultaneously increase the profits of the main manufacturer and supplier in the certain ranges of innovation success probability and profit coefficients, with significant incentive effects.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"60 22","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140975022","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}
{"title":"Graphs obtained by disjoint unions and joins of cliques and stable sets","authors":"Alain Hertz","doi":"10.1051/ro/2024108","DOIUrl":"https://doi.org/10.1051/ro/2024108","url":null,"abstract":"We consider the set of graphs that can be constructed from a one-vertex graph by repeatedly adding a clique or a stable set linked to all or none of the vertices added in previous steps. This class of graphs contains various well-studied graph families such as threshold, domishold, co-domishold and complete multipartite graphs, as well as graphs with linear clique-width at most 2. We show that it can be characterized by\u0000three forbidden induced subgraphs as well as by properties involving maximal stable sets and minimal dominating sets. We also give a simple recognition algorithm and formulas for the computation of the stability and domination numbers of these graphs.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"118 27","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140977904","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}
{"title":"Early entrant's strategy for cooperating with a competing fourth-party platform","authors":"Wen Xin, Jun Lin","doi":"10.1051/ro/2024101","DOIUrl":"https://doi.org/10.1051/ro/2024101","url":null,"abstract":"By integrating several third-party platforms that enter the market late (later entrants), a fourth-party platform can effectively compete with the third-party platform that enters the market early (early entrant). Our research develops an analytical framework to address the platform coopetition problem that the early entrant faces, i.e., integrating its service into the fourth-party platform or not, when there is a fourth-party platform in the market. This study provides optimal conditions and platform decisions for platform coopetition and then explores the impact of the implementation of the coopetition strategy on platform prices and consumer demands. Our analytical results show that the coopetition strategy is effective only when the sum of the strengths of direct and indirect network effects is low and the quality difference between the early and later entrants is higher than a certain threshold. Moreover, the early entrant always partially integrates its service into the fourth-party platform when the coopetition strategy is adopted. Such adoption always lowers the prices of the early and later entrants. The implementation of the coopetition strategy always increases the total consumer demand of the early entrant, but it also results in a reduction in the number of consumers in the standalone application of the early entrant.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"100 s2","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141003560","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}
Yajie Li, Tao Wang, Shuting Chen, Xinmiao Hu, Rui Yin, Jun Yan
{"title":"Prediction method for power fluctuations in cross regional consumption and transportation under the integration of new energy","authors":"Yajie Li, Tao Wang, Shuting Chen, Xinmiao Hu, Rui Yin, Jun Yan","doi":"10.1051/ro/2024099","DOIUrl":"https://doi.org/10.1051/ro/2024099","url":null,"abstract":"Against the backdrop of the increasing development of the new energy industry, the volatility of new energy output poses significant challenges to regional power grid balance and energy absorption. Therefore, this article proposes a prediction method for cross regional transmission power fluctuations under new energy integration conditions. A comprehensive and representative sample dataset was constructed by comprehensively considering factors such as fluctuations in new energy output, capacity confidence, and peak shaving characteristic parameters, combined with numerical weather forecast data. Normalize the sample data to eliminate dimensional differences between parameters. The sparrow search algorithm is used to optimize the weights and thresholds of the double hidden layer BP neural network, effectively avoiding local optimization problems caused by over training. The experimental results show that this method has significant advantages in predicting power fluctuations in cross regional absorption and transportation of new energy, with a predicted power to power ratio of over 0.85.","PeriodicalId":506995,"journal":{"name":"RAIRO - Operations Research","volume":"23 15","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141005716","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}