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

An exact algorithm for simultaneous pickup and delivery problem with split demand and time windows 分批需求和时间窗口下同时取货和送货问题的精确算法

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-07-05 DOI: 10.1016/j.cor.2024.106761

Ziqiang Zhu , Yanru Chen , M.I.M. Wahab

{"title":"An exact algorithm for simultaneous pickup and delivery problem with split demand and time windows","authors":"Ziqiang Zhu , Yanru Chen , M.I.M. Wahab","doi":"10.1016/j.cor.2024.106761","DOIUrl":"10.1016/j.cor.2024.106761","url":null,"abstract":"<div><p>This study introduces a new variant of the vehicle routing problem (VRP) called the simultaneous pickup and delivery problem with split demand and time windows (SPDP-SDTW). The motivation behind this study stems from real-life urban and rural delivery scenarios, encompassing features such as split demand, simultaneous pickup and delivery, many-to-many pickup and delivery, and time windows. The study thoroughly investigates the properties of the optimal solution for the SPDP-SDTW. Based on these properties, an arc flow model is developed for the SPDP-SDTW. Dantzig Wolfe (DW) decomposition techniques are employed to obtain the master problem and the pricing subproblem. In order to effectively address the SPDP-SDTW, an improved branch and price (I-BP) algorithm is proposed, incorporating a tailored column generation (CG) algorithm, branching strategies, and dual stabilization strategies. The proposed CG algorithm provides a framework that combines the improved adaptive degree heuristic (I-AGH) algorithm and the solver Gurobi. This integration substantially mitigates the computational burden involved in solving the subproblem. Extensive computational experiments conducted on datasets of varying sizes, including small, medium, and large instances, consistently demonstrate that the I-BP algorithm performs the best in both solution quality and computational efficiency when compared to existing exact and heuristic algorithms.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141636993","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 reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem 针对延迟位置路由问题的强化学习指导混合进化算法

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-07-05 DOI: 10.1016/j.cor.2024.106758

Yuji Zou , Jin-Kao Hao , Qinghua Wu

{"title":"A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem","authors":"Yuji Zou , Jin-Kao Hao , Qinghua Wu","doi":"10.1016/j.cor.2024.106758","DOIUrl":"10.1016/j.cor.2024.106758","url":null,"abstract":"<div><p>The latency location routing problem integrates the facility location problem and the multi-depot cumulative capacitated vehicle routing problem. This problem involves making simultaneous decisions about depot locations and vehicle routes to serve customers while aiming to minimize the sum of waiting (arriving) times for all customers. To address this computationally challenging problem, we propose a reinforcement learning guided hybrid evolutionary algorithm following the framework of the memetic algorithm. The proposed algorithm relies on a diversity-enhanced multi-parent edge assembly crossover to build promising offspring and a reinforcement learning guided variable neighborhood descent to determine the exploration order of multiple neighborhoods. Additionally, strategic oscillation is used to achieve a balanced exploration of both feasible and infeasible solutions. The competitiveness of the algorithm against state-of-the-art methods is demonstrated by experimental results on the three sets of 76 popular instances, including 51 improved best solutions (new upper bounds) for the 59 instances with unknown optima and equal best results for the remaining instances. We also conduct additional experiments to shed light on the key components of the algorithm.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0305054824002302/pdfft?md5=0678965ad9ac58c5a1b77674e6d55c4d&pid=1-s2.0-S0305054824002302-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141630220","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

Integrating order picking and vehicle routing decisions in a dynamic e-commerce setting 在动态电子商务环境中整合订单分拣和车辆路线决策

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-07-04 DOI: 10.1016/j.cor.2024.106762

Ruben D’Haen , Katrien Ramaekers , Claudia Archetti , Kris Braekers

{"title":"Integrating order picking and vehicle routing decisions in a dynamic e-commerce setting","authors":"Ruben D’Haen , Katrien Ramaekers , Claudia Archetti , Kris Braekers","doi":"10.1016/j.cor.2024.106762","DOIUrl":"https://doi.org/10.1016/j.cor.2024.106762","url":null,"abstract":"<div><p>Responding to e-commerce orders as quickly as possible is indispensable for companies competing in the current retailing landscape. After a customer orders online, the requested items should be picked in the warehouse and delivered to the customer’s location. Previous research showed the benefits of integrating the order picking and vehicle routing decisions in a static context. To achieve shorter customer response times, we propose multiple new algorithms in this study, able to handle the integrated problem of picking and delivery in a setting with dynamic order arrivals and considering more complex picking policies. We develop and implement four online large neighbourhood search algorithms, differing in their degree of integration between picking and routing decisions. The algorithms are tested on different operational settings. Differences between the algorithms and the impact of the operating context are analysed by use of an ANOVA. The results highlight the importance of integrated decision-making, as well as the large impact of the operating context on the operational efficiency. Furthermore, we demonstrate the environmental impact of stringent customer requests. These insights can be used by companies to optimise their operations.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141595599","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

Distributionally robust chance-constrained kernel-based support vector machine 分布稳健的机会约束核支持向量机

IF 4.1 2区工程技术

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

Fengming Lin , Shu-Cherng Fang , Xiaolei Fang , Zheming Gao

{"title":"Distributionally robust chance-constrained kernel-based support vector machine","authors":"Fengming Lin , Shu-Cherng Fang , Xiaolei Fang , Zheming Gao","doi":"10.1016/j.cor.2024.106755","DOIUrl":"10.1016/j.cor.2024.106755","url":null,"abstract":"<div><p>Support vector machine (SVM) is a powerful model for supervised learning. This article addresses the nonlinear binary classification problem using kernel-based SVM with uncertainty involved in the input data specified by the first- and second-order moments. To achieve a robust classifier with small probabilities of misclassification, we investigate a distributionally robust chance-constrained kernel-based SVM model. Since the moment information in the original problem becomes unclear/unavailable in the feature space via kernel transformation, we develop a data-driven approach utilizing empirical moments to provide a second-order cone programming (SOCP) reformulation for efficient computation. To speed up the required computations for solving large-size problems in higher dimensional space and/or with more sampling points involved in estimating empirical moments, we further design an alternating direction multipliers-based algorithm for fast computations. Extensive computational results support the effectiveness and efficiency of the proposed model and solution method. Results on public benchmark datasets without any moment information indicate that the proposed approach still works and, surprisingly, outperforms some commonly used state-of-the-art kernel-based SVM models.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141623797","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 multi-warehouse inventory model under hybrid-price-stock dependent demand and a bulk release pattern 混合价格库存需求和批量发布模式下的多仓库库存模型

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-07-02 DOI: 10.1016/j.cor.2024.106764

Jaime Rodríguez-Mazo, Rocío Ruiz-Benítez

{"title":"A multi-warehouse inventory model under hybrid-price-stock dependent demand and a bulk release pattern","authors":"Jaime Rodríguez-Mazo, Rocío Ruiz-Benítez","doi":"10.1016/j.cor.2024.106764","DOIUrl":"https://doi.org/10.1016/j.cor.2024.106764","url":null,"abstract":"<div><p>In retailing, sales may determinatively depend on both selling price and how much stock is displayed before customers. However, when high logistics costs are incurred at the point of sale, nearby rented warehouses may be arranged as an economic stock point in-between, and partially in lieu of, external orders. Likewise, a simplified ordering process can be attained via modular logistics, a practice considered in different competitive markets. The objective of the present paper is to develop a deterministic modular replenishment model with multiple warehouses (an own warehouse, OW, and rented warehouses, RW, of custom capacities), assuming price- and stock-dependent demand, and a bulk release pattern. The global optimal selling price, order-up-to level, reorder level, and the number and capacity of warehouses conducive to profit maximisation are then determined. To this end, theoretical research in extension of multi-warehouse and hybrid-price-stock dependent demand inventory models is conducted together with computer-assisted numerical studies. Findings show that 1) optimal selling price and displayed stock level may increase with market size, 2) displayed-stock demand elasticity can improve market efficiency, 3) partial use of existing fixed OW capacity may prove optimal as demand decreases, 4) successive RWs may increase profit, yet at a decreasing rate, 5) joint warehouse/price optimisation can be most profitable as demand decreases. From the above, it follows that modular downstream warehousing, jointly with displayed stock-based marketing practices, may constitute an effective tool toward industry profitability and supply–demand alignment, specially during contractionary periods, where price-reducing regulatory efforts may, in turn, become partly dispensable.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141595665","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

Energy-aware flow shop scheduling with uncertain renewable energy 具有不确定可再生能源的能源感知流程车间调度

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-07-02 DOI: 10.1016/j.cor.2024.106741

Masoumeh Ghorbanzadeh , Morteza Davari , Mohammad Ranjbar

{"title":"Energy-aware flow shop scheduling with uncertain renewable energy","authors":"Masoumeh Ghorbanzadeh , Morteza Davari , Mohammad Ranjbar","doi":"10.1016/j.cor.2024.106741","DOIUrl":"10.1016/j.cor.2024.106741","url":null,"abstract":"<div><p>This paper investigates an energy-aware flow shop scheduling problem with on-site renewable and grid energy resources. To deal with the uncertainty of renewable energy resources, we first develop two two-stage stochastic programming formulations based on pulse and step models to minimize the total energy cost purchased from the grid. Next, we develop two robust models where in the first one we assume the cost of buying energy from the grid is limited to a given budget and we aim to maximize the number of scenarios that comply with this limitation. In the second robust model, we aim to minimize the grid energy cost by considering a predetermined confidence level. To solve the stochastic and robust models, we develop Benders decomposition algorithms and incorporate the warm-up technique for Benders algorithm. Computational experiments on randomly generated test instances demonstrate that the step formulation outperforms the pulse formulation for larger instances. Additionally, each developed Benders decomposition algorithm outperforms its corresponding model, and the warm-up technique improves the performance of the Benders decomposition algorithms.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141623800","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

Applying instance space analysis for metaheuristic selection to the 0–1 multidemand multidimensional knapsack problem 将实例空间分析应用于0-1多题多维knapsack问题的元搜索选择

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-07-02 DOI: 10.1016/j.cor.2024.106747

Matthew E. Scherer, Raymond R. Hill, Brian J. Lunday, Bruce A. Cox, Edward D. White

{"title":"Applying instance space analysis for metaheuristic selection to the 0–1 multidemand multidimensional knapsack problem","authors":"Matthew E. Scherer, Raymond R. Hill, Brian J. Lunday, Bruce A. Cox, Edward D. White","doi":"10.1016/j.cor.2024.106747","DOIUrl":"10.1016/j.cor.2024.106747","url":null,"abstract":"<div><p>The empirical testing of metaheuristic solution methods for optimization applications should consider the effect of the underlying structure of the optimization problem test instances employed. This paper presents a methodology for analyzing the performance of metaheuristics applied to the 0–1 multidemand multidimensional knapsack problem (MDMKP) specifically considering problem structure. This research leverages instance space analysis (ISA) to graphically depict both the multidimensional problem structure and metaheuristic performance. A new instance generation method augments the existing set of test instances; in doing so, it introduces correlation structure into the problem and helps ensure MDMKP instance feasibility. Testing compares four metaheuristics from the literature and trains an interpretable machine learning model to select a metaheuristic for a given instance based on that problem’s meta-features. The results show that the correlation structure meta-features are significant factors affecting metaheuristic performance and that a decision tree model can provide interpretable insights into the algorithm selection problem. This work demonstrates the usefulness of ISA for rigorous empirical testing to enhance understanding the performance of metaheuristics applied to the MDMKP.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141623798","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

Effective heuristics for permutation and non-permutation flow shop scheduling with missing operations 具有缺失操作的置换和非置换流程车间调度的有效启发式方法

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-07-02 DOI: 10.1016/j.cor.2024.106742

Marcus Ritt , Daniel Alejandro Rossit

{"title":"Effective heuristics for permutation and non-permutation flow shop scheduling with missing operations","authors":"Marcus Ritt , Daniel Alejandro Rossit","doi":"10.1016/j.cor.2024.106742","DOIUrl":"https://doi.org/10.1016/j.cor.2024.106742","url":null,"abstract":"<div><p>In recent years, thanks to the fourth industrial revolution, there have been significant increases in the flexibility and agility of industrial processes. In this way, business models based on mass customization of production have gained presence in the industry. In terms of production scheduling in flow shop systems, customization affects production operations, in many cases giving rise to the problem of missing operations, that is, there are jobs that do not perform all operations. Modeling missing operations as zero-time operations, allows to find schedules, but wastes efficiency since zero-time operations lead to unnecessary waiting times. In this paper, we demonstrate that even in permutation flow shops treating missing operations as zero-time operations can make the makespan or the total flow time of optimal schedules arbitrarily worse. We show that a promising way to address missing operations is to consider limited non-permutation solutions over the sub-jobs of a job composed of regular operations. We introduce an efficient representation for such schedules and propose algorithms that allow to solve the problem based on iterated greedy methods. The computational results show that the proposed algorithms are superior to the state-of-the-art algorithms.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141607565","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

Modeling and solving framework for tactical maintenance planning problems with health index considerations 考虑健康指数的战术维护规划问题建模与求解框架

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-07-02 DOI: 10.1016/j.cor.2024.106763

Ernest Foussard , Margaux Nattaf , Marie-Laure Espinouse , Grégory Mounié

{"title":"Modeling and solving framework for tactical maintenance planning problems with health index considerations","authors":"Ernest Foussard , Margaux Nattaf , Marie-Laure Espinouse , Grégory Mounié","doi":"10.1016/j.cor.2024.106763","DOIUrl":"https://doi.org/10.1016/j.cor.2024.106763","url":null,"abstract":"<div><p>Maintenance planning is one of the main challenges of the management of production systems. Thanks to recent technological innovations and the development of sensors, it is possible to construct degradation models of equipment condition, thus providing an assessment of the equipment health modeled by a health index indicator. In this work, we present an original tactical maintenance planning problem involving a Health Index indicator on the components of the equipment. Within this framework, maintenance can be seen as a form of delayed production. This observation allows us to derive an original lot-sizing based approach for our tactical maintenance planning problem. Aside from the classical cost minimization objective, the problem also involves a resource consumption objective to be minimized. The problem is proven to be strongly NP-hard in the general case, and a bi-objective Mixed Integer Linear Program is proposed. Then, two matheuristics are defined. A degradation matheuristic allowing several degradations of the objective functions and a Pareto-based matheuristic selecting solution of good quality from a restricted pareto front.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0305054824002351/pdfft?md5=c92866e993bedda915d1a07d28e2a09c&pid=1-s2.0-S0305054824002351-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141595663","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

An efficient probability-based VNS algorithm for delivery territory design 基于概率的高效 VNS 算法用于配送区域设计

IF 4.1 2区工程技术

Computers & Operations Research Pub Date : 2024-07-02 DOI: 10.1016/j.cor.2024.106756

Ahmed Aly , Adriana F. Gabor , Nenad Mladenovic , Andrei Sleptchenko

{"title":"An efficient probability-based VNS algorithm for delivery territory design","authors":"Ahmed Aly , Adriana F. Gabor , Nenad Mladenovic , Andrei Sleptchenko","doi":"10.1016/j.cor.2024.106756","DOIUrl":"https://doi.org/10.1016/j.cor.2024.106756","url":null,"abstract":"<div><p>This paper deals with the Delivery Territory Design Problem (DTDP), a districting problem that often occurs in delivery operations. The goal of the problem is to construct clusters of nodes (territories) such that the maximum diameter of a territory is minimized, while the territories designed are balanced w.r.t. some performance measures. We propose to solve the DTDP using a Probabilistic Variable Neighborhood Search (ProbVNS) algorithm based on two local search procedures: a tailored randomized shake procedure that targets both a reduction of infeasibility and diversification, and a deterministic local search based on a linear combination of objective and constraint violation. In addition to searching in different neighborhoods, the ProbVNS also changes the search direction by exploring different penalties for violating constraints. Numerical experiments show that ProbVNS outperforms a recent GRASP with the Path-Relinking (PR) algorithm proposed in the literature in terms of feasibility and objective value. In the tested instances, ProbVNS obtained a lower infeasibility measure in 90% of the instances. For these instances, the average decrease in the objective value was 8.3%, with a maximum decrease of 51%. Finally, the running times of ProbVNS are, on average, 2.7 times lower than those of PR.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0305054824002284/pdfft?md5=ffac45011b6f0a4403de83f9574ef581&pid=1-s2.0-S0305054824002284-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141595598","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