首页 > 最新文献

International Transactions in Operational Research最新文献

英文 中文
A revenue management approach for tourism logistics optimization 优化旅游物流的收益管理方法
IF 3.1 4区 管理学 Q2 MANAGEMENT Pub Date : 2024-06-08 DOI: 10.1111/itor.13494
Luigi Di Puglia Pugliese, Francesca Guerriero, Giovanna Miglionico

Tourism is a very complex industry and represents one of the most profitable activity in the world. A tourist product requires the execution of several multifaceted activities. Indeed, transportation, accommodation, entertainment, food, and beverages represent only some of the products/services required by a tourist. It is evident that a single enterprise cannot provide all the components of a tourist product, but several interrelated actors should collaborate. This leads to a very complex supply tourist chain that needs to be optimized. The relevant theories and methods of logistics can be used to efficiently manage all the flows that are generated in a tourist chain. The definition of appropriate policies, at the different nodes of the chain, can improve the performance of all the actors involved in tourism logistics. In this paper, we concentrate our attention on tour operators that are relevant in the touristic logistic chain since they are involved in several activities. We introduce different revenue management policies to support tour operators in the decision of accepting the most profitable tourist requests. A request consists of flights and hotel booking, characterized by a starting time of the trip and the length of stay at the destination. We allow for various combinations of flight legs and multiple categories of hotels to accommodate a variety of customer preferences and needs. A computational study is carried out by considering different scenarios, and the performance of the considered revenue management policies is analyzed in detail.

旅游业是一个非常复杂的产业,也是世界上最赚钱的活动之一。一项旅游产品需要开展多方面的活动。事实上,交通、住宿、娱乐、餐饮只是游客所需的部分产品/服务。显然,单个企业不可能提供旅游产品的所有组成部分,而需要几个相互关联的行为者进行合作。这就形成了一个非常复杂的旅游供应链,需要加以优化。物流的相关理论和方法可用于有效管理旅游链中产生的所有流动。在旅游链的不同节点制定适当的政策,可以提高旅游物流所有参与者的绩效。在本文中,我们重点关注旅游物流链中的旅游运营商,因为他们参与了多项活动。我们引入了不同的收益管理政策,以支持旅游经营者决定接受最有利可图的游客请求。一个请求由航班和酒店预订组成,以旅行的开始时间和在目的地的停留时间为特征。我们允许航班航段和多类酒店的不同组合,以满足客户的各种偏好和需求。我们通过考虑不同的情况进行了计算研究,并详细分析了所考虑的收益管理政策的性能。
{"title":"A revenue management approach for tourism logistics optimization","authors":"Luigi Di Puglia Pugliese,&nbsp;Francesca Guerriero,&nbsp;Giovanna Miglionico","doi":"10.1111/itor.13494","DOIUrl":"10.1111/itor.13494","url":null,"abstract":"<p>Tourism is a very complex industry and represents one of the most profitable activity in the world. A tourist product requires the execution of several multifaceted activities. Indeed, transportation, accommodation, entertainment, food, and beverages represent only some of the products/services required by a tourist. It is evident that a single enterprise cannot provide all the components of a tourist product, but several interrelated actors should collaborate. This leads to a very complex supply tourist chain that needs to be optimized. The relevant theories and methods of logistics can be used to efficiently manage all the flows that are generated in a tourist chain. The definition of appropriate policies, at the different nodes of the chain, can improve the performance of all the actors involved in tourism logistics. In this paper, we concentrate our attention on tour operators that are relevant in the touristic logistic chain since they are involved in several activities. We introduce different revenue management policies to support tour operators in the decision of accepting the most profitable tourist requests. A request consists of flights and hotel booking, characterized by a starting time of the trip and the length of stay at the destination. We allow for various combinations of flight legs and multiple categories of hotels to accommodate a variety of customer preferences and needs. A computational study is carried out by considering different scenarios, and the performance of the considered revenue management policies is analyzed in detail.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 1","pages":"353-383"},"PeriodicalIF":3.1,"publicationDate":"2024-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.13494","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141370549","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The role of drones in disaster response: A literature review of operations research applications 无人机在救灾中的作用:运筹学应用文献综述
IF 3.1 4区 管理学 Q2 MANAGEMENT Pub Date : 2024-06-05 DOI: 10.1111/itor.13484
Ecem Yucesoy, Burcu Balcik, Elvin Coban

