Computers & Operations Research最新文献

{"title":"Adding servers to reinforce facilities in a spatially distributed queueing system","authors":"Monir Sabbaghtorkan ,&nbsp;Rajan Batta ,&nbsp;Qing He","doi":"10.1016/j.cor.2024.106862","DOIUrl":"10.1016/j.cor.2024.106862","url":null,"abstract":"<div><div>We study the problem of adding servers to reinforce functioning facilities modeled as spatially distributed <span><math><mrow><mi>M</mi><mo>/</mo><mi>M</mi><mo>/</mo><mi>c</mi></mrow></math></span> type queuing systems. We consider two modes, stationary and interactive. The stationary mode is for a situation in which adding new servers to functioning facilities does not change the demand distribution (e.g., hospital care or vehicle inspection). The interactive mode is for a situation in which adding servers will likely change the demand distribution (e.g., gas stations, electric vehicle charging stations). Here we use the gravity rule to model demand adjustment. A case study is presented based on allocation of gas servers to existing gas stations in an hurricane evacuation event. Managerial insights are provided based on sensitivity analysis.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"173 ","pages":"Article 106862"},"PeriodicalIF":4.1,"publicationDate":"2024-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142536180","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}

{"title":"Designing a resilient supply chain network: A multi-objective data-driven distributionally robust optimization method","authors":"Shengjie Chen,&nbsp;Yanju Chen","doi":"10.1016/j.cor.2024.106868","DOIUrl":"10.1016/j.cor.2024.106868","url":null,"abstract":"<div><div>Uncertainty of supply chain disruption poses a significant challenge to decision-making in many real-life problems. In this paper, a new multi-objective data-driven distributionally robust optimization (MDDRO) model for the resilient supply chain network (RSCN) design problem under disruption scenario is developed, which includes minimizing the total cost, carbon emissions, and delivery time. In the context of supply chain disruption, it is important self-evidently that products can be supplied normally and the practical demand can be met. In handling the partial probability distribution information of the considered uncertain demand, this paper uses a data-driven Wasserstein-Moment ambiguity set (WMAS), which incorporate the Wasserstein metric and Moment information, and a robust counterpart to transform the developed model into a tractable approximation form. The finite-sample performance guarantee of the optimal solution of MDDRO model with Wasserstein-Moment ambiguous chance constraint is given. An accelerated Branch and cut algorithm (BCA) is constructed to solve the MDDRO model. Finally, through the investigation of a real-life case and sensitivity analysis of key parameters, some managerial insights are put forward.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"173 ","pages":"Article 106868"},"PeriodicalIF":4.1,"publicationDate":"2024-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142536182","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}

{"title":"A branch-cut-and-price approach for the two-echelon vehicle routing problem with drones","authors":"Sylvain Lichau ,&nbsp;Ruslan Sadykov ,&nbsp;Julien François ,&nbsp;Rémy Dupas","doi":"10.1016/j.cor.2024.106869","DOIUrl":"10.1016/j.cor.2024.106869","url":null,"abstract":"<div><div>We present a new set-partitioning model for the two-echelon vehicle routing problem with drones (2E-VRP-D). In this model, partial routes corresponding to drone movements are enumerated by an efficient dynamic program. A state-of-the-art exact branch-cut-and-price algorithm solves the model using a labeling algorithm for the pricing problems. We further propose an adaptation of the well-known rounded capacity cuts, specifically tailored to address this problem, as well as pre-processing methods designed to enhance the algorithm’s efficiency. In addition, we propose an effective heuristic branch-cut-and-price based on the exact algorithm. Computational experiments demonstrate that the exact algorithm solves all instances from the 2E-VRP-D literature and significantly increases the size of optimally solved clustered instances. Finally, a sensitivity analysis is conducted to assess the impact of the proposed enhancements.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"173 ","pages":"Article 106869"},"PeriodicalIF":4.1,"publicationDate":"2024-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142536181","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}

