首页 > 最新文献

International Transactions in Operational Research最新文献

英文 中文
Nonparametric efficiency and artificial intelligence techniques in higher education: a systematic literature review and bibliometric analysis 高等教育中的非参数效率和人工智能技术:系统的文献综述和文献计量分析
IF 2.9 4区 管理学 Q2 MANAGEMENT Pub Date : 2025-07-14 DOI: 10.1111/itor.70070
Anna Rita Dipierro, Kristof De Witte, Pierluigi Toma

In a sector that needs to work as efficient as possible, artificial intelligence (AI) can guide the efficiency improvements of higher education institutions (HEIs). This paper explores both the AI literature and the efficiency literature as applied to HEIs following the Preferred Reporting Items for Systematic Review guidelines. The goal is to identify the relevant research that uses nonparametric efficiency and AI techniques within the HEI sector by examining articles published up to March 2025. Our findings provide a powerful mix of bibliometric and systematic literature review results that identify the main trends common to these two strands of research. The analysis highlights a long-standing tradition of applying nonparametric efficiency analysis to the sector, as it is attracting the increasing attention of AI scholars. We outline the substantial evidence that reveals much room for improvement in efficiency in the HEI sector, and how the application of AI may be well-suited. This is particularly evident as AI can support efficiency evaluations, particularly in handling tasks that traditional efficiency techniques alone cannot perform. A key contribution of this work is the identification of the opportunities for further research focus within this critical intersection between the two fields, which can inform both HEI administrators and policymakers.

