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

A MILP formulation and an Iterated Local Search-based algorithm for the grinding ball replacement planning problem

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

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

An efficient solution methodology for the airport slot allocation problem with preprocessing and column-and-row generation

IF 4.1 2区工程技术

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

Paula Fermín Cueto, Sergio García, Miguel F. Anjos

{"title":"An efficient solution methodology for the airport slot allocation problem with preprocessing and column-and-row generation","authors":"Paula Fermín Cueto, Sergio García, Miguel F. Anjos","doi":"10.1016/j.cor.2024.106972","DOIUrl":"10.1016/j.cor.2024.106972","url":null,"abstract":"<div><div>Airport coordination is a demand control mechanism that maximizes the use of existing infrastructure at congested airports. Aircraft operators submit a list of regular flights that they wish to operate over a five to seven-month period and a designated coordinator is responsible for allocating the available airport slots, which represent the permission to operate a flight at a specific date and time. From an optimization perspective, this problem is a special class of the Resource Constrained Project Scheduling Problem where the objective is to minimize the difference between the allocated and requested slots subject to airport capacity constraints and other operational restrictions. Most studies on the topic focus on developing complex models and fast heuristics. Little attention has been paid to exact methods despite their potential to obtain higher quality solutions with better airline acceptability and fewer slot rejections. In this paper, we present Caracal, an efficient column-and-row generation algorithm to solve the single airport slot allocation problem. We also present a problem-specific preprocessing scheme that can identify more redundant constraints and variables than a commercial solver in a fraction of the time. We propose a novel formulation to model historic overages in Level 3 airports, and we find optimal or near optimal solutions to instances originating from practical slot allocation models and real data from UK airports coordinated by Airport Coordination Limited significantly faster than the best exact method in the literature to date. We also conduct experiments on a set of synthetic, realistic instances that we include in this paper, along with the code to generate them, to facilitate benchmarking of slot allocation software.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"177 ","pages":"Article 106972"},"PeriodicalIF":4.1,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143132565","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

Transportation and carbon emissions costs minimization for time-dependent vehicle routing problem with drones

IF 4.1 2区工程技术

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

Yong Peng , Zhi Ren , Dennis Z. Yu , Yonghui Zhang

{"title":"Transportation and carbon emissions costs minimization for time-dependent vehicle routing problem with drones","authors":"Yong Peng , Zhi Ren , Dennis Z. Yu , Yonghui Zhang","doi":"10.1016/j.cor.2024.106963","DOIUrl":"10.1016/j.cor.2024.106963","url":null,"abstract":"<div><div>Integrating drones in package delivery has emerged as an innovative application of unmanned aerial vehicle (UAV) technology in the logistics and transportation sector. In this context, trucks serve a dual role as delivery vehicles for customers and launch platforms for drones. Drones are deployed for efficient package delivery and can be retrieved from predetermined rendezvous locations using trucks. Our study explicitly targets the collaborative package delivery approach between trucks and drones within urban environments. To optimize this collaboration, we develop a mixed-integer programming (MIP) model for the time-dependent vehicle routing problem with drones (TDVRP-D), which aims to minimize the transportation costs of both trucks and drones, along with the carbon emissions costs associated with trucks. To solve this complex problem efficiently, we propose a highly effective metaheuristic algorithm based on the variable neighborhood search (VNS) technique. Through extensive experimental studies and rigorous comparisons with existing methods, we demonstrate the superiority of our proposed algorithm in terms of solution quality and computational efficiency, particularly for large-scale instances.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"176 ","pages":"Article 106963"},"PeriodicalIF":4.1,"publicationDate":"2025-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143166419","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

Towards green manufacturing: Co-optimizing capacity expansion planning of production and renewable energy generation with endogenous uncertainty

IF 4.1 2区工程技术

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

Xin Zhou , Bo Zeng , Feng Cui , Na Geng

{"title":"Towards green manufacturing: Co-optimizing capacity expansion planning of production and renewable energy generation with endogenous uncertainty","authors":"Xin Zhou , Bo Zeng , Feng Cui , Na Geng","doi":"10.1016/j.cor.2024.106971","DOIUrl":"10.1016/j.cor.2024.106971","url":null,"abstract":"<div><div>The manufacturing industry stands as a significant consumer of electricity, for which the production of renewable energy through integrated distributed generation systems represents a sustainable alternative. However, uncertainty about customer demand and energy generation poses challenges for capacity planning. In this paper, we aim to address the joint decision-making for production capacity and renewable energy-generation capacity. To this end, we first establish a two-stage robust optimization (TRO) framework that considers uncertain product demand and generation rates, with the objective of minimizing the total costs. The TRO encompasses not only strategic decisions on production and electricity-generation capacity, but also tactical decisions on production planning, inventory, and emission targets. To solve this model, we propose a pre-check parametric column and constraint generation (PP-C&CG) algorithm. Subsequent validation with benchmark data and application to two practical cases demonstrate that our proposed joint-decision approach is more efficient than non-robust decisions. Lastly, despite its additional costs, our approach based on robust decisions offers practical utility in addressing worst-case scenarios characterized by considerable uncertainty.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"176 ","pages":"Article 106971"},"PeriodicalIF":4.1,"publicationDate":"2025-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143166422","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

Capacity planning to cope with demand surges in fourth-party logistics networks under chance-constrained service levels

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-12-30 DOI: 10.1016/j.cor.2024.106956

Songchen Jiang , Min Huang , Yunan Liu , Yuxin Zhang , Xingwei Wang

{"title":"Capacity planning to cope with demand surges in fourth-party logistics networks under chance-constrained service levels","authors":"Songchen Jiang , Min Huang , Yunan Liu , Yuxin Zhang , Xingwei Wang","doi":"10.1016/j.cor.2024.106956","DOIUrl":"10.1016/j.cor.2024.106956","url":null,"abstract":"<div><div>In this paper, we study a capacity planning problem for a <em>fourth-party logistics network</em> (4PLN) in the face of event-triggered demand surges. We aim to solve a stochastic optimization problem in order to minimize the total cost for the 4PLN under chance-constrained service-level targets, where the stochastic demand process is modeled as a summation of random variables with a Bernoulli term of jump processes. At the heart of our solution procedure is a greedy pricing and weighting strategy based cell-and-bound (G-C&B) algorithm designed for solving the SAA-based model. Compared to the standard C&B method, our G-C&B is able to largely reduce the number of non-essential cell enumerations and achieve reduced running time complexity. To mitigate the performance degradation due to large system scale and/or sample instance, we extend our base algorithm to a two-step <em><strong>L</strong>ocal <strong>E</strong>xperimentation for <strong>G</strong>lobal <strong>O</strong>ptimization strategy based cell-and-bound</em> (LEGO-C&B) framework, in which we first solve a small-scale training problem to find the important scenarios (eliminating excessive cell enumerations) and then use the training results to expedite the full optimization problem. We evaluate the performance of our algorithms by conducting a comprehensive series of numerical experiments. Besides, our results also demonstrate how the effectiveness of our methods depends on various factors including (<em>i</em>) the algorithm’s hyperparameters such as the sample size and training ratio, and (<em>ii</em>) the 4PLN’s input parameters such as the network scale, surge demand frequency, and rental price of 3PL resource. Our results exhibit several qualitative insights.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"176 ","pages":"Article 106956"},"PeriodicalIF":4.1,"publicationDate":"2024-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143166425","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