International Transactions in Operational Research最新文献

{"title":"A predictive multistage postdisaster damage assessment framework for drone routing","authors":"Birce Adsanver,&nbsp;Elvin Coban,&nbsp;Burcu Balcik","doi":"10.1111/itor.13429","DOIUrl":"10.1111/itor.13429","url":null,"abstract":"<p>This study focuses on postdisaster damage assessment operations supported by a set of drones. We propose a multistage framework, consisting of two phases applied iteratively to rapidly gather damage information within an assessment period. In the initial phase, the problem involves determining areas to be scanned by each drone and the optimal sequence for visiting these selected areas. We have adapted an electric vehicle routing formulation and devised a variable neighborhood descent heuristic for this phase. In the second phase, information collected from the scanned areas is employed to predict the damage status of the unscanned areas. We have introduced a novel, fast, and easily implementable imputation policy for this purpose. To evaluate the performance of our approach in real-life disasters, we develop a case study for the expected 7.5 magnitude earthquake in Istanbul, Turkey. Our numerical study demonstrates a significant improvement in response time and priority-based metrics.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 2","pages":"626-668"},"PeriodicalIF":3.1,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.13429","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139582140","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}

{"title":"Just-in-time scheduling problem with due windows and release dates for precast bridge girders","authors":"Gang Liu,&nbsp;Hongwei Wang,&nbsp;Yong Xie","doi":"10.1111/itor.13431","DOIUrl":"10.1111/itor.13431","url":null,"abstract":"<p>As the prefabrication construction method plays an increasingly important role in the construction of cross-sea bridges, coordinating the schedule between off-site prefabrication and on-site assembly becomes crucial and challenging. This paper studies a just-in-time single-machine scheduling problem with due windows and release dates, which originates from the production and supply process of large segments of precast steel box girders in bridge construction. To solve this problem, we equivalently decompose it into the independent and same type of subproblems and formulate a mixed-integer linear mathematical programming model. Furthermore, we propose a branch-and-bound algorithm with the initialization of a novel linear early and tardy dispatching rule with due windows to solve the problem exactly. The dispatching rule, based on the local dominance criteria with due windows, is designed and used to improve the upper bound. Moreover, a lower bound is obtained by further decomposing and relaxing the subproblems. Finally, the parameter of the dispatching rule is calibrated, and the best search strategy of the branch-and-bound algorithm is determined. The comprehensive computational experiments carried out show the efficiency and effectiveness of the proposed branch-and-bound algorithm.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"31 4","pages":"2366-2398"},"PeriodicalIF":3.1,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139582249","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}

{"title":"Fast or slow? Logistics way choices for perishable products under competition","authors":"Fang Fu, Mengying Pei, Wei Xing, Yongsheng Zhou","doi":"10.1111/itor.13433","DOIUrl":"https://doi.org/10.1111/itor.13433","url":null,"abstract":"This study investigates a logistics game where two competing shippers of perishable products may choose between fast and slow logistics ways. The fast logistics way allows a shipper to retain better delivered product quality, whereas the slow one provides a cost advantage. The two shippers sell high- and low-quality products, respectively. We find that the equilibria of the logistics game are determined by the initial qualities of the two products, the differences in the transportation times, and the unit logistics costs of the two logistics ways. Furthermore, a large difference in transportation times enables the high-quality shipper to select the fast logistics way but the low-quality shipper to choose the slow logistics. In this way, the high-quality shipper can benefit from the large difference in delivered product qualities, whereas the low-quality shipper alleviates the pressure of competition. By contrast, when the unit logistics cost of the fast logistics way is sufficiently high, a small difference in transportation times stimulates the high-quality shipper to use the slow logistics way but the low-quality shipper to adopt the fast logistics. The high-quality shipper may seek the benefit from an increase in demand, whereas the low-quality shipper should narrow the difference in delivered product qualities. Finally, we find that faster logistics or higher initial product quality is beneficial to the high-quality shipper, whereas slower logistics or lower initial product quality may be optimal for the low-quality shipper. These findings offer useful insights for managers to choose their logistics ways.","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"35 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139582250","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}

{"title":"Exact and heuristic solutions for the prize-collecting geometric enclosure problem","authors":"Natanael Ramos,&nbsp;Rafael G. Cano,&nbsp;Pedro J. de Rezende,&nbsp;Cid C. de Souza","doi":"10.1111/itor.13428","DOIUrl":"10.1111/itor.13428","url":null,"abstract":"<p>In the <i>prize-collecting geometric enclosure problem</i> (<span>PCGEP</span>), a set <math>\u0000 <semantics>\u0000 <mi>S</mi>\u0000 <annotation>$S$</annotation>\u0000 </semantics></math> of points in the plane is given, each with an associated <i>benefit</i>. The goal is to find a simple polygon <math>\u0000 <semantics>\u0000 <mi>P</mi>\u0000 <annotation>$mathcal {P}$</annotation>\u0000 </semantics></math> with vertices in <math>\u0000 <semantics>\u0000 <mi>S</mi>\u0000 <annotation>$S$</annotation>\u0000 </semantics></math> that maximizes the sum of the benefits of the points of <math>\u0000 <semantics>\u0000 <mi>S</mi>\u0000 <annotation>$S$</annotation>\u0000 </semantics></math> enclosed by <math>\u0000 <semantics>\u0000 <mi>P</mi>\u0000 <annotation>$mathcal {P}$</annotation>\u0000 </semantics></math> minus the perimeter of <math>\u0000 <semantics>\u0000 <mi>P</mi>\u0000 <annotation>$mathcal {P}$</annotation>\u0000 </semantics></math> multiplied by a given nonnegative cost. The <span>PCGEP</span> is <span>NP</span>-complete and has applications to land surveying for exploration or preservation of natural resources. In this paper, we develop the first heuristic, called <span>PCGEP-GR</span>, for the <span>PCGEP</span> and revisit a previously proposed integer linear programming (ILP) model to solve it to optimality. We conducted a comprehensive experimental study of that heuristic and an exact algorithm based on the ILP model. We show that a new set of constraints, together with the previous set, is necessary to guarantee the correctness of the ILP model and introduce preprocessing strategies that allow us to prove optimality 40% faster on average. The proposed heuristic is able to reach the optimum in 32% of our benchmark instances and, for those with unknown optima, <span>PCGEP-GR</span> was found better than or at least as good solutions as the ones obtained by the <span>cplex</span> ILP solver in 54% of the cases. Notwithstanding these positive results, the design of effective heuristics for the <span>PCGEP</span> proved to be very challenging, which also led us to obtain a result that provides the theoretical foundation for future advances in the study of this problem.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"31 4","pages":"2093-2122"},"PeriodicalIF":3.1,"publicationDate":"2024-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139460669","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}

{"title":"The rich heterogeneous dial-a-ride problem with trip time prediction","authors":"Laura Portell,&nbsp;Helena Ramalhinho","doi":"10.1111/itor.13415","DOIUrl":"10.1111/itor.13415","url":null,"abstract":"<p>The dial-a-ride problem (DARP) involves designing vehicle routes to fulfill the door-to-door transportation requests of users where the goal is to minimize costs while satisfying transportation requests. In this paper, we introduce the rich heterogeneous DARP, which extends the generalized heterogeneous DARP to consider a fleet of buses and taxis, multiple depots, time windows at pickup and delivery locations, maximum ride and waiting times, and the possibility of an accompanying person. Our approach is based on a real service in Barcelona, and we also consider the variation in trip duration based on the time of day and day of the week. A predictive model is developed using machine learning techniques to estimate trip durations accurately. We apply our proposal to the daily door-to-door transportation of people with reduced mobility in Barcelona and demonstrate its superiority in terms of costs and quality of service by using the Gurobi optimizer. Additionally, we provide an analysis of the consequences of varying certain features on the costs and quality of service.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 2","pages":"692-718"},"PeriodicalIF":3.1,"publicationDate":"2024-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.13415","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139410575","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}

{"title":"A scenario-based requirement analysis of R&D projects from the cross-efficiency perspective","authors":"Qinru Wang, Qing Yang","doi":"10.1111/itor.13427","DOIUrl":"https://doi.org/10.1111/itor.13427","url":null,"abstract":"Research and development (R&amp;D) project requirements have relationships with scenarios, scenario-based events and other factors, while traditional research does not always include quantitative analysis. Our research proposes a new method for prioritising scenario-based requirements within R&amp;D projects based on scenario analysis and cross-efficiency. First, we decompose the scenarios and apply the design structure matrix to demonstrate the inside dependencies. Second, the multi-domain matrix (MDM) is used to establish a model for the dependencies between scenario-based requirements based on scenarios and scenario-based events and the complex network is used to measure the degree centrality between the scenario-based requirements. Third, the data envelopment analysis is utilised in the integrated cross-efficiency model, including self-efficiency and peer efficiency, to evaluate scenario-based requirements' economic benefits and resource utilisation. Finally, dependencies among scenario-based requirements for product R&amp;D projects within company A are derived and ranked, indicating the model's validity.","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"26 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139376090","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}

{"title":"Advance selling strategy and pricing decisions with online reviews","authors":"Ming-Zhao Tang, Tian-Hui You, Bing-Bing Cao","doi":"10.1111/itor.13425","DOIUrl":"https://doi.org/10.1111/itor.13425","url":null,"abstract":"Motivated by marketing practices in advance selling, this paper studies the optimal pricing decisions and advance selling strategy with online reviews. The firm may charge a full or partial price in advance selling and then determine whether to continue selling products in the spot market. We characterize the equilibrium pricing decisions, selling scheme, and advance selling strategy in the monopoly market. We find that no matter what kind of advance selling strategy is implemented, the firm should choose the two-period selling scheme instead of the one-period one to market the product. Notably, when the two-period selling scheme is chosen, either the skimming pricing or the penetration pricing may be optimal for the firm. Specifically, when the review valence is significantly lower, the skimming pricing is always favored by the firm; otherwise, the penetration pricing is more profitable. Moreover, the disclosure quality and review valence jointly affect the choice of firm's optimal advance selling strategy. In detail, advance selling with a full-price strategy is always dominant if the disclosure quality is high; otherwise, the firm's optimal advance selling strategy is determined by the review valence. Meanwhile, we also analyze several extensions to explore meaningful insights and provide decision-making support for the firm facing a complex marketing environment.","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"41 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139376229","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}

{"title":"Assessing social performance in supply chain design and planning through a monetization approach","authors":"Cátia da Silva,&nbsp;Ana Barbosa-Póvoa,&nbsp;Ana Carvalho","doi":"10.1111/itor.13419","DOIUrl":"10.1111/itor.13419","url":null,"abstract":"<p>Sustainable development is today a major concern, and within this supply chain’ environmental and social performances need to be considered. The social pillar of the supply chain is not easy to measure, and its quantification is a researcher's challenge. In addition, quantifying the social impact of a monetary unit, easily understood by decision-makers, is an important step towards achieving global sustainable supply chain performance. This work intends to contribute to this challenge and develops a monetization approach for assessing supply chain's social performance, considering three main relevant social indicators: job creation, accidents and training.  These are then integrated into an optimization-based decision tool that can be used to design and plan a supply chain based on an informed decision. This operation research–based tool considers the economic and the social pillars independently or simultaneously, allowing the development of different analyses to reflect on the different trade-offs that could be considered when designing and planning sustainable supply chains. A case study is utilized to demonstrate the tool's applicability, and a number of conclusions and insights are provided on how to strengthen supply chain sustainability.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 2","pages":"802-838"},"PeriodicalIF":3.1,"publicationDate":"2023-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.13419","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139078468","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}

{"title":"New advances for quantum-inspired optimization","authors":"Yu Du,&nbsp;Haibo Wang,&nbsp;Rick Hennig,&nbsp;Amit Hulandageri,&nbsp;Gary Kochenberger,&nbsp;Fred Glover","doi":"10.1111/itor.13420","DOIUrl":"10.1111/itor.13420","url":null,"abstract":"<p>Advances in quantum computing with applications in combinatorial optimization have evolved at an increasing rate in recent years. The quadratic unconstrained binary optimization (QUBO) model is at the center of these developments and has become recognized as an effective alternative method for representing a wide variety of combinatorial optimization problems. Additional momentum has resulted from the arrival of quantum computers and their ability to solve the Ising spin glass problem, another form of the QUBO model. This paper highlights advances in solving QUBO models and extensions to more general polynomial unconstrained binary optimization (PUBO) models as important alternatives to traditional approaches. Computational experience is provided that compares the performance of unique quantum-inspired metaheuristic solvers—the Next Generation Quantum (NGQ) solver for QUBO models and the NGQ-PUBO solver for PUBO models—with the performance of CPLEX and the Dwave quantum advantage solver. Extensive results, including experiments with a set of large set partitioning problems representing the largest QUBO models reported in the literature to date, along with maximum diversity and max cut problem sets, disclose that our solvers outperform both CPLEX and Dwave by a wide margin in terms of both computational time and solution quality.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 1","pages":"6-17"},"PeriodicalIF":3.1,"publicationDate":"2023-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.13420","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139056172","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}

{"title":"Scheduling-location problem with drones","authors":"Dongwook Kim,&nbsp;Ilkyeong Moon","doi":"10.1111/itor.13423","DOIUrl":"10.1111/itor.13423","url":null,"abstract":"<p>Drone operation, a new driving force for logistics innovation, is struggling to overcome practical challenges. One of the concerns for drone utilization is limited flight ranges, and different concepts of facilities are continually developed to support drone delivery. These new facilities prompt the need to integrate decision-making across different phases. In particular, the deployment of facilities that complement the physical limitations of drones and the scheduling of drones to perform delivery tasks are closely related. Therefore, we developed a scheduling-location problem with drones, a new methodology for integrating operational and strategic planning decisions. The integrated decision-making determines the location of the drone facilities by not only considering the critical distance of facilities but also by taking into account whether the delivery schedule is implemented. In our model, additional drone facilities are sometimes opened considering available drones due to the feasibility of the delivery schedule. An extended formulation and a restricted master heuristic are proposed to solve problems time-efficiently. Computational results show that the restricted master heuristic outperforms the mathematical model in finding solutions for large-scale instances. The developed model and heuristic algorithm provide drone delivery services even in areas that are not easily reachable by drones due to being located far from the warehouse and can be effectively applied to humanitarian logistics.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"31 5","pages":"2850-2874"},"PeriodicalIF":3.1,"publicationDate":"2023-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139056205","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}