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

Maintenance optimization for multi-component systems with a single sensor 利用单一传感器优化多组件系统的维护工作

IF 6 2区管理学

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

Ragnar Eggertsson , Ayse Sena Eruguz , Rob Basten , Lisa M. Maillart

{"title":"Maintenance optimization for multi-component systems with a single sensor","authors":"Ragnar Eggertsson , Ayse Sena Eruguz , Rob Basten , Lisa M. Maillart","doi":"10.1016/j.ejor.2024.08.016","DOIUrl":"10.1016/j.ejor.2024.08.016","url":null,"abstract":"<div><div>We consider a multi-component system in which a single sensor monitors a condition parameter. Monitoring gives the decision maker partial information about the system state, but it does not reveal the exact state of the components. Each component follows a discrete degradation process, possibly correlated with the degradation of other components. The decision maker infers a belief about each component’s exact state from the current condition signal and the past data, and uses that to decide when to intervene for maintenance. A maintenance intervention consists of a complete and perfect inspection, and may be followed by component replacements. We model this problem as a partially observable Markov decision process. For a suitable stochastic order, we show that the optimal policy partitions in at most three regions on stochastically ordered line segments. Furthermore, we show that in some instances, the optimal policy can be partitioned into two regions on line segments. In two examples, we visualize the optimal policy. To solve the examples, we modify the incremental pruning algorithm, an exact solution algorithm for partially observable Markov decision processes. Our modification has the potential to also speed up the solution of other problems formulated as partially observable Markov decision processes.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":null,"pages":null},"PeriodicalIF":6.0,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142231675","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

Portfolio default losses driven by idiosyncratic risks 特异性风险导致的投资组合违约损失

IF 6 2区管理学

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

Shaoying Chen , Zhiwei Tong , Yang Yang

{"title":"Portfolio default losses driven by idiosyncratic risks","authors":"Shaoying Chen , Zhiwei Tong , Yang Yang","doi":"10.1016/j.ejor.2024.08.015","DOIUrl":"10.1016/j.ejor.2024.08.015","url":null,"abstract":"<div><div>We consider a portfolio of general defaultable assets with low individual default risk and study the probability of the portfolio default loss exceeding an arbitrary threshold. The latent variables driving defaults are modeled by a mixture structure that combines common shock, systematic risk, and idiosyncratic risk factors. While common shocks and systematic risk have been found by many studies to contribute significantly to portfolio losses, the role of idiosyncratic risks is often found to be negligible. Such conclusions are usually established under the assumption that the portfolio size tends to infinity and idiosyncratic risk factors are not dominant. We study under-investigated scenarios where the portfolio size is fixed and the idiosyncratic risk factors are heavy-tailed, exploring two distinct scenarios: an independence scenario and an asymptotic dependence scenario. The former is standard in the literature, while the latter is motivated by recent studies that have found the inadequacy of relying solely on common factors to capture default clustering. This consideration also reflects the possibility that idiosyncratic reasons can trigger contagion among firms with liabilities to each other. In the independence scenario, even with heavy-tailed idiosyncratic risk factors, the probability of a substantial portfolio loss remains low unless a single asset carries a disproportionately large weight. Conversely, in the asymptotic dependence scenario, the primary drivers of increased exceedance probability are the dependent idiosyncratic risk factors.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":null,"pages":null},"PeriodicalIF":6.0,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142101098","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

Exact and heuristic approaches for the ship-to-shore problem 船到岸问题的精确方法和启发式方法

IF 6 2区管理学

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

M. Wagenvoort , P.C. Bouman , M. van Ee , T. Lamballais Tessensohn , K. Postek