{"title":"Sustainable inventory models under carbon emissions regulations: Taxonomy and literature review","authors":"Makoena Sebatjane","doi":"10.1016/j.cor.2024.106865","DOIUrl":"10.1016/j.cor.2024.106865","url":null,"abstract":"<div><div>Atmospheric levels of carbon emissions have been increasing rapidly due to factors such as industrialisation. In response to this, various governments around the world have introduced carbon emissions regulations to curb the negative effects of emissions. Such regulations include carbon tax, cap, cap-and-trade, and cap-and-offset, among others. Given that supply chains are a major source of emissions, research in the broader subject of green supply chain management has experienced rapid growth in recent years. The prevalence of emissions regulations around the world has forced researchers in the area of inventory management to incorporate various emissions regulations into inventory models. Consequently, the sub-area of sustainable inventory models under emissions regulations has emerged as a very active research field within a short space of time. This paper aims to review the current literature on sustainable inventory models under carbon emissions regulations over the period 2013–2023. In addition, the paper also develops a novel taxonomy for classifying the literature, utilising factors such as types of emissions regulations, input data, types of items, shortages, delayed payments, nature of the demand, and objective function, among others. An analysis of the reviewed literature indicates that sustainable inventory models under emissions regulations is a rapidly growing area of research, driven mostly by the increased legislation around emissions. In terms of future research agenda, accounting for uncertainties, bridging the gap between theory and practice via real-life case studies, and applying soft computing methods represent some of the most promising areas for further development.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"173 ","pages":"Article 106865"},"PeriodicalIF":4.1,"publicationDate":"2024-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142445348","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}

