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

Joint location and pricing for recycling service planning 联合定位和定价的回收服务规划

IF 4.1 2区工程技术

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

Qihang Liu , Jichang Dong , Ying Liu , Luming Yang

引用次数: 0

Evaluating a Simulated Annealing metaheuristic for the Heterogeneous On-Demand Bus Routing Problem with a novel experimental setup 用一种新的实验装置评估异构按需总线路由问题的模拟退火元启发式算法

IF 4.1 2区工程技术

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

Michell Queiroz, Kenneth Sörensen

{"title":"Evaluating a Simulated Annealing metaheuristic for the Heterogeneous On-Demand Bus Routing Problem with a novel experimental setup","authors":"Michell Queiroz, Kenneth Sörensen","doi":"10.1016/j.cor.2025.107116","DOIUrl":"10.1016/j.cor.2025.107116","url":null,"abstract":"<div><div>This work addresses the Heterogeneous On-Demand Bus Routing Problem (H-ODBRP), a problem involving the efficient management of transportation requests in an urban setting. Passengers are picked up and dropped off at designated stations near their origin and destination points by a fleet of heterogeneous vehicles. The primary objective is to minimize the total user ride time (URT) for all passengers. A metaheuristic, based on the Simulated Annealing framework, is introduced to provide effective solutions to this problem. A new Integer Programming formulation is also proposed and used to evaluate the solution quality of the proposed metaheuristic on small instances with up to 14 requests. This study contributes to the literature by providing the first insights into the On-Demand Bus Routing Problem using a heterogeneous fleet of vehicles. The results show that, in the instances examined, vehicles with 12 or more seats are rarely utilized. Furthermore, introducing some degree of randomness in selecting vehicle capacity for assigning passengers to empty vehicles proves to be more beneficial than choosing capacity strictly based on demand. A distinctive feature of this study is its focus on the impact of different instance properties, offering a novel experimental setup that could provide fresh insights into on-demand transportation problems.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"182 ","pages":"Article 107116"},"PeriodicalIF":4.1,"publicationDate":"2025-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144106835","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 approximation algorithm for multi-allocation hub location problems 多分配轮毂定位问题的近似算法

IF 4.1 2区工程技术

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

Niklas Jost

{"title":"An approximation algorithm for multi-allocation hub location problems","authors":"Niklas Jost","doi":"10.1016/j.cor.2025.107118","DOIUrl":"10.1016/j.cor.2025.107118","url":null,"abstract":"<div><div>The multi allocation <span><math><mi>p</mi></math></span>-hub median problem (MApHM), the multi allocation uncapacitated hub location problem (MAuHLP) and the multi allocation <span><math><mi>p</mi></math></span>-hub location problem (MApHLP) are common hub location problems with several practical applications. HLPs combine the task of constructing a network and solving a routing on that network. Specifically, a set of hubs must be chosen and each routing must be performed using one or two hubs as stopovers. The costs between two hubs are discounted by a parameter <span><math><mi>α</mi></math></span>. The objective is to minimize the total transportation cost in the MApHM and additionally to minimize the set-up costs for the hubs in the MAuHLP and MApHLP. In this paper, an approximation algorithm to solve these problems is developed, which improves the approximation bound for MAuHLP to 2.408.</div><div>The proposed algorithm reduces the HLPs to Facility Location Problems (FLPs), incorporating the idea of preferring hubs in the direction of the destination. Depending on the HLP, different FLP approximation algorithms with approximation bound <span><math><mi>γ</mi></math></span> are used. In cases where the discount factor satisfies <span><math><mrow><mn>0</mn><mo><</mo><mi>α</mi><mo><</mo><mfrac><mrow><mn>1</mn></mrow><mrow><mi>γ</mi></mrow></mfrac></mrow></math></span> or <span><math><mrow><mi>α</mi><mo>≥</mo><mn>0</mn><mo>.</mo><mn>619</mn></mrow></math></span>, the resulting approximation bound still improves upon the current state of the art.</div><div>The proposed algorithm is capable of solving much bigger instances than any exact algorithm in the literature. New benchmark instances have been created and published, such that HLP algorithms can be tested and compared on standardized huge instances. There, the proposed algorithm outperformed the previous best approximation algorithm in nearly all test instances.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"182 ","pages":"Article 107118"},"PeriodicalIF":4.1,"publicationDate":"2025-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143942415","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

Nash equilibria and the price of anarchy under SPT-LPT mixed coordination mechanism in distributed manufacturing 分布式制造中SPT-LPT混合协调机制下的纳什均衡与无政府状态的代价

IF 4.1 2区工程技术

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

Long Zhang , Zhiwen Wang , Wei Sheng

{"title":"Nash equilibria and the price of anarchy under SPT-LPT mixed coordination mechanism in distributed manufacturing","authors":"Long Zhang , Zhiwen Wang , Wei Sheng","doi":"10.1016/j.cor.2025.107117","DOIUrl":"10.1016/j.cor.2025.107117","url":null,"abstract":"<div><div>In the distributed manufacturing of new energy vehicle components, achieving a balance between the self-interested behaviors of individual production departments and the factory’s overall objectives is critical. This paper addresses this challenge by developing game-theoretic models to analyze the impact of a mixed coordination mechanism — specifically, those combining Shortest Processing Time (SPT) and Longest Processing Time (LPT) rules — on the existence of Nash equilibria (NE) and the Price of Anarchy (PoA). We propose different algorithms tailored to the parallel and uniform equipment-models, each capable of producing NE; and provide upper bounds of the PoA from the perspective of both equipment utilization and operational efficiency in theory. We conduct simulation analyses based on randomly generated instances to evaluate the average PoAs of our algorithms, which are consistent with the theoretical results. Our findings offer valuable managerial insights by elucidating how technological parameters, such as equipment number, type, and the degree of coordination, influence production performance in distributed manufacturing systems.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"182 ","pages":"Article 107117"},"PeriodicalIF":4.1,"publicationDate":"2025-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143942525","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

Syncrolift dry dock scheduling with a capacitated ship transfer system 带容量船舶转运系统的同步干船坞调度

IF 4.1 2区工程技术

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

Hao Guan, Mengtong Wang, Qiang Meng

{"title":"Syncrolift dry dock scheduling with a capacitated ship transfer system","authors":"Hao Guan, Mengtong Wang, Qiang Meng","doi":"10.1016/j.cor.2025.107138","DOIUrl":"10.1016/j.cor.2025.107138","url":null,"abstract":"<div><div>Despite the rapidly increasing maintenance demand driven by an aging fleet and the growth of global fleet size, optimizing dry dock operations remains an underexplored area in academic research. This study addresses this gap by focusing on enhancing efficiency through improved dry dock scheduling, aiming to alleviate the growing disparity between maintenance needs and limited dry dock resources. We propose a practical syncrolift dry dock scheduling problem that incorporates a capacitated ship transfer system, which requires determining the optimal sequence of ship maintenance services to minimize total waiting time. A mixed-integer linear programming (MILP) model is developed to effectively tackle the challenges of this problem, particularly the ship transfer system—a critical bottleneck involving the syncrolift and railways—by modeling it as a series of segments with varying capacities and transfer restrictions. The model accommodates the complexities of the scheduling process, such as limited transfer capacity, diverse segment characteristics, bidirectional ship transfer flows, ship compatibility constraints, and sequence-dependent setup times. Recognizing the NP-hard nature of the problem, we introduce a novel column-generation-based heuristic method to solve the MILP model efficiently. The efficacy of the proposed solution method is validated through extensive numerical experiments using real operational data from the NOSCO shipyard. Results demonstrate significant improvements in operational efficiency, with ship waiting times reduced by 32.5% compared to first-come-first-served scheduling solutions.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"182 ","pages":"Article 107138"},"PeriodicalIF":4.1,"publicationDate":"2025-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143948670","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

SDP-based Benders decomposition for solving p-median quadratic facility location problems 基于sdp的Benders分解求解p中值二次型设施选址问题

IF 4.1 2区工程技术

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

Yingying Yang, Hoa T. Bui, Ryan Loxton

引用次数: 0

A branch-price-and-cut algorithm for the time-dependent multiple truck–drone routing problem 时变多卡车-无人机路径问题的分支价格削减算法

IF 4.1 2区工程技术

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

Xiaoning Zang , Li Jiang , Changyong Liang , Xiang Fang

{"title":"A branch-price-and-cut algorithm for the time-dependent multiple truck–drone routing problem","authors":"Xiaoning Zang , Li Jiang , Changyong Liang , Xiang Fang","doi":"10.1016/j.cor.2025.107104","DOIUrl":"10.1016/j.cor.2025.107104","url":null,"abstract":"<div><div>Time-varying traffic conditions are crucial features of urban logistics. Overlooking these conditions will pose a high coordination risk for drone-assisted routing problems. In this paper, a time-dependent multiple truck–drone routing problem (TD-MTDRP), which captures the time-varying traffic conditions as time-dependent travel times, is introduced. In the problem, trucks with time-dependent travel times travel through the urban roads, while drones fly over the urban areas, unaffected by the urban traffic, resulting in time-independent travel times. Our objective is to the total duration of all routes. We present the ready time function on a truck–drone path level, which is proven to satisfy the FIFO property. A route-based model is introduced based on this function to formulate the problem. The model decomposes the set-partitioning problem into a master problem (MP) and a time-dependent shortest truck–drone path problem with resource constraints (TDSTDPPRC). A branch-price-and-cut algorithm is also developed to solve the model. In this algorithm, a column-and-row generation is introduced to solve the MP, and a labeling algorithm incorporating new label extension and dominance rules is presented to address the TDSTDPPRC. For the numerical results, the approaches are evaluated on two sets of instances derived from the benchmark instances, demonstrating the effectiveness of the exact method in solving the TD-MTDRP.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"182 ","pages":"Article 107104"},"PeriodicalIF":4.1,"publicationDate":"2025-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143948669","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 ant colony hybrid simulated annealing algorithm for collaborative optimization of robotic mixed-model parallel two-sided assembly lines balancing 基于蚁群混合模拟退火算法的机器人混合模型双面平行装配线平衡协同优化

IF 4.1 2区工程技术

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

Yuling Jiao, Yang Wang, Xinyue Su, Fuyu Wang

{"title":"An ant colony hybrid simulated annealing algorithm for collaborative optimization of robotic mixed-model parallel two-sided assembly lines balancing","authors":"Yuling Jiao, Yang Wang, Xinyue Su, Fuyu Wang","doi":"10.1016/j.cor.2025.107113","DOIUrl":"10.1016/j.cor.2025.107113","url":null,"abstract":"<div><div>Aiming at the flexible production of small-lot and multi-variety assembly lines in intelligent manufacturing systems, a robot-operated mixed-model sequencing and parallel two-sided assembly line assembly system is proposed. Systematic co-optimization in three dimensions of task assignment at mated-stations and multi-line stations, multi-product mixed-model sequencing and task line balancing, as well as robot types and task time at workstations are solved. Mixed-model parallel two-sided assembly line system and its key terms are defined. A mathematical model of the mixed-model robotic parallel two-sided assemblyGreen line type-II balancing problem (MRPTALBP-II) considering energy consumption is developed. Based on the ant colony optimization algorithm (ACO) and simulated annealing algorithm (SA) for solving the model, the ant colony hybrid simulated annealing algorithm (ACHSA) is proposed to solve the model. A new initial solution encoding, multiple neighborhood structures and dual pheromone matrix updating method are designed,in order to avoid the algorithm from falling into local optimum and to expand the search range. Three sets of calculations are obtained for comparative analysis in conjunction with classical arithmetic cases. The results show that the ACHSA outperforms the SA and the ACO, with an excellence rate of 100% for large-scale arithmetic cases and 61% for small-scale arithmetic cases, which verifies the validity of the model and the algorithm. Firstly, the MRPTALBP-II is successfully solved, which provides a useful reference for the solution of multi-factor collaborative problems of complex systems.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"182 ","pages":"Article 107113"},"PeriodicalIF":4.1,"publicationDate":"2025-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143928980","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

Deep reinforcement learning for dynamic order picking in warehouse operations 仓库操作中动态订单拣选的深度强化学习

IF 4.1 2区工程技术

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

Sasan Mahmoudinazlou , Abhay Sobhanan , Hadi Charkhgard , Ali Eshragh , George Dunn

{"title":"Deep reinforcement learning for dynamic order picking in warehouse operations","authors":"Sasan Mahmoudinazlou , Abhay Sobhanan , Hadi Charkhgard , Ali Eshragh , George Dunn","doi":"10.1016/j.cor.2025.107112","DOIUrl":"10.1016/j.cor.2025.107112","url":null,"abstract":"<div><div>Order picking is a pivotal operation in warehouses that directly impacts overall efficiency and profitability. This study addresses the dynamic order picking problem, a significant concern in modern warehouse management, where real-time adaptation to fluctuating order arrivals and efficient picker routing are crucial. Traditional methods, which often depend on static optimization algorithms designed around fixed order sets for the picker routing, fall short in addressing the challenges of this dynamic environment. To overcome these challenges, we propose a Deep Reinforcement Learning (DRL) framework tailored for single-block warehouses equipped with an autonomous picking device. By dynamically optimizing picker routes, our approach significantly reduces order throughput times and unfulfilled orders, particularly under high order arrival rates. We benchmark our DRL model against established algorithms, utilizing instances generated based on standard practices in the order picking literature. Experimental results demonstrate the superiority of our DRL model over benchmark algorithms. For example, at a high order arrival rate of 0.09 (i.e., 9 orders per 100 units of time on average), our approach achieves an order fulfillment rate of approximately 98%, compared to the 82% fulfillment rate observed with benchmarking algorithms. We further investigate the integration of a hyperparameter in the reward function that allows for flexible balancing between distance traveled and order completion time. Finally, we demonstrate the robustness of our DRL model on out-of-sample test instances.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"182 ","pages":"Article 107112"},"PeriodicalIF":4.1,"publicationDate":"2025-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143929521","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

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