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

Designing state-of-the-art metaheuristics: What have we learned from the parallel-machine scheduling problem with setups? 设计最先进的元启发式：我们从具有设置的并行机器调度问题中学到了什么？

IF 4.1 2区工程技术

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

Gustavo Alencar Rolim, Marcelo Seido Nagano

{"title":"Designing state-of-the-art metaheuristics: What have we learned from the parallel-machine scheduling problem with setups?","authors":"Gustavo Alencar Rolim, Marcelo Seido Nagano","doi":"10.1016/j.cor.2025.107110","DOIUrl":"10.1016/j.cor.2025.107110","url":null,"abstract":"<div><div>For over two decades, the unrelated parallel machines scheduling problem with sequence-dependent setup times has engaged the research community, finding relevance in numerous practical applications. Despite the progress of exact approaches, the field of metaheuristics has seen a proliferation of new methods that often claim superiority over existing ones. In this paper, we survey, implement, and test a group of 12 metaheuristics for makespan minimization. An extensive computational study is conducted in an attempt to establish the components that lead to better results. We discuss common design choices, solution representation schemes, and acceleration procedures to reduce computational effort. Experimental testing on 3260 test instances from two well-known benchmarks shows that a simple simulated annealing algorithm with few control parameters, complete solution representation, and diverse neighborhood structures present the best results under a standardized set of experimental conditions. All source codes are available to the scientific community in a reproducible capsule.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"182 ","pages":"Article 107110"},"PeriodicalIF":4.1,"publicationDate":"2025-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143937086","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

Emerging optimization problems for distribution in same-day delivery 当日送达配送新出现的优化问题

IF 4.1 2区工程技术

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

Yuanyuan Li , Claudia Archetti , Ivana Ljubić

引用次数: 0

A novel topological neighborhood structure for flexible job shop scheduling problem with variable sublots 具有可变子批的柔性作业车间调度问题的一种新的拓扑邻域结构

IF 4.1 2区工程技术

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

Zipeng Yang, Xinyu Li, Liang Gao, Qihao Liu

{"title":"A novel topological neighborhood structure for flexible job shop scheduling problem with variable sublots","authors":"Zipeng Yang, Xinyu Li, Liang Gao, Qihao Liu","doi":"10.1016/j.cor.2025.107120","DOIUrl":"10.1016/j.cor.2025.107120","url":null,"abstract":"<div><div>Lot streaming is an effective approach to reduce machine idle time by splitting each operation into sublots, enabling parallel processing. However, the search space will also expand dramatically due to the variability of batching and scheduling. Neighborhood structure is an effective approach to obtain high-quality solutions with less computational effort in a complex search space. This paper proposes a novel neighborhood structure, and uses it to develop an effective algorithm for flexible job shop scheduling problem with variable sublots (FJSP-VS). Firstly, a three-dimensional disjunctive graph is developed to represent solutions clearly by incorporating an axis of batching. This representation captures comprehensive neighborhood features, and provides a robust basis for neighborhood perturbations. Subsequently, a novel topological neighborhood structure is proposed for deeper exploration, which can effectively avoid the generation of infeasible solutions while ensuring the quality of neighborhood solutions. The novel topological neighborhood structure is integrated into a variable neighborhood search component, for effective local searching. On this basis, a topology-guided memetic algorithm (TGMA) is proposed, which can obtain high-quality solutions in the complex solution space. Experiments are organized on expanded benchmarks of varying scales, and the proposed TGMA can obtain better solutions than several state-of-the-art algorithms in over 90% instances. The results demonstrate its superior performance in solution quality and computational efficiency when solving the complex high-dimensional FJSP-VS.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"182 ","pages":"Article 107120"},"PeriodicalIF":4.1,"publicationDate":"2025-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143936987","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

Mathematical modeling and heuristic solutions for container loading and routing problem: A case study in a cable manufacturing company 集装箱装载与布线问题的数学建模与启发式解决方法：以某电缆制造公司为例

IF 4.1 2区工程技术

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

Gazi Bilal Yıldız , Kübra Yalçın , Halim Burak Taşkın , Murat Gürek

引用次数: 0

Meta-learning for dynamic multi-robot task scheduling 动态多机器人任务调度的元学习

IF 4.1 2区工程技术

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

Peng Song, Huaiyu Chen, Kaixin Cui, Junzheng Wang, Dawei Shi

{"title":"Meta-learning for dynamic multi-robot task scheduling","authors":"Peng Song, Huaiyu Chen, Kaixin Cui, Junzheng Wang, Dawei Shi","doi":"10.1016/j.cor.2025.107109","DOIUrl":"10.1016/j.cor.2025.107109","url":null,"abstract":"<div><div>In this work, we investigate the problem of dynamic task scheduling for multi-robot systems, in which a large number of robots collaborate to achieve a multi-objective optimization goal in transportation, rescue, <em>etc</em>. Considering the dynamic characteristics of tasks and robots in industrial scenarios, a reinforcement learning scheduling algorithm based on a meta-learning framework is proposed, which learns to interact with the environment to obtain an optimal solution. A DenseNet-like deep Q-network is designed to mine high level features of a state matrix, whose size changes dynamically with the scenario settings. By optimizing network parameters in inner and outer meta learning loops, the Q-network learns from the experience of multiple scheduling scenarios and obtains a generalized initialization parameter, which can be fine-tuned online to adapt to a new multi-robot system. The effectiveness of the proposed meta-scheduling approach is illustrated by numerical simulations in 9 different multi robot scenarios, achieving a 11.0% higher objective score and a 63.9% reduction in training time compared with a standard deep Q-Learning algorithm.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"182 ","pages":"Article 107109"},"PeriodicalIF":4.1,"publicationDate":"2025-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143929519","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 block-building constraint programming model for the container loading problem 集装箱装载问题的分块构造约束规划模型

IF 4.1 2区工程技术

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

Chang Liu , Kate Smith-Miles , Tony Wauters , Alysson M. Costa

{"title":"A block-building constraint programming model for the container loading problem","authors":"Chang Liu , Kate Smith-Miles , Tony Wauters , Alysson M. Costa","doi":"10.1016/j.cor.2025.107111","DOIUrl":"10.1016/j.cor.2025.107111","url":null,"abstract":"<div><div>The container loading problem involves packing a set of given rectangular boxes into a larger rectangular container of fixed size, with the objective of maximizing the volume of the loaded boxes. Most of the literature on the container loading problem and its variants proposes heuristic approaches that can find good solutions quickly. Current exact methods are mostly limited to mixed-integer programming (MIP) formulations, which often struggle to obtain good solutions for large problem instances.</div><div>In this paper, we introduce two exact constraint programming models for the container loading problem. The first model uses integer and binary variables to assign boxes to valid positions and orientations within the container. The second model enhances this by incorporating the concept of block-building, commonly used in heuristic methods. Extensive computational experiments on classical benchmark instances from the literature show that the solutions obtained with the proposed models significantly outperform those achieved with existing MIP models. We also perform an instance space analysis of the proposed models to map the models’ performances across problem instances, providing deeper insights into the strengths and weaknesses of the block-building approach.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"182 ","pages":"Article 107111"},"PeriodicalIF":4.1,"publicationDate":"2025-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143922056","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

Robust and Distributionally Robust Shortest Path problems: A survey 鲁棒和分布鲁棒最短路径问题综述

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2025-04-29 DOI: 10.1016/j.cor.2025.107096

Carlo Filippi , Francesca Maggioni , M. Grazia Speranza

{"title":"Robust and Distributionally Robust Shortest Path problems: A survey","authors":"Carlo Filippi , Francesca Maggioni , M. Grazia Speranza","doi":"10.1016/j.cor.2025.107096","DOIUrl":"10.1016/j.cor.2025.107096","url":null,"abstract":"<div><div>The availability of frequently updated and reliable data on traversal times of arcs in a network makes the study of non-deterministic Shortest Path problems of high importance nowadays. A large body of literature on robust and distributionally robust models is emerging, allowing reliable decisions to be taken that consider the worst-case condition. The literature differs in the assumptions made on the uncertainty of the traversal times, on the information available, and on the objective function that guides the optimization.</div><div>In this paper, we review this literature with the goal of identifying open and relevant research directions. We present robust Shortest Path and Distributionally Robust Shortest Path problems including: static, with recourse, and dynamic robust problems; absolute and relative robust problems. For each area, a description of the models and solution approaches is given, with concise excerpts of the related works. Trends and possible research directions are outlined. We review 29 papers on this subject, classifying them in terms of problem description, model characteristics and proposed solution methods.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"182 ","pages":"Article 107096"},"PeriodicalIF":4.1,"publicationDate":"2025-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143907014","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

Modified ATCR rule for fixed and variable costs of tardiness 修改了固定和可变延迟成本的ATCR规则

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2025-04-29 DOI: 10.1016/j.cor.2025.107097

Shubham Keshri, Rohit Gupta, Avijit Khanra

引用次数: 0

A problem reduction based memetic algorithm for the vehicle routing problem with discrete split deliveries and pickups 基于问题约简的模因算法求解离散分装配送车辆路径问题

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2025-04-29 DOI: 10.1016/j.cor.2025.107106

Zheng Gao , Fuqin Deng , Zhang-Hua Fu , Xiangjing Lai , Qinghua Wu

{"title":"A problem reduction based memetic algorithm for the vehicle routing problem with discrete split deliveries and pickups","authors":"Zheng Gao , Fuqin Deng , Zhang-Hua Fu , Xiangjing Lai , Qinghua Wu","doi":"10.1016/j.cor.2025.107106","DOIUrl":"10.1016/j.cor.2025.107106","url":null,"abstract":"<div><div>Vehicle routing problem with discrete split deliveries and pickups demands (VRPDSPDP), which considers simultaneously split deliveries, pickups demands and discrete demands, has recently received increasing attention in the academic community due to their potential real-world applications in logistic operations and supply chain. In this paper, to solve efficiently this computationally challenging problem, we proposed a problem reduction based memetic algorithm (PRMA for short). The proposed PRMA algorithm consists mainly of a problem reduction method aiming to reduce the size of problem, a crossover operator to generate an offspring solution from two parent solutions selected randomly from the population, a split method to convert a sequence of pairs of demands to several routes, a local search method to improve locally the quality of solutions, and a population updating strategy. We conducted extensive computational experiments to assess the performance of algorithm based on 222 benchmark instances commonly used in the literature, and the computational results show that the proposed algorithm is very efficient and significantly outperforms the state-of-the-art algorithm in the literature. In particular, the proposed algorithm improves the best-known results for 139 out of 222 instances, while matching the best-known results for 77 instances.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"182 ","pages":"Article 107106"},"PeriodicalIF":4.1,"publicationDate":"2025-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143898635","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 approach for the Vehicle Routing Problem with Demand Allocation 考虑需求分配的车辆路径问题的一种精确方法

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2025-04-26 DOI: 10.1016/j.cor.2025.107101

Bruno Oliveira , Diogo Lima , Artur Pessoa , Marcos Roboredo

{"title":"An exact approach for the Vehicle Routing Problem with Demand Allocation","authors":"Bruno Oliveira , Diogo Lima , Artur Pessoa , Marcos Roboredo","doi":"10.1016/j.cor.2025.107101","DOIUrl":"10.1016/j.cor.2025.107101","url":null,"abstract":"<div><div>The Vehicle Routing Problem with Demand Allocation (VRPDA) involves a depot, a set of uncapacitated delivery sites, and a set of customers. Instead of directly visiting customers, their demand is allocated to a visited delivery site, incurring an assignment cost. VRPDA requires two key decisions: the first is to design a set of routes that begin and end at the depot for a fleet of homogeneous vehicles, visiting only delivery sites; the second is to assign customers to the visited delivery sites. These decisions aim to minimize the total routing and assignment costs. The solution must satisfy three primary constraints: each customer must be assigned to exactly one visited delivery site; each delivery site may be visited at most once across all routes; and the total demand of customers assigned to visited delivery sites on any given route must not exceed the vehicle capacity. To solve the VRPDA, we propose an exact branch-and-cut-and-price algorithm implemented within the VRPSolver framework. We demonstrate that the enumeration of elementary routes can only be applied in the proposed algorithm if the master formulation constraint, which prevents a delivery site from being visited more than once, is relaxed. These constraints are initially relaxed and then enforced as needed within the pricing subproblems during the course of a branch-and-bound (B&B) algorithm. Extensive experiments on benchmark instances reveal that the proposed B&B algorithm surpasses the best exact algorithms in the literature and, for the first time, finds optimal solutions for several large instances.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"182 ","pages":"Article 107101"},"PeriodicalIF":4.1,"publicationDate":"2025-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143892012","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