International Transactions in Operational Research最新文献

{"title":"Information sharing in a dual channel with an agency-selling platform","authors":"Wei Xing,&nbsp;Qi Sun,&nbsp;Fang Fu,&nbsp;Yongsheng Zhou","doi":"10.1111/itor.70089","DOIUrl":"https://doi.org/10.1111/itor.70089","url":null,"abstract":"<p>The dual-channel sales based on an agency-selling platform and a physical retailer have been one of the most common supply chain structures for a variety of consumer products. This paper studies the information sharing decisions of an agency-selling platform and a physical retailer in a dual-channel supply chain where a supplier sells a product through these two channels. We find that the commission rate and channel competition intensity play an important role in determining the equilibrium sharing decisions. In particular, a large commission rate prevents the platform from sharing information with the supplier because the platform is worried that the shared information will be used by the supplier to optimize retail sales and thus cause the demand transfer from the platform to the retailer. By contrast, a large competition intensity forces the retailer to share information to seek a strong responsiveness of the retail price to updated demand. Interestingly, both the platform and the retailer may encounter a prisoner's dilemma and the undesirable “lose-lose” outcome could potentially be mitigated if the platform reduces its information accuracy. Moreover, the supplier's decision to buy information will make all three players more profitable when it cannot obtain information for free. This research highlights how equilibrium information sharing decisions are affected by the interaction between the platform's agency-selling mode and the wholesale price contract used in the retail channel. The findings also provide useful insights for managers to make their information sharing decisions.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"34 2","pages":"1245-1270"},"PeriodicalIF":3.5,"publicationDate":"2026-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149205508","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":"Optimizing equity and efficiency in the aerial firefighting resource allocation problem","authors":"Konstantinos A. Tasias,&nbsp;George Nenes","doi":"10.1111/itor.70236","DOIUrl":"https://doi.org/10.1111/itor.70236","url":null,"abstract":"<p>This study addresses the aerial firefighting resource allocation problem, formulated as the strategic prepositioning of a heterogeneous aerial firefighting fleet across capacity-constrained airbases. A novel bi-objective model is proposed that simultaneously optimizes efficiency (aggregate risk-weighted accessibility) and equity (minimized regional service disparities). The model employs an enhanced spatial accessibility method with a distance-decay function to evaluate coverage effectiveness and distribution fairness. A multi-objective genetic algorithm is implemented to generate Pareto-approximate solutions, revealing quantifiable trade-offs. Applied to a national-scale case study in Greece using 25 years of wildfire data, results demonstrate that the proposed framework provides significantly wider coverage than current practices, thereby extending protection to underserved regions while reducing redundant overlap. Sensitivity analyses confirm robustness across various real-world conditions, such as different budget levels and aircraft availability. This transferable tool enables policymakers to make data-driven decisions by quantifying the balance between response effectiveness and social fairness in wildfire-prone regions.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"34 2","pages":"1072-1096"},"PeriodicalIF":3.5,"publicationDate":"2026-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.70236","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149205891","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":"Park-and-multi-loop with autonomous delivery robots in last-mile logistics","authors":"Tommaso Adamo,&nbsp;Gianpaolo Ghiani,&nbsp;Emanuela Guerriero,&nbsp;Emanuele Manni,&nbsp;Gianluca Solazzo","doi":"10.1111/itor.70212","DOIUrl":"https://doi.org/10.1111/itor.70212","url":null,"abstract":"<p>This paper deals with the park-and-multi-loop routing problem, in the context of last-mile logistics, in which a fleet of traditional vehicles equipped with several autonomous delivery robots leaves from a depot to service a set of customer requests. Each delivery route involves a main tour of a traditional vehicle (subject to time-dependent travel times), which may stop at one or more parking locations, from which one or more walking sub-tours are carried out by the driver and the delivery robots on the pedestrian network. The goal is to minimize the overall cost of both van and walking routes. An alternative objective aims to minimize the <span></span><math>\u0000 <semantics>\u0000 <msub>\u0000 <mi>CO</mi>\u0000 <mn>2</mn>\u0000 </msub>\u0000 <annotation>$mathrm{CO}_2$</annotation>\u0000 </semantics></math> emissions. A peculiarity of the problem is that the walking distance covered by drivers and delivery robots must not exceed given thresholds. For this problem, we propose a tailored destroy-and-repair mechanism embedded into a neighborhood search algorithm. The destroy-and-repair operators are parameterized, and the most appropriate parameter setting is chosen based on some performance measures of the solution. Computational results on a set of instances of varying size, derived from real data of two major Italian cities, certify the quality of the approach, compared to classic destroy-and-repair operators. Moreover, we also show the benefits of the proposed delivery scheme in terms of <span></span><math>\u0000 <semantics>\u0000 <msub>\u0000 <mi>CO</mi>\u0000 <mn>2</mn>\u0000 </msub>\u0000 <annotation>$mathrm{CO}_2$</annotation>\u0000 </semantics></math> emissions when compared to a traditional delivery paradigm.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"34 2","pages":"914-945"},"PeriodicalIF":3.5,"publicationDate":"2026-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.70212","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149206111","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":"Exact solution algorithms for biobjective mixed integer programming problems","authors":"Deniz Emre,&nbsp;Özlem Karsu,&nbsp;Firdevs Ulus","doi":"10.1111/itor.70079","DOIUrl":"https://doi.org/10.1111/itor.70079","url":null,"abstract":"<p>We consider criterion space algorithms for biobjective mixed integer programs. The algorithms solve scalarization models in order to explore predetermined regions of the objective space called boxes, defined by two nondominated points. When exploring, the algorithm exploits information on its corner points and chooses the scalarization problem accordingly so as to detect line segments quickly, without having to solve many scalarizations. We propose three algorithms: The first one creates new boxes immediately when it finds a nondominated point, whereas the second algorithm conducts additional operations after obtaining a nondominated point by the Pascoletti–Serafini scalarization. The third algorithm is another variant that uses the computational advantage of dichotomic search whenever possible. Our computational experiments demonstrate the computational feasibility of the algorithms and show that the number of mixed integer linear programming models is significantly lower compared to similar approaches in the literature. The results further validate the utilization of Pascoletti–Serafini scalarization, aimed at enhancing the representativeness of solutions under time and cardinality limits. We observe that the third variant is particularly effective in finding a representative subset of the nondominated solutions under such limits.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"34 2","pages":"1138-1171"},"PeriodicalIF":3.5,"publicationDate":"2026-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149205387","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 bi-objective optimization model to plan vaccination campaigns aided by temporary centers","authors":"Fernando Montenegro-Dos Santos,&nbsp;Francisco Pérez-Galarce,&nbsp;Carlos A. Monardes-Concha,&nbsp;Sergio Cruz-Zárate,&nbsp;Alfredo Candia-Véjar","doi":"10.1111/itor.70154","DOIUrl":"https://doi.org/10.1111/itor.70154","url":null,"abstract":"<p>Vaccination campaigns have saved thousands of lives and reached even the world's most remote areas. However, the COVID-19 pandemic significantly changed the strategies for such campaigns. It is now crucial to rigorously consider new factors when planning the operational aspects of these campaigns, particularly for last-mile vaccine dispensing. First, a large share of the population must be vaccinated, with emphasis on vulnerable groups at higher risk. Second, if the virus is highly contagious and capable of asymptomatic transmission, implementing public health measures at vaccination sites becomes paramount. To address these challenges, we propose a bi-objective optimization model to support healthcare decision-making. It defines a schedule for locating temporary vaccination centers and assigning populations to permanent and temporary sites over a planning horizon. Moreover, we formalize and validate a minimum set of properties for a function-based prioritization mechanism to ensure consistent prioritization. One objective prioritizes vaccinating vulnerable groups according to our novel function-based approach, while the other minimizes the operational costs of temporary centers. In the complex environment of a pandemic, the strategic integration and use of temporary and permanent vaccination centers is vital for creating a robust and responsive vaccination strategy. Temporary centers, whose locations are determined by the model, improve access for hard-to-reach groups, contribute to minimizing crowding at permanent sites, and lower infection risks. Our results, demonstrated through a case study, show that the model effectively allocates resources and generates various vaccination plans that cater to different priority levels assigned to each objective, thereby offering valuable decision support.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"34 2","pages":"1003-1039"},"PeriodicalIF":3.5,"publicationDate":"2026-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149206144","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":"From airplanes to classrooms: A cross-domain literature review of seating assignment models and methods","authors":"Miles Compani,&nbsp;Golshan Madraki,&nbsp;R. John Milne","doi":"10.1111/itor.70153","DOIUrl":"https://doi.org/10.1111/itor.70153","url":null,"abstract":"<p>Seating assignments play an important role in customer-focused managerial decisions, yet existing studies are frequently limited in scope to isolated application domains. This paper addresses this fragmentation through the first systematic cross-domain seating assignment literature review, analyzing publications via bibliometric analysis and examining assignment methods (including optimization techniques) across transportation (airplanes and trains), dining establishments, entertainment venues, and classrooms. Co-citation analysis reveals that research communities operate in separate networks despite addressing similar challenges using mathematical programming, heuristic approaches, stochastic simulation, and other operational research methods. Our cross-domain synthesis identifies technique transfer opportunities previously invisible due to research silos, such as applying restaurant group-seating strategies to airline passengers traveling together or entertainment venue considerations to dining table assignments. The review concludes that limited real-world implementation stems partly from researchers' inability to access successful approaches from adjacent fields, highlighting opportunities to advance seating assignment methods through integrated frameworks.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"34 2","pages":"653-737"},"PeriodicalIF":3.5,"publicationDate":"2026-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149206217","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":"Financing assistance and concession strategies of the transnational supply chain under liquidity shock","authors":"Kai Kang,&nbsp;Mengyu He","doi":"10.1111/itor.70077","DOIUrl":"https://doi.org/10.1111/itor.70077","url":null,"abstract":"<p>How to deal with financial distress caused by liquidity shocks has become an urgent problem for firms. We provide a framework on how to clarify the role of financing assistance and concession strategies in the context of transnational supply chains and aim to help managers understand how to choose strategies. With a small liquidity shock, the buyer provides financing assistance to the distressed supplier, resulting in a bailout effect. When the cross-effect of tax difference and vertical shareholding is large, buyer financing can hedge bankruptcy risk more effectively. With a large liquidity shock, the distressed supplier files for bankruptcy. When the reorganization cost is small or moderate, the distressed supplier reorganizes, and concession effect and bidirectional predation behavior occur in the reorganization process. When the reorganization cost is large, the distressed supplier goes into liquidation. The results provide suggestions for financing and bankruptcy decisions of firms under liquidity shock.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"34 2","pages":"1271-1305"},"PeriodicalIF":3.5,"publicationDate":"2026-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149205388","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":"How to optimise tournament draws: The case of the FIFA World Cup","authors":"László Csató","doi":"10.1111/itor.70194","DOIUrl":"https://doi.org/10.1111/itor.70194","url":null,"abstract":"<p>The organisers of major sports competitions use different policies with respect to constraints in the group draw. Our paper aims to rationalise these choices by analysing the trade-off between attractiveness (the number of games played by teams from the same geographic zone) and fairness (the departure of the draw mechanism from a uniform distribution). A parametric optimisation model is formulated and applied to the 2018 and 2022 FIFA World Cup draws. A flaw of the draw procedure is identified: the pre-assignment of the host to a group unnecessarily increases the distortions. All Pareto efficient sets of draw constraints are determined via simulations. The proposed framework can be used to find the optimal draw rules and justify the non-uniformity of the draw procedure for the stakeholders.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"34 2","pages":"791-821"},"PeriodicalIF":3.5,"publicationDate":"2026-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.70194","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149206108","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":"Reservation-based intersection scheduling using dynamic programming with dominance pruning","authors":"Zhixia Li,&nbsp;Muting Ma,&nbsp;Mesut Yavuz","doi":"10.1111/itor.70223","DOIUrl":"https://doi.org/10.1111/itor.70223","url":null,"abstract":"&lt;p&gt;Scheduling connected and automated vehicles (CAVs) at reservation-based intersections faces a fundamental trade-off: existing methods sacrifice either optimality for computational efficiency or real-time applicability for optimal solutions. We bridge this gap by proposing a dynamic programming (DP) algorithm with dominance pruning (&lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;msup&gt;\u0000 &lt;mi&gt;DP&lt;/mi&gt;\u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 &lt;/msup&gt;\u0000 &lt;annotation&gt;$rm{DP}^2$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;) that simultaneously achieves optimal batch formation, polynomial-time complexity, and superior solution quality. &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;msup&gt;\u0000 &lt;mi&gt;DP&lt;/mi&gt;\u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 &lt;/msup&gt;\u0000 &lt;annotation&gt;$rm{DP}^2$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; introduces a novel dominance rule that eliminates suboptimal child nodes by comparing analytically derived lower bounds, enabling batch-based processing of CAVs while guaranteeing optimality. Unlike existing approaches that assume predetermined batches or sacrifice optimality, &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;msup&gt;\u0000 &lt;mi&gt;DP&lt;/mi&gt;\u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 &lt;/msup&gt;\u0000 &lt;annotation&gt;$rm{DP}^2$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; integrates optimal batching decisions directly into the scheduling algorithm. The proposed method achieves a substantial improvement over existing exact algorithms with &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;O&lt;/mi&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 &lt;msup&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 &lt;/msup&gt;\u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt;$mathcal {O}(n^2)$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; worst-case and &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;Ω&lt;/mi&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt;$Omega (n)$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; best-case time complexity. Extensive experiments demonstrate that &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;msup&gt;\u0000 &lt;mi&gt;DP&lt;/mi&gt;\u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 &lt;/msup&gt;\u0000 &lt;annotation&gt;$rm{DP}^2$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; reduces computation time by 91% and 99% compared to a state-of-the-art DP algorithm and Gurobi solver, respectively, while consistently delivering superior performance in makespan, average delay, and maximum delay metrics across diverse traffic scenarios. Furthermore, &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;msup&gt;\u0000 &lt;mi&gt;DP&lt;/mi&gt;\u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 &lt;/msup&gt;\u0000 ","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"34 2","pages":"946-974"},"PeriodicalIF":3.5,"publicationDate":"2026-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149206185","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":"Impact of shipping policies on ordering and pricing strategies in dual-channel perishable food retailing","authors":"Xiaotong Guo,&nbsp;Yong He,&nbsp;Yanan Yu,&nbsp;Dong Li","doi":"10.1111/itor.70090","DOIUrl":"https://doi.org/10.1111/itor.70090","url":null,"abstract":"<p>The perishable food retail sector faces significant challenges, including product quality deterioration, intense competition, and the complexities of dual-channel (online/offline) operations. This study examines a retailer selling perishable food through both channels, where customer purchasing behavior is influenced by price and dynamic quality degradation. Using a consumer utility model that accounts for perishability, we analyze the retailer's optimal order quantities and price discounts under different shipping policies. Our key findings reveal how shipping fees, consumer heterogeneity, and promotion periods interact to shape pricing strategies. Under conditions of low shipping fees, configurations of discounts become more complex due to the trade-offs between shipping costs and sales revenue. Without safety stock, discounts are steeper in low-fee scenarios, while high-fee conditions favor smaller discounts. Market dynamics determine the effectiveness of discounts and shipping policies in reducing waste and boosting profits. A “win–win” scenario emerges under low shipping fees, where environmental and economic goals align. Conversely, high shipping fees create a conflict between these objectives. Additionally, strategic safety stock allocation and shipping policy adjustments can simultaneously enhance market share and profitability. By aligning operational decisions with sustainability goals, this study contributes to reducing food waste and improving supply chain resilience.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"34 1","pages":"217-249"},"PeriodicalIF":3.5,"publicationDate":"2026-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148700089","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}