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

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

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

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

Using machine learning to identify hidden constraints in vehicle routing problems

IF 4.1 2区工程技术

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

Anna Konovalenko , Lars Magnus Hvattum , Mohamed Kais Msakni

{"title":"Using machine learning to identify hidden constraints in vehicle routing problems","authors":"Anna Konovalenko , Lars Magnus Hvattum , Mohamed Kais Msakni","doi":"10.1016/j.cor.2025.107029","DOIUrl":"10.1016/j.cor.2025.107029","url":null,"abstract":"<div><div>Last-mile delivery involves a series of complex tasks in an unpredictable environment. Decision support tools based on optimization algorithms construct efficient routes for drivers, optimizing the cost of making deliveries. However, drivers often deviate from these routes due to factors not considered in the decision-making process. This discrepancy raises the question of how to identify routes that are useable in real-world scenarios. Our research proposes using modern machine learning techniques to classify routes based on their practical usability. In a controlled environment, we demonstrate that machine learning can learn hidden factors influencing route viability by focusing on variants of the vehicle routing problem with additional constraints like time window, capacity and precedence. For each underlying constraint, we show that a machine learning model can be trained to classify routes based on whether or not they violate the constraint. Using datasets generated from well-known benchmark instances, we present computational experiments to evaluate model performance. We discuss which types of constraints are more challenging to recognize and how large a dataset must be to allow for accurate classification. This research has the potential to improve existing decision tools, enabling them to generate routes that better account for real-world complexities.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"179 ","pages":"Article 107029"},"PeriodicalIF":4.1,"publicationDate":"2025-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143526653","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Multi-objective flexible job shop scheduling based on feature information optimization algorithm

IF 4.1 2区工程技术

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

Zeyin Guo, Lixin Wei, Jinlu Zhang, Ziyu Hu, Hao Sun, Xin Li

{"title":"Multi-objective flexible job shop scheduling based on feature information optimization algorithm","authors":"Zeyin Guo, Lixin Wei, Jinlu Zhang, Ziyu Hu, Hao Sun, Xin Li","doi":"10.1016/j.cor.2025.107027","DOIUrl":"10.1016/j.cor.2025.107027","url":null,"abstract":"<div><div>Multi-objective optimization methods are increasingly used in job shop scheduling optimization strategies. However, in the design process of multi-objective optimization strategies, a neighborhood search is performed on all solutions in the optimization algorithm, resulting in a time-consuming search. In the algorithm selection process, feature information carried by individuals is often ignored, leading to a lack of targeted guidance ability in the algorithm. To address the limitations of the existing methods, a multi-objective flexible job shop scheduling method based on a feature information optimization algorithm (FIOA) was proposed. First, a framework of multiple group optimization algorithms was applied to construct diverse groups. Subsequently, a representative individual selection strategy was applied to mine individual offspring information and accelerate population convergence. To balance the exploration ability and computational resources of the FIOA, multiple neighborhood search rules were used to improve the utilization rate of individual offspring. In this study, the parameter configuration of the proposed algorithm was calibrated using the Taguchi method. To evaluate the effectiveness and superiority of the FIOA, each improvement of the FIOA algorithm was evaluated. In addition, it was compared with state-of-the-art algorithms in benchmark tests, and the results showed that the FIOA outperformed the other algorithms in solving flexible job shop scheduling.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"179 ","pages":"Article 107027"},"PeriodicalIF":4.1,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143509484","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 comprehensive stochastic programming model for transfer synchronization in transit networks

IF 4.1 2区工程技术

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

Zahra Ansarilari , Merve Bodur , Amer Shalaby

{"title":"A comprehensive stochastic programming model for transfer synchronization in transit networks","authors":"Zahra Ansarilari , Merve Bodur , Amer Shalaby","doi":"10.1016/j.cor.2025.107015","DOIUrl":"10.1016/j.cor.2025.107015","url":null,"abstract":"<div><div>We investigate the stochastic transfer synchronization problem, which seeks to synchronize the timetables of different routes in a transit network to reduce transfer waiting times, delay times, and unnecessary in-vehicle times. We present a sophisticated two-stage stochastic mixed-integer programming model that takes into account variability in passenger walking times between bus stops, bus running times, dwell times, and demand uncertainty. Our model incorporates new features related to dwell time determination by considering passenger arrival patterns at bus stops which have been neglected in the literature on transfer synchronization and timetabling. We solve a sample average approximation of our model using a problem-based scenario reduction approach, and the progressive hedging algorithm. As a proof of concept, our computational experiments on instances using transfer nodes in the City of Toronto, with a mixture of low- and high-frequency routes, demonstrate the potential advantages of the proposed model. Our findings highlight the necessity and value of incorporating stochasticity in transfer-based timetabling models.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"179 ","pages":"Article 107015"},"PeriodicalIF":4.1,"publicationDate":"2025-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143509483","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 two-echelon vehicle routing problem with pickups, deliveries, and deadlines

IF 4.1 2区工程技术

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

M. Arya Zamal , Albert H. Schrotenboer , Tom Van Woensel

{"title":"The two-echelon vehicle routing problem with pickups, deliveries, and deadlines","authors":"M. Arya Zamal , Albert H. Schrotenboer , Tom Van Woensel","doi":"10.1016/j.cor.2025.107016","DOIUrl":"10.1016/j.cor.2025.107016","url":null,"abstract":"<div><div>This paper introduces the Two-Echelon Vehicle Routing Problem with Pickups, Deliveries, and Deadlines (2E-VRP-PDD), an emerging routing variant addressing the operations of logistics companies connecting consumers and suppliers in metropolitan areas. Logistics companies typically organize their logistics in such metropolitan areas via multiple geographically dispersed two-echelon distribution systems. The 2E-VRP-PDD is the practical problem that needs to be solved within each of such a single two-echelon distribution system, thereby merging first and last-mile logistics operations. Specifically, it integrates the distribution of last-mile parcels from the hub via satellites to the consumers with the collection of first-mile parcels from the suppliers via satellites that return to the hub. Moreover, it considers deadlines before first-mile parcels arrive at the hub, which must be transported further in the network. We solve the 2E-VRP-PDD with a newly developed Adaptive Large Neighborhood Search (ALNS) combined with a post-process integer programming model. Our ALNS provides high-quality solutions on established benchmark instances from the literature. On a new benchmark set for the 2E-VRP-PDD, we find that modifying time restrictions, such as parcel delivery deadlines at the city hub, can lead to an 8.27% cost increase, highlighting the overhead associated with same-day delivery compared to next-day delivery operations. Finally, by analyzing real-life instances containing up to 2150 customers obtained from our industry collaborator in Jakarta, Indonesia, we show that our ALNS can reduce the cost of operations by up to 17.54% compared to current practice.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"179 ","pages":"Article 107016"},"PeriodicalIF":4.1,"publicationDate":"2025-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143487875","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0