Computers & Operations Research最新文献

A new composite heuristic to minimize the total tardiness for the single machine scheduling problem with variable and flexible maintenance

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-09-14 DOI: 10.1016/j.cor.2024.106849

{"title":"A new composite heuristic to minimize the total tardiness for the single machine scheduling problem with variable and flexible maintenance","authors":"","doi":"10.1016/j.cor.2024.106849","DOIUrl":"10.1016/j.cor.2024.106849","url":null,"abstract":"<div><p>Inspired by a real-world maintenance/job scheduling issue coming from the semiconductor industry, the present paper proposes a new heuristic algorithm structure for the single machine scheduling T-problem with flexible and variable maintenance, job release dates and sequence dependence setup times. Considering the typical short-term production planning needs, a single maintenance problem has to be scheduled within a certain time interval, along with a set of jobs so as to minimize the total tardiness. A twofold contribution emerges from the present paper. First, four mixed-integer linear programming models are developed for the problem at hand and compared in terms of time to convergence and computational complexity. Second, a novel heuristic algorithm, which has been configured into three distinct variants, has been compared with 17 alternative heuristics from the relevant literature based on a comprehensive experimental campaign. The numerical results allow the selection of the most suitable MILP model and confirm the effectiveness of the proposed heuristic approach.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0305054824003216/pdfft?md5=cef462ee4df1d37c9ee1f481090dd904&pid=1-s2.0-S0305054824003216-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142238552","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

An effective two-stage heuristic for scheduling the distributed assembly flowshops with sequence dependent setup times

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-09-13 DOI: 10.1016/j.cor.2024.106850

{"title":"An effective two-stage heuristic for scheduling the distributed assembly flowshops with sequence dependent setup times","authors":"","doi":"10.1016/j.cor.2024.106850","DOIUrl":"10.1016/j.cor.2024.106850","url":null,"abstract":"<div><p>This paper studies the Distributed Assembly Permutation Flowshop Scheduling Problem with Sequence Dependent Setup Times (DAPFSP-SDST). The optimization objective is minimization of maximal completion time (makespan), and it is shown that minimizing the sum of Total Setup Times for Assembling Products (TSTAP) and Total Idle Times on Assembly Machine (TITAM) is equivalent to minimizing the makespan. Additionally, minimization of TSTAP and TITAM can be transformed into sequencing problems of products and jobs within critical products, respectively. We also find out that a product sequence essentially explores an area in the solution space, with solutions in the area having the same TSTAP but different TITAMs determined by Critical-Jobs-Sequences (CJSs). Based on the new findings, an effective Two-Stage Heuristic Algorithm (TSHA) is proposed to first obtain promising product sequences and then exploit the corresponding areas for the DAPFSP-SDST. At the first stage of TSHA, high-quality initial product sequences are obtained through a constructive method and two Neighborhood Descent for Product Sequence (NDPS) algorithms are presented for more potential searching areas. At the second stage, a Neighborhood Descent for CJS (NDCJS) is designed to find CJSs with TITAM as small as possible. Evaluations on a benchmark instance set show that TSHA achieves better performance compared to the existing <em>meta</em>-heuristic and hyper-heuristic algorithms on the DAPFSP-SDST. Another impressive advantage of the TSHA is its low computational cost, as it is a heuristic algorithm with some neighborhood search operators.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142238554","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 multi-criteria districting approach with a lexicographic compactness metric: An application to the Chilean postal service

IF 4.1 2区工程技术

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

{"title":"A multi-criteria districting approach with a lexicographic compactness metric: An application to the Chilean postal service","authors":"","doi":"10.1016/j.cor.2024.106845","DOIUrl":"10.1016/j.cor.2024.106845","url":null,"abstract":"<div><p>Recent trends in customer habits have greatly affected last-mile logistics, increasing the pressure to effectively serve an increasing demand. For traditional postal mail companies, this change is an opportunity to alleviate the decreasing role of conventional mail within society and to focus on new products and services. Unfortunately, these changes also affect the efficiency of their supply chains, which were focused on delivering letters. In this work we consider the last-mile reorganization problem as faced by <em>Correos de Chile</em>, the Chilean public postal service. While this work is mostly focused on the particular needs of the company, the approach applies to other scenarios where the work allocation can be modeled as a districting problem with multiple simultaneous objectives and special shape conditions on the districts. To solve the proposed model, a multi-criteria heuristic procedure based on a combination of different neighborhood structures, each geared towards specific characteristics of the problem, is put forward. The applicability of the approach on large-size real-life conditions is tested on instances derived from real life operations showing the applicability of the proposed method.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142238553","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

Classification and comparison of integer programming formulations for the single-machine sequencing problem 单机排序问题整数编程公式的分类和比较

IF 4.1 2区工程技术

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

引用次数: 0

Service Selection under Uncertainty 不确定情况下的服务选择

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-09-11 DOI: 10.1016/j.cor.2024.106847

{"title":"Service Selection under Uncertainty","authors":"","doi":"10.1016/j.cor.2024.106847","DOIUrl":"10.1016/j.cor.2024.106847","url":null,"abstract":"<div><p>Cloud computing has emerged as a popular computing paradigm, providing scalable and pay-per-use services to execute a variety of tasks. However, selecting the most suitable cloud services for a client can be challenging, as it involves taking into account the service characteristics and a set of client restrictions. In this paper, we formalize the problem of Service Selection under Uncertainty (<span>SSuU</span>) as an optimization problem. Our goal is to allocate tasks to appropriate cloud services while considering the probability of Service Level Agreement (SLA) violations and a set of client restrictions. We introduce an efficient dynamic programming approach to calculate the probability of SLA violations incrementally over time. We prove that the <span>SSuU</span> problem is strongly <span><math><mi>NP</mi></math></span>-complete, and propose an Integer Linear Programming (ILP) formulation and an Iterated Local Search-based algorithm for tackling it. To facilitate evaluation, we also introduce a set of benchmark instances for the <span>SSuU</span> problem. We extensively evaluate our proposed solutions on 94 input instances and compare them to the exact method (i.e., which always produces the optimal solution). Our results demonstrate that the metaheuristic approach is significantly faster and leads to exact solutions in the great majority of the evaluation scenarios.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142172209","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

Automatic algorithm selection for Pseudo-Boolean optimization with given computational time limits 在给定计算时间限制的情况下为伪布尔优化自动选择算法

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-09-05 DOI: 10.1016/j.cor.2024.106836

{"title":"Automatic algorithm selection for Pseudo-Boolean optimization with given computational time limits","authors":"","doi":"10.1016/j.cor.2024.106836","DOIUrl":"10.1016/j.cor.2024.106836","url":null,"abstract":"<div><p>Machine learning (ML) techniques have been proposed to automatically select the best solver from a portfolio of solvers. They have been applied to various problems including Boolean Satisfiability, Traveling Salesperson and Graph Coloring. These techniques are used to implement <em>meta-solvers</em> that receive, as input, the instance of a problem, predict the best-performing solver in the portfolio, and execute it to deliver a solution. Typically, the quality of the solution improves with a longer computational time. This has led to the development of <em>anytime meta-solvers</em>, which consider both the instance and a user-prescribed computational time limit. <em>Anytime meta-solvers</em> predict the best-performing solver within the specified time limit. In this study, we focus on designing anytime meta-solvers for the NP-hard optimization problem of <em>Pseudo-Boolean Optimization</em> (PBO), which generalizes Satisfiability and Maximum Satisfiability problems. The effectiveness of our approach is demonstrated via extensive empirical study in which our anytime meta-solver, named PBO_MS, improves dramatically on the performance of Mixed Integer Programming solver Gurobi, which is the best-performing single solver in the portfolio. We generalize the anytime meta-solver by predicting a given number <span><math><mrow><mi>p</mi><mo>≥</mo><mn>1</mn></mrow></math></span> of best solvers in the portfolio and then run these, each with equal share of the specified time limit. This anytime <span><math><mi>p</mi></math></span>-meta-solver is shown here to outperform both the anytime 1-meta-solver as well as a fixed selection of <span><math><mi>p</mi></math></span> solvers by a wide margin.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142149125","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 algorithm with exact bounds for coverage path planning in UAV-based search and rescue under windy conditions 大风条件下无人机搜救覆盖路径规划的精确边界算法

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-09-05 DOI: 10.1016/j.cor.2024.106822

{"title":"An algorithm with exact bounds for coverage path planning in UAV-based search and rescue under windy conditions","authors":"","doi":"10.1016/j.cor.2024.106822","DOIUrl":"10.1016/j.cor.2024.106822","url":null,"abstract":"<div><p>Unmanned aerial vehicles (UAVs) are increasingly utilized in global search and rescue efforts, enhancing operational efficiency. In these missions, a coordinated swarm of UAVs is deployed to efficiently cover expansive areas by capturing and analyzing aerial imagery and footage. Rapid coverage is paramount in these scenarios, as swift discovery can mean the difference between life and death for those in peril. This paper focuses on planning the flight paths for multiple UAVs in windy conditions to efficiently cover rectangular search areas in minimal time. We address this challenge by dividing the search area into a grid network and formulating it as a mixed-integer program (MIP). We derive a precise lower bound for the objective function and develop a fast algorithm with a proven capability of finding either the optimal solution or a near-optimal solution with a constant absolute gap to optimality. Notably, as the problem complexity increases, our solution exhibits a diminishing relative optimality gap while maintaining negligible computational costs compared to the MIP approach. The fast execution speed of the algorithms is demonstrated by numerical experiments with area sizes up to 10,000 grid cells.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142149127","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

Risk-averse distributionally robust optimization for construction waste reverse logistics with a joint chance constraint 具有联合机会约束的建筑垃圾逆向物流的风险规避分布稳健优化

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-09-04 DOI: 10.1016/j.cor.2024.106829

引用次数: 0

The Dial-a-Tour Problem 拨号旅游问题

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-09-03 DOI: 10.1016/j.cor.2024.106832

{"title":"The Dial-a-Tour Problem","authors":"","doi":"10.1016/j.cor.2024.106832","DOIUrl":"10.1016/j.cor.2024.106832","url":null,"abstract":"<div><p>This article delves into the Dial-a-Tour Problem (DATP) frequently encountered in local travel agencies, known for their personalized and hands-on customer service. In the DATP, multiple tourist groups are efficiently matched with different vehicles using vanpooling, maximizing vehicle occupancy while ensuring seamless transfers to the local attractions included in their booked tours. Each tourist group is picked up from and returned to their respective hotels after their journey. The predetermined locations and the sequence of visits for each tour are known in advance. Therefore, the primary objective is to minimize the number of vehicles required to fulfill all requests and maintain the desired level of service.</p><p>To tackle this challenge, the article presents a comprehensive approach. It introduces a mixed-integer linear model, two constraint programming formulations, and a novel operator called the <span><math><mi>k</mi></math></span>-buffer insertion operator. This operator serves as the centerpiece of a descent heuristic proposed in the study.</p><p>Extensive evaluation across a diverse range of randomly generated instances underscores the superiority of the proposed constraint programming formulations over the mixed integer linear programming model. However, it is noteworthy that the proposed heuristic surpasses even the most effective constraint programming formulation. This highlights its remarkable efficiency in solving real-size instances within notably brief computation times. Such prowess underscores the practical utility of this heuristic in effectively tackling the complexities inherent in the Dial-a-Tour Problem.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142149123","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 reliable ensemble forecasting modeling approach for complex time series with distributionally robust optimization 针对复杂时间序列的可靠集合预测建模方法，具有分布稳健优化功能

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-09-03 DOI: 10.1016/j.cor.2024.106831

{"title":"A reliable ensemble forecasting modeling approach for complex time series with distributionally robust optimization","authors":"","doi":"10.1016/j.cor.2024.106831","DOIUrl":"10.1016/j.cor.2024.106831","url":null,"abstract":"<div><p>Accurate ensemble forecast results provide strong support for management decisions. While the existing ensemble forecasting model ignores the requirement of directional accuracy making its prediction direction is usually error-prone. To address this issue, we develop a convex directional prediction error measure and subsequently construct a reliable ensemble forecasting model that minimizes the horizontal prediction error with the bounded directional prediction error. Mathematically, we provided the proper range of the required directional error level. Furthermore, we find the classical ensemble forecasting model is a special case of our study when the directional error level is larger than the upper bound we gave in this study. To deal with the possible deterioration of the individual model over time, we also considered its worst possible prediction performance by introducing the distributionally robust optimization (DRO) technique into the proposed reliable ensemble forecasting model. Technically, we showed that the DRO-based reliable ensemble forecasting model is convex and can be reformulated into a second-order cone problem which can be readily solved by off-the-shelf solvers. Finally, the effectiveness of the proposed reliable ensemble forecasting model and the DRO-based reliable ensemble forecasting model were validated on three different datasets, e.g., the exchange rate, the oil price, and the country risk index. To sum up, we construct a reliable ensemble forecasting model to simultaneously control the horizontal prediction error and directional prediction error of ensemble forecasting, and thus enhance the reliability of ensemble forecasting.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142149124","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