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

A branch-and-price algorithm for the single machine scheduling problem with periodic maintenance to minimize makespan 以最小完工时间为目标的周期性维护单机调度问题的分支价格算法

IF 4.3 2区工程技术

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

Aiyue Fei , Qian Hu , Ying Liu

{"title":"A branch-and-price algorithm for the single machine scheduling problem with periodic maintenance to minimize makespan","authors":"Aiyue Fei , Qian Hu , Ying Liu","doi":"10.1016/j.cor.2025.107214","DOIUrl":"10.1016/j.cor.2025.107214","url":null,"abstract":"<div><div>Periodic maintenance of machines is essential to prevent unexpected breakdowns and ensure safe and reliable production. In this paper, we address the single machine scheduling problem with periodic maintenance, where a set of jobs must be processed sequentially on a single machine that requires periodic maintenance, with the objective of minimizing makespan. We first formulate this problem as a set partitioning model consisting of a set of integer variables and a set of continuous variables, and then develop a branch-and-price algorithm to efficiently solve the set partitioning model. In the algorithm, we design a hierarchical branching strategy to generate child nodes, a primal heuristic to quickly generate feasible solutions from fractional solutions, and a label setting algorithm with a bounding procedure to address pricing problems. Extensive computational experiments on benchmark instances and newly generated instances have been conducted to evaluate the efficiency of our branch-and-price algorithm. The results demonstrate that our algorithm solving the set partitioning model significantly outperforms the Gurobi Optimizer solving existing mathematical models in the literature, owing to our well-designed branching strategy, primal heuristic, and bounding procedure.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"184 ","pages":"Article 107214"},"PeriodicalIF":4.3,"publicationDate":"2025-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144749385","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

Knowledge-guided hybrid deep reinforcement learning for the dynamic multi-depot electric vehicle routing problem 基于知识引导的混合深度强化学习的动态多车场电动车路径问题

IF 4.3 2区工程技术

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

Reza Shahbazian, Alessia Ciacco, Giusy Macrina, Francesca Guerriero

{"title":"Knowledge-guided hybrid deep reinforcement learning for the dynamic multi-depot electric vehicle routing problem","authors":"Reza Shahbazian, Alessia Ciacco, Giusy Macrina, Francesca Guerriero","doi":"10.1016/j.cor.2025.107217","DOIUrl":"10.1016/j.cor.2025.107217","url":null,"abstract":"<div><div>In this paper, we consider the dynamic multi-depot electric vehicle routing problem with time windows, proposing a novel hybrid framework, integrating knowledge-guided multi-agent deep reinforcement learning (MARL) and a variable neighborhood search (VNS) algorithm. The MARL component employs a double-deep Q-network for initial route generation, which is further refined by the VNS to enhance solution quality. Real-time decision-making and adaptive optimization enable the framework to respond effectively to dynamic changes in the environment, leading to improved efficiency, reduced costs, and enhanced overall performance. Extensive experiments on both synthetic and real-world benchmark datasets, demonstrate the framework’s superiority over state-of-the-art algorithms, showing significant improvements in total traveled distance, computation time, and scalability. The results indicate over 70% reduction in the average total traveled distance compared to state-of-the-art baselines on small-scale datasets. Importantly, the framework’s ability to handle large-scale problems effectively makes it a promising solution for real-world applications.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"184 ","pages":"Article 107217"},"PeriodicalIF":4.3,"publicationDate":"2025-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144738519","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 optimization approach for the resource-constrained project scheduling problem with uncertain activity release times 具有不确定活动释放时间的资源约束项目调度问题的鲁棒优化方法

IF 4.3 2区工程技术

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

Kejun Qiu , Lu Chen , Stéphane Dauzère-Pérès

引用次数: 0

Flexible job shop rescheduling using user preferences 灵活的作业车间重新调度使用用户首选项

IF 4.3 2区工程技术

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

Essognim Richard Wilouwou , Arwa Khannoussi , Alexandru-Liviu Olteanu , Marc Sevaux

{"title":"Flexible job shop rescheduling using user preferences","authors":"Essognim Richard Wilouwou , Arwa Khannoussi , Alexandru-Liviu Olteanu , Marc Sevaux","doi":"10.1016/j.cor.2025.107213","DOIUrl":"10.1016/j.cor.2025.107213","url":null,"abstract":"<div><div>We consider solving the flexible job shop scheduling problem, where new jobs arrive and must be inserted into the production line through rescheduling. The insertion of new jobs can cause instability in the workshop, which may lead to additional costs, operator fatigue, increased risk of errors, and customer dissatisfaction. Several metrics have been used to measure instability. These metrics can be conflicting, and their choice depends on the user. In this paper, we conduct an analysis considering the DM’s preferences regarding stability criteria, and assume that he expresses his preferences in the form of judgments (e.g. <em>very good</em>, <em>good</em>, <em>average</em>, or <em>bad</em>). Our formulation of stability criteria allows the DMs to interpret the solutions. The solutions potentially accepted by the DM need to excel in the efficiency criterion while achieving at least <em>good</em> quality on the stability criteria. We aggregate the decision-maker’s preferences on stability criteria using a sorting preference model called MRSort. We propose two approaches for integrating the DM’s preferences into the optimization process: an <em>a priori</em> approach and an <em>interactive</em> approach. We show that with the <em>a priori</em> approach, we are able to find solutions of at least <em>good</em> quality on 96% of small instances, 93% of medium instances, and 59% of large instances, but this can lead to losses in efficiency. With the interactive approach, we obtain solutions of at least good category in about 59% of instances for each size, but it requires multiple interactions if one aims to achieve solutions of at least <em>good</em> quality. This highlights the conflicting nature between efficiency and stability. The optimization is performed using a Variable Neighborhood Search with three types of neighborhood structures for local search.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"184 ","pages":"Article 107213"},"PeriodicalIF":4.3,"publicationDate":"2025-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144722191","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

Editorial for the special issue on “Challenges and perspectives in Location Science” “地理位置科学的挑战与展望”特刊社论

IF 4.3 2区工程技术

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

Teresa Melo (Guest Editors), Stefan Nickel, Anita Schöbel

引用次数: 0

A multi-agent reinforcement learning model incorporating historical operational data for pump station operational scheduling 基于历史运行数据的泵站运行调度多智能体强化学习模型

IF 4.3 2区工程技术

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

Chao Wang , Yaofei Zhang , Sherong Zhang , Xiaohua Wang , Zhiyong Zhao

{"title":"A multi-agent reinforcement learning model incorporating historical operational data for pump station operational scheduling","authors":"Chao Wang , Yaofei Zhang , Sherong Zhang , Xiaohua Wang , Zhiyong Zhao","doi":"10.1016/j.cor.2025.107221","DOIUrl":"10.1016/j.cor.2025.107221","url":null,"abstract":"<div><div>The development of operational scheduling for pump units is a critical focus in pump station management. This study introduces a pump station operation scheduling model based on multi-agent reinforcement learning that integrates historical operational data, addressing inefficiencies, poor generalization, and operational complexity encountered with traditional evolutionary algorithms. Utilizing a graph neural network, the model incorporates historical data and prior knowledge about pump station performance curves to establish a performance computation model for multi-unit operation combinations. The scheduling of multi-unit operations at a pump station is conceptualized as a parallel decision-making problem, incorporating rules aimed at cost reduction, efficiency improvement, and meeting water delivery volume requirements while minimizing operational complexity. A MARL model is developed, taking into account the variability in initial operating conditions to enhance generalization capabilities. The study compares the performance of various reinforcement learning models with evolutionary algorithms. Results indicate that the trained MARL model adapts effectively to dynamic water delivery conditions and exhibits strong generalization capabilities. Compared to actual operational scheduling, it achieves significant savings of over 419,000 units in operational costs and over 390,000 kWh in energy consumption. Furthermore, compared to evolutionary algorithms, the decision-making solutions generated by the reinforcement learning model align more closely with operational logic and are more efficient, achieving a planning speed increase of over 70 times.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"184 ","pages":"Article 107221"},"PeriodicalIF":4.3,"publicationDate":"2025-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144738522","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

Optimization of drone base station locations and mobile charging drone routing for post-disaster communication 灾后通信无人机基站位置和移动充电无人机路径优化

IF 4.3 2区工程技术

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

Farzad Avishan , Mehmet Berk Karasu , Melike Çap , İhsan Yanıkoğlu

{"title":"Optimization of drone base station locations and mobile charging drone routing for post-disaster communication","authors":"Farzad Avishan , Mehmet Berk Karasu , Melike Çap , İhsan Yanıkoğlu","doi":"10.1016/j.cor.2025.107206","DOIUrl":"10.1016/j.cor.2025.107206","url":null,"abstract":"<div><div>In the aftermath of a disaster, traditional communication systems often become inaccessible, creating significant challenges for rescue teams and affected individuals. This research aims to design an innovative communication system to bridge this gap, ensuring efficient information transfer and establishing reliable communication channels between rescue teams and affected people. The focus is on using drones as communication tools to address this challenge. The study explores the use of drones as data collection and transmission platforms in disaster-stricken areas. By collecting information from individuals, including text messages and location data from different platforms, drones can efficiently transmit vital data to the communication backhaul. An optimization model is formulated to decide on the 3D location of drone base stations while maximizing coverage and service quality. In addition, mobile power drones are also required to supply the power for deployed base stations and data transfer; the model also decides on the routing of multiple power drones. To solve the problem efficiently, a clustering-based matheuristic is developed to determine the locations of the base stations. We show the solution performance of the model and the effectiveness of our heuristic algorithm in a case study using data from Sultanbeyli province in Türkiye. The heuristic algorithm solves all the case study instances, which consist of 700 nodes, 75–105 stationary drones, and 6–8 mobile drones, in less than an hour. The results show that with 105 stationary and 8 mobile drones, we can cover 82% of the users. Furthermore, we demonstrate how this coverage can be increased to 95% by implementing certain adjustments. The findings offer insights into the potential of using drone base stations in post-disaster scenarios, thereby empowering disaster management agencies with enhanced communication capabilities for improved coordination and response in the face of disaster.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"184 ","pages":"Article 107206"},"PeriodicalIF":4.3,"publicationDate":"2025-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144738521","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 Stackelberg approach to transportation infrastructure planning: Integrating User Decision-making 交通基础设施规划的Stackelberg方法：整合用户决策

IF 4.3 2区工程技术

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

Oscar-Mauricio Cepeda-Valero , Jose-Fidel Torres-Delgado , Andres D. González

{"title":"A Stackelberg approach to transportation infrastructure planning: Integrating User Decision-making","authors":"Oscar-Mauricio Cepeda-Valero , Jose-Fidel Torres-Delgado , Andres D. González","doi":"10.1016/j.cor.2025.107211","DOIUrl":"10.1016/j.cor.2025.107211","url":null,"abstract":"<div><div>The design of transportation networks is an intriguing and complex subject, primarily driven by the high costs and existing deficiencies in transit systems. Effective network design necessitates the consideration of multiple factors, including the rapid growth of urban centers, the demand for new routes, and the evolving preferences of citizens. A poorly designed network can result in significant drawbacks, such as delays, congestion, and escalated air pollution levels. Consequently, addressing this challenge requires the implementation of targeted modifications in the transport infrastructure, such as constructing new streets, expanding existing roads, enhancing capacity, and improving coverage. The paper introduces a Stackelberg model that addresses the planning of transport infrastructure, focusing on incorporate the user decisions. The model functions on two levels: the upper level captures the decision-making process of users, influenced by factors like time savings and transport system accessibility. Conversely, the lower level relates to the planner’s responsibility in designing and configuring the transport network to align with user demands and preferences while minimizing costs. Four types of transport networks were evaluated based on criteria such as used capacity, network growth, system cost, and unmet user needs. The evaluation revealed that mesh networks perform better due to their ability to distribute user flow across multiple lines, reducing dependency on a few edges. Additionally, the versatility of the procedure is demonstrated through its implementation in the Lausanne metro network.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"184 ","pages":"Article 107211"},"PeriodicalIF":4.3,"publicationDate":"2025-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144756819","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

The integrated planning of berth allocation, quay crane assignment, and pilotage scheduling 泊位分配、码头起重机分配和引航调度的综合规划

IF 4.3 2区工程技术

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

Liyang Xiao , Gilbert Laporte , Peng Sun , Wei Xie

{"title":"The integrated planning of berth allocation, quay crane assignment, and pilotage scheduling","authors":"Liyang Xiao , Gilbert Laporte , Peng Sun , Wei Xie","doi":"10.1016/j.cor.2025.107201","DOIUrl":"10.1016/j.cor.2025.107201","url":null,"abstract":"<div><div>Port logistics plays a crucial role in the efficiency of global trade, encompassing key operations such as berth allocation, quay crane assignment, and pilotage scheduling. Traditional approaches often treat these processes independently, leading to inefficiencies in resource utilization, increased operational costs, and prolonged vessel turnaround times. This paper addresses these challenges by proposing an integrated planning framework that simultaneously optimizes berth allocation, quay crane assignment, and pilotage scheduling. A novel integer programming model is proposed to jointly consider decisions related to pilotage, berthing, and handling operations, with the objective of minimizing vessel delays and pilot-related costs. To address the computational challenges encountered in practical applications, an adaptive large neighborhood search (ALNS) metaheuristic, enhanced with tailored berth allocation heuristics and problem-specific operators, is designed. Extensive numerical experiments are conducted to evaluate the performance of the integrated framework under diverse operational scenarios. The results demonstrate that the integrated approach is effective in reducing vessel turnaround times, improving resource utilization, and lowering total costs. Furthermore, a detailed sensitivity analysis is performed to assess the impact of variations in pilot availability, time-window constraints, and channel capacity on scheduling outcomes. These findings provide actionable insights for port operators aiming to enhance operational efficiency and cost-effectiveness, and highlight the advantages of a holistic view of berth allocation, quay crane assignment, and pilotage scheduling.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"184 ","pages":"Article 107201"},"PeriodicalIF":4.3,"publicationDate":"2025-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144725045","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

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