European Journal of Operational Research最新文献_第7页

On indication, strict monotonicity, and efficiency of projections in a general class of path-based data envelopment analysis models 论一类基于路径的数据包络分析模型的指示、严格单调性和预测效率

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2024-08-12 DOI: 10.1016/j.ejor.2024.08.009

Margaréta Halická , Mária Trnovská , Aleš Černý

{"title":"On indication, strict monotonicity, and efficiency of projections in a general class of path-based data envelopment analysis models","authors":"Margaréta Halická , Mária Trnovská , Aleš Černý","doi":"10.1016/j.ejor.2024.08.009","DOIUrl":"10.1016/j.ejor.2024.08.009","url":null,"abstract":"<div><p>Data envelopment analysis (DEA) theory formulates a number of desirable properties that DEA models should satisfy. Among these, indication, strict monotonicity, and strong efficiency of projections tend to be grouped together in the sense that, in individual models, typically, either all three are satisfied or all three fail at the same time. Specifically, in slacks-based graph models, the three properties are always met; in path-based models, such as radial models, directional distance function models, and the hyperbolic function model, the three properties, with some minor exceptions, typically all fail.</p><p>Motivated by this observation, the article examines relationships among indication, strict monotonicity, and strong efficiency of projections in the class of path-based models over variable returns-to-scale technology sets. Under mild assumptions, it is shown that the property of strict monotonicity and strong efficiency of projections are equivalent, and that both properties imply indication. This paper also characterises a narrow class of technology sets and path directions for which the three properties hold in path-based models.</p></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":null,"pages":null},"PeriodicalIF":6.0,"publicationDate":"2024-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141992118","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

Integrated crew organization and work zone scheduling for network-wide daily road pavement rehabilitation 全网日常路面修复的综合人员组织和工区调度

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2024-08-12 DOI: 10.1016/j.ejor.2024.08.012

Wenyi Zhang , Yanbo He , Xuan Zhang , Tao Liu , Wei Guan

{"title":"Integrated crew organization and work zone scheduling for network-wide daily road pavement rehabilitation","authors":"Wenyi Zhang , Yanbo He , Xuan Zhang , Tao Liu , Wei Guan","doi":"10.1016/j.ejor.2024.08.012","DOIUrl":"10.1016/j.ejor.2024.08.012","url":null,"abstract":"<div><p>This study develops a new integer-programming model to address the network-wide daily road pavement rehabilitation scheduling problem. In the model, the crew organization and work zone schedule are jointly optimized daily, with the objective of minimizing both the operational cost and user travel time. A day-to-day traffic dynamics model is applied to capture the non-equilibrium traffic evolution against network supply variation over the planning horizon, which leads to a simulation-based optimization problem. To solve this challenging problem, a two-stage hybrid heuristic solution method is proposed. In the first stage, hybrid tabu search (TS) meta-heuristics are comparatively developed to identify a group of active crew work routes without time slacks. The obtained crew routes are then fed to the second stage for work zone scheduling via a discrete compass search algorithm. Some important findings are obtained from numerical experiments. First, crew routing (or crew organization) is the dominant decision in the studied problem, and a desirable work zone schedule encourages a crew to execute the assigned tasks continually. The findings can be used to develop simplified and efficient solution algorithms. Second, the hybrid TS meta-heuristics developed for crew routing exhibit superior performance compared to other solution methods. Finally, a well-defined model for the current problem should consider both user travel time and operation cost. Our model enables decision-makers to make an effective trade-off between these two objectives. An effective measure is suggested to evaluate the cost-effectiveness of budget investment decisions when budgets are limited.</p></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":null,"pages":null},"PeriodicalIF":6.0,"publicationDate":"2024-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142043627","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 value-at-risk based approach to the routing problem of multi-hazmat railcars 基于风险价值的多危险品轨道车路由选择方法

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2024-08-06 DOI: 10.1016/j.ejor.2024.08.006

