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

A column generation-based matheuristic for an inventory-routing problem with driver-route consistency 具有驾驶员路线一致性的库存路线问题的基于列生成的数学

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2025-02-13 DOI: 10.1016/j.ejor.2025.02.007

Waleed Najy , Claudia Archetti , Ali Diabat

{"title":"A column generation-based matheuristic for an inventory-routing problem with driver-route consistency","authors":"Waleed Najy , Claudia Archetti , Ali Diabat","doi":"10.1016/j.ejor.2025.02.007","DOIUrl":"10.1016/j.ejor.2025.02.007","url":null,"abstract":"<div><div>This paper investigates a variant of an inventory-routing problem (IRP) that enforces two conditions on the structure of the solution: time-invariant routes, and a fixed, injective (i.e., one-to-one) assignment of routes to vehicles. The practical benefits of concurrent route invariance and driver assignments are numerous. Fixed routes reduce the solution space of the problem and improve its tractability; they simplify operations; and they increase the viability of newer delivery technologies like drones and autonomous vehicles. Consistency between driver and customer is linked to improved service, driver job satisfaction and delivery efficiency, and is also an important consideration in certain contexts like home healthcare. After formulating the problem as a mixed integer-linear program, we recast it as a set partitioning problem whose linear relaxation is solved via column generation. Due to the prohibitively expensive nature of the pricing problem that generates new columns, we present a novel column generation-based heuristic for it that relies on decoupling routing and inventory management decisions. We demonstrate the effectiveness of the proposed method via a numerical study.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"324 2","pages":"Pages 382-397"},"PeriodicalIF":6.0,"publicationDate":"2025-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143443566","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 predict-and-optimize approach to profit-driven churn prevention 一个预测和优化的方法，以利润驱动的流失预防

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2025-02-13 DOI: 10.1016/j.ejor.2025.02.008

Nuria Gómez-Vargas , Sebastián Maldonado , Carla Vairetti

引用次数: 0

Hybridizing Carousel Greedy and Kernel Search: A new approach for the maximum flow problem with conflict constraints Carousel贪心与核搜索的杂交：一种求解冲突约束下最大流问题的新方法

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2025-02-13 DOI: 10.1016/j.ejor.2025.02.006

F. Carrabs , R. Cerulli , R. Mansini , D. Serra , C. Sorgente

{"title":"Hybridizing Carousel Greedy and Kernel Search: A new approach for the maximum flow problem with conflict constraints","authors":"F. Carrabs , R. Cerulli , R. Mansini , D. Serra , C. Sorgente","doi":"10.1016/j.ejor.2025.02.006","DOIUrl":"10.1016/j.ejor.2025.02.006","url":null,"abstract":"<div><div>This work addresses a variant of the maximum flow problem where specific pairs of arcs are not allowed to carry positive flow simultaneously. Such restrictions are known in the literature as <em>negative disjunctive constraints</em> or <em>conflict constraints</em>. The problem is known to be strongly NP-hard and several exact approaches have been proposed in the literature. In this paper, we present a heuristic algorithm for the problem, based on two different approaches: Carousel Greedy and Kernel Search. These two approaches are merged to obtain a fast and effective matheuristic, named Kernousel. In particular, the computational results reveal that exploiting the information gathered by the Carousel Greedy to build the set of most promising variables (the <em>kernel set</em>), makes the Kernel Search more effective. To validate the performance of the new hybrid method, we compare it with the two components running individually. Results are also evaluated against the best-known solutions available in the literature for the problem. The new hybrid method provides 15 new best-known values on benchmark instances.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"324 2","pages":"Pages 414-435"},"PeriodicalIF":6.0,"publicationDate":"2025-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143443567","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

Multi-drone rescue search in a large network 多无人机大网络救援搜索

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2025-02-11 DOI: 10.1016/j.ejor.2025.02.003

Victor Gonzalez , Patrick Jaillet

引用次数: 0

Last mile delivery routing problem with some-day option 最后一英里的送货路线问题，改天选择

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2025-02-11 DOI: 10.1016/j.ejor.2025.02.001

Stefan Voigt, Markus Frank, Heinrich Kuhn

{"title":"Last mile delivery routing problem with some-day option","authors":"Stefan Voigt, Markus Frank, Heinrich Kuhn","doi":"10.1016/j.ejor.2025.02.001","DOIUrl":"10.1016/j.ejor.2025.02.001","url":null,"abstract":"<div><div>E-commerce retailers are challenged to maintain cost-efficiency and customer satisfaction while pursuing sustainability, especially in the last mile. In response, retailers are offering a range of delivery speeds, including same-day and instant options. Faster deliveries, while trending, often increase costs and emissions due to limited planning time and reduced consolidation opportunities in the last mile. In contrast, this paper proposes the inclusion of a slower delivery option, termed some-day. Slowing down the delivery process allows for greater shipment consolidation, achieving cost savings and environmental goals simultaneously. We introduce the dynamic and stochastic some-day delivery problem, which accounts for a latest delivery day, customer time windows, and capacity limitations within a multi-period planning framework. Our solution approach is based on addressing auxiliary prize-collecting vehicle routing problems with time windows (PCVRPTW) on a daily basis, where the prize reflects the benefit of promptly serving the customer. We develop a hybrid adaptive large neighborhood search with granular insertion operators, outperforming existing metaheuristics for PCVRPTWs. Our numerical study shows significant cost savings with only small increases in delivery times compared to an earliest policy.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"324 2","pages":"Pages 477-491"},"PeriodicalIF":6.0,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143477827","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

Robust pricing for demand response under bounded rationality in residential electricity distribution 有限理性下住宅配电需求响应的鲁棒定价

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2025-02-11 DOI: 10.1016/j.ejor.2025.01.023

Guanxiang Yun , Qipeng P. Zheng , Lihui Bai , Eduardo L. Pasiliao

{"title":"Robust pricing for demand response under bounded rationality in residential electricity distribution","authors":"Guanxiang Yun , Qipeng P. Zheng , Lihui Bai , Eduardo L. Pasiliao","doi":"10.1016/j.ejor.2025.01.023","DOIUrl":"10.1016/j.ejor.2025.01.023","url":null,"abstract":"<div><div>This paper studies residential users’ electricity consumption in response to dynamic pricing in smart grid, from the behavioral economics angle. Particularly, this research employs a novel approach, <em>i.e</em>., the boundedly rational user decision (BRUD) modeling framework, which assumes users will accept an electricity consumption schedule whose total utility is within an “acceptable bound” of his/her maximum utility. Subsequently, we study the optimistic and pessimistic/robust pricing models via bi-level optimization, where the utility company minimizes the total system cost while considering the best and worst case under BRUD, respectively. In order to solve the pricing models efficiently, we present two methods, <em>i.e</em>., the penalty method and the Lagrangian-dual method, both with the help of cutting planes. Computational results show that the proposed dynamic pricing schemes are effective in decreasing the total system cost. Furthermore, the Lagrangian-dual-based method outperforms the penalty method due to the exploitation of the special convexity structure of the problem. Finally, when compared to solutions without considering the irrationality of user behavior, solutions from the BRUD models are more efficient in reducing total system cost. Furthermore, the additional benefits gained from considering irrationality tend to grow when user’s monetary value of convenience increases.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"324 2","pages":"Pages 654-668"},"PeriodicalIF":6.0,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143443568","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

Preference learning for efficient bundle selection in horizontal transport collaborations 横向运输合作中有效捆包选择的偏好学习

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2025-02-10 DOI: 10.1016/j.ejor.2025.02.002

Steffen Elting , Jan Fabian Ehmke , Margaretha Gansterer

{"title":"Preference learning for efficient bundle selection in horizontal transport collaborations","authors":"Steffen Elting , Jan Fabian Ehmke , Margaretha Gansterer","doi":"10.1016/j.ejor.2025.02.002","DOIUrl":"10.1016/j.ejor.2025.02.002","url":null,"abstract":"<div><div>To improve routing efficiency, transport service providers can enter a horizontal transport collaboration that uses a combinatorial auction to reallocate delivery orders. To find the optimal allocation, the carriers have to report bids for all possible combinations of available delivery orders. As this number grows exponentially with the number of orders to be reallocated, they are faced with an enormous computational challenge. To lift this burden, the auctioneer may offer only a limited set of order combinations. However, selecting this limited set is itself a stochastic combinatorial optimization problem known as the Bundle Selection Problem. In contrast to previous one-shot approaches to solve this problem, in this paper, a partial preference learning scheme is applied that iteratively queries carriers’ valuations, uses their responses to train preference models and then uses these fitted models to estimate valuations for new combinations of orders. This work investigates different ways to realize such a concept and analyzes their respective improvement in collaboration gains. The results indicate that the suggested algorithm can yield travel time savings of up to 20% higher than those achieved by a random benchmark and up to 10% higher than those of a literature benchmark if at least 40 query-response pairs are considered.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"324 3","pages":"Pages 953-968"},"PeriodicalIF":6.0,"publicationDate":"2025-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143477824","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

An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints 带有附加析取冲突约束的一对多最短路径问题的一种高效分支定界算法

IF 6 2区管理学

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

Bahadır Pamuk , Temel Öncan , İ. Kuban Altınel

引用次数: 0

Supplier encroachment with decision biases 供应商对决策偏差的侵犯

IF 6 2区管理学

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

Xiaolong Guo, Zenghui Su, Fangkezi Zhou

{"title":"Supplier encroachment with decision biases","authors":"Xiaolong Guo, Zenghui Su, Fangkezi Zhou","doi":"10.1016/j.ejor.2025.01.043","DOIUrl":"10.1016/j.ejor.2025.01.043","url":null,"abstract":"<div><div>The retail market is being increasingly invaded by suppliers who are establishing their own direct selling channels, thanks to the rise of e-commerce and internet technology. The cost of direct sales has been identified as a crucial factor in the strategic interaction between suppliers and retailers. However, retailers often struggle to accurately assess this cost due to their decision biases. To address this issue, we propose a strategic mental model to examine how these biases impact supplier encroachment and firms’ performance outcomes. Our analysis reveals that a retailer can benefit from having an underestimation bias. Additionally, the bias of one firm can benefit the other, depending on whether it is an underestimation or overestimation bias. Interestingly, both the supplier and the retailer can earn more when they are biased compared to when neither of them is biased, resulting in a win-win scenario. However, if the supplier fails to recognize the retailer’s bias, the possibility of mutual gains is eliminated. Furthermore, when biases are present, the option of encroachment may backfire for the supplier compared to the scenario without encroachment, and the retailer may be worse off in the sequential encroachment setting compared to the simultaneous setting. Finally, we extend our model by considering imperfect substitutability between the retailer’s and supplier’s products, and the main conclusions remain robust. Our findings suggest that considering these biases alters the nature of strategic dynamics and provides new insights into supplier encroachment and information management.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"324 1","pages":"Pages 129-141"},"PeriodicalIF":6.0,"publicationDate":"2025-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143443570","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

Non-crossing vs. independent lead times in a lost-sales inventory system with compound Poisson demand 具有复合泊松需求的损失销售库存系统中的非交叉vs.独立交货期

IF 6 2区管理学

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

Søren Glud Johansen , Anders Thorstenson

{"title":"Non-crossing vs. independent lead times in a lost-sales inventory system with compound Poisson demand","authors":"Søren Glud Johansen , Anders Thorstenson","doi":"10.1016/j.ejor.2025.01.042","DOIUrl":"10.1016/j.ejor.2025.01.042","url":null,"abstract":"<div><div>In this paper we provide an analysis of an inventory system with compound Poisson demand and a sequential supply system, specifically focusing on non-crossing lead times. The purpose is to facilitate a comparison with order crossing caused by independent lead times. We apply a new approach for modeling exogenous, non-crossing Erlang distributed lead times. It is assumed that the inventory is controlled by continuous review and a base-stock level. Any part of a customer demand which cannot be satisfied immediately from inventory is lost. Set-up costs are negligible and the relevant cost parameters for choosing the best base stock consist of the holding cost rate and a shortage cost per unit lost. We provide a proof that the long-run average total relevant cost is a convex function of the base stock. Hence, the base stock is easy to compute and it is optimal in the case of geometrically distributed customer demand sizes. For demand sizes which are not geometric, we suggest an approximation to specify the base stock. An approximation is also suggested for the case when the lead time is only specified by its mean and standard deviation (SD). Our numerical study shows that the average cost is very sensitive to the SD. This in sharp contrast to the complete insensitivity of SD in case of geometric demand sizes and independent lead times.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"324 2","pages":"Pages 466-476"},"PeriodicalIF":6.0,"publicationDate":"2025-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143477832","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