The increasing use of drones has led to growing interest in their potential applications in disaster response. In this study, we examine the role of drones in disaster management under three categories of operation types, which are information collection, delivery, and communication network recovery. Focusing on an operations research (OR) perspective, we analyze and summarize the important characteristics of different problem structures and highlight the solution approaches. We also identify gaps and limitations in the current literature and propose future directions for further investigation. Overall, the study provides a comprehensive summary and valuable insights for researchers and practitioners interested in exploring the use of drones for humanitarian purposes and developing OR-based approaches to support decision-making.

随着无人机的使用日益广泛,人们对其在灾害响应中的潜在应用也越来越感兴趣。在本研究中,我们根据信息收集、传递和通信网络恢复这三类操作类型,研究了无人机在灾害管理中的作用。我们从运筹学(OR)的角度出发,分析并总结了不同问题结构的重要特征,并重点介绍了解决方法。我们还指出了当前文献中存在的差距和局限性,并提出了进一步研究的未来方向。总之,本研究为有兴趣探索将无人机用于人道主义目的并开发基于运筹学的方法来支持决策的研究人员和从业人员提供了全面的总结和宝贵的见解。
{"title":"The role of drones in disaster response: A literature review of operations research applications","authors":"Ecem Yucesoy,&nbsp;Burcu Balcik,&nbsp;Elvin Coban","doi":"10.1111/itor.13484","DOIUrl":"10.1111/itor.13484","url":null,"abstract":"<p>The increasing use of drones has led to growing interest in their potential applications in disaster response. In this study, we examine the role of drones in disaster management under three categories of operation types, which are information collection, delivery, and communication network recovery. Focusing on an operations research (OR) perspective, we analyze and summarize the important characteristics of different problem structures and highlight the solution approaches. We also identify gaps and limitations in the current literature and propose future directions for further investigation. Overall, the study provides a comprehensive summary and valuable insights for researchers and practitioners interested in exploring the use of drones for humanitarian purposes and developing OR-based approaches to support decision-making.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 2","pages":"545-589"},"PeriodicalIF":3.1,"publicationDate":"2024-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.13484","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141383666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Road network, landing location, and routing optimization for forest smallholders landscapes 森林小农户景观的路网、着陆点和路线优化
IF 3.1 4区 管理学 Q2 MANAGEMENT Pub Date : 2024-05-30 DOI: 10.1111/itor.13485
Miguel F. Constantino, Marta Mesquita, Susete Marques, Sándor F. Tóth, José G. Borges

We present two mixed integer linear programming (MILP) formulations for a well-known integrated network, timber landing location, and routing problem that arises in forest management. The models seek to jointly optimize the construction and maintenance schedule of forest road networks with landing site selection and transportation routing for timber production. This problem is, in general, difficult to solve as it contains the so-called fixed charge network flow problem, which is known to be NP-hard. One of the proposed MILP formulations considers 3-index continuous variables to represent timber flows on road segments in each period. The presence of Big-M constraints leads to weak linear relaxation bounds. Disaggregating flow variables, according to timber origin, results in a novel 4-index formulation with very tight linear relaxation bounds. Nevertheless, the number of variables increases prohibitively. This research makes use of spatial constraints common to Smallholding Forested Landscapes to develop a solution approach that reduces the number of flow variables in the new 4-index model. Results from a real-world case study located in Northwest Portugal show that, with the 4-index formulation, the proposed solution approach makes it possible to obtain optimal solutions in a short computational time.

