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

Relax-and-Fix and Fix-and-Optimise algorithms to solve an integrated network design problem for closing a supply chain with hybrid retailers/collection centres 放松-修复和修复-优化算法，以解决与混合零售商/收集中心关闭供应链的集成网络设计问题

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2025-01-16 DOI: 10.1016/j.cor.2025.106981

Mehdi Amiri-Aref , Mahdi Doostmohammadi

{"title":"Relax-and-Fix and Fix-and-Optimise algorithms to solve an integrated network design problem for closing a supply chain with hybrid retailers/collection centres","authors":"Mehdi Amiri-Aref , Mahdi Doostmohammadi","doi":"10.1016/j.cor.2025.106981","DOIUrl":"10.1016/j.cor.2025.106981","url":null,"abstract":"<div><div>This paper studies a multi-echelon closed-loop supply chain network design problem that is characterised by a set of hybrid retailers/collection centres in a multi-period setting. This problem is motivated by the return-to-retail approach currently prevalent in the retail industry under the deposit return scheme. This paper proposes a mathematical programming model that integrates strategic decisions regarding the number and location of hybrid retailer/collection centre facilities, with dynamic decisions pertaining to manufacturing and remanufacturing/recycling, inventory level, and fleet size across the network. This optimisation problem is formulated as a mixed integer linear programming model to fulfil customers’ demands while minimising the total network costs. To solve the problem, a matheuristic solution approach is devised, incorporating Relax-and-Fix and Fix-and-Optimise heuristics augmented by novel relaxation and fixing strategies. We introduce an integrality test which accounts for possible rounding-off errors allowing a user-defined integer feasibility tolerance. Moreover, a variable partitioning is applied to shrink the problem’s dimensions and to shorten the search space. The latter is then iteratively updated to explore neighbourhoods within a given search radius size. To evaluate the validity and efficiency of the proposed model and the solution approach, 90 instances are generated using a case study within the geographical scope limited to the network of a retail chain in France. Numerical results show that the proposed solution method provides near-optimal solutions for small- and medium-size instances in a reasonable computational time and outperforms the commercial solver for large- and extra large-size problems. Managerial insights derived from the computational experiments regarding key performance indicators of the problem are presented and discussed.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"177 ","pages":"Article 106981"},"PeriodicalIF":4.1,"publicationDate":"2025-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143133016","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

Ultrametric location and parsimonious representation 超精密定位与简约表示

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2025-01-13 DOI: 10.1016/j.cor.2025.106977

Frank Plastria , Francisco Guevara

引用次数: 0

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2025-01-12 DOI: 10.1016/j.cor.2024.106968

Xiaoming Wang, Songping Zhu, Qingxin Chen

{"title":"Unrelated parallel machine scheduling with random rework and limited preemption","authors":"Xiaoming Wang, Songping Zhu, Qingxin Chen","doi":"10.1016/j.cor.2024.106968","DOIUrl":"10.1016/j.cor.2024.106968","url":null,"abstract":"<div><div>This study examines the problem of unrelated parallel machine scheduling with random rework and limited preemption. In this setting, new rework jobs are permitted to preempt ongoing jobs, provided that preempted jobs are resumed on the same machine. Due to the inherent complexity of this problem, exact methods based on stochastic dynamic programming are impractical for real-world applications. To address this issue, several efficient approximate methods are proposed to derive suboptimal policies for large-scale problems. First, a mixed integer programming model and several modified metaheuristics, based on aggregate duration estimation, are proposed to solve the decision problem in each state. Subsequently, a two-stage heuristic algorithm is presented. This algorithm first employs a priority rule to sort waiting jobs and then assigns them to machines using a mathematical programming approach. Computational experiments are conducted to evaluate the performance of the proposed methods. The results demonstrate that significant improvements can be achieved by incorporating limited preemption. The modified metaheuristics exhibit superior overall performance in large-scale problems, while the two-stage heuristic algorithm is most effective in a large-scale and very loose due date problem environment. Furthermore, sensitivity analysis on rework intensity reveals an approximately positive linear correlation between the benefits of preemption and rework intensity in large-scale problems.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"177 ","pages":"Article 106968"},"PeriodicalIF":4.1,"publicationDate":"2025-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143132603","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

Integer programming approaches for distributionally robust chance constraints with adjustable risks 具有可调风险的分布鲁棒机会约束的整数规划方法

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2025-01-10 DOI: 10.1016/j.cor.2025.106974

Yiling Zhang

引用次数: 0

A MILP formulation and an Iterated Local Search-based algorithm for the grinding ball replacement planning problem 基于迭代局部搜索的磨球更换规划问题的MILP公式和算法

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2025-01-10 DOI: 10.1016/j.cor.2025.106975

Daniel L. de Souza , Mário S. Santos , Cássio P. Costa , Marcone J.F. Souza , Luciano P. Cota

{"title":"A MILP formulation and an Iterated Local Search-based algorithm for the grinding ball replacement planning problem","authors":"Daniel L. de Souza , Mário S. Santos , Cássio P. Costa , Marcone J.F. Souza , Luciano P. Cota","doi":"10.1016/j.cor.2025.106975","DOIUrl":"10.1016/j.cor.2025.106975","url":null,"abstract":"<div><div>This study introduces the grinding ball replacement planning problem. This problem arises in the grinding process of ore mining industries. The aim is to optimize the replacement of the grinding balls to maintain the specific energy consumption and percentage of the final product particle size of the grinding process for the subsequent beneficiation stage of the plant within the recommended values during daily operation. We propose a fuzzy controller to determine the recommended power for the mills and a predictive model to estimate their power from operational data. We also introduce a mixed-integer linear programming formulation and design an Enhanced Iterated Local Search-based (E-ILS) algorithm specialized in deciding the instant and bulk weight of the grinding balls to be replaced into each mill throughout a work shift. We have embedded the E-ILS algorithm into a decision system with a two-level architecture. The higher level proposes the grinding ball replacement through the E-ILS, and the lower level executes this solution through an industrial programmable logic controller. We tested the solution methods using 30 instances representing production data from 15 days in 12-h daily work shifts of the grinding process at Usina Cauê of Vale S.A., Brazil. Compared with Gurobi, the E-ILS achieved the optimal solutions in all instances, with an average variability of 1%. Compared with the current solution method, the E-ILS results showed savings of up to 40% in costs with grinding media replacement.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"177 ","pages":"Article 106975"},"PeriodicalIF":4.1,"publicationDate":"2025-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143132567","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 constraint programming-based lower bounding procedure for the job shop scheduling problem 基于约束规划的作业车间调度问题下边界算法

IF 4.1 2区工程技术

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

Francisco Yuraszeck , Gonzalo Mejía , Daniel Alejandro Rossit , Armin Lüer-Villagra

引用次数: 0

An adaptive large neighborhood search for unrelated parallel machine scheduling with setup times and delivery times 具有设置时间和交付时间的不相关并行机器调度的自适应大邻域搜索

IF 4.1 2区工程技术

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

Fulong Xie , Kai Li , Jianfu Chen , Wei Xiao , Tao Zhou

{"title":"An adaptive large neighborhood search for unrelated parallel machine scheduling with setup times and delivery times","authors":"Fulong Xie , Kai Li , Jianfu Chen , Wei Xiao , Tao Zhou","doi":"10.1016/j.cor.2025.106976","DOIUrl":"10.1016/j.cor.2025.106976","url":null,"abstract":"<div><div>This paper investigates the problem of scheduling jobs on unrelated parallel machines, considering setup times and delivery times. The objective is to minimize the total weighted service time, which is the sum of the job’s completion time and delivery time. To address the problem, we introduce a mixed-integer programming model that is solved by the commercial solver CPLEX. Due to the NP-hardness of the problem, an adaptive large neighborhood search (ALNS) is developed to solve large-scale instances. The ALNS integrates effective operators and an initial solution generation method. Moreover, we propose a local search that consists of the problem’s lemmas and random variable neighborhood descent. To assess the performance of metaheuristic algorithms, a column generation algorithm (CG) is proposed. Afterwards, we carry out extensive numerical experiments on 4200 instances with up to 20 machines and 320 jobs. The results on small-scale instances show that the CG is capable of obtaining lower bounds tighter than those of the CPLEX, and ALNS is able to obtain solutions that are not inferior to the CPLEX in a very short time (0.33s). Furthermore, results on large-scale instances demonstrate that the duality gap between the upper and lower bounds of the ALNS is smaller than that of four state-of-the-art metaheuristic algorithms designed to solve similar problems.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"177 ","pages":"Article 106976"},"PeriodicalIF":4.1,"publicationDate":"2025-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143132571","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

Seru scheduling problem with lot streaming and worker transfers: A multi-objective approach 具有批流和工人转移的Seru调度问题：一个多目标方法

IF 4.1 2区工程技术

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

Beren Gürsoy Yılmaz , Ömer Faruk Yılmaz , Elif Akçalı , Emre Çevikcan

{"title":"Seru scheduling problem with lot streaming and worker transfers: A multi-objective approach","authors":"Beren Gürsoy Yılmaz , Ömer Faruk Yılmaz , Elif Akçalı , Emre Çevikcan","doi":"10.1016/j.cor.2024.106967","DOIUrl":"10.1016/j.cor.2024.106967","url":null,"abstract":"<div><div>Seru production system (SPS) offers the flexibility of job shop production environments with the efficiency of traditional assembly lines. The SPSs are particularly attractive to industries characterized by high product variety and micro production volumes, and effective utilization of production and workforce resources is a critical challenge for SPSs. This paper addresses the seru scheduling problem with lot streaming and worker transfers for a SPS using a multi-objective approach. To this end, first, a multi-objective mixed-integer linear programming (MILP) model is developed for the minimization of makespan, average flow time, and maximum workload imbalance. Six different algorithms based on non-dominating sorting genetic algorithm II (NSGA-II) are developed<em>,</em> each corresponding to an operational setting dictated by the lot streaming and worker transfers strategies in effect. A design of experiment (DoE) framework is utilized to generate realistic problem instances based on the several controllable factors and their levels. Analysis of comprehensive computational results demonstrates the effectiveness of the proposed algorithm (NS2) in finding high-quality and diversified solutions by simultaneous utilization of lot streaming with variable-sized sublots and worker transfers. The results indicate that the performance improvement achieved by the NS2 ranges between 10% and 20% compared to other algorithms. Furthermore, Analysis of Variance (ANOVA) confirms the significance of the number of workers and number of serus as critical parameters for the design or redesign of SPSs. Drawing on these findings, managerial insights are provided regarding the impact of lot streaming and worker transfers on SPS performance. This study offers practical and theoretical insights for decision-makers seeking to enhance SPS performance and bridge the gap between the conceptual analysis and practical implementation of SPSs.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"177 ","pages":"Article 106967"},"PeriodicalIF":4.1,"publicationDate":"2025-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143132569","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

Improved linear programming relaxations for flow shop problems with makespan minimization 带最大完工时间最小化的流水车间问题的改进线性规划松弛

IF 4.1 2区工程技术

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

Roderich Wallrath , Meik Franke , Matthias Walter

{"title":"Improved linear programming relaxations for flow shop problems with makespan minimization","authors":"Roderich Wallrath , Meik Franke , Matthias Walter","doi":"10.1016/j.cor.2024.106970","DOIUrl":"10.1016/j.cor.2024.106970","url":null,"abstract":"<div><div>Machine scheduling problems with makespan minimization have been addressed in various academic and industrial fields using mixed-integer programming (MIP). In most MIP models, however, the makespan variable is poorly linked to the natural date variables of jobs. To address this, we propose novel, strengthening inequalities, derived from the single-machine scheduling polyhedron augmented by a makespan variable. While the associated optimization problem for a single machine is trivial, these inequalities can be applied as cutting planes to more complicated scheduling problems. In this work, we demonstrate their use for non-permutation flow shops. Using the Taillard benchmark set, we analyze the effect of the inequalities on the linear programming relaxations and mixed-integer programs of three commonly used MIP models. The experiments show that the inequalities significantly improve the ability of linear-ordering and time-indexed models to bound the optimum. The positive effect also extends to linear-ordering models with changeover times, demonstrating the potential of these inequalities to improve more general, application-oriented flow shop problems.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"177 ","pages":"Article 106970"},"PeriodicalIF":4.1,"publicationDate":"2025-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143132633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Designing visually and operationally attractive routes to improve driver acceptance in road cleaning vehicle routing problem 设计具有视觉和操作吸引力的路线，以提高司机对道路清洁车辆路线问题的接受度

IF 4.1 2区工程技术

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

Mingwei Chen, Xiaofang Wang, Linning Cai, Liang Ma

{"title":"Designing visually and operationally attractive routes to improve driver acceptance in road cleaning vehicle routing problem","authors":"Mingwei Chen, Xiaofang Wang, Linning Cai, Liang Ma","doi":"10.1016/j.cor.2025.106973","DOIUrl":"10.1016/j.cor.2025.106973","url":null,"abstract":"<div><div>As urbanization accelerates, the planning of effective operating routes for urban road cleaning fleets has become a significant concern for municipalities. However, traditional vehicle routing algorithms often overlook drivers’ route preferences, resulting in poor driver acceptance. This study aims to design routes that are simultaneously cost-effective and attractive to drivers, thereby facilitating the implementation of efficient algorithms. Based on an analysis of road cleaning tasks and driver behavior, we introduce the concept of ”operational attractiveness” to complement the notion of visual attractiveness in road cleaning contexts. Two strategies are proposed for improving driver acceptance: imitating drivers’ routing behavior and reducing route overlap. The first strategy enhances the operational attractiveness of the route, while the second focuses on its visual attractiveness. We have integrated these two strategies into Randomized-Merge (RM), which is known for its remarkable cost-optimization performance. Numerical experiments on one real-world instance and ten new randomly generated instances show that the proposed heuristics can generate routes with lower cost than RM. Moreover, these routes are more attractive based on operational and visual metrics.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"177 ","pages":"Article 106973"},"PeriodicalIF":4.1,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143132570","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