{"title":"Exact and heuristic approaches for the ship-to-shore problem","authors":"M. Wagenvoort , P.C. Bouman , M. van Ee , T. Lamballais Tessensohn , K. Postek","doi":"10.1016/j.ejor.2024.08.017","DOIUrl":"10.1016/j.ejor.2024.08.017","url":null,"abstract":"<div><p>After a natural disaster such as a hurricane or flooding, the navy can help by bringing supplies, clearing roads, and evacuating victims. If destinations cannot be reached over land, resources can be transported using smaller ships and helicopters, called connectors. To start aid on land as soon as possible this must be done efficiently. In the ship-to-shore problem, trips with their accompanying resources are determined while minimising the makespan. Limited (un)loading capacities, heterogeneous connector characteristics and constraints posed by priority of the resources and grouping of the resources (resource sets) all require that the connector trips are carefully coordinated. Despite the criticality of this coordination, existing literature does not consider resource sets and has only developed heuristics. We provide a formulation that incorporates resource sets and develop (i) an exact branch-and-price algorithm and (ii) a tailored greedy heuristic that can provide upper bounds. We find that 84% of our 98 practical instances terminate within an hour in on average 80 s. Our greedy heuristic can find optimal solutions in two-thirds of these instances, mostly for instances that are very constrained in terms of the delivery order of resources. When improvements are found by the branch-and-price algorithm, the average gap with the makespan of the greedy solution is 40% and, in most cases, these improvements are obtained within three minutes. For the 20 artificial instances, the greedy heuristic has consistent performance on the different types of instances. For these artificial instances improvements of on average 35% are found in reasonable time.</p></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":null,"pages":null},"PeriodicalIF":6.0,"publicationDate":"2024-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0377221724006404/pdfft?md5=03f9a6e23a60a993f2b14ef8cb2d9021&pid=1-s2.0-S0377221724006404-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142043616","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

Optimal payoffs under smooth ambiguity 平稳模糊条件下的最优回报

IF 6 2区管理学

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

An Chen , Steven Vanduffel , Morten Wilke

引用次数: 0

Customer and provider bounded rationality in on-demand service platforms 按需服务平台中的客户和供应商有界理性

IF 6 2区管理学

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

Danna Chen , Yong-Wu Zhou , Xiaogang Lin , Kangning Jin

{"title":"Customer and provider bounded rationality in on-demand service platforms","authors":"Danna Chen , Yong-Wu Zhou , Xiaogang Lin , Kangning Jin","doi":"10.1016/j.ejor.2024.08.013","DOIUrl":"10.1016/j.ejor.2024.08.013","url":null,"abstract":"<div><p>The growing literature on operations management in the context of the sharing economy typically assumes that both customers and providers are fully rational. In contrast, we consider an on-demand service platform (e.g., Didi and Uber) with boundedly rational customers and providers that sets a price charged to customers and a wage paid to providers. Both customers and providers are sensitive to the payment terms set by the platform and also to congestion in the system (given by the relative numbers of available customers and providers in the market). We capture bounded rationality using a model in which customers and providers are incapable of accurately estimating the congestion level. We examine the impact of bounded rationality on the platform profit, consumer surplus, and labor welfare. We find that both customers’ and providers’ bounded rationalities may benefit the platform. Specifically, when customers’ or providers’ bounded rationality level and service valuation are relatively large or the valuation is relatively small, more irrational customers or providers increases the platform’s profit. Moreover, we find that the platform can exploit the bounded rationality differences between customers and providers to gain profit. Counterintuitively, we also demonstrate that the high bounded rationality of customers or providers may increase consumer surplus and/or labor welfare. Finally, bounded rationality on one side (e.g., customer side) can make bounded rationality on the other side (e.g., provider side) more likely to increase the platform’s profit, consumer surplus, or labor welfare under certain conditions.</p></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":null,"pages":null},"PeriodicalIF":6.0,"publicationDate":"2024-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142043617","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

Corrigendum to “Labeling methods for partially ordered paths” [European Journal of Operational Research 318 (2024) 19–30] 部分有序路径的标记方法"[《欧洲运筹学报》318 (2024) 19-30] 更正

IF 6 2区管理学

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

Ricardo Euler, Pedro Maristany de las Casas

引用次数: 0

An unified framework for measuring environmentally-adjusted productivity change: Theoretical basis and empirical illustration 衡量经环境调整的生产力变化的统一框架：理论基础和经验说明

IF 6 2区管理学

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

A. Abad , P. Ravelojaona

引用次数: 0

Bilinear branch and check for unspecified parallel machine scheduling with shift consideration 考虑移位因素的非指定并行机调度的双线性分支和校验

IF 6 2区管理学

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

Ponpot Jartnillaphand, Elham Mardaneh, Hoa T. Bui