在一个需要尽可能高效工作的领域,人工智能(AI)可以指导高等教育机构(HEIs)提高效率。本文探讨了应用于高等学校的人工智能文献和效率文献,这些高等学校遵循系统审查指南的首选报告项目。目标是通过检查截至2025年3月发表的文章,确定在高等教育领域使用非参数效率和人工智能技术的相关研究。我们的研究结果提供了文献计量学和系统文献综述结果的强大组合,确定了这两股研究的共同主要趋势。该分析强调了将非参数效率分析应用于该部门的长期传统,因为它正在吸引越来越多的人工智能学者的关注。我们概述了大量证据,表明高等教育部门的效率有很大的提高空间,以及人工智能的应用如何很好地适应。这一点尤其明显,因为人工智能可以支持效率评估,特别是在处理传统效率技术无法单独完成的任务时。这项工作的一个关键贡献是确定了在这两个领域之间的关键交叉点进行进一步研究的机会,这可以为高等教育管理者和决策者提供信息。
{"title":"Nonparametric efficiency and artificial intelligence techniques in higher education: a systematic literature review and bibliometric analysis","authors":"Anna Rita Dipierro,&nbsp;Kristof De Witte,&nbsp;Pierluigi Toma","doi":"10.1111/itor.70070","DOIUrl":"https://doi.org/10.1111/itor.70070","url":null,"abstract":"<p>In a sector that needs to work as efficient as possible, artificial intelligence (AI) can guide the efficiency improvements of higher education institutions (HEIs). This paper explores both the AI literature and the efficiency literature as applied to HEIs following the Preferred Reporting Items for Systematic Review guidelines. The goal is to identify the relevant research that uses nonparametric efficiency and AI techniques within the HEI sector by examining articles published up to March 2025. Our findings provide a powerful mix of bibliometric and systematic literature review results that identify the main trends common to these two strands of research. The analysis highlights a long-standing tradition of applying nonparametric efficiency analysis to the sector, as it is attracting the increasing attention of AI scholars. We outline the substantial evidence that reveals much room for improvement in efficiency in the HEI sector, and how the application of AI may be well-suited. This is particularly evident as AI can support efficiency evaluations, particularly in handling tasks that traditional efficiency techniques alone cannot perform. A key contribution of this work is the identification of the opportunities for further research focus within this critical intersection between the two fields, which can inform both HEI administrators and policymakers.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"33 3","pages":"1427-1464"},"PeriodicalIF":2.9,"publicationDate":"2025-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.70070","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145646485","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
The tree-of-hubs location problem with interhub stopovers 枢纽间中途停留的枢纽树定位问题
IF 2.9 4区 管理学 Q2 MANAGEMENT Pub Date : 2025-06-29 DOI: 10.1111/itor.70068
Oscar H. Ariztegui-Beltrán, David L. Cortés-Murcia, William Guerrero Rueda, Mehrdad Mohammadi, Olivier Péton

The tree-of-hubs location problem (THLP) is a variant of the classical hub location problem, in which the set of hubs must be connected in a tree topology. The key decision variables involve the selection of hub locations, the allocation of spokes to hubs, and the design of a tree-structured interhub network. In this paper, we introduce a new extension of the THLP that incorporates stopover nodes—intermediate locations situated along the paths between hubs. The inclusion of stopovers helps reduce transportation costs by minimizing unnecessary back-and-forth trips and limiting transshipments at hubs. However, this benefit comes at the expense of potential detours in the interhub connections. We propose a mixed-integer linear programming (MILP) formulation to model this problem, with an objective function that minimizes the total cost of transporting commodities between multiple origins and destinations. Computational experiments are conducted using adapted instances from the AP-200 dataset. We also perform a sensitivity analysis on the discount factors associated with the use of stopovers. The results show that stopovers can lead to logistics cost savings of up to 15%. In addition, we provide managerial insights and quantify the impact of stopovers on network design costs by comparing solutions with and without their inclusion. Finally, we discuss the conditions under which stopovers can be effectively leveraged in practice.

集线器树定位问题(THLP)是经典集线器定位问题的一种变体,其中集线器集必须以树状拓扑结构连接。关键决策变量包括轮毂位置的选择、轮辐到轮毂的分配以及树状结构轮毂间网络的设计。在本文中,我们引入了THLP的一个新的扩展,该扩展包含了位于枢纽之间路径上的中途节点-中间位置。包括中途停留,有助于减少不必要的往返旅行和限制在枢纽转运,从而降低运输成本。然而,这种好处是以牺牲集线器连接的潜在弯路为代价的。我们提出了一个混合整数线性规划(MILP)公式来模拟这个问题,其目标函数是最小化多个起点和目的地之间运输商品的总成本。利用AP-200数据集的自适应实例进行了计算实验。我们还对与使用中途停留相关的折扣因素进行了敏感性分析。结果表明,中途停留可以节省高达15%的物流成本。此外,我们通过比较包含和不包含中途停留的解决方案,提供管理见解并量化中途停留对网络设计成本的影响。最后,我们讨论了在实践中有效利用中途停留的条件。
{"title":"The tree-of-hubs location problem with interhub stopovers","authors":"Oscar H. Ariztegui-Beltrán,&nbsp;David L. Cortés-Murcia,&nbsp;William Guerrero Rueda,&nbsp;Mehrdad Mohammadi,&nbsp;Olivier Péton","doi":"10.1111/itor.70068","DOIUrl":"https://doi.org/10.1111/itor.70068","url":null,"abstract":"<p>The tree-of-hubs location problem (THLP) is a variant of the classical hub location problem, in which the set of hubs must be connected in a tree topology. The key decision variables involve the selection of hub locations, the allocation of spokes to hubs, and the design of a tree-structured interhub network. In this paper, we introduce a new extension of the THLP that incorporates stopover nodes—intermediate locations situated along the paths between hubs. The inclusion of stopovers helps reduce transportation costs by minimizing unnecessary back-and-forth trips and limiting transshipments at hubs. However, this benefit comes at the expense of potential detours in the interhub connections. We propose a mixed-integer linear programming (MILP) formulation to model this problem, with an objective function that minimizes the total cost of transporting commodities between multiple origins and destinations. Computational experiments are conducted using adapted instances from the AP-200 dataset. We also perform a sensitivity analysis on the discount factors associated with the use of stopovers. The results show that stopovers can lead to logistics cost savings of up to 15%. In addition, we provide managerial insights and quantify the impact of stopovers on network design costs by comparing solutions with and without their inclusion. Finally, we discuss the conditions under which stopovers can be effectively leveraged in practice.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"33 2","pages":"826-859"},"PeriodicalIF":2.9,"publicationDate":"2025-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145197158","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 enhanced pricing model for truck transportation: a case study in Swedish forestry 改进的卡车运输定价模式:瑞典林业案例研究
IF 2.9 4区 管理学 Q2 MANAGEMENT Pub Date : 2025-06-24 DOI: 10.1111/itor.70062
Mikael Rönnqvist, Patrik Flisberg, Gunnar Svenson, Daniel Noreland

Determining freight rates for heavy trucks involves a detailed analysis of multiple cost factors, including time, distance, fuel, and other operational costs, which collectively contribute to the overall compensation for transportation services. However, actual remuneration is based on more simplified agreements. Often, the standard agreement is based on the loaded driving distance. Such agreements provide an accurate description of the average cost over many transports but can be very unfair in compensation on single transports. This paper presents a pricing model for truck transportation that extends traditional models based on distance. The new model includes a measure of cost driving factors along the route, such as hills, road surface, curves, speed limits, intersections, speed changes, long ascents, and other physical difficulties. This measure is extracted from the Calibrated Route Finder, a route selection support system used for roundwood transportation in Sweden. The suggested price model that combines distance and a weighted resistance measure gives a better match between remuneration and full costing of a transport than a model that concentrates only on distance. The suggested model has been tested on a large annual transport data set and detailed and selected transportations evaluated by five large forest companies.

确定重型卡车的运费率涉及对多种成本因素的详细分析,包括时间、距离、燃料和其他运营成本,这些因素共同影响运输服务的总体补偿。但是,实际报酬是根据比较简化的协定。通常,标准协议是基于装载的驾驶距离。这种协议对许多运输的平均成本提供了准确的描述,但对单一运输的补偿可能非常不公平。本文提出了一种基于距离的卡车运输定价模型。新模型包括了对路线上的成本驱动因素的衡量,如山丘、路面、弯道、速度限制、交叉路口、速度变化、长上升和其他物理困难。这一措施是从校准路线查找器中提取的,这是瑞典用于圆木运输的路线选择支持系统。建议的价格模型结合了距离和加权阻力措施,比只关注距离的模型更能匹配运输的报酬和全部成本。所建议的模型已在大型年度运输数据集上进行了检验,并由五家大型森林公司对详细和选定的运输进行了评估。
{"title":"An enhanced pricing model for truck transportation: a case study in Swedish forestry","authors":"Mikael Rönnqvist,&nbsp;Patrik Flisberg,&nbsp;Gunnar Svenson,&nbsp;Daniel Noreland","doi":"10.1111/itor.70062","DOIUrl":"https://doi.org/10.1111/itor.70062","url":null,"abstract":"<p>Determining freight rates for heavy trucks involves a detailed analysis of multiple cost factors, including time, distance, fuel, and other operational costs, which collectively contribute to the overall compensation for transportation services. However, actual remuneration is based on more simplified agreements. Often, the standard agreement is based on the loaded driving distance. Such agreements provide an accurate description of the average cost over many transports but can be very unfair in compensation on single transports. This paper presents a pricing model for truck transportation that extends traditional models based on distance. The new model includes a measure of cost driving factors along the route, such as hills, road surface, curves, speed limits, intersections, speed changes, long ascents, and other physical difficulties. This measure is extracted from the Calibrated Route Finder, a route selection support system used for roundwood transportation in Sweden. The suggested price model that combines distance and a weighted resistance measure gives a better match between remuneration and full costing of a transport than a model that concentrates only on distance. The suggested model has been tested on a large annual transport data set and detailed and selected transportations evaluated by five large forest companies.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"33 2","pages":"775-797"},"PeriodicalIF":2.9,"publicationDate":"2025-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.70062","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145197029","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
Special Issue on “Cutting and Packing” “裁切及包装”特刊
IF 3.1 4区 管理学 Q2 MANAGEMENT Pub Date : 2025-06-09 DOI: 10.1111/itor.70035
{"title":"Special Issue on “Cutting and Packing”","authors":"","doi":"10.1111/itor.70035","DOIUrl":"https://doi.org/10.1111/itor.70035","url":null,"abstract":"","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 6","pages":"4044-4045"},"PeriodicalIF":3.1,"publicationDate":"2025-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144244339","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
Preface to the Special Issue on “Sustainable and Responsive Transportation and Logistics” “可持续及反应迅速的运输及物流”特刊前言
IF 3.1 4区 管理学 Q2 MANAGEMENT Pub Date : 2025-06-09 DOI: 10.1111/itor.70029
Rosa G. González-Ramírez, Janny Leung, Alena Otto, Erwin Pesch
{"title":"Preface to the Special Issue on “Sustainable and Responsive Transportation and Logistics”","authors":"Rosa G. González-Ramírez,&nbsp;Janny Leung,&nbsp;Alena Otto,&nbsp;Erwin Pesch","doi":"10.1111/itor.70029","DOIUrl":"https://doi.org/10.1111/itor.70029","url":null,"abstract":"","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 6","pages":"3209-3210"},"PeriodicalIF":3.1,"publicationDate":"2025-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144244193","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
Special Issue on “Agricultural E-commerce and Logistics Operations in the Era of Digital Economy” “数字经济时代的农业电子商务与物流运作”特刊
IF 3.1 4区 管理学 Q2 MANAGEMENT Pub Date : 2025-06-09 DOI: 10.1111/itor.70037
{"title":"Special Issue on “Agricultural E-commerce and Logistics Operations in the Era of Digital Economy”","authors":"","doi":"10.1111/itor.70037","DOIUrl":"https://doi.org/10.1111/itor.70037","url":null,"abstract":"","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 6","pages":"4040-4042"},"PeriodicalIF":3.1,"publicationDate":"2025-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144244340","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
Special Issue on “Decision Support System Technology in the Artificial Intelligence Era” 《人工智能时代的决策支持系统技术》特刊
IF 3.1 4区 管理学 Q2 MANAGEMENT Pub Date : 2025-06-09 DOI: 10.1111/itor.70036
{"title":"Special Issue on “Decision Support System Technology in the Artificial Intelligence Era”","authors":"","doi":"10.1111/itor.70036","DOIUrl":"https://doi.org/10.1111/itor.70036","url":null,"abstract":"","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 6","pages":""},"PeriodicalIF":3.1,"publicationDate":"2025-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144244341","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
Evaluating ESG effects on firm's technical efficiency with robust nonparametric frontiers: Insights from Asia 以稳健的非参数边界评估ESG对企业技术效率的影响:来自亚洲的见解
IF 2.9 4区 管理学 Q2 MANAGEMENT Pub Date : 2025-06-05 DOI: 10.1111/itor.70055
Maria Arsenopoulou, Michail Nerantzidis, Themistokles G. Lazarides, Evdokia Tsifora

This study examines how environmental, social, and governance practices impact firms' technical efficiency, focusing on operational capabilities often overlooked in financial performance measures. Using a nonparametric frontier analysis with robust order-m estimators, we analyzed 6033 firms across Asia from 2015 to 2022. Results show a nonlinear, “U”-shaped relationship: initial environmental, social, and governance investments may decrease efficiency, but surpassing a threshold improves it. This suggests that while early environmental, social, and governance efforts may lead to inefficiency due to adjustments, long-term benefits include better stakeholder investment and innovation. Firms also showed greater resilience during the COVID-19 pandemic. The sector-specific analysis supports this “U”-shaped trend but highlights the need for detailed, sector-specific research.

本研究考察了环境、社会和治理实践如何影响企业的技术效率,重点关注在财务绩效指标中经常被忽视的运营能力。使用非参数前沿分析和稳健的order-m估计器,我们分析了2015年至2022年亚洲6033家公司。结果显示出一种非线性的“U”型关系:初始的环境、社会和治理投资可能会降低效率,但超过某个阈值会提高效率。这表明,虽然早期的环境、社会和治理努力可能由于调整而导致效率低下,但长期利益包括更好的利益相关者投资和创新。企业在2019冠状病毒病大流行期间也表现出更强的抵御能力。具体行业的分析支持这种“U”型趋势,但强调需要详细的、具体行业的研究。
{"title":"Evaluating ESG effects on firm's technical efficiency with robust nonparametric frontiers: Insights from Asia","authors":"Maria Arsenopoulou,&nbsp;Michail Nerantzidis,&nbsp;Themistokles G. Lazarides,&nbsp;Evdokia Tsifora","doi":"10.1111/itor.70055","DOIUrl":"https://doi.org/10.1111/itor.70055","url":null,"abstract":"<p>This study examines how environmental, social, and governance practices impact firms' technical efficiency, focusing on operational capabilities often overlooked in financial performance measures. Using a nonparametric frontier analysis with robust order-<i>m</i> estimators, we analyzed 6033 firms across Asia from 2015 to 2022. Results show a nonlinear, “U”-shaped relationship: initial environmental, social, and governance investments may decrease efficiency, but surpassing a threshold improves it. This suggests that while early environmental, social, and governance efforts may lead to inefficiency due to adjustments, long-term benefits include better stakeholder investment and innovation. Firms also showed greater resilience during the COVID-19 pandemic. The sector-specific analysis supports this “U”-shaped trend but highlights the need for detailed, sector-specific research.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"33 2","pages":"1052-1073"},"PeriodicalIF":2.9,"publicationDate":"2025-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.70055","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145196496","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
Energy-aware flexible job shop scheduling problem with nonlinear routes and position-based learning effect 具有非线性路径和位置学习效应的能量感知柔性作业车间调度问题
IF 2.9 4区 管理学 Q2 MANAGEMENT Pub Date : 2025-06-05 DOI: 10.1111/itor.70057
Ernesto G. Birgin, José Angel Riveaux, Débora P. Ronconi

Sustainability has become one of the main objectives in all human activities and, in particular, in manufacturing environments. In this paper, we consider the flexible job shop scheduling problem with the objective of minimizing energy consumption. As it is known that a considerable part of the energy consumption occurs when the machines are on and idle, the addressed problem includes the possibility of turning the machines off and on between processing operations. To bring the problem closer to the large variety of real-world problems it encompasses, we include two relevant factors: nonlinear routes and position-based learning effect. The treated problem is formally described through a mixed integer linear programming model. We propose constructive heuristics, two types of neighborhoods with which we construct local search schemes and three metaheuristics, namely, general variable neighborhood search, greedy randomized adaptive search procedure, and simulated annealing. We conduct a large number of experiments to evaluate the performance of the introduced methods on small-sized and large-sized instances. In the large-sized instances, the general variable neighborhood search that combines the two neighborhoods into a single method is particularly effective. In the small-sized instances with known optimal solutions, the greedy randomized adaptive search procedure finds solutions that, on average, are within 0.22% of the optimal solution.

可持续性已成为所有人类活动的主要目标之一,特别是在制造环境中。本文研究了以能耗最小为目标的柔性作业车间调度问题。众所周知,相当一部分的能源消耗发生在机器开着和空闲时,所解决的问题包括在加工操作之间关闭和打开机器的可能性。为了使问题更接近于它所包含的各种现实问题,我们包括两个相关因素:非线性路线和基于位置的学习效应。通过混合整数线性规划模型对所处理的问题进行形式化描述。我们提出了建设性启发式算法,两种类型的邻域构建局部搜索方案和三种元启发式算法,即一般变量邻域搜索,贪婪随机自适应搜索过程和模拟退火。我们进行了大量的实验来评估所引入的方法在小型和大型实例上的性能。在大型实例中,将两个邻域结合为一个方法的通用变量邻域搜索尤其有效。在已知最优解的小实例中,贪婪随机自适应搜索过程找到的解平均在最优解的0.22%以内。
{"title":"Energy-aware flexible job shop scheduling problem with nonlinear routes and position-based learning effect","authors":"Ernesto G. Birgin,&nbsp;José Angel Riveaux,&nbsp;Débora P. Ronconi","doi":"10.1111/itor.70057","DOIUrl":"https://doi.org/10.1111/itor.70057","url":null,"abstract":"<p>Sustainability has become one of the main objectives in all human activities and, in particular, in manufacturing environments. In this paper, we consider the flexible job shop scheduling problem with the objective of minimizing energy consumption. As it is known that a considerable part of the energy consumption occurs when the machines are on and idle, the addressed problem includes the possibility of turning the machines off and on between processing operations. To bring the problem closer to the large variety of real-world problems it encompasses, we include two relevant factors: nonlinear routes and position-based learning effect. The treated problem is formally described through a mixed integer linear programming model. We propose constructive heuristics, two types of neighborhoods with which we construct local search schemes and three metaheuristics, namely, general variable neighborhood search, greedy randomized adaptive search procedure, and simulated annealing. We conduct a large number of experiments to evaluate the performance of the introduced methods on small-sized and large-sized instances. In the large-sized instances, the general variable neighborhood search that combines the two neighborhoods into a single method is particularly effective. In the small-sized instances with known optimal solutions, the greedy randomized adaptive search procedure finds solutions that, on average, are within 0.22% of the optimal solution.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"33 2","pages":"860-891"},"PeriodicalIF":2.9,"publicationDate":"2025-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.70057","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145196495","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
An allocation rule for connection scheduling problems 连接调度问题的分配规则
IF 2.9 4区 管理学 Q2 MANAGEMENT Pub Date : 2025-06-04 DOI: 10.1111/itor.70052
Laura Davila-Pena, Peter Borm, Ignacio García-Jurado, Jop Schouten

This paper studies so-called connection scheduling problems, a type of interactive operations research problem. A connection scheduling problem combines aspects from the minimum cost spanning tree and sequencing problems. Given a graph, we aim to first establish a connection order on the players such that the total cost of connecting them to a source is minimal and second to find a fair cost allocation of such an optimal order among the players involved. We restrict our attention to connection scheduling problems on trees and propose a recursive method to solve these tree connection scheduling problems integrated with an allocation approach. This latter mechanism consistently and recursively uses benchmark endogenous myopic orders to determine potential cost savings, which will then be appropriately allocated. Interestingly, the transition process from a benchmark myopic order to an optimal one will be smooth using the switching of blocks of agents based on the basic notion of merge segments.

本文研究了连接调度问题,这是一种交互式运筹学问题。连接调度问题结合了最小开销生成树和排序问题。给定一个图,我们的目标是首先在参与者上建立一个连接顺序,使将他们连接到一个源的总成本最小,然后在相关参与者之间找到一个公平的最优顺序的成本分配。我们将注意力集中在树的连接调度问题上,并提出了一种结合分配方法的递归方法来解决这些树的连接调度问题。后一种机制一致且递归地使用基准内源性近视顺序来确定潜在的成本节约,然后将其适当地分配。有趣的是,使用基于合并段的基本概念的代理块的切换,从基准近视顺序到最优顺序的过渡过程将是平滑的。
{"title":"An allocation rule for connection scheduling problems","authors":"Laura Davila-Pena,&nbsp;Peter Borm,&nbsp;Ignacio García-Jurado,&nbsp;Jop Schouten","doi":"10.1111/itor.70052","DOIUrl":"https://doi.org/10.1111/itor.70052","url":null,"abstract":"<p>This paper studies so-called connection scheduling problems, a type of interactive operations research problem. A connection scheduling problem combines aspects from the minimum cost spanning tree and sequencing problems. Given a graph, we aim to first establish a connection order on the players such that the total cost of connecting them to a source is minimal and second to find a fair cost allocation of such an optimal order among the players involved. We restrict our attention to connection scheduling problems on trees and propose a recursive method to solve these tree connection scheduling problems integrated with an allocation approach. This latter mechanism consistently and recursively uses benchmark endogenous myopic orders to determine potential cost savings, which will then be appropriately allocated. Interestingly, the transition process from a benchmark myopic order to an optimal one will be smooth using the switching of blocks of agents based on the basic notion of merge segments.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"33 2","pages":"892-925"},"PeriodicalIF":2.9,"publicationDate":"2025-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.70052","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145196532","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
期刊
International Transactions in Operational Research
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1