RAIRO Oper. Res.最新文献_第9页

A new synergistic strategy for ranking restaurant locations: A decision-making approach based on the hexagonal fuzzy numbers 一种新的餐厅位置排序协同策略:基于六边形模糊数的决策方法

RAIRO Oper. Res. Pub Date : 2023-02-28 DOI: 10.1051/ro/2023025

Kamal Hossain Gazi, S. Mondal, Banashree Chatterjee, Neha Ghorui, Arijit Ghosh, Debashis De

{"title":"A new synergistic strategy for ranking restaurant locations: A decision-making approach based on the hexagonal fuzzy numbers","authors":"Kamal Hossain Gazi, S. Mondal, Banashree Chatterjee, Neha Ghorui, Arijit Ghosh, Debashis De","doi":"10.1051/ro/2023025","DOIUrl":"https://doi.org/10.1051/ro/2023025","url":null,"abstract":"This research addresses the problem of restaurant locations ranking with applications for a cosmopolitan big city like Kolkata, India. A restaurant selection is based on occasions, spending capability, environment, location, comfort, quality of the food etc. In this research paper an exhaustive set of factors and sub-factors is taken into consideration to select and rank restaurants situated at different locations in the city of Kolkata with a population of around fifteen million. The ranking of restaurants depends on complex, conflicting qualitative attributes. In the paper Hexagonal Fuzzy Numbers (HFN) have been used to suitably depict the imprecise uncertain environment. HFN, its distance measure and defuzzification have been applied to deal with the hesitancy and impreciseness of the decision makers. Analytic Hierarchy Process (AHP) has been used as a Multi Criteria Decision Making (MCDM) tool to obtain factors and sub-factors weights. TOPSIS and COPRAS methods were used for ranking different restaurant locations. Using comparative analysis it is shown that HFN with the TOPSIS and COPRAS method gives better result than other fuzzy numbers. The sensitivity analysis portion also gives a direction for taking a suitable decision in different possible scenario.","PeriodicalId":20872,"journal":{"name":"RAIRO Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76069951","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}

引用次数: 7

Optimality conditions and duality results for a robust bi-level programming problem 一类鲁棒双层规划问题的最优性条件和对偶性结果

RAIRO Oper. Res. Pub Date : 2023-02-28 DOI: 10.1051/ro/2023026

Shivani Saini, N. Kailey, I. Ahmad

引用次数: 0

An incentive mechanism for integration of business applications between organizations 组织间业务应用程序集成的激励机制

RAIRO Oper. Res. Pub Date : 2023-02-23 DOI: 10.1051/ro/2023024

Rasool Esmaeilyfard, Atefe Salehi

{"title":"An incentive mechanism for integration of business applications between organizations","authors":"Rasool Esmaeilyfard, Atefe Salehi","doi":"10.1051/ro/2023024","DOIUrl":"https://doi.org/10.1051/ro/2023024","url":null,"abstract":"Extending services and operations of organizations in the field of e-business or e-government sometimes requires the integration of business applications. However, sometimes due to challenges and risks, such as complex business processes reengineering, upstream organizations are reluctant to integrate their applications. This paper focuses on two critical questions; (1) How can organizations be encouraged to participate in integrating their business applications? (2) What is the amount of incentives required? In this study, cooperative game theory and the externalities of these systems have been considered to form a stable coalition between organizations for integrating their business applications. We provided an algorithm for determining the incentives to integrate the business applications with other organizations in this coalition. These incentives can be extended to various management issues for better decision-making such as economic aspects, public subsidies, and public participation. The results of experiments have shown that creating a coalition based on this strategy is always possible, and the benefits of organizations in the coalition rise with increasing service delivery in business applications.","PeriodicalId":20872,"journal":{"name":"RAIRO Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91055191","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

Search engine marketing for different competition modes - Interfirm and intrafirm 不同竞争模式下的搜索引擎营销——企业间和企业内部

RAIRO Oper. Res. Pub Date : 2023-02-20 DOI: 10.1051/ro/2023021

Xueli Zhang, Defeng Yang, Can Li

{"title":"Search engine marketing for different competition modes - Interfirm and intrafirm","authors":"Xueli Zhang, Defeng Yang, Can Li","doi":"10.1051/ro/2023021","DOIUrl":"https://doi.org/10.1051/ro/2023021","url":null,"abstract":"Brands seeking for prominent positions in online consumer search may invest in two types of search engine marketing: paid search marketing (PSM) and search engine optimization (SEO). This paper investigates how firms should allocate marketing resources between PSM and SEO under different competition modes (interfirm and intrafirm competition). We develop an analytical model where within an interfirm competition, two brands compete for every step, while for the intrafirm competition, multi-brand firm coordinates the search engine marketing decisions for its brands, but delegates the price decisions to the brand managers. We find that the resource allocation decision may depend on the firm’s brand strength in organic search. Our analysis shows an increasing curve relation between resources allocated to PSM and the brand strength for interfirm competition and inverted-U shape for intrafirm competition. More specifically, as the brand strength goes up, for the interfirm competition, the resources allocated to PSM increase till 100%, while it should increase only when brand strength is sufficiently low, but decrease when brand strength is high for the intrafirm competition. This nontrivial result underscores the challenge facing a multi-brand firm in balancing between maximizing the search prominence for the category and minimizing the internal competition.","PeriodicalId":20872,"journal":{"name":"RAIRO Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87735658","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

Identifying approximate proper efficiency in an infinite dimensional space 在无限维空间中确定近似固有效率

RAIRO Oper. Res. Pub Date : 2023-02-20 DOI: 10.1051/ro/2023019

N. Hoseinpoor, M. Ghaznavi

引用次数: 0

Minimizing total tardiness in a two-machine flowshop with uncertain and bounded processing times 在具有不确定和有限加工时间的双机流程车间中最小化总延迟

RAIRO Oper. Res. Pub Date : 2023-02-20 DOI: 10.1051/ro/2023023

Muberra Allahverdi

{"title":"Minimizing total tardiness in a two-machine flowshop with uncertain and bounded processing times","authors":"Muberra Allahverdi","doi":"10.1051/ro/2023023","DOIUrl":"https://doi.org/10.1051/ro/2023023","url":null,"abstract":"The two-machine flowshop scheduling problem with the performance measure of total tardiness is addressed. This performance measure is essential since meeting deadlines is a crucial part of scheduling and a major concern for some manufacturing systems. The processing times on both machines are uncertain variables and within some lower and upper bounds. This is due to uncertainty being an integral part of some manufacturing settings, making it impossible to predict processing times in advance. To the best of the author’s knowledge, this problem is addressed for the first time in this paper. A dominance relation is established and nineteen algorithms, which incorporate the established dominance relation, are presented. These algorithms are extensively evaluated through randomly generated data for different numbers of jobs and four different distributions, representing both symmetric and non-symmetric distributions. Computational experiments show that the presented algorithms perform extremely well when compared with a random solution. In particular, the best of the considered 19 algorithms reduces the error of the random solution by 99.99% and the error of the worst algorithm (among the 19 algorithms) by 99.96%. The results are confirmed by a test of hypothesis and this algorithm is recommended.","PeriodicalId":20872,"journal":{"name":"RAIRO Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81401876","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

Single machine SLK/DIF due window assignment problem with general job-dependent positional effect and outsourcing operations 具有一般岗位依赖效应和外包操作的单机SLK/DIF到期窗口分配问题

RAIRO Oper. Res. Pub Date : 2023-02-20 DOI: 10.1051/ro/2023020

Chun-Lai Liu

引用次数: 0

Fast synergy approximation in transportation procurement with combinatorial auctions 组合拍卖运输采购中的快速协同逼近

RAIRO Oper. Res. Pub Date : 2023-02-20 DOI: 10.1051/ro/2023022

M. E. Keskin, C. Triki, Adel Elomri

引用次数: 1

Independent Roman bondage of graphs 图的独立罗马束缚

RAIRO Oper. Res. Pub Date : 2023-02-14 DOI: 10.1051/ro/2023017

S. Kosari, J. Amjadi, M. Chellali, S. M. Sheikholeslami

{"title":"Independent Roman bondage of graphs","authors":"S. Kosari, J. Amjadi, M. Chellali, S. M. Sheikholeslami","doi":"10.1051/ro/2023017","DOIUrl":"https://doi.org/10.1051/ro/2023017","url":null,"abstract":"An independent Roman dominating function (IRD-function) on a graph $G$ is a\u0000\u0000function $f:V(G)rightarrow{0,1,2}$ satisfying the conditions that (i) every\u0000\u0000vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which\u0000\u0000$f(v)=2$, and (ii) the set of all vertices assigned non-zero\u0000\u0000values under $f$ is independent. The weight of an IRD-function is\u0000\u0000the sum of its function values over all vertices, and the independent Roman\u0000\u0000domination number $i_{R}(G)$ of $G$ is the minimum weight of an\u0000\u0000IRD-function on $G$. In this paper, we initiate the study of the independent\u0000\u0000Roman bondage number $b_{iR}(G)$ of a graph $G$ having at least\u0000\u0000one component of order at least three, defined as the smallest size of set of\u0000\u0000edges $Fsubseteq E(G)$ for which $i_{R}(G-F)>i_{R}(G)$. We begin by showing\u0000\u0000that the decision problem associated with the independent Roman\u0000\u0000bondage problem is NP-hard for bipartite graphs.\u0000\u0000Then various upper bounds on $b_{iR}(G)$ are established as well\u0000\u0000as exact values on it for some special graphs. In particular, for trees $T$\u0000\u0000of order at least three, it is shown that $b_{iR}(T)leq3,$\u0000\u0000while for connected planar graphs the upper bounds are in terms of\u0000\u0000the maximum degree with refinements depending on the girth of the graph.","PeriodicalId":20872,"journal":{"name":"RAIRO Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86951116","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}

引用次数: 1

Minimizing the number of edges in (Pk ∪ K3)-saturated connected graphs 最小化(Pk∪K3)饱和连通图中的边数

RAIRO Oper. Res. Pub Date : 2023-02-14 DOI: 10.1051/ro/2023018

Yuying Li, Kexiang Xu

引用次数: 0