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

A supervised learning approach to rankability

IF 4.1 2区工程技术

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

Nathan McJames , David Malone , Oliver Mason

引用次数: 0

Ship emission monitoring with a joint mode of motherships and unmanned aerial vehicles

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2025-03-09 DOI: 10.1016/j.cor.2025.107012

Dan Zhuge , Jianhui Du , Lu Zhen , Shuaian Wang , Peng Wu

{"title":"Ship emission monitoring with a joint mode of motherships and unmanned aerial vehicles","authors":"Dan Zhuge , Jianhui Du , Lu Zhen , Shuaian Wang , Peng Wu","doi":"10.1016/j.cor.2025.107012","DOIUrl":"10.1016/j.cor.2025.107012","url":null,"abstract":"<div><div>Ship emission monitoring is crucial for improving compliance with emission control area (ECA) policies. To address the limitations of traditional base station-based monitoring methods, we propose a highly maneuverable mothership-based unmanned aerial vehicle (UAV) monitoring mode. We develop a mixed integer non-linear programming model to maximize the total profit (i.e., the revenues of ship emission monitoring minus the fixed costs of motherships and UAVs, the fuel cost of motherships, and the electricity cost of UAVs). Three types of integer variables are relaxed to continuous variables based on the model properties. We then design a tailored Benders decomposition algorithm to solve the model. Moreover, to improve the performance of the algorithm, we also present a variety of acceleration strategies, including lower bound limit inequalities and knapsack inequalities. Finally, we verify the effectiveness of the proposed algorithm using experimental instances based on the North American ECA. We also find a relationship between the width of emission inspection area and the total monitoring cost.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"179 ","pages":"Article 107012"},"PeriodicalIF":4.1,"publicationDate":"2025-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143610810","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

Logic-based Benders decomposition methods for the distributed permutation flow shop scheduling problem with production and transportation cost

IF 4.1 2区工程技术

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

Fuli Xiong, Jiangbo Shi, Lin Jing, An Ping

{"title":"Logic-based Benders decomposition methods for the distributed permutation flow shop scheduling problem with production and transportation cost","authors":"Fuli Xiong, Jiangbo Shi, Lin Jing, An Ping","doi":"10.1016/j.cor.2025.107044","DOIUrl":"10.1016/j.cor.2025.107044","url":null,"abstract":"<div><div>Distributed manufacturing mode can significantly enhance production flexibility and efficiency. Considering that factories and customers in distributed manufacturing environments may be geographically dispersed, we address a distributed permutation flow shop scheduling problem (DPFSP) with direct transportation under different cost of production and transportation while the goal is to minimize of weighted sum cost and makespan (DPFSP-PTM). First, we formulate two mixed-integer linear programming (MILP) models and one constraint programming (CP) model to optimize the objective simultaneously. Then, by decomposing DPFSP-PTM into an order assignment master problem (AMP) and a series of scheduling subproblems (SSPs), we develop two exact methods based on logic-based Benders decomposition (LBBD) and Branch-and-Check (BCH). To accelerate convergence, we propose three strong SSP relaxations based on the single-machine bottleneck to enhance the MILP models and AMP. Additionally, we introduce an initial solution generated by the iterated greedy (IG) algorithm to warm-start the LBBD. Finally, we demonstrate the effectiveness of the proposed methods in achieving competitive average optimality gaps and lower bounds across both small-scale and large-scale instances.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"179 ","pages":"Article 107044"},"PeriodicalIF":4.1,"publicationDate":"2025-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143593075","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

Scheduling moldable tasks on homogeneous multi-cluster platforms with GPUs

IF 4.1 2区工程技术

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

Fangfang Wu , Run Zhang , Xiandong Zhang

{"title":"Scheduling moldable tasks on homogeneous multi-cluster platforms with GPUs","authors":"Fangfang Wu , Run Zhang , Xiandong Zhang","doi":"10.1016/j.cor.2025.107041","DOIUrl":"10.1016/j.cor.2025.107041","url":null,"abstract":"<div><div>This paper examines task scheduling in homogeneous multi-cluster platforms, equipped with Graphics Processing Units (GPUs), with the aim of minimizing the makespan. We assume that tasks can be parallelized across these platforms under the moldable model. Recognizing the NP-hard nature of the problem, our goal is to develop algorithms that provide approximation ratios. While existing research has established algorithms for single-cluster GPU environments, scaling these to multi-cluster platforms introduces new challenges, especially due to the restriction that tasks cannot use processors from different clusters. We propose an integer programming-based algorithm that achieves an approximation ratio of <span><math><mrow><mfrac><mrow><mn>3</mn></mrow><mrow><mn>2</mn></mrow></mfrac><mo>+</mo><mi>ϵ</mi></mrow></math></span>, trading off runtime for an improved approximation ratio. Additionally, leveraging recent theoretical advancements, we have created a polynomial-time algorithm with an approximation ratio of <span><math><mrow><mn>2</mn><mo>+</mo><mi>ϵ</mi></mrow></math></span>. Empirical computational experiments show that our algorithms surpass their counterparts in empirical approximation ratios.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"179 ","pages":"Article 107041"},"PeriodicalIF":4.1,"publicationDate":"2025-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143601282","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

Online order acceptance and scheduling in a single machine environment

IF 4.1 2区工程技术

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

Chunyan Zheng, Jin Yu, Guohua Wan

引用次数: 0

Multi-armed bandit for the cyclic minimum sitting arrangement problem

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2025-03-01 DOI: 10.1016/j.cor.2025.107034

Marcos Robles , Sergio Cavero , Eduardo G. Pardo , Oscar Cordón

{"title":"Multi-armed bandit for the cyclic minimum sitting arrangement problem","authors":"Marcos Robles , Sergio Cavero , Eduardo G. Pardo , Oscar Cordón","doi":"10.1016/j.cor.2025.107034","DOIUrl":"10.1016/j.cor.2025.107034","url":null,"abstract":"<div><div>Graphs are commonly used to represent related elements and relationships among them. Signed graphs are a special type of graphs that can represent more complex structures, such as positive or negative connections in a social network. In this work, we address a combinatorial optimization problem, known as the Cyclic Minimum Sitting Arrangement, that consists of embedding a signed input graph into a cycle host graph, trying to locate in the embedding positive connected vertices closer than negative ones. This problem is a variant of the well-known Minimum Sitting Arrangement where the host graph has the structure of a path graph. To tackle the problem, we propose an algorithm based on the Multi-Armed Bandit method that combines three greedy-randomized constructive procedures with a Variable Neighborhood Descent local search algorithm. To assess the merit of our proposal, we compare it with the state-of-the-art method. Our experiments show that our algorithm outperforms the best-known method in the literature to date, and the results are statistically significant, establishing itself as the new state of the art for the problem.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"179 ","pages":"Article 107034"},"PeriodicalIF":4.1,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143548515","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 efficient iterated local search for the minimum quasi-clique partitioning problem

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2025-03-01 DOI: 10.1016/j.cor.2025.107033

Qing Zhou , Tongtong Zhu , Qinghua Wu , Zhong-Zhong Jiang , Wenjie Wang

{"title":"An efficient iterated local search for the minimum quasi-clique partitioning problem","authors":"Qing Zhou , Tongtong Zhu , Qinghua Wu , Zhong-Zhong Jiang , Wenjie Wang","doi":"10.1016/j.cor.2025.107033","DOIUrl":"10.1016/j.cor.2025.107033","url":null,"abstract":"<div><div>Given a simple undirected graph <span><math><mi>G</mi></math></span> and a real constant <span><math><mrow><mi>γ</mi><mo>∈</mo><mrow><mo>(</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>]</mo></mrow></mrow></math></span>, a <span><math><mi>γ</mi></math></span>-quasi-clique is defined as a subset of vertices that induces a subgraph with an edge density of at least <span><math><mi>γ</mi></math></span>. The minimum quasi-clique partitioning problem (MQCPP) seeks to identify the minimum cardinality of <span><math><mi>γ</mi></math></span>-quasi-clique partitions in <span><math><mi>G</mi></math></span>. This work presents an efficient iterated local search (ILS) method to address MQCPP by using a two-phase local search procedure for local improvement, and a greedy-based perturbation procedure for diversifying the search process. An evaluation function that records the number of intra edges of each quasi-clique is used for neighboring solution evaluation, and a fast incremental evaluation technique is employed to speed up the evaluation. Numerical results on three sets of 321 benchmark instances demonstrate the superior performance of the proposed algorithm compared with state-of-the-art approaches. Specifically, ILS reports 153 (47.7%) new upper bounds and fails to reach the best known solution for only 2 instances. Additional analysis experiments are conducted to evaluate the effects of the key components of ILS, including the two-phase local search procedure, the greedy-based perturbation procedure, and the fast incremental evaluation technique.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"179 ","pages":"Article 107033"},"PeriodicalIF":4.1,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143592974","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

Autonomous delivery vehicle routing problem with drones based on multiple delivery modes

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2025-02-27 DOI: 10.1016/j.cor.2025.107032

Jili Kong , Hao Wang , Minhui Xie

{"title":"Autonomous delivery vehicle routing problem with drones based on multiple delivery modes","authors":"Jili Kong , Hao Wang , Minhui Xie","doi":"10.1016/j.cor.2025.107032","DOIUrl":"10.1016/j.cor.2025.107032","url":null,"abstract":"<div><div>Autonomous delivery vehicles (ADVs) and drones have gained widespread attention in the last-mile delivery due to their efficiency, environmental sustainability, and convenience. Moreover, the cooperative delivery between ADVs and drones is very complex, and most of the existing studies are focused on the cooperative delivery between trucks and drones in a single delivery mode. In contrast, this paper introduces a new vehicle routing problem for an unmanned delivery system consisting of ADVs and heterogeneous drones based on multiple delivery modes. A mixed integer programming (MIP) model is constructed for the autonomous delivery vehicle routing problem with drones based on multiple delivery modes (ADVRPD-MDM) with the objective of minimizing cost. We design a randomized variable neighborhood search (RVNS) algorithm that incorporates 12 specific neighborhood structures, a random variable neighborhood descent (RVND) mechanism and a random shaking strategy to solve the model. We evaluate the application effects of each operator and verify the effectiveness of the RVNS algorithm by the improved Solomon instances. Furthermore, when compared to the large neighborhood search (LNS) algorithm in 56 instances, the RVNS algorithm demonstrates an average improvement of 3.86% in its lowest solution, thereby confirming its superior performance. Through a series of experiments, it has been observed that the integration of collaborative drones and parallel drones within the unmanned delivery system can effectively reduce the cost. The results of the sensitivity analysis demonstrate that factors such as the multi-visit capability, the utilization of multiple drones, the high payload capacity, the long endurance, and the rapid charging rate are critical in reducing the cost. Finally, we verify through a case study that the unmanned delivery system with the ADV as carrier offers cost advantages compared to those employing trucks.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"179 ","pages":"Article 107032"},"PeriodicalIF":4.1,"publicationDate":"2025-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143593074","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

Towards more efficient local search for weighted graph coloring problem in massive graphs

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2025-02-27 DOI: 10.1016/j.cor.2025.107031

Shiwei Pan , Yujiao Zhao , Jiangnan Li, Yiyuan Wang, Ye Zhang, Wenbo Zhou, Minghao Yin

{"title":"Towards more efficient local search for weighted graph coloring problem in massive graphs","authors":"Shiwei Pan , Yujiao Zhao , Jiangnan Li, Yiyuan Wang, Ye Zhang, Wenbo Zhou, Minghao Yin","doi":"10.1016/j.cor.2025.107031","DOIUrl":"10.1016/j.cor.2025.107031","url":null,"abstract":"<div><div>The weighted graph coloring problem (WGCP) is a well-known NP-hard combinatorial optimization problem with various practical applications. Due to its theoretical significance and practical relevance, numerous algorithms have been developed to address the WGCP. In the past, both exact and heuristic algorithms have primarily focused on solving classic benchmarks, with relatively few efforts dedicated to tackling the challenges posed by massive WGCP real-world applications. In our work, we propose an effective local search algorithm for the WGCP based on three main ideas. First, we introduce a new variant of configuration checking to escape from local optima. Second, we devise a novel method for selecting vertex movements that guides the search towards more favorable directions. Third, we propose a novel deep optimization strategy to perturb the solution. Extensive experiments demonstrate that our proposed algorithm outperforms several state-of-the-art algorithms on both classic and massive benchmarks. This indicates the effectiveness and superiority of our approach in solving the WGCP.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"179 ","pages":"Article 107031"},"PeriodicalIF":4.1,"publicationDate":"2025-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143548516","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

Feasible and infeasible region search for the maximally diverse grouping problem

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2025-02-27 DOI: 10.1016/j.cor.2025.107030

Xiaofan Wu , Jiejian Feng , Jinglei Yang , Yang Zhang

引用次数: 0