Computers & Operations Research最新文献

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

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

Integrated robust scheduling for inpatient surgery and ambulatory surgery 集成了住院手术和门诊手术的鲁棒调度

IF 4.1 2区工程技术

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

Zongli Dai , Xiaoyue Gong , Jian-Jun Wang , Lejing Yu , Jim (Junmin) Shi

{"title":"Integrated robust scheduling for inpatient surgery and ambulatory surgery","authors":"Zongli Dai , Xiaoyue Gong , Jian-Jun Wang , Lejing Yu , Jim (Junmin) Shi","doi":"10.1016/j.cor.2025.107098","DOIUrl":"10.1016/j.cor.2025.107098","url":null,"abstract":"<div><div>Ambulatory surgery services are becoming more and more popular as they can alleviate the shortage of hospital bed resources and increase the number of surgeries without increasing additional investment. In this mode, ambulatory surgery and inpatient surgery have different operating rooms but the same surgeons, which makes it difficult to coordinate the operating rooms and surgery time of the surgeon. In addition, the uncertainty of surgery duration and disruptions aggravate the difficulty of scheduling. Therefore, we model an integrated scheduling problem of ambulatory surgery and inpatient surgery under the in-hospital ambulatory surgery services mode. Considering the uncertainty of surgery duration and disruptions, a disruption management model based on distributionally robust optimization and machine learning consensus is established. For the computational complexity of the problem, we transform it into a two-stage robust problem and propose a disruption management algorithm to solve it. The experiment proves that integrated scheduling considering ambulatory surgery and inpatient surgery can significantly reduce the cost associated with the ORs and improve the utilization of the ORs. In addition, disruption management is not a once-and-for-all exercise, and the occurrence of new disruptions needs to be taken into account when performing disruption management.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"181 ","pages":"Article 107098"},"PeriodicalIF":4.1,"publicationDate":"2025-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143887411","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 heuristic algorithm with multi-scale perturbations for point arrangement and equal circle packing in a convex container 凸容器中点排列和等圆排列的多尺度微扰启发式算法

IF 4.1 2区工程技术

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

Xiangjing Lai , Jin-Kao Hao , Dong Yue , Yangming Zhou

{"title":"A heuristic algorithm with multi-scale perturbations for point arrangement and equal circle packing in a convex container","authors":"Xiangjing Lai , Jin-Kao Hao , Dong Yue , Yangming Zhou","doi":"10.1016/j.cor.2025.107099","DOIUrl":"10.1016/j.cor.2025.107099","url":null,"abstract":"<div><div>The point arrangement and equal circle packing problems are a category of classic max–min constrained optimization problems with many important applications. Being computationally very challenging to solve, they have been widely studied in operations research and mathematics. We propose a heuristic algorithm for the point arrangement and equal circle packing problems in various convex containers. The algorithm relies on several complementary search components, including an unconstrained optimization procedure that ensures diversified and intensified searches, an optima exploitation based adjustment method for the radius of circles, and a monotonic basin-hopping method with multi-scale perturbations. Computational results on numerous benchmark instances show that the proposed algorithm significantly outperforms the existing state-of-the-art algorithms, especially for hard instances or large-scale instances. For the well-known equal circle packing problem in a circular container, it improves the best-known result for 69 out of the 96 hardest instances widely used in the literature. For the majority of the remaining instances tested, the algorithm improves or matches the best-known results with a high success rate, despite of the fact that these instances have been tested by many existing algorithms. Experimental analysis shows that the optima exploitation based adjustment method for the radius of circles plays a crucial role for the high performance of the algorithm and that the multi-scale perturbations are able to significantly enhance the search ability and robustness of the algorithm. Given the general feature of the proposed framework, it can be applied to other related max–min constrained optimization problems.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"181 ","pages":"Article 107099"},"PeriodicalIF":4.1,"publicationDate":"2025-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143882175","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

International multimodal transportation optimization considering bulk cargo containerization 考虑散货集装箱化的国际多式联运优化

IF 4.1 2区工程技术

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

Mingzhu Yu , Haoran Yang , Yaofeng Zhou , Xiaofan Lai , Gangqiao Wang

{"title":"International multimodal transportation optimization considering bulk cargo containerization","authors":"Mingzhu Yu , Haoran Yang , Yaofeng Zhou , Xiaofan Lai , Gangqiao Wang","doi":"10.1016/j.cor.2025.107095","DOIUrl":"10.1016/j.cor.2025.107095","url":null,"abstract":"<div><div>Bulk cargo containerization helps to reposition empty containers and reduce bulk cargo attrition in international trade. This paper studies an international multimodal transportation optimization problem that considers the containerization of bulk cargo in multiple planning periods. We provide a mathematical formulation for this optimization model, taking into account decisions related to equipment purchasing and bulk cargo containerization quantities. By incorporating the uncertainty of the bulk cargo demand, our basic model is extended to a two-stage stochastic mixed integer programming model. An improved Benders decomposition algorithm is proposed to solve this model. The results of numerical experiments and sensitivity analysis show that: (1) a high bulk cargo loss rate, a large number of nodes in the network, and an extensive planning period motivate carriers to pursue bulk cargo containerization; (2) when the price of the containerization equipment is reasonable, bulk cargo containerization can save costs; (3) the more complex the network, the higher the price of the equipment carriers can afford for bulk cargo containerization; and (4) considering uncertain demand with more demand scenarios can help reduce operational cost.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"182 ","pages":"Article 107095"},"PeriodicalIF":4.1,"publicationDate":"2025-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143892011","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

Characteristics-based Estimation of distribution algorithm for the steelmaking-refining-continuous casting scheduling problem in the real-world steel plants 炼钢-精炼-连铸调度问题的基于特征估计的分布算法

IF 4.1 2区工程技术

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

Long Zhang, Xi Hu, XiaoMing Wu

{"title":"Characteristics-based Estimation of distribution algorithm for the steelmaking-refining-continuous casting scheduling problem in the real-world steel plants","authors":"Long Zhang, Xi Hu, XiaoMing Wu","doi":"10.1016/j.cor.2025.107107","DOIUrl":"10.1016/j.cor.2025.107107","url":null,"abstract":"<div><div>As a key production process in the steel industry, excellent scheduling of Steelmaking-refining-Continuous Casting (SCC) manufacturing process can improve production efficiency, shorten the steel production cycle, and reduce the production cost for steel enterprises. This paper presents a Characteristics-based Estimation of Distribution Algorithm (CEDA) for the SCC scheduling problem in the real-world steel plants. Considering the processing characteristics of the continuous casting machine, a novel caster-based encoding scheme and an improved decoding scheme are proposed. Also, a distance concept is introduced to mitigate the impact of similar individuals on the probability model, and an importance-based probability model updating mechanism is designed to increase the impact of excellent individual on the probability model. Furthermore, an individual sampling scheme with enhanced probability is constructed to ensure continuous processing of the continuous casting machine as much as possible. Finally, this paper designs a limited insertion operation in the local search to address the exploitation of the proposed algorithm. Extensive numerical simulations demonstrate that the proposed CEDA for the SCC scheduling process is more efficient than some state-of-the-art algorithms in the literature.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"181 ","pages":"Article 107107"},"PeriodicalIF":4.1,"publicationDate":"2025-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143868290","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