我们提出了两种混合整数线性规划(MILP)公式,用于解决森林管理中出现的众所周知的综合网络、木材着陆地点和路线问题。这些模型旨在联合优化森林道路网络的建设和维护计划,以及木材生产的着陆点选择和运输路线。一般来说,这个问题很难解决,因为它包含所谓的固定费用网络流问题,而这个问题是众所周知的 NP 难题。所提出的 MILP 公式之一考虑了 3 索引连续变量,以表示每个周期内各路段上的木材流量。Big-M 约束条件的存在导致了弱线性松弛约束。根据木材产地对流量变量进行分解,可以得到线性松弛边界非常严格的新型 4 索引公式。然而,变量数量的增加令人望而却步。本研究利用小块林地景观中常见的空间约束条件,开发出一种可减少新 4 指数模型中流量变量数量的求解方法。葡萄牙西北部的一个实际案例研究结果表明,采用 4 指数公式,所提出的求解方法可以在较短的计算时间内获得最优解。
{"title":"Road network, landing location, and routing optimization for forest smallholders landscapes","authors":"Miguel F. Constantino,&nbsp;Marta Mesquita,&nbsp;Susete Marques,&nbsp;Sándor F. Tóth,&nbsp;José G. Borges","doi":"10.1111/itor.13485","DOIUrl":"10.1111/itor.13485","url":null,"abstract":"<p>We present two mixed integer linear programming (MILP) formulations for a well-known integrated network, timber landing location, and routing problem that arises in forest management. The models seek to jointly optimize the construction and maintenance schedule of forest road networks with landing site selection and transportation routing for timber production. This problem is, in general, difficult to solve as it contains the so-called fixed charge network flow problem, which is known to be NP-hard. One of the proposed MILP formulations considers 3-index continuous variables to represent timber flows on road segments in each period. The presence of Big-M constraints leads to weak linear relaxation bounds. Disaggregating flow variables, according to timber origin, results in a novel 4-index formulation with very tight linear relaxation bounds. Nevertheless, the number of variables increases prohibitively. This research makes use of spatial constraints common to Smallholding Forested Landscapes to develop a solution approach that reduces the number of flow variables in the new 4-index model. Results from a real-world case study located in Northwest Portugal show that, with the 4-index formulation, the proposed solution approach makes it possible to obtain optimal solutions in a short computational time.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 2","pages":"888-917"},"PeriodicalIF":3.1,"publicationDate":"2024-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.13485","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141189397","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Is it worth it? Using DEA to analyze the efficiency gains and costs of merging university departments: a case study of the Complutense University of Madrid 值得吗?利用 DEA 分析大学院系合并的效率收益和成本:马德里康普斯顿大学案例研究
IF 3.1 4区 管理学 Q2 MANAGEMENT Pub Date : 2024-05-28 DOI: 10.1111/itor.13488
Daniel Santín, Juan Tejada
The aim of this paper is to analyze the benefits of the university department merger undertaken by the Complutense University of Madrid (UCM) in 2017. The merger led to a new structure in which the original 184 departments were reduced to 97. To do this, we use the data envelopment analysis (DEA) to evaluate the efficiency gains of a merger process decomposing efficiency into three savings effects: learning, harmony, and scale effects. They decomposed efficiency into three savings effects: learning, harmony, and scale effects. Additionally, we introduce a new regulatory effect, which accounts for other potential recursive savings not included in the DEA analysis. Our results suggest that the merger process undertaken by the UCM achieved savings of around 20.5 million euros, approximately 6.6 million euros, which is accounted for by the regulatory effect. These savings will reproduce and accumulate annually over time. The results also show that, as a result of the intense negotiations, academic staff based at faculties engaged in the merger process may have taken more days of sick leave than academics from unmerged faculties in 2017, although the increase is not significant at standard levels.
本文旨在分析马德里康普顿斯大学(UCM)2017 年进行的大学院系合并的益处。合并后,原来的 184 个系减少到 97 个,形成了新的结构。为此,我们使用数据包络分析法(DEA)来评估合并过程的效率收益,将效率分解为三种节约效应:学习效应、和谐效应和规模效应。他们将效率分解为三种节约效应:学习效应、和谐效应和规模效应。此外,我们还引入了一种新的监管效应,它考虑了 DEA 分析中未包括的其他潜在递归节约效应。我们的研究结果表明,UCM 在合并过程中节省了约 2050 万欧元,其中约 660 万欧元来自监管效应。随着时间的推移,这些节余将逐年复制和积累。结果还显示,由于谈判激烈,2017 年参与合并进程的院系的学术人员可能比未合并院系的学术人员请了更多天病假,尽管在标准水平上这一增长并不显著。
{"title":"Is it worth it? Using DEA to analyze the efficiency gains and costs of merging university departments: a case study of the Complutense University of Madrid","authors":"Daniel Santín, Juan Tejada","doi":"10.1111/itor.13488","DOIUrl":"https://doi.org/10.1111/itor.13488","url":null,"abstract":"The aim of this paper is to analyze the benefits of the university department merger undertaken by the Complutense University of Madrid (UCM) in 2017. The merger led to a new structure in which the original 184 departments were reduced to 97. To do this, we use the data envelopment analysis (DEA) to evaluate the efficiency gains of a merger process decomposing efficiency into three savings effects: learning, harmony, and scale effects. They decomposed efficiency into three savings effects: learning, harmony, and scale effects. Additionally, we introduce a new regulatory effect, which accounts for other potential recursive savings not included in the DEA analysis. Our results suggest that the merger process undertaken by the UCM achieved savings of around 20.5 million euros, approximately 6.6 million euros, which is accounted for by the regulatory effect. These savings will reproduce and accumulate annually over time. The results also show that, as a result of the intense negotiations, academic staff based at faculties engaged in the merger process may have taken more days of sick leave than academics from unmerged faculties in 2017, although the increase is not significant at standard levels.","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"101 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141189354","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
Robust optimization model for relief supplies distribution considering fairness 考虑公平性的救灾物资分配鲁棒优化模型
IF 3.1 4区 管理学 Q2 MANAGEMENT Pub Date : 2024-05-28 DOI: 10.1111/itor.13486
Yingzhen Chen
The emergency management agency (EMA) needs to distribute limited relief supplies efficiently. However, it is difficult to develop a reliable system for relief supplies distribution owing to the uncertainties in emergencies. This paper investigates a robust multiperiod relief supplies distribution problem that considers the uncertainties of transportation time, the amount of donation amount, and the secondary disasters. First, a satisfaction model is constructed by considering the relief supplies and the transportation time. The negative effect of the delay in transportation time is considered in the satisfaction model. Second, based on the satisfaction model, a comprehensive fairness strategy is constructed that considers both vertical fairness and horizontal fairness. Finally, a relief supplies distribution model is built for the EMA that considers the actions of the non‐governmental organization (NGO) and donors. Both the utility and the fairness are considered in the objective of the proposed model. In numerical experiments, the Wenchuan earthquake is conducted to illustrate the applicability of the model and provide implications for decision‐makers. The results show the benefits of considering both vertical fairness and horizontal fairness. Then the suitable threshold is given by the analysis of the time delay. Finally, managerial insights and recommendations for the EMA and the NGO derived from the numerical experiments are presented. The findings in this paper help improve the reliability of the relief supplies distribution system.
应急管理机构(EMA)需要有效地分发有限的救援物资。然而,由于紧急情况下的不确定性,很难开发出可靠的救援物资分配系统。本文研究了一个稳健的多周期救援物资分配问题,该问题考虑了运输时间、捐赠金额和次生灾害等不确定性因素。首先,通过考虑救灾物资和运输时间构建了一个满意度模型。满意度模型考虑了运输时间延迟的负面影响。其次,在满意度模型的基础上,考虑纵向公平和横向公平,构建综合公平策略。最后,为 EMA 建立了一个救灾物资分配模型,该模型考虑了非政府组织(NGO)和捐助者的行动。该模型的目标同时考虑了效用和公平性。在数值实验中,通过汶川地震来说明模型的适用性,并为决策者提供启示。结果显示了同时考虑纵向公平性和横向公平性的好处。然后,通过对时间延迟的分析,给出了合适的阈值。最后,本文介绍了从数值实验中得出的对 EMA 和非政府组织的管理启示和建议。本文的研究结果有助于提高救援物资分发系统的可靠性。
{"title":"Robust optimization model for relief supplies distribution considering fairness","authors":"Yingzhen Chen","doi":"10.1111/itor.13486","DOIUrl":"https://doi.org/10.1111/itor.13486","url":null,"abstract":"The emergency management agency (EMA) needs to distribute limited relief supplies efficiently. However, it is difficult to develop a reliable system for relief supplies distribution owing to the uncertainties in emergencies. This paper investigates a robust multiperiod relief supplies distribution problem that considers the uncertainties of transportation time, the amount of donation amount, and the secondary disasters. First, a satisfaction model is constructed by considering the relief supplies and the transportation time. The negative effect of the delay in transportation time is considered in the satisfaction model. Second, based on the satisfaction model, a comprehensive fairness strategy is constructed that considers both vertical fairness and horizontal fairness. Finally, a relief supplies distribution model is built for the EMA that considers the actions of the non‐governmental organization (NGO) and donors. Both the utility and the fairness are considered in the objective of the proposed model. In numerical experiments, the Wenchuan earthquake is conducted to illustrate the applicability of the model and provide implications for decision‐makers. The results show the benefits of considering both vertical fairness and horizontal fairness. Then the suitable threshold is given by the analysis of the time delay. Finally, managerial insights and recommendations for the EMA and the NGO derived from the numerical experiments are presented. The findings in this paper help improve the reliability of the relief supplies distribution system.","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"77 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141189374","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
A tutorial on solving single‐leader‐multi‐follower problems using SOS1 reformulations 使用 SOS1 重构法解决单领导多追随者问题教程
IF 3.1 4区 管理学 Q2 MANAGEMENT Pub Date : 2024-05-26 DOI: 10.1111/itor.13466
Didier Aussel, Cécile Egea, Martin Schmidt
In this tutorial, we consider single‐leader‐multi‐follower games in which the models of the lower‐level players have polyhedral feasible sets and convex objective functions. This situation allows for classic Karush–Kuhn–Tucker reformulations of the separate lower‐level problems, which lead to challenging single‐level reformulations of Mathematical Programing with Complementarity Constraints (MPCC) type. The main contribution of this tutorial is to present a ready‐to‐use reformulation of this MPCC using special‐ordered‐sets of type 1 (SOS1) conditions. These conditions are readily available in all modern mixed‐integer linear optimization solvers that solve the single‐leader‐multi‐follower problem to optimality. After formally stating the problem class under consideration as well as deriving its reformulations, we present explicit Python code that shows how these techniques can be realized using the solver Gurobi. Finally, we also show the effect of the SOS1‐based reformulation using the real‐world example of industrial eco‐park modeling.
在本教程中,我们考虑了单领导多追随者博弈,其中下层博弈者的模型具有多面体可行集和凸目标函数。在这种情况下,我们可以对独立的下层问题进行经典的卡鲁什-库恩-塔克(Karush-Kuhn-Tucker)重拟,从而实现具有互补约束的数学编程(MPCC)类型的单层重拟。本教程的主要贡献在于利用特殊有序集合类型 1 (SOS1) 条件,提出了一种即用型 MPCC 重构方法。这些条件在所有现代混合整数线性优化求解器中都很容易找到,这些求解器可以最优地求解单引导者-多引导者问题。在正式说明所考虑的问题类别并推导出其重构之后,我们给出了明确的 Python 代码,展示了如何使用求解器 Gurobi 实现这些技术。最后,我们还利用工业生态园建模的实际例子,展示了基于 SOS1 的重构的效果。
{"title":"A tutorial on solving single‐leader‐multi‐follower problems using SOS1 reformulations","authors":"Didier Aussel, Cécile Egea, Martin Schmidt","doi":"10.1111/itor.13466","DOIUrl":"https://doi.org/10.1111/itor.13466","url":null,"abstract":"In this tutorial, we consider single‐leader‐multi‐follower games in which the models of the lower‐level players have polyhedral feasible sets and convex objective functions. This situation allows for classic Karush–Kuhn–Tucker reformulations of the separate lower‐level problems, which lead to challenging single‐level reformulations of Mathematical Programing with Complementarity Constraints (MPCC) type. The main contribution of this tutorial is to present a ready‐to‐use reformulation of this MPCC using special‐ordered‐sets of type 1 (SOS1) conditions. These conditions are readily available in all modern mixed‐integer linear optimization solvers that solve the single‐leader‐multi‐follower problem to optimality. After formally stating the problem class under consideration as well as deriving its reformulations, we present explicit <jats:styled-content>Python</jats:styled-content> code that shows how these techniques can be realized using the solver <jats:styled-content>Gurobi</jats:styled-content>. Finally, we also show the effect of the SOS1‐based reformulation using the real‐world example of industrial eco‐park modeling.","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"45 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141146864","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
Blockchain adoption strategy in a platform dual-channel supply chain with risk-averse sellers 在有风险规避型卖家的平台双渠道供应链中采用区块链的策略
IF 3.1 4区 管理学 Q2 MANAGEMENT Pub Date : 2024-05-21 DOI: 10.1111/itor.13474
Huimin Zhang, Zhenkai Lou, Fujun Hou, Yan Yan

This paper investigates blockchain technology (BT) adoption strategy in a platform dual-channel supply chain, wherein the supplier establishes a direct selling channel (DC) in addition to the existing reselling channel (RC) of the e-retailer. Both the supplier and the e-retailer are risk-averse, and they have access to consumers through a common online platform. The online platform possesses the capability to introduce BT and can opt to introduce it to neither, one (DC or RC) or both channels. Game models for the four strategies are developed, and the corresponding equilibrium outcomes are obtained using backward induction. Our analysis reveals that when competition intensity is high and both perceived risk aversion level and BT's unit cost are low, the online platform prefers only DC with adopting BT. Otherwise, it prefers both channels with adopting BT. The supplier shares the same preference as the online platform for BT adoption strategy. Interestingly, the e-retailer prefers only DC with adopting BT only when BT's unit cost is high; otherwise, she prefers solely RC with adopting BT. Furthermore, we enhance the basic model by modifying parameter configurations and the sequence game, and verify that our main findings in these extensions remain robust.

本文研究了在平台双渠道供应链中采用区块链技术(BT)的策略,即供应商在电子零售商现有转售渠道(RC)之外建立一个直销渠道(DC)。供应商和电子零售商都是风险规避者,他们通过一个共同的在线平台接触消费者。网络平台拥有引入 BT 的能力,可以选择在两个渠道中都不引入 BT,也可以选择在一个渠道(DC 或 RC)或两个渠道都引入 BT。我们建立了四种策略的博弈模型,并通过逆向归纳法得到了相应的均衡结果。我们的分析表明,当竞争强度高、感知风险规避水平和 BT 单位成本都较低时,在线平台只倾向于在 DC 采用 BT。否则,在线平台会同时偏好采用 BT 和 DC 两种渠道。在采用 BT 战略方面,供应商与网络平台的偏好相同。有趣的是,只有当 BT 的单位成本较高时,网络零售商才会在采用 BT 的同时只选择 DC;否则,她会在采用 BT 的同时只选择 RC。此外,我们还通过修改参数配置和序列博弈增强了基本模型,并验证了我们在这些扩展中的主要发现仍然稳健。
{"title":"Blockchain adoption strategy in a platform dual-channel supply chain with risk-averse sellers","authors":"Huimin Zhang,&nbsp;Zhenkai Lou,&nbsp;Fujun Hou,&nbsp;Yan Yan","doi":"10.1111/itor.13474","DOIUrl":"10.1111/itor.13474","url":null,"abstract":"<p>This paper investigates blockchain technology (BT) adoption strategy in a platform dual-channel supply chain, wherein the supplier establishes a direct selling channel (DC) in addition to the existing reselling channel (RC) of the e-retailer. Both the supplier and the e-retailer are risk-averse, and they have access to consumers through a common online platform. The online platform possesses the capability to introduce BT and can opt to introduce it to neither, one (DC or RC) or both channels. Game models for the four strategies are developed, and the corresponding equilibrium outcomes are obtained using backward induction. Our analysis reveals that when competition intensity is high and both perceived risk aversion level and BT's unit cost are low, the online platform prefers only DC with adopting BT. Otherwise, it prefers both channels with adopting BT. The supplier shares the same preference as the online platform for BT adoption strategy. Interestingly, the e-retailer prefers only DC with adopting BT only when BT's unit cost is high; otherwise, she prefers solely RC with adopting BT. Furthermore, we enhance the basic model by modifying parameter configurations and the sequence game, and verify that our main findings in these extensions remain robust.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"31 6","pages":"4199-4228"},"PeriodicalIF":3.1,"publicationDate":"2024-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141116564","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
Optimal emergency hospitals construction in an unexpected epidemic with considering the interactive effect 突发疫情中考虑互动效应的最佳急救医院建设
IF 3.1 4区 管理学 Q2 MANAGEMENT Pub Date : 2024-05-18 DOI: 10.1111/itor.13473
Ming Liu, Xiaoxiao Zhu
Constructing emergency hospitals is one of the most critical measures to defeat an unexpected epidemic. However, existing operations research (OR) studies rarely consider the interactive effect between the construction of emergency hospitals and the dynamics of epidemic transmission. Inspired by this gap, we propose a new modeling framework for decision‐making in emergency hospital construction. In our optimization model, we address the pandemic evolution functions as constraints. We also consider the heterogeneity among infected individuals, distinguishing between those with mild and severe symptoms, each requiring treatment in different types of emergency hospitals. We formulate the problem as a mixed integer nonlinear programming model. Our model can envision the current and future evolution of the epidemic and the impact of different decisions regarding emergency hospital construction on epidemic development. Simultaneously, it provides the optimal strategy to build hospitals and minimize the total number of untreated patients due to the disease. The proposed model is tested using the Covid‐19 outbreak case in Wuhan. The results can provide precise guidelines for emergency hospitals construction, including timing and capacity, and offer decision boundaries for policymakers considering the uncertainty of disease transmission. Furthermore, our decision‐making framework is general and can be adapted to study other epidemics.
建设急救医院是战胜突发疫情的最关键措施之一。然而,现有的运筹学(OR)研究很少考虑应急医院建设与疫情传播动态之间的互动效应。受这一空白的启发,我们提出了一个新的急救医院建设决策模型框架。在我们的优化模型中,我们将流行病演变函数作为约束条件。我们还考虑了感染者之间的异质性,区分了症状轻微和严重的感染者,每种感染者都需要在不同类型的急诊医院接受治疗。我们将问题表述为一个混合整数非线性编程模型。我们的模型可以预测疫情当前和未来的发展情况,以及建设急诊医院的不同决策对疫情发展的影响。同时,它还提供了建设医院的最佳策略,并最大限度地减少因疾病而未得到治疗的病人总数。提出的模型通过武汉 Covid-19 疫情案例进行了检验。结果可为急救医院的建设(包括时间和容量)提供精确的指导,并为考虑到疾病传播的不确定性的决策者提供决策边界。此外,我们的决策框架具有通用性,可用于研究其他流行病。
{"title":"Optimal emergency hospitals construction in an unexpected epidemic with considering the interactive effect","authors":"Ming Liu, Xiaoxiao Zhu","doi":"10.1111/itor.13473","DOIUrl":"https://doi.org/10.1111/itor.13473","url":null,"abstract":"Constructing emergency hospitals is one of the most critical measures to defeat an unexpected epidemic. However, existing operations research (OR) studies rarely consider the interactive effect between the construction of emergency hospitals and the dynamics of epidemic transmission. Inspired by this gap, we propose a new modeling framework for decision‐making in emergency hospital construction. In our optimization model, we address the pandemic evolution functions as constraints. We also consider the heterogeneity among infected individuals, distinguishing between those with mild and severe symptoms, each requiring treatment in different types of emergency hospitals. We formulate the problem as a mixed integer nonlinear programming model. Our model can envision the current and future evolution of the epidemic and the impact of different decisions regarding emergency hospital construction on epidemic development. Simultaneously, it provides the optimal strategy to build hospitals and minimize the total number of untreated patients due to the disease. The proposed model is tested using the Covid‐19 outbreak case in Wuhan. The results can provide precise guidelines for emergency hospitals construction, including timing and capacity, and offer decision boundaries for policymakers considering the uncertainty of disease transmission. Furthermore, our decision‐making framework is general and can be adapted to study other epidemics.","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"2011 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141063134","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
A probabilistic bi-objective model for a humanitarian location-routing problem under uncertain demand and road closure 不确定需求和道路封闭条件下的人道救援选址问题概率双目标模型
IF 3.1 4区 管理学 Q2 MANAGEMENT Pub Date : 2024-05-16 DOI: 10.1111/itor.13475
Sedanur Temiz, Hande Cansın Kazanç, Mehmet Soysal, Mustafa Çimen

Effective planning and execution of humanitarian aid logistics activities ensure that disaster-related losses are minimized. This study addresses a tactical-level pre-disaster humanitarian logistics problem where a decision-maker decides on cross-dock locations by taking potential vehicle routes into account. A decision support model is proposed for the location selection and distribution operations in humanitarian logistics with explicit fuel consumption estimation. In the addressed problem, the demand amount of each node depends on probabilistic disaster scenarios. Probabilities of whether each arc/road is open or closed and heterogeneous vehicle fleet in terms of vehicle sizes are also respected. The model is formulated as probabilistic bi-objective mixed integer linear programming, whose objectives are minimization of the total cost (i.e., fuel cost, vehicle fixed cost, and fixed opening cost) and total travel time. To the best of our knowledge, the proposed decision support model is unique in terms of the features considered simultaneously. The applicability of the model is demonstrated by the case study and subsequent numerical analyses of a possible earthquake in the Kartal district of Istanbul. The proposed model is shown to have the potential to support decision-makers in preparation for a disaster. A solution approach based on a clustering algorithm has been also proposed to solve larger instances of the problem. The effectiveness of this heuristic has been demonstrated through its application to larger-scale problems.

有效规划和执行人道主义援助物流活动可确保将与灾害有关的损失降至最低。本研究探讨了一个战术层面的灾前人道主义物流问题,即决策者通过考虑潜在的车辆行驶路线来决定交叉停靠地点。针对人道主义物流中的地点选择和配送操作,提出了一个具有明确燃料消耗估算的决策支持模型。在所解决的问题中,每个节点的需求量取决于概率灾难情景。每个弧线/道路是开放还是封闭的概率以及车辆大小方面的异质车队也受到尊重。该模型被表述为概率双目标混合整数线性规划,其目标是总成本(即燃料成本、车辆固定成本和固定开放成本)和总旅行时间的最小化。据我们所知,就同时考虑的特征而言,所提出的决策支持模型是独一无二的。伊斯坦布尔卡尔塔尔区可能发生地震的案例研究和随后的数值分析证明了该模型的适用性。结果表明,所提出的模型具有支持决策者做好灾难准备的潜力。此外,还提出了一种基于聚类算法的解决方法,以解决更大的问题实例。这一启发式方法在更大规模问题上的应用证明了其有效性。
{"title":"A probabilistic bi-objective model for a humanitarian location-routing problem under uncertain demand and road closure","authors":"Sedanur Temiz,&nbsp;Hande Cansın Kazanç,&nbsp;Mehmet Soysal,&nbsp;Mustafa Çimen","doi":"10.1111/itor.13475","DOIUrl":"10.1111/itor.13475","url":null,"abstract":"<p>Effective planning and execution of humanitarian aid logistics activities ensure that disaster-related losses are minimized. This study addresses a tactical-level pre-disaster humanitarian logistics problem where a decision-maker decides on cross-dock locations by taking potential vehicle routes into account. A decision support model is proposed for the location selection and distribution operations in humanitarian logistics with explicit fuel consumption estimation. In the addressed problem, the demand amount of each node depends on probabilistic disaster scenarios. Probabilities of whether each arc/road is open or closed and heterogeneous vehicle fleet in terms of vehicle sizes are also respected. The model is formulated as probabilistic bi-objective mixed integer linear programming, whose objectives are minimization of the total cost (i.e., fuel cost, vehicle fixed cost, and fixed opening cost) and total travel time. To the best of our knowledge, the proposed decision support model is unique in terms of the features considered simultaneously. The applicability of the model is demonstrated by the case study and subsequent numerical analyses of a possible earthquake in the Kartal district of Istanbul. The proposed model is shown to have the potential to support decision-makers in preparation for a disaster. A solution approach based on a clustering algorithm has been also proposed to solve larger instances of the problem. The effectiveness of this heuristic has been demonstrated through its application to larger-scale problems.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 2","pages":"590-625"},"PeriodicalIF":3.1,"publicationDate":"2024-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.13475","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140971521","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Drone scheduling in a hexagon‐based delivery network with multiple fulfillment centers 在具有多个配送中心的六边形配送网络中进行无人机调度
IF 3.1 4区 管理学 Q2 MANAGEMENT Pub Date : 2024-05-13 DOI: 10.1111/itor.13476
Chuang Liu, Huaping Chen, Xueping Li, Shengchao Zhou, Zhaohong Jia
As an emerging technology, drones have great potential in small parcel delivery, reducing operational costs, and improving efficiency. However, battery technologies restrict the endurance of drones. Inspired by the cellular networks used in mobile communications, a hexagon‐based delivery network (HBDN) is proposed to overcome such restrictions. Battery‐swapping stations are incorporated into the HBDN to expand the delivery service range of drones. Based on the proposed HBDN, the multidrone scheduling problem in multiple fulfillment centers (FCs) is addressed. The objective is to minimize the makespan. A mixed‐integer programming model is constructed for the problem. A memetic algorithm with hill climbing (MAHC) is developed to address the problem. A strategy is proposed to prevent inbreeding in the crossover procedure. A local search based on hill climbing is combined with the mutation operation. A lower bound of the problem is proposed to measure the performance of MAHC. Furthermore, load balancing and nearest‐priority strategies are proposed to select FCs. Comparative experiments show that MAHC performs competitively in terms of running time and solution quality.
作为一项新兴技术,无人机在小包裹递送、降低运营成本和提高效率方面具有巨大潜力。然而,电池技术限制了无人机的续航能力。受移动通信中使用的蜂窝网络的启发,我们提出了一种基于六边形的递送网络(HBDN)来克服这些限制。电池交换站被纳入 HBDN,以扩大无人机的配送服务范围。基于所提出的 HBDN,解决了多个履行中心(FC)中的多无人机调度问题。该问题的目标是最大限度地减少时间跨度。为该问题构建了一个混合整数编程模型。开发了一种爬坡记忆算法(MAHC)来解决该问题。提出了一种在交叉过程中防止近亲繁殖的策略。基于爬坡的局部搜索与变异操作相结合。提出了问题的下限,以衡量 MAHC 的性能。此外,还提出了负载平衡和最近优先策略来选择 FC。对比实验表明,MAHC 在运行时间和解决方案质量方面都具有竞争力。
{"title":"Drone scheduling in a hexagon‐based delivery network with multiple fulfillment centers","authors":"Chuang Liu, Huaping Chen, Xueping Li, Shengchao Zhou, Zhaohong Jia","doi":"10.1111/itor.13476","DOIUrl":"https://doi.org/10.1111/itor.13476","url":null,"abstract":"As an emerging technology, drones have great potential in small parcel delivery, reducing operational costs, and improving efficiency. However, battery technologies restrict the endurance of drones. Inspired by the cellular networks used in mobile communications, a hexagon‐based delivery network (HBDN) is proposed to overcome such restrictions. Battery‐swapping stations are incorporated into the HBDN to expand the delivery service range of drones. Based on the proposed HBDN, the multidrone scheduling problem in multiple fulfillment centers (FCs) is addressed. The objective is to minimize the makespan. A mixed‐integer programming model is constructed for the problem. A memetic algorithm with hill climbing (MAHC) is developed to address the problem. A strategy is proposed to prevent inbreeding in the crossover procedure. A local search based on hill climbing is combined with the mutation operation. A lower bound of the problem is proposed to measure the performance of MAHC. Furthermore, load balancing and nearest‐priority strategies are proposed to select FCs. Comparative experiments show that MAHC performs competitively in terms of running time and solution quality.","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"11 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140925317","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
期刊
International Transactions in Operational Research
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1