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

Q-learning based hyper-heuristic with clustering strategy for combinatorial optimization: A case study on permutation flow-shop scheduling problem 基于 Q-learning 的超启发式与组合优化的聚类策略：包络流车间调度问题案例研究

IF 4.1 2区工程技术

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

{"title":"Q-learning based hyper-heuristic with clustering strategy for combinatorial optimization: A case study on permutation flow-shop scheduling problem","authors":"","doi":"10.1016/j.cor.2024.106833","DOIUrl":"10.1016/j.cor.2024.106833","url":null,"abstract":"<div><p>In this paper, a Q-learning based hyper-heuristic with clustering strategy (QHH/CS) is proposed for combinatorial optimization problems (COPs). In QHH/CS, a clustering strategy based on low-dimensional mapping method is devised to map initial population to a low-dimensional space, thus obtaining multiple subpopulations accounting for different search directions. To discover more promising search regions around each subpopulation, we propose a parallel Q-learning search mechanism composed of multiple search components, including multi-subpopulation Q-table, state extraction method, contribution-driven reward function, and deep mining local search actions. Relying on these search components, QHH/CS identifies the variations of the objective values of subpopulations to evaluate the solution features of COPs, whereby valuable information can be learned during the search process of the algorithm. To illustrate the effectiveness of QHH/CS, it is applied to solve the permutation flow-shop scheduling problem. We additionally assess QHH/CS through the well-known vehicle routing problem, which confirms the general search ability of the algorithm for COPs. Moreover, the convergence analysis of the QHH/CS algorithm is performed, providing theoretical guidance for the optimization process of the proposed algorithm. Results of experiments demonstrate that QHH/CS can find high-quality solutions to the solved problems.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142167820","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

Vehicle routing problem for omnichannel retailing including multiple types of time windows and products 全渠道零售（包括多种类型的时间窗口和产品）的车辆路线问题

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-09-01 DOI: 10.1016/j.cor.2024.106828

{"title":"Vehicle routing problem for omnichannel retailing including multiple types of time windows and products","authors":"","doi":"10.1016/j.cor.2024.106828","DOIUrl":"10.1016/j.cor.2024.106828","url":null,"abstract":"<div><p>This paper addresses the capacitated vehicle routing problem for omnichannel retailing with multiple types of time windows (hard time windows and soft time windows) and multiple types of products simultaneously. The problem aims to transfer multiple products from a central warehouse to stores and satellites, where split delivery is allowed since the demands of stores or satellites are large and the different product types have different volumes. Based on different characteristics of purchasing channels, the time window of a store is a hard constraint while the time window of a satellite is a soft one. This type of vehicle routing problem exists extensively in omnichannel retail distribution systems in the logistics industry of China, which considers multiple purchasing channels for customers. Since this type of vehicle routing problem is an NP-hard problem and more complicated than the conventional vehicle routing problem with time windows, we design an adaptive large neighborhood search (ALNS) method to solve it. Finally, numerical experiments are conducted to evaluate the effectiveness of the proposed algorithm and reveal some managerial insights. The numerical experiments show that the proposed algorithm can obtain a high-quality solution under a shorter computation time compared with the state-of-the-art MIP solver (Gurobi).</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142149119","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

Machine Learning based Algorithm Selection and Genetic Algorithms for serial-batch scheduling 基于机器学习的算法选择和遗传算法用于批量连续调度

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-08-31 DOI: 10.1016/j.cor.2024.106827

{"title":"Machine Learning based Algorithm Selection and Genetic Algorithms for serial-batch scheduling","authors":"","doi":"10.1016/j.cor.2024.106827","DOIUrl":"10.1016/j.cor.2024.106827","url":null,"abstract":"<div><p>Whenever combinatorial optimization problems cannot be solved by exact solution methods in reasonable time, tailor-made algorithms (heuristics, meta-heuristics) are developed. Often, these heuristics exploit structural properties and perform well on selected subsets of the problem space. For example, this is how the two best-known construction heuristics solve the scheduling problem investigated in this study (i.e., the scheduling of parallel serial-batch processing machines with incompatible job families, restricted batch capacities, arbitrary batch capacity demands, and sequence-dependent setup times). However, when the properties change, the performance of one algorithm might decrease, and another algorithm might have been the better choice. To resolve this issue, we propose using Machine Learning to exploit the strengths of different algorithms and to select the probably best-performing algorithm for each problem instance individually. To that, we investigate a variety of methods from the “learning-to-rank” literature and propose several adaptations. Furthermore, because there is no algorithm for the considered scheduling problem that is capable to explore the entire solution space, we developed two Genetic Algorithms for the improvement of initial solutions computed by the selected algorithms. Here, we put special emphasis on ensuring that the solution representation (encoding) reflects the entire solution space and that the operators (e.g., for recombination and mutation) are appropriate to explore and exploit this space completely. Our computational experiments show an average increase of 39.19% in solution quality.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0305054824002995/pdfft?md5=7d0fb502bfbb4621f314e349f5d32365&pid=1-s2.0-S0305054824002995-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142149126","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

Adaptive large neighborhood search for drayage routing problems involving longer combination vehicles 针对涉及较长组合车辆的拖运路由问题的自适应大邻域搜索

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-08-30 DOI: 10.1016/j.cor.2024.106826

{"title":"Adaptive large neighborhood search for drayage routing problems involving longer combination vehicles","authors":"","doi":"10.1016/j.cor.2024.106826","DOIUrl":"10.1016/j.cor.2024.106826","url":null,"abstract":"<div><p>Longer combination vehicles (LCVs)—tractor-trailer combinations with two or more trailers—can move more cargo per trip than standard trucks, potentially reducing costs and emissions. Acknowledging this, the drayage industry has recently launched initiatives to increase the adoption of LCVs, aiming to mitigate supply chain issues. This paper aims to support these kinds of initiatives by tackling drayage routing problems involving LCVs and further aspects, such as heterogeneous truck fleets, containers of any size and cargo category, and compatibility constraints based on the containers’ sizes and loads. As solution method, we propose an adaptive large neighborhood search (ALNS) heuristic, whose search operators account for aspects such as truck/container compatibility and load configurations specific to each truck. The proposed ALNS heuristic also incorporates a novel acceptance criterion that seeks to escape local optima while allowing for revisiting the current best solution and avoiding search stagnation. Through a series of benchmark tests against a state-of-the-art exact approach, we show that the proposed ALNS heuristic can consistently find high-quality solutions for a wide range of instances while, in some cases, cutting runtimes from hours or even days to a few minutes. We also show that the proposed acceptance criterion enables improved performance. Finally, we use the proposed ALNS heuristic to derive managerial insights into the savings delivered by different types of LCVs in drayage operations.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0305054824002983/pdfft?md5=3e17b3fee39fe91ed7f57b94dbb8e1c5&pid=1-s2.0-S0305054824002983-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142167821","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

Fully distributed convex hull pricing based on alternating direction method of multipliers 基于交替方向乘法的全分布式凸壳定价

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-08-30 DOI: 10.1016/j.cor.2024.106823

{"title":"Fully distributed convex hull pricing based on alternating direction method of multipliers","authors":"","doi":"10.1016/j.cor.2024.106823","DOIUrl":"10.1016/j.cor.2024.106823","url":null,"abstract":"<div><p>In certain power markets, due to the non-convex operation characteristics, generators adhering to the decisions of Independent System Operators (ISO) may struggle to recover costs through local marginal energy sales. ISOs impose discriminatory additional payments as incentives for generator compliance. Convex hull pricing is a unified scheme that significantly reduces these supplementary payments. The Lagrangian dual problem of the Unit Commitment (UC) problem is solved within the dual space to determine convex hull prices. To navigate the computational challenges posed by the real large-scale power systems, we propose a methodology for a global convergence distributed solution, which addresses the Lagrangian dual problem. This methodology is based on the Alternating Direction Method of Multipliers (ADMM) algorithm and incorporates convex hull cut planes to enhance computational efficiency. Moreover, a tight and compact UC model is employed to reduce the number of iterations. Numerical results indicate that if the convex hull descriptions of units can be obtained, our algorithm is capable of providing precise convex hull prices and high-quality solutions within a feasible timeframe, while also maintaining the confidentiality of individual subset unit information.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142149121","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

Reviewing extensions and solution methods of the planar Weber single facility location problem 回顾平面韦伯单一设施定位问题的扩展和求解方法

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-08-30 DOI: 10.1016/j.cor.2024.106825

{"title":"Reviewing extensions and solution methods of the planar Weber single facility location problem","authors":"","doi":"10.1016/j.cor.2024.106825","DOIUrl":"10.1016/j.cor.2024.106825","url":null,"abstract":"<div><p>One of the classic foundational constructs of Location Science was proposed by Alfred Weber in 1909. His construct involved finding the location for a single production facility which minimized the sum of weighted distances of transporting the needed raw materials from localized sources along with the sum of weighted distances in delivering the final product to one or more markets.</p><p>The first objective of this paper is to review the major advancements in this simple classic single facility location problem and its variations. One can find in the literature a very large number of algorithms to solve the standard Weber problem. Some are iterative and others are finite even for geometric Euclidean and rectilinear spaces. Moreover, some schemes are efficient (theoretically) and others are practically quite fast.</p><p>The second goal of this paper is to show that many extensions of the standard Weber problem can be solved by solving a polynomial number of standard Weber problems. This unifying result implies, in particular, that all these extensions are polynomially solvable since the standard Weber problem can be solved in polynomial time. In addition, with this unifying approach we solve some important planar non-convex Euclidean location problems in polynomial time.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0305054824002971/pdfft?md5=719726b54554bbac993c8d8330e91a5e&pid=1-s2.0-S0305054824002971-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142149120","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

New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: A computational evaluation 两阶段装配调度问题的新启发式方法，最小化总提前率和迟到率：计算评估

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-08-29 DOI: 10.1016/j.cor.2024.106824

{"title":"New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: A computational evaluation","authors":"","doi":"10.1016/j.cor.2024.106824","DOIUrl":"10.1016/j.cor.2024.106824","url":null,"abstract":"<div><p>Traditionally, scheduling literature has focused mainly on solving problems related to processing jobs with non-assembly operations. Despite the growing interest in the assembly literature in recent years, knowledge of the problem is still in its early stages in many aspects. In this regard, we are not aware of any previous contributions that address the assembly scheduling problem with just-in-time objectives. To fill this gap, this paper studies the 2-stage assembly scheduling problem minimising the sum of total earliness and total tardiness. We first analyse the relationship between the decision problem and the generation of the due dates of the jobs, and identify the equivalences with different related decision problems depending on the instances. The properties and conclusions obtained in the analysis are applied to design two constructive heuristics and a composite heuristic. To evaluate our proposals, different heuristics from the state-of-the-art of related scheduling problems are adapted, and a computational evaluation is carried out. The excellent behaviour of the proposed algorithms is demonstrated by an extensive computational evaluation.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S030505482400296X/pdfft?md5=b208a6facb1331eea8b1bfb4e7263b83&pid=1-s2.0-S030505482400296X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142128663","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

Redesigning a NSGA-II metaheuristic for the bi-objective Support Vector Machine with feature selection 重新设计具有特征选择的双目标支持向量机的 NSGA-II 元求真法

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-08-24 DOI: 10.1016/j.cor.2024.106821

引用次数: 0

Problem size reduction methods for large CVRPs 缩小大型 CVRP 问题规模的方法

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-08-23 DOI: 10.1016/j.cor.2024.106820

引用次数: 0

Tri-objective lot-streaming scheduling optimization for hybrid flow shops with uncertainties in machine breakdowns and job arrivals using an enhanced genetic programming hyper-heuristic 使用增强型遗传编程超启发式优化具有机器故障和作业到达不确定性的混合流水车间的三目标批量流水排程

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-08-23 DOI: 10.1016/j.cor.2024.106817

{"title":"Tri-objective lot-streaming scheduling optimization for hybrid flow shops with uncertainties in machine breakdowns and job arrivals using an enhanced genetic programming hyper-heuristic","authors":"","doi":"10.1016/j.cor.2024.106817","DOIUrl":"10.1016/j.cor.2024.106817","url":null,"abstract":"<div><p>Lot-streaming scheduling has been widely recognized as a means to improve shop productivity, but there is few research on lot-streaming scheduling problems under dynamic disturbances. To fill the gap, lot-streaming scheduling optimization approach for hybrid flow shops with uncertainties in machine breakdowns and job arrivals is proposed. A mathematical model is formulated with objectives of minimizing maximum tardiness, total idle energy consumption of the machine, and maximum makespan. Since the Genetic Programming Hyper Heuristic algorithm has better results in solving dynamic scheduling problems, a Collaborative Harmony Search-based Genetic Programming Hyper Heuristic (CHS-GPHH) is presented to solve the dynamic lot-streaming hybrid flow shop scheduling problem (DLS-HFSSP) with the two dynamic events occurring simultaneously. In the improved algorithm, a neighborhood structure based on harmony search is developed for lot splitting. To verify the effectiveness of the proposed approach, the various comparative studies c are conducted on the lot-streaming dynamic hybrid flow shop scheduling. The results demonstrate the effectiveness of each improvement component of the CHS-GPHH, and verify that CHS-GPHH is an effective approach to deal with DLS-HFSSP with the in all the scenarios.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142097861","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