{"title":"Bilinear branch and check for unspecified parallel machine scheduling with shift consideration","authors":"Ponpot Jartnillaphand, Elham Mardaneh, Hoa T. Bui","doi":"10.1016/j.ejor.2024.08.011","DOIUrl":"10.1016/j.ejor.2024.08.011","url":null,"abstract":"<div><p>This paper tackles the complex challenge of team formations, assignments, and job schedules within the static Unspecified Parallel Machine Flexible Resource Scheduling problem, specifically incorporating shift considerations. In existing literature, teams are often simplified as machines that operate continuously throughout the day without any interruptions. However, in reality, teams require breaks between shifts and cannot work continuously within a day. Therefore, we introduce shift considerations to ensure that teams do not work in consecutive shifts. We consider flexible workers, capable of performing any job, who are distributed among different teams in different shifts to undertake various jobs. The number of teams in each shift is a decision variable. The duration of each job is determined by the number of workers in a team assigned to it. The objective function is to minimize the makespan, representing the overall schedule completion time, while adhering to precedence constraints. We formulate an integer linear programming model for the proposed problem and develop a novel bilinear branch and check algorithm that introduces valid bilinear inequalities to accelerate convergence. The numerical results confirm that our algorithm’s performance optimally solves problems up to 35 jobs within a reasonable timeframe, surpassing the efficiency of the branch and cut method of IBM CPLEX and the classical branch and check algorithm.</p></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":null,"pages":null},"PeriodicalIF":6.0,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0377221724006295/pdfft?md5=3907512fc468ce4bbbc85500736d9766&pid=1-s2.0-S0377221724006295-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141992117","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

Optimizing omnichannel retailer inventory replenishment using vehicle capacity-sharing with demand uncertainties and service level requirements 利用具有需求不确定性和服务水平要求的车辆产能共享优化全渠道零售商库存补货

IF 6 2区管理学

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

Ruozhen Qiu , Mingli Yuan , Minghe Sun , Zhi-Ping Fan , Henry Xu

{"title":"Optimizing omnichannel retailer inventory replenishment using vehicle capacity-sharing with demand uncertainties and service level requirements","authors":"Ruozhen Qiu , Mingli Yuan , Minghe Sun , Zhi-Ping Fan , Henry Xu","doi":"10.1016/j.ejor.2024.08.005","DOIUrl":"10.1016/j.ejor.2024.08.005","url":null,"abstract":"<div><p>This study explores an inventory replenishment problem for an omnichannel retailer selling a product with demand uncertainties and service level requirements in different channels through a capacity-sharing strategy. The omnichannel retailer allows customers to order products online and then pick them up in retail stores. The capacity-sharing strategy is considered to reduce travel costs when the omnichannel retailer delivers products in different channels. With the capacity-sharing strategy, some products can be transferred from the online delivery vehicle to the retail store delivery vehicle. The expectation and the bounds on the online route travel cost of the capacity-sharing strategy are determined, based on which the capacity-sharing rules are established. Optimization models and a solution procedure are developed to solve the omnichannel retailer inventory replenishment problem. To ensure adequate performance, service level requirements are considered when making delivery decisions. Numerical experiments using randomly generated and artificial instances are performed to verify the effectiveness and practicality of the proposed optimization models and the solution procedure. The results show that the proposed models and solution procedure can effectively reduce travel costs, and can provide effective schedule and delivery quantity decision support for omnichannel retailers.</p></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":null,"pages":null},"PeriodicalIF":6.0,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142101131","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 unified solution framework for flexible job shop scheduling problems with multiple resource constraints 具有多重资源约束的灵活作业车间调度问题的统一解决框架

IF 6 2区管理学

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

Gregory A. Kasapidis , Dimitris C. Paraskevopoulos , Ioannis Mourtos , Panagiotis P. Repoussis

{"title":"A unified solution framework for flexible job shop scheduling problems with multiple resource constraints","authors":"Gregory A. Kasapidis , Dimitris C. Paraskevopoulos , Ioannis Mourtos , Panagiotis P. Repoussis","doi":"10.1016/j.ejor.2024.08.010","DOIUrl":"10.1016/j.ejor.2024.08.010","url":null,"abstract":"<div><div>This paper examines flexible job shop scheduling problems with multiple resource constraints. A unified solution framework is presented for modelling various types of non-renewable, renewable and cumulative resources, such as limited capacity machine buffers, tools, utilities and work in progress buffers. We propose a Constraint Programming (CP) model and a CP-based Adaptive Large Neighbourhood Search (ALNS-CP) algorithm. The ALNS-CP uses long-term memory structures to store information about the assignment to machines of both individual operations and pairs of operations, as encountered in high-quality and diverse solutions during the search process. This information is used to create additional constraints for the CP solver, which guide the search towards promising regions of the solution space. Numerous experiments are conducted on well-known benchmark sets to assess the performance of ALNS-CP against the current state-of-the-art. Additional experiments are conducted on new instances of various sizes to study the impact of different resource types on the makespan. The computational results show that the proposed solution framework is highly competitive, while it was able to produce 39 new best solutions on well-known problem instances of the literature.</div></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":"142144400","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