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

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

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

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

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

Distributionally robust optimization methods and applications 分布式鲁棒优化方法及应用

IF 4.1 2区工程技术

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

Xiang Li, Yankui Liu

引用次数: 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

Adaptive large neighborhood search for autonomous electric vehicle scheduling in airport baggage transport service 机场行李运输服务中电动汽车调度的自适应大邻域搜索

IF 4.1 2区工程技术

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

Xuanyu Zhang, Xinyue Wang, Wenzhao Dong, Gangyan Xu

{"title":"Adaptive large neighborhood search for autonomous electric vehicle scheduling in airport baggage transport service","authors":"Xuanyu Zhang, Xinyue Wang, Wenzhao Dong, Gangyan Xu","doi":"10.1016/j.cor.2025.107086","DOIUrl":"10.1016/j.cor.2025.107086","url":null,"abstract":"<div><div>Efficient airport baggage transport plays a vital role in reducing aircraft turnaround time, diminishing potential flight delays, and lowering the operation cost. Although the traditional tug-and-dolly system provides operational flexibility, its scheduling is complex and relies heavily on experts’ experience, leading to a low utilization rate of resources and inefficient transport services. To tackle this problem and improve the sustainability of airport ground handling service, this paper proposes a novel scheduling mode using autonomous electric dollies (AE-Dollies)<span><span><sup>1</sup></span></span> for airport baggage transport. The scheduling of AE-Dollies is modeled as a Split-Demand Multi-Trip Electric Vehicle Routing Problem (SD-MT-EVRP), which considers rich requirements in practical scenarios. An improved Adaptive Large Neighborhood Search (ALNS) based solution algorithm is developed, which integrates several specially designed removal heuristics and a greedy-based charging station relocation algorithm. Extensive computational experiments are conducted, and results show our method is more effective in improving vehicle utilization than the existing method. Moreover, an experimental case study based on Hong Kong International Airport demonstrates the potential use of our method in real-life scenarios.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"182 ","pages":"Article 107086"},"PeriodicalIF":4.1,"publicationDate":"2025-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143898634","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

Cover-based inequalities for the single-source capacitated facility location problem with customer preferences 考虑客户偏好的单源容量设施选址问题的基于覆盖的不等式

IF 4.1 2区工程技术

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

Christina Büsing , Markus Leitner , Sophia Wrede

{"title":"Cover-based inequalities for the single-source capacitated facility location problem with customer preferences","authors":"Christina Büsing , Markus Leitner , Sophia Wrede","doi":"10.1016/j.cor.2025.107082","DOIUrl":"10.1016/j.cor.2025.107082","url":null,"abstract":"<div><div>The <em>single-source capacitated facility location problem with customer preferences (SSCFLPCP)</em> is known to be strongly NP-hard. Computational tests imply that state-of-the-art solvers struggle with computing exact solutions. In this paper, we contribute two novel preprocessing methods which reduce the size of the considered integer programming formulation and introduce sets of valid inequalities which decrease the integrality gap. Each of the introduced results utilises structural synergies between capacity constraints and customer preferences in the SSCFLPCP. First, we derive two preprocessing methods where the first method fixes location variables and the second method fixes allocation variables. Afterwards, we study cover-based inequalities. Here, we first strengthen the well-known cover inequalities: when determining covers, we also consider demands of customers not in the cover that must be assigned to the covered facility if a customer in the cover is assigned to it. We further strengthen these inequalities by including information on the assignments of customers in a cover if they are not assigned to the covered facility. Afterwards, we derive a new family of valid inequalities, which expresses the relation of open facilities based on sets of customers covering a facility. We then discuss solution methods for the corresponding separation problems and, finally, test our results for two preference types in a computational study. Our results show a clear positive impact of the preprocessing methods and inequalities, in particular when preferences are defined by assignment costs.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"182 ","pages":"Article 107082"},"PeriodicalIF":4.1,"publicationDate":"2025-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143892010","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