Kan Fang , Enyuan Fu , Dian Huang , Ginger Y. Ke , Manish Verma

{"title":"A value-at-risk based approach to the routing problem of multi-hazmat railcars","authors":"Kan Fang , Enyuan Fu , Dian Huang , Ginger Y. Ke , Manish Verma","doi":"10.1016/j.ejor.2024.08.006","DOIUrl":"10.1016/j.ejor.2024.08.006","url":null,"abstract":"<div><p>This paper solves a routing problem of multi-hazmat railcars with consolidation operations in order to avoid serious consequences of hazmat accidents. We develop a bi-level optimization model for this problem, and apply a value-at-risk (VaR) approach to generate route choices. By incorporating the consolidation operations performed among different railway shipments, both the risks incurred at yards and on service legs are integratively quantified to evaluate route risks. Due to the inherent complexity of the problem, we propose an exact algorithm as well as a heuristic algorithm to solve the proposed model, and conduct extensive numerical experiments on instances generated from a real railway system in the Midwestern United States. The analysis shows that risk-seeking decision makers will benefit from consolidated transportation due to its potential to significantly reduce total transportation costs. As decision makers become more risk averse, i.e., confidence level increases, increasing the number of train services and reducing the amount of hazmat railcars and consolidation operation has a positive impact on reducing route risk. In addition, the computational results verify the effectiveness of our proposed optimization model and solution approaches, which can generate various routing plans for railway companies under different risk preferences, and our proposed heuristic algorithm gives an optimal or near-optimal solution in 1.41% to 28.22% of the time required by the exact algorithm.</p></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":null,"pages":null},"PeriodicalIF":6.0,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142043621","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

Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation 最小颜色破碎的垃圾箱打包问题的边界和启发式算法

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2024-08-06 DOI: 10.1016/j.ejor.2024.08.007

Mathijs Barkel , Maxence Delorme , Enrico Malaguti , Michele Monaci

{"title":"Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation","authors":"Mathijs Barkel , Maxence Delorme , Enrico Malaguti , Michele Monaci","doi":"10.1016/j.ejor.2024.08.007","DOIUrl":"10.1016/j.ejor.2024.08.007","url":null,"abstract":"<div><p>In this paper, we consider a recently introduced packing problem in which a given set of weighted items with colors has to be packed into a set of identical bins, while respecting capacity constraints and the number of available bins, and minimizing the total number of times that colors appear in the bins. We review exact methods from the literature and present a fast lower bounding procedure that, in some cases, can also provide an optimal solution. We theoretically study the worst-case performance of the lower bound and the effect of the number of available bins on the solution cost. Then, we computationally test our solution method on a large benchmark of instances from the literature: quite surprisingly, all of them are optimally solved by our procedure in a few seconds, including those for which the optimal solution value was still unknown. Thus, we introduce additional harder instances, which are used to evaluate the performance of a constructive heuristic method and of a tabu search algorithm. Results on the new instances show that the tabu search produces considerable improvements over the heuristic solution, with a limited computational effort.</p></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":null,"pages":null},"PeriodicalIF":6.0,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0377221724006076/pdfft?md5=383831667c3b44bd5e8da84c114be12d&pid=1-s2.0-S0377221724006076-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142043620","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

Agency selling or reselling: The role of cause marketing 代理销售或转售：事业营销的作用

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2024-08-05 DOI: 10.1016/j.ejor.2024.07.034

Lin Wei , Shengming Zheng , Shaofu Du , Baofeng Zhang