{"title":"An effective mitigation strategy to hedge against absenteeism of occasional drivers","authors":"Simona Mancini ,&nbsp;Margaretha Gansterer ,&nbsp;Chefi Triki","doi":"10.1016/j.cor.2024.106858","DOIUrl":"10.1016/j.cor.2024.106858","url":null,"abstract":"<div><div>Companies can use occasional drivers to increase efficiency on last-mile deliveries. However, as occasional drivers are freelancers without contracts, they can decide at short notice whether they perform delivery requests. If they do not perform their tasks, this is known as driver absenteeism, which obviously disrupts the operations of companies. This paper tackles this problem by developing an auction-based system, including a mitigation strategy to hedge against the absenteeism of occasional drivers. According to this strategy, a driver can bid not only for serving bundles but also to act as a reserved driver. Reserved drivers receive a fee to ensure their presence but are not guaranteed to be assigned to a specific bundle. The problem is modeled as a two-stage stochastic problem with recourse activation. To solve this problem, this paper develops a self-learning matheuristic (SLM) and an iterated local search (ILS) that exploits SLM as a local search operator. Through an extensive computational study, this paper shows the clear dominance of the newly proposed approach in terms of solution quality, run times, and customers’ perceived quality of service compared against three different deterministic approaches. The Value of the Stochastic Solution, a well-known stochastic parameter, is also analyzed. Finally, the identikit of the perfect reserved driver, based on data observed in optimal solutions, is discussed.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"173 ","pages":"Article 106858"},"PeriodicalIF":4.1,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142441514","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}

{"title":"Towards sustainable scheduling of unrelated parallel batch processors: A multiobjective approach with triple bottom line, classical and data-driven robust optimization","authors":"Ali Fallahi,&nbsp;Erfan Amani Bani,&nbsp;Mohsen Varmazyar","doi":"10.1016/j.cor.2024.106863","DOIUrl":"10.1016/j.cor.2024.106863","url":null,"abstract":"<div><div>Sustainable scheduling has become a critical aspect of modern industrial practices, requiring the integration of economic, environmental, and social dimensions. This research introduces an integrated problem for scheduling unrelated batch processors, aiming to optimize total cost, energy consumption, and social benefit through a multiobjective mixed-integer linear mathematical programming model. The study addresses the uncertainty in job processing time using robust optimization to enhance the model’s reliability. A three-stage solution methodology is proposed to solve the problem. First, robust optimization approaches are suggested to handle job processing time uncertainty. To this end, classical and kernel learning data-driven robust approaches are employed for uncertainty handling in cases of interval-bounded and distributional asymmetry uncertainties. Then, the global criterion multiobjective method is presented to resolve goal conflicts. To tackle the NP-hard complexity, three efficient multiobjective metaheuristic algorithms, non-dominated sorting genetic algorithm-II, multiobjective particle swarm optimization, and multiobjective grey wolf optimizer, are designed. The developed model and methodologies are extensively evaluated through numerical experiments. Results demonstrate the efficiency of the current framework against the literature model in solving the studied problem. Also, the robust models can properly handle the problem’s uncertainty regarding the assumptions of studied cases. The global criterion method’s performance is acceptable for small instances, while metaheuristics excel in solving larger problems. Based on the assumptions of the studied robust cases, the developed framework is investigated for two case studies from poultry production and glass ceramization real-world industries to illustrate its applicability further.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"173 ","pages":"Article 106863"},"PeriodicalIF":4.1,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142440930","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}

{"title":"A job assignment scheduling algorithm with variable sublots for lot-streaming flexible job shop problem based on NSGAII","authors":"Shuai Shao ,&nbsp;Gaochao Xu ,&nbsp;Jiaxing Li ,&nbsp;Ziqi Liu ,&nbsp;Zhenjun Jin","doi":"10.1016/j.cor.2024.106866","DOIUrl":"10.1016/j.cor.2024.106866","url":null,"abstract":"<div><div>The flexible job shop scheduling problem has gained lots of attention from scholars because of its high flexibility. The lot-streaming scheduling strategy with its advantages of high resource utilization and reduced response time has gradually become an important solution to the flexible job shop scheduling problem at this stage, but it assumes that the number of available processing equipment is not limited. However, the number of equipment that can be processed in parallel for a single process in the actual production of small and medium-sized enterprises is limited. To address the issue, a multi-objective optimal scheduling method for variable sublots flexible shops involving switching time and switching operator restrictions is proposed in this paper, which can be described as based on the principle of job balancing the rational selection of the number of machines and jobs allocation (JBJA) to maximize the machine utilization while minimizing the total processing time. In this paper, we propose adaptive job scheduling NSGAII (AJS-NSGAII) which contains a hidden type encoding, a decoding method using JBJA strategy, and a hybrid rule to initialize the population and solve 15 orders. The experimental findings verify that this algorithm is capable of ensuring the actual production requirements of the enterprise, its multi-machine selection rules are effective and its overall performance is superior.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"173 ","pages":"Article 106866"},"PeriodicalIF":4.1,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142440931","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}

{"title":"A literature review on hub location-routing models and their solution techniques","authors":"Sebastian Wandelt,&nbsp;Shuang Wang,&nbsp;Xiaoqian Sun","doi":"10.1016/j.cor.2024.106861","DOIUrl":"10.1016/j.cor.2024.106861","url":null,"abstract":"<div><div>Hub location problems (HLPs), which essentially aim at optimizing the location of hubs and the allocation of spokes to satisfy a given demand, have been studied over nearly four decades. Since dedicated allocation connections between each spoke and its hub may increase the operating cost and underutilize the vehicle capacity, especially in less-than-truckload freight service applications, the last ten years have witnessed an increasing interest of researchers in hub location routing problems (HLRPs). HLRPs involve a more comprehensive approach, by considering both facility location and vehicle routing aspects simultaneously, also optimizing the assignment of customers to these hubs and finding the best routes from hubs to customers, making HLRPs more complex and practical for real-world logistics and distribution scenarios than HLPs. In this paper, we review the HLRP models proposed in the existing literature, the commonalities and differences of developed solutions techniques, particularly concerning the computation of incumbent solutions and neighborhood changes. We believe that our study contributes to the existing literature, by unifying the rather scattered publication landscape on HLRPs and proposing a set of interesting directions for future work.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"173 ","pages":"Article 106861"},"PeriodicalIF":4.1,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142445349","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}

{"title":"Solving capacitated vehicle routing problem with three-dimensional loading and relocation constraints","authors":"Jushang Chi,&nbsp;Shiwei He,&nbsp;Rui Song","doi":"10.1016/j.cor.2024.106864","DOIUrl":"10.1016/j.cor.2024.106864","url":null,"abstract":"<div><div>In capacitated vehicle routing problem with three-dimensional loading constraints (3L-CVRP) that combines the container loading and capacitated vehicle routing problems, the relationship between vehicle visiting sequence and item loading sequence is reflected through relocation-ban constraint. This widely applied constraint prohibits the temporarily unloading and repositioning of loaded items during the entire transportation process, simplifying loading operations but also limiting the volume utilization of each vehicle and increasing transportation costs. To address this issue and obtain a trade-off between transportation cost and operational complexity (reflected in relocation cost), two improved relocation constraints that seek to allow necessary and restricted relocations are developed in this study. Under pickup scenario, a mixed integer-linear programming model is developed to describe the 3L-CVRP with the relocation constraints. An improved branch-and-price algorithm is employed to solve the model. Two loading algorithms, incorporated with a backward dynamic programming method, are proposed to simultaneously generate loading and relocation plans. Enhancement strategies, including an improved label-correcting-based algorithm and memory components that collect loading feasibility and relocation cost information, are developed. Numerical experiments were designed to test the performance of the proposed algorithms and validate the significance of necessary relocations. In pure loading instances, necessary relocations bring an increase in volume utilization by 3.75 % on average and 36.48 % at maximum. In large-scale benchmark instances, allowing necessary relocations decrease the overall costs by 4.86 % on average and 13.08 % at maximum.</div><div>Abbreviations: 3L-CVRP, capacitated vehicle routing problem with three-dimensional loading constraints; CLP, container loading problem; CVRP, capacitated vehicle routing problem; RC, relocation constraints; MILP, mixed integer linear programming; B&amp;P, branch and price; BDP, backward dynamic programming; D–W, Dantizig–Wolfe; ESPPRLC, elementary shortest path problem with resource and loading constraints; LCA, label-correcting-based algorithm; 3L-PDP, pickup and delivery vehicle routing problem with three-dimensional loading constraints; RMP, restricted-master-problem; SP, sub-problem; IGHA, improved greedy heuristic algorithm; ITRSA, improved tree search algorithm; TN, tree node; BR, Bischoff &amp; Ratcliff.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"173 ","pages":"Article 106864"},"PeriodicalIF":4.1,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142553260","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}

{"title":"Classification and evaluation of the algorithms for vector bin packing","authors":"Clément Mommessin ,&nbsp;Thomas Erlebach ,&nbsp;Natalia V. Shakhlevich","doi":"10.1016/j.cor.2024.106860","DOIUrl":"10.1016/j.cor.2024.106860","url":null,"abstract":"<div><div>Heuristics for Vector Bin Packing (VBP) play an important role in modern distributed computing systems and other applications aimed at optimizing the usage of multidimensional resources. In this paper we perform a systematic classification of heuristics for VBP, with the focus on construction heuristics. We bring together existing VBP algorithms and their tuning parameters, and propose new algorithms and new tuning parameters. For a less studied class of multi-bin algorithms, we explore their properties analytically, considering monotonic and anomalous behavior and approximation guarantees. For empirical evaluation, all algorithms are implemented as the <em>Vectorpack</em> library and assessed through extensive experiments. Our findings may serve as the basis for the development of more complex, hybrid algorithms, hyperheuristics and machine learning algorithms. The <em>Vectorpack</em> library can also be adjusted for addressing enhanced VBP problems with additional features, which arise in applications, especially those typical for modern distributed computing systems.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"173 ","pages":"Article 106860"},"PeriodicalIF":4.1,"publicationDate":"2024-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142441513","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}