International Transactions in Operational Research最新文献_第6页

Multi-period optimal bidding strategy with energy storage 考虑储能的多时段最优竞价策略

IF 2.9 4区管理学

International Transactions in Operational Research Pub Date : 2026-06-08 Epub Date: 2025-06-10 DOI: 10.1111/itor.70056

Azin Khaleghi, Wouter Baar, Dario Bauso

引用次数: 0

Scheduling optimization of optical lens polishing 光学透镜抛光调度优化

IF 2.9 4区管理学

International Transactions in Operational Research Pub Date : 2026-06-08 Epub Date: 2026-01-25 DOI: 10.1111/itor.70162

Tzu-Chin Lin, Bertrand M. T. Lin

{"title":"Scheduling optimization of optical lens polishing","authors":"Tzu-Chin Lin, Bertrand M. T. Lin","doi":"10.1111/itor.70162","DOIUrl":"https://doi.org/10.1111/itor.70162","url":null,"abstract":"Optical systems have achieved notable progress in focusing and imaging technologies; however, manual grinding remains indispensable, resulting in elevated costs, extended timelines, and inefficiencies. These difficulties are compounded by operational constraints, uneven machine utilization, and risks of order delays and escalating expenses, which threaten customer trust and business stability. Fine grinding, a vital stage in lens manufacturing, includes trial processing testing, and mass production, with setup time identified as a major determinant of production efficiency. This study integrates setup times into scheduling decisions to enhance monthly order fulfillment. The objectives are to reduce tardiness costs and optimize both machine utilization and overall efficiency. Three approaches are examined: manual scheduling, dispatching rules, and an integer programming model. Results demonstrate that the mathematical model achieves dominant efficiency when order volumes match capacity and reduces tardiness penalties to one-fourth of those under manual scheduling when capacity is exceeded, underscoring its practical relevance for lens manufacturers.","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"33 6","pages":"3744-3768"},"PeriodicalIF":2.9,"publicationDate":"2026-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.70162","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148194210","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Quantum annealing-driven branch and bound for the total weighted tardiness traveling salesman problem on the D-Wave quantum computer D-Wave量子计算机上总加权延迟旅行商问题的量子退火驱动分支定界

IF 2.9 4区管理学

International Transactions in Operational Research Pub Date : 2026-06-08 Epub Date: 2026-01-21 DOI: 10.1111/itor.70161

Wojciech Bożejko, Mariusz Uchroński, Mieczysław Wodecki

{"title":"Quantum annealing-driven branch and bound for the total weighted tardiness traveling salesman problem on the D-Wave quantum computer","authors":"Wojciech Bożejko, Mariusz Uchroński, Mieczysław Wodecki","doi":"10.1111/itor.70161","DOIUrl":"https://doi.org/10.1111/itor.70161","url":null,"abstract":"The transportation problem considered in this work consists of minimizing the sum of penalties for tardiness in the delivery of the product from the base to clients. We propose an innovative method for constructing hybrid algorithms using quantum annealing that guarantees the optimality of the solution. The hybrid algorithm alternately performs calculations on a classical computer equipped with a silicon CPU and a quantum annealer with a QPU processor. The entire method is based on the branch and bound scheme. The lower and upper bounds are calculated on the QPU, while the CPU is responsible for organizing the calculations, recalling the solution tree. The problem under consideration is of great practical importance because it is a component of many complex issues related to solving the traveling repairmen problem, which are very difficult or even impossible to solve today using classical methods. Undoubtedly, an important application of quantum computers in the future is NP-hard optimization tasks related to transportation scheduling and logistics.","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"33 6","pages":"3855-3881"},"PeriodicalIF":2.9,"publicationDate":"2026-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148194153","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Upgradable remanufacturing in the presence of green consumers: strategic analysis from a supply chain perspective 绿色消费者下的可升级再制造：供应链视角下的战略分析

IF 2.9 4区管理学

International Transactions in Operational Research Pub Date : 2026-06-08 Epub Date: 2025-07-01 DOI: 10.1111/itor.70058

Mengdan Wang, Nengmin Wang, Margaretha Gansterer

{"title":"Upgradable remanufacturing in the presence of green consumers: strategic analysis from a supply chain perspective","authors":"Mengdan Wang, Nengmin Wang, Margaretha Gansterer","doi":"10.1111/itor.70058","DOIUrl":"https://doi.org/10.1111/itor.70058","url":null,"abstract":"Increasing consumer environmental consciousness drives many manufacturers to sell remanufactured products. Particularly, some offer upgraded remanufactured products equipped with critical components that match the quality of new ones. However, remanufacturing affects demand for new products, the supplier's wholesale pricing, and consequently, the manufacturer's profits. This study examines the manufacturer's remanufacturing strategy in the presence of green consumers by developing a model involving one supplier and one manufacturer. It encompasses no-remanufacturing, basic-remanufacturing, upgraded-remanufacturing, and hybrid-remanufacturing models. We find that when consumers place a high valuation on remanufactured products, the hybrid-remanufacturing model is optimal if the proportion of green consumers is medium, while the upgraded-remanufacturing model is optimal if the proportion of green consumers is high. If the proportion of green consumers is larger than a threshold and consumer valuation of remanufactured products is low, the basic-remanufacturing model is optimal. Interestingly, we also identify scenarios where the manufacturer benefits from not developing any remanufacturing business. When the production cost of critical components is low, the manufacturer's sale of upgraded remanufactured products leads to a win–win outcome. If the proportion of green consumers is large, remanufacturing enhances social welfare, but it may also decrease environmental performance.","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"33 6","pages":"4195-4246"},"PeriodicalIF":2.9,"publicationDate":"2026-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148193986","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

From grapes to market: a systematic review of optimization model applications for supporting decision-making in the wine supply chain 从葡萄到市场：在葡萄酒供应链中支持决策的优化模型应用的系统回顾

IF 2.9 4区管理学

International Transactions in Operational Research Pub Date : 2026-06-08 Epub Date: 2025-10-05 DOI: 10.1111/itor.70118

Luis Lillo Otarola, Franco Basso, Raul Pezoa, Paulina Quilodrán, Mauricio Varas, Hanns de la Fuente-Mella

{"title":"From grapes to market: a systematic review of optimization model applications for supporting decision-making in the wine supply chain","authors":"Luis Lillo Otarola, Franco Basso, Raul Pezoa, Paulina Quilodrán, Mauricio Varas, Hanns de la Fuente-Mella","doi":"10.1111/itor.70118","DOIUrl":"https://doi.org/10.1111/itor.70118","url":null,"abstract":"The wine industry faces growing challenges across its supply chain due to operational complexity, international competition, and rising sustainability demands. This study presents a systematic review conducted following PRISMA guidelines, analyzing 90 articles published between 1970 and 2024 on optimization models applied to the wine supply chain. We examine mathematical formulations, solution methods, decision levels (operational, tactical, strategic), and supply chain stage coverage. Results show that 87% of studies use deterministic models—predominantly mixed-integer linear programming—while only 13% incorporate uncertainty. Research focuses mainly on early stages: grape cultivation and harvest (33%) and wine production (38%), with limited attention to bottling (10%) and distribution (7%). Only 12% integrate multiple stages. The identified underexplored areas highlight opportunities to improve climate adaptation for vineyard managers, enable more integrated planning for supply chain managers, and better align sustainability goals for policymakers. By synthesizing these trends and identifying seven strategic research priorities aligned with the International Organization of Vine and Wine guidelines, this review provides actionable insights to strengthen sector resilience, efficiency, and sustainability.","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"33 6","pages":"3645-3697"},"PeriodicalIF":2.9,"publicationDate":"2026-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148194105","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

An efficient variable neighborhood search approach for the facility location problem with the limited choice rule 有限选择规则下设施选址问题的一种高效变邻域搜索方法

IF 2.9 4区管理学

International Transactions in Operational Research Pub Date : 2026-06-08 Epub Date: 2025-07-14 DOI: 10.1111/itor.70069

Enrique García-Galán, Alberto Herrán, J. Manuel Colmenar

{"title":"An efficient variable neighborhood search approach for the facility location problem with the limited choice rule","authors":"Enrique García-Galán, Alberto Herrán, J. Manuel Colmenar","doi":"10.1111/itor.70069","DOIUrl":"https://doi.org/10.1111/itor.70069","url":null,"abstract":"One of the most common problems in the expansion of a company consists of deciding the most appropriate locations for their facilities. This decision problem, known as the facility location problem, has been studied from different perspectives, considering a number of different constraints. Among these different versions of the problem, the facility location problem with the limited choice rule considers both the cost of opening facilities and the benefit of attracting customers under a deterministic utility approach. In this work, we propose a metaheuristic approach based on variable neighborhood search to tackle this problem. Our proposal is able to obtain the best results in 296 of the 309 instances studied, compared to state-of-the-art algorithms. In addition, we propose an efficient local search that obtains a 91.5% average reduction in execution time compared to the version with the straightforward implementation. Therefore, this efficient proposal can be applied to larger instances that cannot be solved with previous approaches.","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"33 6","pages":"3905-3933"},"PeriodicalIF":2.9,"publicationDate":"2026-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.70069","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148194201","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A formulation and a metaheuristic approach for the clustered vehicle routing problem with d-relaxed priority rule 一种具有放宽优先级规则的聚类车辆路径问题的表述和元启发式方法

IF 2.9 4区管理学

International Transactions in Operational Research Pub Date : 2026-06-08 Epub Date: 2025-12-18 DOI: 10.1111/itor.70143

Eduardo dos Santos Teixeira, Silvio Alexandre de Araujo

{"title":"A formulation and a metaheuristic approach for the clustered vehicle routing problem with d-relaxed priority rule","authors":"Eduardo dos Santos Teixeira, Silvio Alexandre de Araujo","doi":"10.1111/itor.70143","DOIUrl":"https://doi.org/10.1111/itor.70143","url":null,"abstract":"This paper investigates an extension of the vehicle routing problem in which, in addition to minimizing the distance traveled, the sequencing of customer visits is subject to precedence constraints that impose visiting priorities among customers. This problem has practical applications in various real-world contexts, including humanitarian logistics and internet service provision. In this paper, we extend the literature by considering the clustered vehicle routing problem with <math>\u0000 <semantics>\u0000 <mi>d</mi>\u0000 <annotation>$d$</annotation>\u0000 </semantics></math>-relaxed priority rule, a version of the problem where all vertices must be visited exactly once, the vehicles have capacity limitations, and the vertices must be visited considering the <math>\u0000 <semantics>\u0000 <mi>d</mi>\u0000 <annotation>$d$</annotation>\u0000 </semantics></math>-relaxed priority rule. A new mathematical formulation considering the local timing case is presented, and a metaheuristic approach is proposed to tackle bigger instances. Finally, computational experiments using a general-purpose mixed-integer linear programming solver are compared with the results obtained by the metaheuristic. The results indicate that the mathematical model can find feasible solutions for small instances—although without proving optimality—while the proposed metaheuristic is able to find feasible solutions for larger instances in significantly less computational time.","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"33 6","pages":"3714-3743"},"PeriodicalIF":2.9,"publicationDate":"2026-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.70143","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148193969","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Smart food-sharing platforms for social sustainability: a heuristic algorithm approach 促进社会可持续性的智能食品共享平台：启发式算法方法

IF 2.9 4区管理学

International Transactions in Operational Research Pub Date : 2026-04-01 Epub Date: 2024-09-05 DOI: 10.1111/itor.13543

Behzad Maleki Vishkaei, Pietro De Giovanni

引用次数: 0

A fast local search for the identical parallel machine scheduling problem with the position-based deteriorating effect and maintenance 基于位置的退化效果和维修的同一并行机调度问题的快速局部搜索

IF 2.9 4区管理学

International Transactions in Operational Research Pub Date : 2026-04-01 Epub Date: 2025-02-03 DOI: 10.1111/itor.13623

Radosław Rudek

引用次数: 0

Exact time-discounting and heuristics for the EOQ model with random yield 随机产量EOQ模型的精确时间折现及启发式算法