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, Francesca Guerriero, 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}
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.
{"title":"The role of drones in disaster response: A literature review of operations research applications","authors":"Ecem Yucesoy, Burcu Balcik, 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}
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.
{"title":"Road network, landing location, and routing optimization for forest smallholders landscapes","authors":"Miguel F. Constantino, Marta Mesquita, Susete Marques, Sándor F. Tóth, 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}
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.
{"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}
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}
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.
{"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}
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.
{"title":"Blockchain adoption strategy in a platform dual-channel supply chain with risk-averse sellers","authors":"Huimin Zhang, Zhenkai Lou, Fujun Hou, 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}
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.
{"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}
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, Hande Cansın Kazanç, Mehmet Soysal, 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}
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.
{"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}