International Transactions in Operational Research最新文献

{"title":"A tutorial on solving single-leader-multi-follower problems using SOS1 reformulations","authors":"Didier Aussel,&nbsp;Cécile Egea,&nbsp;Martin Schmidt","doi":"10.1111/itor.13466","DOIUrl":"10.1111/itor.13466","url":null,"abstract":"<p>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 <span>Python</span> code that shows how these techniques can be realized using the solver <span>Gurobi</span>. Finally, we also show the effect of the SOS1-based reformulation using the real-world example of industrial eco-park modeling.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 3","pages":"1227-1250"},"PeriodicalIF":3.1,"publicationDate":"2024-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.13466","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141146864","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":"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}

{"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}

{"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}

{"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}

{"title":"Combining convolution neural networks with long-short term memory layers to predict Parkinson's disease progression","authors":"Maria Frasca,&nbsp;Davide La Torre,&nbsp;Gabriella Pravettoni,&nbsp;Ilaria Cutica","doi":"10.1111/itor.13469","DOIUrl":"10.1111/itor.13469","url":null,"abstract":"<p>Parkinson's disease (PD) is a neurological condition that occurs in nearly 1% of the world's population. The disease is manifested by a sharp drop in dopamine production, resulting from the death of the related producing cells in an area of the midbrain called the substantia nigra. Early diagnosis and accurate staging of the disease are essential to apply the appropriate therapeutic approaches to slow cognitive and motor decline. At present, there is not a singular blood test or biomarker accessible for diagnosing PD or monitoring the progression of its symptoms. Clinical professionals identify the disease by assessing the symptoms, which, however, may vary from case to case, as well as their progression speed. Magnetic resonance imaging (MRIs) have been used for the past three decades to diagnose and distinguish between PD and other neurological conditions.</p><p>However, to the best of our knowledge, no neural network models have been designed to identify the disease stage. This paper aims to fill this gap. Using the “Parkinson's Progression Markers Initiative” dataset, which reports the patient's MRI and an indication of the disease stage, we developed a model to identify the level of progression. The images and the associated scores were used for training and assessing different deep learning models. Our analysis distinguished four distinct disease progression levels based on a standard scale (Hoehn and Yah scale). The final architecture consists of the cascading of a 3D-CNN network, adopted to reduce and extract the spatial characteristics of the MRI for efficient training of the successive LSTM layers, aiming at modeling the temporal dependencies among the data. Before training the model, the patient's MRI is preprocessed to correct acquisition errors by applying image registration techniques, to extract irrelevant content from the image, such as nonbrain tissue (e.g., skull, neck, fat). We also adopted template-based data augmentation techniques to obtain a balanced dataset about progression classes. Our results show that the proposed 3D-CNN + LSTM model achieves state-of-the-art results by classifying the elements with 91.90 as macro averaged OVR AUC on four classes.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 4","pages":"2159-2188"},"PeriodicalIF":3.1,"publicationDate":"2024-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140996211","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":"Second-order cone programming models for the unitary weighted Weber problem and for the minimum sum of the squares clustering problem","authors":"Marcella Braga de Assis Linhares,&nbsp;Renan Vicente Pinto,&nbsp;Nelson Maculan,&nbsp;Marcos Negreiros","doi":"10.1111/itor.13472","DOIUrl":"10.1111/itor.13472","url":null,"abstract":"<p>In this work, new mixed integer nonlinear optimization models are proposed for two clustering problems: the unitary weighted Weber problem and the minimum sum of squares clustering. The proposed formulations are convex quadratic models with linear and second-order cone constraints that can be efficiently solved by interior point algorithms. Their continuous relaxation is convex and differentiable. The numerical experiments show the proposed models are more efficient than some classical models for these problems known in the literature.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 2","pages":"961-972"},"PeriodicalIF":3.1,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140839127","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":"Comparing QUBO models for quantum annealing: integer encodings for permutation problems","authors":"Philippe Codognet","doi":"10.1111/itor.13471","DOIUrl":"10.1111/itor.13471","url":null,"abstract":"<p>QUBO (quadratic unconstrained binary optimization) has become the modeling language for quantum annealing and quantum-inspired annealing solvers. We present different approaches in QUBO for the magic square problem and the quadratic assignment problem (QAP), which can be modeled by linear equations and a permutation constraint over integer variables. Different ways of encoding integers by Booleans in QUBO amount to models, the implementation of which could have very different performance. Experiments performed on the Fixstars Amplify Annealer Engine, a quantum-inspired annealing solver, show that, compared to the classical one-hot encoding, using unary encoding for integers performs slightly better for the QAP and much better for magic square.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 1","pages":"18-37"},"PeriodicalIF":3.1,"publicationDate":"2024-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.13471","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140839124","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":"Special Issue on “Sharing Platforms for Sustainability: Exploring Strategies, Trade-offs, and Applications”","authors":"","doi":"10.1111/itor.13455","DOIUrl":"https://doi.org/10.1111/itor.13455","url":null,"abstract":"","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"31 5","pages":"3557-3558"},"PeriodicalIF":3.1,"publicationDate":"2024-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140808030","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":"Special issue on “Managing supply chain resilience in the digital economy era”","authors":"","doi":"10.1111/itor.13464","DOIUrl":"https://doi.org/10.1111/itor.13464","url":null,"abstract":"","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"31 5","pages":"3555-3556"},"PeriodicalIF":3.1,"publicationDate":"2024-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140808029","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}