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

Augmentation search for integer programming over a polyhedron 多面体上整数规划的增广搜索

IF 4.1 2区工程技术

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

Tolga Bektaş

引用次数: 0

A deep reinforcement learning method for solving Two-Echelon Location-Routing Problem 求解两梯队位置路由问题的深度强化学习方法

IF 4.1 2区工程技术

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

Shuo Huang , Yaoxin Wu , Zhiguang Cao , Xuexi Zhang

{"title":"A deep reinforcement learning method for solving Two-Echelon Location-Routing Problem","authors":"Shuo Huang , Yaoxin Wu , Zhiguang Cao , Xuexi Zhang","doi":"10.1016/j.cor.2025.107210","DOIUrl":"10.1016/j.cor.2025.107210","url":null,"abstract":"<div><div>In the domain of logistics and supply chain management, optimizing distribution networks is a crucial task for improving efficiency and reducing operational costs. This paper focuses on addressing the Two-Echelon Location-Routing Problem (2E-LRP), with the aim to concurrently optimize the facility (i.e., the transfer station and depot) placement, and vehicle routing for transporting goods between depots, transfer stations, and customers. We propose a method based on deep reinforcement learning to minimize the total costs associated with the operational cost of facilities, the cost of vehicle usage, and transportation cost. Specifically, we design an encoder–decoder structured two-stage attention model that constructs solutions of location-routing problems in two echelons, respectively. A simple yet effective recurrent unit is used in decoder to capture context embeddings, allowing the model to selectively incorporate beneficial information from previous construction steps. The contexts are then used for attention computation to select facilities and customers and thus determine their placements and the routes. The model is trained by REINFORCE algorithm with a shared baseline, and its performance is validated through comparisons with Gurobi solver and typical heuristic algorithms. Extensive results showcase the favorable performance of our model on both synthetic and benchmark instances, which offers a competitive alternative to traditional solutions. Specifically, our model achieves up to 1.5% cost reduction and over 99% computation time savings compared to traditional heuristic algorithms in large instance. In addition, the generalization is fairly good to cope with instances of different scales and distributions.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"183 ","pages":"Article 107210"},"PeriodicalIF":4.1,"publicationDate":"2025-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144704129","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

Integrated and sequential algorithms for the robust two-echelon location-routing problem under demand uncertainty 需求不确定条件下鲁棒两梯队定位路由问题的集成序列算法

IF 4.1 2区工程技术

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

Ousmane Ali , Jean-François Côté , Leandro C. Coelho

{"title":"Integrated and sequential algorithms for the robust two-echelon location-routing problem under demand uncertainty","authors":"Ousmane Ali , Jean-François Côté , Leandro C. Coelho","doi":"10.1016/j.cor.2025.107198","DOIUrl":"10.1016/j.cor.2025.107198","url":null,"abstract":"<div><div>This paper addresses the two-echelon capacitated location-routing problem (2E-CLRP) when faced with demand uncertainty. We assume that the customer’s demands at the second echelon are uncertain and design a two-echelon distribution network where open satellites, served from a single depot, have sufficient capacities to handle the variation in demand. At the same time, the planned routes must remain feasible for all values of demand within an uncertainty set. We propose a robust counterpart for an integrated model of the 2E-CLRP and solve it using an adaptive large neighborhood search heuristic and a branch-and-cut algorithm. We also design four non-integrated solution approaches based on the robust counterparts for the 2E-CLRP subproblems, including the vehicle routing problem (VRP), the facility location problem (FLP), the location-routing problem (LRP), and the two-echelon FLP (2E-FLP). The importance of an integrated approach to 2E-CLRP is demonstrated by comparing it to non-integrated approaches. Results show that early integration of location and routing decisions leads to better location and total costs. We also evaluate the price of robustness and the trade-off between conservative and riskier robust solutions using a Monte Carlo simulation. We perform a series of computational experiments to validate the proposed algorithms using benchmark instances for the deterministic 2E-CLRP, LRP and robust VRP.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"183 ","pages":"Article 107198"},"PeriodicalIF":4.1,"publicationDate":"2025-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144687171","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

Dual-resource flexible job shop scheduling considering worker proficiency differences 考虑工人熟练程度差异的双资源柔性作业车间调度

IF 4.1 2区工程技术

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

Chuang Wang , Di Fan , Yang Liu , Shan Ren , Jin Wang

{"title":"Dual-resource flexible job shop scheduling considering worker proficiency differences","authors":"Chuang Wang , Di Fan , Yang Liu , Shan Ren , Jin Wang","doi":"10.1016/j.cor.2025.107216","DOIUrl":"10.1016/j.cor.2025.107216","url":null,"abstract":"<div><div>Currently, the increasing attention to resource constraints in production systems is driven by the notable distribution of workers across all age groups within the production shop and the discrepancy of their proficiency in operating machines. It takes time and knowledge to improve workers’ proficiency. And as the workforce retires later, the longer working hours of older workers can help them gain more experience. With the improvement of accumulated experience, the time spent on human-related tasks such as machine debugging, checking, cleaning, and other necessary preparation processes before processing will be significantly reduced. Considering these factors is crucial when making production decisions, necessitating the adaptation of job assignments to suit the capabilities of individual workers. Through this approach, the economic indicators of ‘people-oriented manufacturing’ advocated by Industry 5.0 and workshop production can be jointly realized. In this scenario, a mathematical model is constructed with the objective of minimizing the sum of setup time and processing time for the double-resource flexible job shop scheduling problem (DRCFJSP), considering the differences in worker skill levels and varying process setup times based on this. The model takes the skills and proficiency of workers into consideration as well. Given the problem’s characteristics, the migratory bird optimization algorithm (MBO) is applied to address this issue. Finally, a comparative experiment is carried out on a simulation example. The experimental results verify that incorporating the influence of workers with different proficiency on preparation time into the scheduling model can significantly optimize the total production completion time.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"184 ","pages":"Article 107216"},"PeriodicalIF":4.1,"publicationDate":"2025-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144714247","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 review of bulk terminal operations: Status, trends, and future outlook 散货码头营运回顾：现状、趋势及未来展望

IF 4.1 2区工程技术

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

Oualid Benbrik , Rachid Benmansour , Filipe Rodrigues

{"title":"A review of bulk terminal operations: Status, trends, and future outlook","authors":"Oualid Benbrik , Rachid Benmansour , Filipe Rodrigues","doi":"10.1016/j.cor.2025.107199","DOIUrl":"10.1016/j.cor.2025.107199","url":null,"abstract":"<div><div>Bulk terminals are key infrastructures in the supply chain because they are the main nodes responsible for connecting sea and land transportation of bulk cargo. Their efficient management requires optimizing terminal operations, a challenge that has increasingly attracted researchers’ attention and motivates the need to review and analyze the work done so far. While research in container terminals has been widely reviewed in multiple surveys, the same does not apply to bulk terminals, for as yet there is no equivalent compilation or review of the existing research. This work addresses the gap by providing the first systematic literature review on the optimization of seaside and yardside operations at bulk terminals. It covers 120 research papers on dry and liquid bulk terminals. Keyword network analysis is used to establish relations within the existing work and identify five predominant research streams: seaside operations optimization, yardside operations optimization, simulation of terminal operations, integrated operations optimization, and artificial intelligence-based approaches. The papers are classified according to the type of port, type of terminal, type of cargo, problem(s) addressed, performance measures, and solution methods used. Furthermore, this review goes beyond reviewing and classifying the existing research; it also identifies research limitations and outlines several promising directions for future research, providing valuable insights to researchers and practitioners.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"183 ","pages":"Article 107199"},"PeriodicalIF":4.1,"publicationDate":"2025-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144655407","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

Solving multi-stage stochastic facility location problems with modular capacity adjustments 基于模块化容量调整的多阶段随机设施选址问题的求解

IF 4.1 2区工程技术

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

Šárka Štádlerová , Peter Schütz , Sanjay Dominik Jena

引用次数: 0

Two-dimensional bin packing, cutting stock, and open dimension problems: A survey of practical requirements 二维料仓包装、切料和开维问题：实际要求调查

IF 4.1 2区工程技术

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

Matheus Francescatto, Alvaro Neuenfeldt Júnior

{"title":"Two-dimensional bin packing, cutting stock, and open dimension problems: A survey of practical requirements","authors":"Matheus Francescatto, Alvaro Neuenfeldt Júnior","doi":"10.1016/j.cor.2025.107209","DOIUrl":"10.1016/j.cor.2025.107209","url":null,"abstract":"<div><div>Two-dimensional cutting and packing (C&P) problems involve cutting one or more objects into a set of items, resulting in cutting patterns. C&P problems are found in various real-life applications such as the steel, wood, paper, and glass industries, where industrial aspects like raw material reuse, defective objects, trim distance, cutting patterns based on item similarity, and/or demand uncertainty influence the development of solving methods. This article presents a systematic literature review of industrial aspects addressed in cutting-related applications of C&P problems, with a specific focus on two-dimensional bin packing, cutting stock, and open dimension problems. From a sample of 100 articles, 13 key industrial aspects were identified across 13 industry sectors, highlighting how these aspects are incorporated into solving methods. The review also outlines practical benefits observed in real-life applications and proposes a framework to support the implementation of solving methods. Emerging research trends in the C&P area are also discussed. Considering industrial aspects in the design of solving methods contributes to advances in manufacturing, improving production efficiency by reducing raw material waste, cutting costs, and minimizing the time required to generate cutting patterns.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"183 ","pages":"Article 107209"},"PeriodicalIF":4.1,"publicationDate":"2025-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144655406","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

Probabilistic Vector Machines 概率向量机

IF 4.1 2区工程技术

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

A. Pedro Duarte Silva

引用次数: 0

A decentralised genetic algorithm with sub-objectives for the transit network design problem 交通网络设计问题的分散子目标遗传算法

IF 4.1 2区工程技术

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

Maarten Wens, Pieter Vansteenwegen

{"title":"A decentralised genetic algorithm with sub-objectives for the transit network design problem","authors":"Maarten Wens, Pieter Vansteenwegen","doi":"10.1016/j.cor.2025.107191","DOIUrl":"10.1016/j.cor.2025.107191","url":null,"abstract":"<div><div>This paper introduces a novel approach to the transit network design problem. This technique, based on a genetic algorithm, uses multiple sub-populations in parallel, each prioritising different aspects of the optimal solution. These aspects include minimising transfers, reducing detours, and addressing specific parts of the demand. All of these aspects are important in minimising average passenger travel time, and artificially changing each weight factor in the objective function allows us to escape local optima efficiently. Our algorithm demonstrates improved performance when tested on well-known benchmark instances by diversifying the population and letting each sub-population focus on different parts of a qualitative solution. This algorithm reduces average travel times by more than 2% compared to the current state-of-the-art. Additionally, our approach generates a range of high-quality and distinct solutions, offering valuable insights for decision-makers. The algorithm is also tested on a large, complex instance based on a rural area in Belgium and shows the capability to find improvements over the current transit network.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"183 ","pages":"Article 107191"},"PeriodicalIF":4.1,"publicationDate":"2025-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144672270","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

New solution approaches for balancing assembly lines with setup times 平衡装配线与安装时间的新解决方案

IF 4.1 2区工程技术

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

Jordi Pereira , Marcus Ritt

引用次数: 0