Computers & Operations Research最新文献_第6页

Minimal and stable feedback arc sets and graph centrality measures 最小稳定反馈弧集和图中心性测度

IF 4.3 2区工程技术

Computers & Operations Research Pub Date : 2025-08-18 DOI: 10.1016/j.cor.2025.107247

Claudia Cavallaro, Vincenzo Cutello, Mario Pavone

引用次数: 0

Dynamic flexible job shop scheduling based on multi-dimensional space collaborative guidance evolution 基于多维空间协同引导演化的动态柔性作业车间调度

IF 4.3 2区工程技术

Computers & Operations Research Pub Date : 2025-08-11 DOI: 10.1016/j.cor.2025.107243

Zeyin Guo, Lixin Wei, Xin Li, Jinlu Zhang

{"title":"Dynamic flexible job shop scheduling based on multi-dimensional space collaborative guidance evolution","authors":"Zeyin Guo, Lixin Wei, Xin Li, Jinlu Zhang","doi":"10.1016/j.cor.2025.107243","DOIUrl":"10.1016/j.cor.2025.107243","url":null,"abstract":"<div><div>With the advancement of green manufacturing, energy-saving scheduling in production systems has become a current research focus. To achieve balanced optimization between completion time and production energy consumption targets, a multi-space guided evolutionary (MSGE) algorithm is designed to solve energy scheduling under machine failures. Additionally, a window hybrid rescheduling strategy is proposed to address the issue of machine malfunctions. Based on the equipment characteristics of the production workshop, the processing equipment is simulated into three different levels to obtain a reasonable configuration between the workpiece and the machine. To balance the convergence and diversity of the population, global and local optimization strategies are adopted to guide the population’s evolution. For the scheduling plan, a low-carbon strategy is adopted to reduce energy consumption in production. MSGE is experimentally compared with other algorithms on test cases, and the results show that the proposed MSGE algorithm outperforms other algorithms in terms of generation distance (GD) and hypervolume (HV) indicators when solving energy-flexible workshop scheduling problems.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"184 ","pages":"Article 107243"},"PeriodicalIF":4.3,"publicationDate":"2025-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144810111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Reconsidering compact measures: A multiobjective framework for ecological reserve design 重新考虑紧凑措施：生态保护区设计的多目标框架

IF 4.3 2区工程技术

Computers & Operations Research Pub Date : 2025-08-09 DOI: 10.1016/j.cor.2025.107241

Nathan Adelgren , Lakmali Weerasena , Damitha Bandara

{"title":"Reconsidering compact measures: A multiobjective framework for ecological reserve design","authors":"Nathan Adelgren , Lakmali Weerasena , Damitha Bandara","doi":"10.1016/j.cor.2025.107241","DOIUrl":"10.1016/j.cor.2025.107241","url":null,"abstract":"<div><div>This study aims to develop a refined compactness measure, a key spatial attribute in reserve design that impacts both ecological and economic efficiency. Designing ecological reserves often involves conflicting objectives, necessitating the simultaneous consideration of spatial attribute and ecological diversity. We introduce a novel metric that accounts for both size and shape in measuring reserve compactness. Additionally, we employ multiobjective optimization to generate Pareto-optimal solutions, offering stakeholders a range of high-quality reserve configurations. Our focus on compactness is particularly relevant when clusters represent distinct habitats with limited biological interactions. We compare various compactness measures, such as boundary length and pairwise distance and evaluate their suitability for inclusion in optimization models. This approach addresses diverse stakeholder priorities, leading to more balanced reserve selections. We demonstrate the shortcomings of single-objective approaches, which often yield suboptimal, non-compact reserves, and highlight the advantages of optimizing across multiple metrics to better capture the complexities of reserve design.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"184 ","pages":"Article 107241"},"PeriodicalIF":4.3,"publicationDate":"2025-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144842479","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

An exact algorithm for the Minimum Gap Graph Partitioning Problem 最小间隙图划分问题的一种精确算法

IF 4.3 2区工程技术

Computers & Operations Research Pub Date : 2025-08-07 DOI: 10.1016/j.cor.2025.107224

Maurizio Bruglieri , Gianluca Consiglio , Roberto Cordone

引用次数: 0

Geographic decompositions in railway timetable planning: Modelling and computational assessment 铁路时刻表规划中的地理分解：建模与计算评估

IF 4.3 2区工程技术

Computers & Operations Research Pub Date : 2025-08-07 DOI: 10.1016/j.cor.2025.107240

Jacob Trepat Borecka , Florin Leutwiler , Francesco Corman , Nikola Bešinović

{"title":"Geographic decompositions in railway timetable planning: Modelling and computational assessment","authors":"Jacob Trepat Borecka , Florin Leutwiler , Francesco Corman , Nikola Bešinović","doi":"10.1016/j.cor.2025.107240","DOIUrl":"10.1016/j.cor.2025.107240","url":null,"abstract":"<div><div>Railway timetable planning is the core of railway operations, which aims to make efficient use of infrastructure capacity and provide fast, punctual, and reliable services for customers. A timetable consists of a feasible train schedule adhering to operational constraints and meeting certain quality objectives, and the complexity and scale of railway networks require advanced algorithms to address large-scale instances. For this, decomposition approaches have been developed, exploiting for instance the geographical structure of the problem by partitioning the problem into more manageable smaller areas or stations and junctions. Nevertheless, it remains an open question how these specific choices balance to a different extent the computation effort to solve decomposed subproblems versus coordinating them towards a global, optimal solution. In this paper, we carry out an extensive computational analysis to evaluate the effects of diverse decomposition scenarios in a real-life case study of the Swiss Federal Railways. For this, we model and implement automatic geographic decomposition architectures based on a systematic algorithmic approach, on an existing logic-based Benders decomposition framework for railway timetable planning. In particular, we explore a process based on aggregation of areas into larger areas to generate a set of decompositions. The results of the computational analysis by means of random forests show the potential to minimize runtimes in decompositions with small number of large-sized areas with a relatively small master problem, facilitating a simpler coordination mechanism between master problem and subproblems, which strongly influences the computational effort to solve problem instances. Nonetheless, despite finding explainability in the contributions of factors to the computational effort required to solve different decompositions of the timetabling problem, the analysis also reveals complex relationships between multiple factors.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"184 ","pages":"Article 107240"},"PeriodicalIF":4.3,"publicationDate":"2025-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144830284","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Estimating production technologies using multi-output adaptive constrained enveloping splines 利用多输出自适应约束包络样条估算生产工艺

IF 4.3 2区工程技术

Computers & Operations Research Pub Date : 2025-08-06 DOI: 10.1016/j.cor.2025.107242

Victor J. España , Juan Aparicio , Xavier Barber

{"title":"Estimating production technologies using multi-output adaptive constrained enveloping splines","authors":"Victor J. España , Juan Aparicio , Xavier Barber","doi":"10.1016/j.cor.2025.107242","DOIUrl":"10.1016/j.cor.2025.107242","url":null,"abstract":"<div><div>Data Envelopment Analysis (DEA) is a widely used method for evaluating the relative efficiency of decision-making units, but it often yields overly optimistic efficiency estimates, particularly with small sample sizes. To overcome this limitation, we introduce Adaptive Constrained Enveloping Splines (ACES), a non-parametric technique based on regression splines to accommodate multi-output, multi-input production contexts. ACES employs a three-stage estimation process. In the first stage, optimal output levels are estimated while incorporating essential envelope constraints, with optional monotonicity and/or concavity adjustments as needed. In the second stage, a refinement phase is carried out in which some of the estimates made are replaced by the observed values. Finally, a DEA-type technology is constructed using a new virtual data sample, ensuring adherence to usual shape constraints. Although ACES entails a higher computational cost, it achieves substantially lower mean squared error and bias than alternative methods of the literature across a wide range of simulated scenarios. This improvement is particularly pronounced in settings with complex production structures or heterogeneous returns to scale. This performance is consistent across both noise-free and noisy data environments, underscoring the method’s robustness and accuracy.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"184 ","pages":"Article 107242"},"PeriodicalIF":4.3,"publicationDate":"2025-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144826470","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Sustainable risk mitigation in hazardous material transportation 可持续地减轻危险材料运输中的风险

IF 4.3 2区工程技术

Computers & Operations Research Pub Date : 2025-08-06 DOI: 10.1016/j.cor.2025.107228

Annarita De Maio , Gilbert Laporte , Roberto Musmanno , Francesca Vocaturo

{"title":"Sustainable risk mitigation in hazardous material transportation","authors":"Annarita De Maio , Gilbert Laporte , Roberto Musmanno , Francesca Vocaturo","doi":"10.1016/j.cor.2025.107228","DOIUrl":"10.1016/j.cor.2025.107228","url":null,"abstract":"<div><div>The transportation of hazardous material involves the movement of freight representing a high risk to health, safety, and the environment. Due to its nature, hazardous material transportation is regulated by strict laws and must be treated separately from classical transportation. This study addresses road transportation of hazardous materials as a variant of the hazmat vehicle routing and scheduling problem with time windows. The model incorporates a multi-criteria risk measure, balancing factors such as accident probability, population density, distance from fire stations, and traffic conditions, while considering time-dependent travel times divided into distinct time zones. The problem is formulated as a three-objective optimization model to minimize total risk, arrival time, and vehicle cost. A late acceptance hill-climbing heuristic is introduced to obtain feasible solutions. Computational experiments on test instances demonstrate the heuristic’s efficiency and its ability to generate high-quality solutions in reduced execution times. Subsequently, the heuristic is applied to a case study on a Northern Italy road network involving the transportation of compressed oxygen by a logistics operator, providing actionable managerial insights.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"184 ","pages":"Article 107228"},"PeriodicalIF":4.3,"publicationDate":"2025-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144810110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A cardinality constrained iterated local search for the virtual machine placement problem 基于基数约束的迭代局部搜索求解虚拟机布局问题

IF 4.3 2区工程技术

Computers & Operations Research Pub Date : 2025-08-05 DOI: 10.1016/j.cor.2025.107222

Qing Zhou , Yuru Li , Jin-Kao Hao , Qinghua Wu , Yuning Chen

{"title":"A cardinality constrained iterated local search for the virtual machine placement problem","authors":"Qing Zhou , Yuru Li , Jin-Kao Hao , Qinghua Wu , Yuning Chen","doi":"10.1016/j.cor.2025.107222","DOIUrl":"10.1016/j.cor.2025.107222","url":null,"abstract":"<div><div>The virtual machine placement (VMP) problem is a critical task in the field of cloud computing. The assignment of virtual machines to physical machines affects the quality of cloud services and running cost. Given a set of physical machines with certain capacities and a set of virtual machines with requirements, VMP aims to allocate each virtual machine to a capacity constrained physical machine in such a way that the total number of the physical machines used is minimized while their usage does not exceed the capacity. In this study, a cardinality constrained iterated local search algorithm is proposed to solve the VMP problem by transforming VMP into a sequence of cardinality-constrained problems, where each problem involves a fixed number <span><math><mi>k</mi></math></span> of physical machines. The algorithm uses the tabu search procedure for solution improvement, which exploits two new neighborhoods based on dedicated evaluation functions for neighboring solution selection. In addition, it uses a simple perturbation strategy to prevent the algorithm from search stagnation. Numerical results show that the proposed algorithm is highly competitive in both solution quality and computational efficiency, compared to several state-of-the-art algorithms on 18 subsets of 1800 widely used benchmark instances. Specifically, the algorithm reports the best results in terms of the average objective values on 17 out of 18 instance subsets with a short run time of 5 s. Importantly, using the lower bounds, it proves for the first time the optimality of solutions for 1390 instances. We study the impact of the key components of the algorithm on its performance.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"184 ","pages":"Article 107222"},"PeriodicalIF":4.3,"publicationDate":"2025-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144779901","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Flow shop scheduling with inter-stage flexibility and blocking constraints 具有分段柔性和阻塞约束的流水车间调度

IF 4.3 2区工程技术

Computers & Operations Research Pub Date : 2025-07-30 DOI: 10.1016/j.cor.2025.107219

Gaia Nicosia , Andrea Pacifici , Ulrich Pferschy , Anna Russo Russo , Cecilia Salvatore

{"title":"Flow shop scheduling with inter-stage flexibility and blocking constraints","authors":"Gaia Nicosia , Andrea Pacifici , Ulrich Pferschy , Anna Russo Russo , Cecilia Salvatore","doi":"10.1016/j.cor.2025.107219","DOIUrl":"10.1016/j.cor.2025.107219","url":null,"abstract":"<div><div>We investigate a scheduling problem arising from a material handling and processing problem in a production line of an Austrian company building prefabricated house walls. The addressed problem is a permutation flow shop with blocking constraints in which the machine of at least one stage can process a number operations of two other stages in the system. This situation is usually referred to as multi-task or inter-stage flexibility.</div><div>The problem is inherently NP-hard; however, we identify some special cases that can be solved in polynomial time. For the general case, with an arbitrary number of machines, jobs, and operations per job, we propose a range of heuristic algorithms, with a particular emphasis on matheuristics based on two distinct mixed-integer linear programming (MIP) formulations of the problem. These matheuristics utilize the strengths of exact optimization techniques while introducing flexibility to address limits on computation time. To assess the performance of the proposed approaches, we conduct an extensive computational study on randomly generated test cases based on real-world instances.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"184 ","pages":"Article 107219"},"PeriodicalIF":4.3,"publicationDate":"2025-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144738520","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Exact and matheuristic algorithms for robust lot-sizing and scheduling problems with uncertain capacity 具有不确定容量的鲁棒批量和调度问题的精确数学算法

IF 4.3 2区工程技术

Computers & Operations Research Pub Date : 2025-07-30 DOI: 10.1016/j.cor.2025.107218

Bo Jiang , Yuexin Kang , Xinglu Liu , Canrong Zhang

{"title":"Exact and matheuristic algorithms for robust lot-sizing and scheduling problems with uncertain capacity","authors":"Bo Jiang , Yuexin Kang , Xinglu Liu , Canrong Zhang","doi":"10.1016/j.cor.2025.107218","DOIUrl":"10.1016/j.cor.2025.107218","url":null,"abstract":"<div><div>Uncertain capacity, resulting from unforeseen events such as machinery breakdowns and operator errors, etc., poses significant risks to the production stability and efficiency. In this paper, we consider capacity uncertainty and develop production plans with robust capabilities to withstand risks. Specifically, this study extends the traditional lot-sizing and scheduling problem (LSP) to the robust LSP (R-LSP) by addressing a multi-period LSP in a flexible flow shop with uncertain machine capacity, which means that the available working time for each machine is uncertain and fluctuates within a certain range during each period. This paper develops a two-stage robust optimization model, where the first stage focuses on the scheduling problem determining the configuration of each flexible machine during each period, while the second stage addresses the lot-sizing problem determining the lot sizes of each operation for each product. Furthermore, a tailored column-and-constraint generation algorithm and a genetic algorithm-based matheuristic are proposed. Extensive numerical experiments demonstrate that the tailored column-and-constraint generation algorithm effectively solves the proposed two-stage robust optimization model, resulting in optimal production plans with high resilience to capacity uncertainty. Moreover, the genetic algorithm-based matheuristic offers satisfactory solutions for large-scale complex problems. Sensitivity analysis of the robust parameters and performance evaluations verify the effectiveness and efficiency of the proposed robust model and algorithms.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"184 ","pages":"Article 107218"},"PeriodicalIF":4.3,"publicationDate":"2025-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144772976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0