{"title":"Agency selling or reselling: The role of cause marketing","authors":"Lin Wei , Shengming Zheng , Shaofu Du , Baofeng Zhang","doi":"10.1016/j.ejor.2024.07.034","DOIUrl":"10.1016/j.ejor.2024.07.034","url":null,"abstract":"<div><p>Cause marketing (CM) is commonly adopted to pursue profit growth or/and achieve corporate social responsibility (CSR). In online retailing, to facilitate CM for the products, e-retailers are increasingly implementing CM programs for the firms that sell products directly to consumers, i.e., suppliers under agency selling mode or themselves under reselling mode. Motivated by this, we examine how CM for the product influences the equilibrium outcomes under the two selling modes and the selling mode preferences of the supply chain members. Our results suggest that CM for the product is beneficial to both the supply chain members but can render the e-retailer to be hurt by a higher agency fee. Significantly, the supplier can prefer agency selling mode only when the agency fee is lower, whereas the e-retailer can prefer it even if the agency fee is lower. As a result of the changes in the selling mode preferences, the CM program can hurt the e-retailer when the selling mode is determined by the supplier. We further consider the cases where either of the supply chain members cares about CSR and fulfills it with CM. The results indicate that the concern for CSR of either of the supply chain members can coordinate their selling mode preferences. Specifically, the concern for CSR of the supplier (e-retailer) can induce them to prefer agency selling mode (reselling mode), thereby eliminating (further exacerbating) the adverse impact of the CM program on the supply chain members.</p></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":null,"pages":null},"PeriodicalIF":6.0,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142101132","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

Optimizing integrated berth allocation and quay crane assignment: A distributionally robust approach 优化综合泊位分配和码头起重机分配：分布稳健法

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2024-08-05 DOI: 10.1016/j.ejor.2024.08.001

Chong Wang , Qi Wang , Xi Xiang , Canrong Zhang , Lixin Miao

{"title":"Optimizing integrated berth allocation and quay crane assignment: A distributionally robust approach","authors":"Chong Wang , Qi Wang , Xi Xiang , Canrong Zhang , Lixin Miao","doi":"10.1016/j.ejor.2024.08.001","DOIUrl":"10.1016/j.ejor.2024.08.001","url":null,"abstract":"<div><div>In this research, we have formulated a Two-Stage Distributionally Robust Optimization (TDRO) model within the context of a mean–variance ambiguity set, specifically designed to address the challenges in the Integrated Berth Allocation and Quay Crane Assignment Problem (BACAP). A key consideration in this study is the inherent uncertainty associated with ships’ arrival times. During the initial stage, we derive a baseline schedule governing berth allocation and quay crane assignment. Anticipating potential disruptions arising from uncertain arrival delays, the second stage is meticulously formulated to determine the worst-case expectation of adjustment costs within the mean–variance ambiguity set. Subsequently, we undertake an equivalent transformation, converting the general TDRO model into a Two-Stage Robust Second-Order Cone Programming (TRO-SOCP) model. This transformation facilitates the application of the Column and Constraint Generation (C&CG) algorithm, ensuring the derivation of an exact solution. To address the computational intricacies associated with second-order cone programming, we propose two enhancement strategies for upper and lower bounds, aimed at expediting the solution process. Additionally, to contend with large-scale instances, we introduce a refinement and approximation method, transforming the TDRO model into a Mixed-Integer Programming (MIP) model. Furthermore, extensive numerical experiments are executed on both synthetic and real-life instances to validate the superior performance of our model and algorithms. In terms of the total cost, the TDRO model demonstrates superior performance compared with Two-Stage Stochastic Programming (TSP) and Two-Stage Robust Optimization (TRO) models.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":null,"pages":null},"PeriodicalIF":6.0,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141909633","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

Physical vs Virtual corporate power purchase agreements: Meeting renewable targets amid demand and price uncertainty 实体与虚拟企业购电协议：在需求和价格不确定的情况下实现可再生能源目标

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2024-08-03 DOI: 10.1016/j.ejor.2024.08.002

Seyed Danial Mohseni Taheri , Selvaprabu Nadarajah , Alessio Trivella

