Rairo-Operations Research最新文献

Interval-valued picture fuzzy aggregation information based on Frank operators and their application in group decision making 基于Frank算子的区间值图像模糊聚合信息及其在群体决策中的应用

4区管理学

Rairo-Operations Research Pub Date : 2023-11-07 DOI: 10.1051/ro/2023174

Mohammad Ali Abolfathi, Ali Ebadian

{"title":"Interval-valued picture fuzzy aggregation information based on Frank operators and their application in group decision making","authors":"Mohammad Ali Abolfathi, Ali Ebadian","doi":"10.1051/ro/2023174","DOIUrl":"https://doi.org/10.1051/ro/2023174","url":null,"abstract":"The information aggregation operator plays a key rule in the multiple attribute group decision making problems. The aim of this paper is to investigate the information aggregation operators method under the interval-valued picture fuzzy environment with the help of Frank norms operations. The picture fuzzy set is an extended version of the intuitionistic fuzzy set, which not only considers the degree of acceptance or rejection but also takes into the account of neutral degree during the analysis. Under these environments, some basic aggregation operators namely interval-valued picture fuzzy Frank weighted averaging operator, interval-valued picture fuzzy Frank ordered weighted averaging operator, interval-valued picture fuzzy Frank hybrid averaging operator, interval-valued picture fuzzy Frank weighted geometric operator, interval-valued picture fuzzy Frank ordered weighted geometric operator, and interval-valued picture fuzzy Frank hybrid geometric operator are proposed in this paper. Some general properties of these operators such as idempotency, commutativity, monotonicity, and boundedness, are discussed. Furthermore, the method for multiple attribute group decision making problems based on these operators is developed and the operational processes are illustrated in detail. Finally, an illustrative example has been given to show the decision steps of the proposed method and to demonstrate their eﬀectiveness.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135475983","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}

引用次数: 0

2-power domination number for Knodel graphs and its application in communication networks Knodel图的2次支配数及其在通信网络中的应用

4区管理学

Rairo-Operations Research Pub Date : 2023-11-03 DOI: 10.1051/ro/2023173

R. Sundara Rajan, Arulanand S, S. Prabhu, Indra Rajasingh

引用次数: 0

An exact second order cone programming approach for traffic assignment problems 交通分配问题的精确二阶锥规划方法

4区管理学

Rairo-Operations Research Pub Date : 2023-10-26 DOI: 10.1051/ro/2023172

Vedat Bayram

{"title":"An exact second order cone programming approach for traffic assignment problems","authors":"Vedat Bayram","doi":"10.1051/ro/2023172","DOIUrl":"https://doi.org/10.1051/ro/2023172","url":null,"abstract":"Demographic changes, urbanization and increasing vehicle ownership at unprecedented rates put a lot of strain on cities particularly on urban mobility and transportation and overwhelm transportation network infrastructures and current transportation systems, which are not built to cope with such a fast increasing demand. Traffic congestion is considered as the most difficult challenge to tackle for sustainable urban mobility and is aggravated by the increased freight activity due to e-commerce and on-demand delivery and the explosive growth in transportation network companies and ride-hailing services. There is a need to implement a combination of policies to ensure that increased urban traffic congestion does not lower the quality of life and threaten global climate and human health and to prevent further economic losses. This study aims to contribute to the United Nations (UN) climate action and sustainable development goals in tackling recurring traffic congestion problem in urban areas to achieve a sustainable urban mobility in that it offers a solution methodology for traffic assignment problem. We introduce an exact generalized solution methodology based on reformulation of existing traffic assignment problems as a second order cone programming (SOCP) problem and propose column generation (CG) and cutting plane (CP) algorithms to solve the problem effectively for large scale road network instances. We conduct numerical experiments to test the performance of the proposed algorithms on realistic road networks.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"7 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134910013","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}

引用次数: 0

Price strategy of community fresh food e-commerce considering the heterogeneous needs of consumers and fresh quality transparency 考虑消费者异质需求和生鲜质量透明度的社区生鲜电子商务价格策略

4区管理学

Rairo-Operations Research Pub Date : 2023-10-25 DOI: 10.1051/ro/2023169

BING JIANG, HONGBING LUO, CHONG WANG, JIANKANG LIU, XIAOLING LIU, CHENG LIU, ZHENYI JI, DONG XIA

{"title":"Price strategy of community fresh food e-commerce considering the heterogeneous needs of consumers and fresh quality transparency ","authors":"BING JIANG, HONGBING LUO, CHONG WANG, JIANKANG LIU, XIAOLING LIU, CHENG LIU, ZHENYI JI, DONG XIA","doi":"10.1051/ro/2023169","DOIUrl":"https://doi.org/10.1051/ro/2023169","url":null,"abstract":"High online operating costs and low consumer utility still need to be addressed in the sales of community fresh e-commerce. Herein, we develop a new community fresh marketing model composed of retailers for online operating costs and consumers for low consumer utility by dividing community consumers into essential type and expectant type in this study. Then, the profit functions of community fresh retailers are developed in this study according to utility theory. Finally, a revised model of the fresh quality transparency (FQT) factor is conducted and discussed in this study. The results suggest that the profits obtained from essential consumers and expectant consumers by the community fresh e-commerce retailers are higher within a certain range of freshness costs compared to the basic model’s projection; meanwhile, the profits from expectant consumers contribute more than those from essential consumers. However, if the freshness cost exceeds a certain critical value, the abovementioned profits predicted from the new model will be lower. This study enriches the supply chain theory of community fresh food and provides retailers with theoretical guidance on differentiated services and pricing to better match the needs of community consumers.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135217897","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}

引用次数: 0

Analysis of a renewal arrival process subject to geometric catastrophe with random batch killing 随机批杀几何突变下的更新到达过程分析

4区管理学

Rairo-Operations Research Pub Date : 2023-10-25 DOI: 10.1051/ro/2023171

Nitin Kumar

引用次数: 0

Portfolio optimization based on bi-objective linear programming 基于双目标线性规划的投资组合优化

4区管理学

Rairo-Operations Research Pub Date : 2023-10-25 DOI: 10.1051/ro/2023170

Marzie Izadi, Mohammad Ali Yaghoobi

引用次数: 0

On the eccentricity energy and eccentricity spectral radius of graphs with odd diameter 奇径图的偏心能和偏心谱半径

4区管理学

Rairo-Operations Research Pub Date : 2023-10-24 DOI: 10.1051/ro/2023168

Leshi Qiu, Jianping Li, Jianbin Zhang

{"title":"On the eccentricity energy and eccentricity spectral radius of graphs with odd diameter","authors":"Leshi Qiu, Jianping Li, Jianbin Zhang","doi":"10.1051/ro/2023168","DOIUrl":"https://doi.org/10.1051/ro/2023168","url":null,"abstract":"The eccentricity matrix of a graph is defined as the matrix obtained from its distance matrix by retaining the largest elements in each row and column, while the rest elements are set to be zero. The eccentricity eigenvalues of a graph are the eigenvalues of its eccentricity matrix, the eccentricity energy of a graph is the sum of the absolute values of its eccentricity eigenvalues, and the eccentricity spectral radius of a graph is its largest eccentricity eigenvalue. Let Gn,d be the set of n-vertex connected graphs with odd diameter d, where each graph G in Gn,d has a diametrical path whose center edge is a cut edge of G. For any graph G in Gn,d, we construct a weighted graph Hω such that its adjacency matrix is just the eccentricity matrix of G, where H is the sequential join graph of the complement graphs of four disjoint complete graphs. In terms of the energy and spectral radius of the weighted graphs, we determine the graphs with minimum eccentricity energy, minimum and maximum eccentricity spectral radius, respectively, in Gn,d. As corollaries, we determine the trees with minimum eccentricity energy, minimum and maximum eccentricity spectral radius, respectively, among all trees with odd diameter.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"37 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135220403","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}

引用次数: 0

The self-coordination mean-variance strategy in continuous time 连续时间下的自协调均值方差策略

4区管理学

Rairo-Operations Research Pub Date : 2023-10-13 DOI: 10.1051/ro/2023166

Yun Shi, Duan Li, Xiangyu Cui

引用次数: 0

Exact and heuristic approaches for maximizing flows in UAV-enabled wireless cellular networks with multi-hop backhauls 具有多跳回程的无人机无线蜂窝网络流量最大化的精确和启发式方法

4区管理学

Rairo-Operations Research Pub Date : 2023-10-13 DOI: 10.1051/ro/2023167

Mohamed Haouari, Mariem Mhiri, Kais Msakni, Mazen Hasna, Tamer Khattab

{"title":"Exact and heuristic approaches for maximizing flows in UAV-enabled wireless cellular networks with multi-hop backhauls","authors":"Mohamed Haouari, Mariem Mhiri, Kais Msakni, Mazen Hasna, Tamer Khattab","doi":"10.1051/ro/2023167","DOIUrl":"https://doi.org/10.1051/ro/2023167","url":null,"abstract":"This paper investigates the problem of data routing in backhaul networks using Unmanned Aerial Vehicles (UAVs) to relay data from Small Cells (SCs) to the core network. The objective is to maximize the total demand of data to be routed, while ensuring technical requirements such as hop constraints and edge capacity. The problem is formulated using a compact mixed-integer programming model, which can solve small- and medium-sized topologies. In addition, a fast constructive heuristic based on a maximal tree is developed to solve large-scale topologies, resulting in a significant reduction in CPU time. The quality of the heuristic is evaluated by using column generation for solving the linear programming relaxation of an exponential formulation. The computational study shows the effectiveness and value of the proposed compact model and constructive heuristic for various topology sizes. Furthermore, experiments demonstrates that by keeping the network setup constant and updating the demand vector only, the computational time of the compact model can be drastically reduced for all topology sizes.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135855219","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}

引用次数: 0

Graceful game on some graph classes 一些图类的优美博弈

4区管理学

Rairo-Operations Research Pub Date : 2023-10-10 DOI: 10.1051/ro/2023165

Deise L. de Oliveira, Danilo Artigas, Simone Dantas, Luisa Frickes, Atílio G. Luiz

引用次数: 0