{"title":"Physical vs Virtual corporate power purchase agreements: Meeting renewable targets amid demand and price uncertainty","authors":"Seyed Danial Mohseni Taheri , Selvaprabu Nadarajah , Alessio Trivella","doi":"10.1016/j.ejor.2024.08.002","DOIUrl":"10.1016/j.ejor.2024.08.002","url":null,"abstract":"<div><p>Power purchase agreements (PPAs) have become an important corporate procurement vehicle for renewable power, especially among companies that have committed to targets requiring a certain fraction of their power demand be met by renewables. PPAs are long-term contracts that provide renewable energy certificates (RECs) to the corporate buyer and take two main forms: Physical vs Virtual. Physical PPAs deliver power in addition to RECs, while virtual PPAs are financial contracts that hedge (at least partially) power price uncertainty. We compare procurement portfolios that sign physical PPAs with ones that sign virtual PPAs, focusing on fixed-volume contracts and emphasizing uncertainties in power demand and the prices of power and RECs. In particular, we first analyze a two-stage stochastic model to understand the behavior of procurement quantities and costs when using physical and virtual PPAs as well as variants that limit risk. We subsequently formulate a Markov decision process (MDP) that optimizes the multi-stage procurement of power to reach and sustain a renewable procurement target. By leveraging state-of-the-art reoptimization techniques, we solve this MDP on realistic instances to near optimality, and highlight the relative benefits of using PPA types to meet a renewable target. We underscore a trade-off between expected cost and cash flow variance that buyers should consider when choosing between physical and virtual PPAs. Moreover, advanced reoptimization techniques significantly impact the ability to manage this trade-off.</p></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":null,"pages":null},"PeriodicalIF":6.0,"publicationDate":"2024-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0377221724006027/pdfft?md5=213a157c103b213e04d7f62a1c7a47cb&pid=1-s2.0-S0377221724006027-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142043622","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

Time-to-build, regulation, and investment 建设时间、监管和投资

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2024-08-02 DOI: 10.1016/j.ejor.2024.07.037

Haejun Jeon

引用次数: 0

Industrial multi-resource flexible job shop scheduling with partially necessary resources 具有部分必要资源的工业多资源灵活作业车间调度

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2024-08-02 DOI: 10.1016/j.ejor.2024.07.023

Quentin Perrachon , Alexandru-Liviu Olteanu , Marc Sevaux , Sylvain Fréchengues , Jean-François Kerviche

引用次数: 0

Generating sets of diverse and plausible scenarios through approximated multivariate normal distributions 通过近似多变量正态分布生成多样且可信的情景集

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2024-08-02 DOI: 10.1016/j.ejor.2024.08.003

Eljas Aalto , Tuomo Kuosa , Max Stucki

{"title":"Generating sets of diverse and plausible scenarios through approximated multivariate normal distributions","authors":"Eljas Aalto , Tuomo Kuosa , Max Stucki","doi":"10.1016/j.ejor.2024.08.003","DOIUrl":"10.1016/j.ejor.2024.08.003","url":null,"abstract":"<div><p>This article presents a novel and broadly generalizable framework for generating diverse and plausible sets of scenarios. Potential future outcomes are decomposed using a set of uncertainties which are assumed to be multivariate normally distributed, regardless of whether the uncertainties actually present numerically quantifiable phenomena. The optimal scenarios are then chosen along the principal components of the distribution, and the results can be easily interpreted and visualized. Notably, our approach requires a relatively small number of numerical assessments, offering an efficient and practical solution for decision-makers. The framework also provides a testable setting for evaluating its performance and allows users to iteratively improve future-related assumptions and predictions. These findings are relevant for all fields that aim to understand potential future developments, such as, but not limited to, foresight, economics, business strategy and strategic intelligence analysis.</p></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":null,"pages":null},"PeriodicalIF":6.0,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0377221724006039/pdfft?md5=4ada55ab937657d886aa05ef3e1994a5&pid=1-s2.0-S0377221724006039-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141909432","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