European Journal of Operational Research最新文献

Monitoring bank risk around the world using unsupervised learning

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2025-01-28 DOI: 10.1016/j.ejor.2025.01.036

Mathieu Mercadier, Amine Tarazi, Paul Armand, Jean-Pierre Lardy

引用次数: 0

Stochastic model for physician staffing and scheduling in emergency departments with multiple treatment stages

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2025-01-26 DOI: 10.1016/j.ejor.2025.01.027

Janaina F. Marchesi, Silvio Hamacher, Igor Tona Peres

引用次数: 0

From collaborative filtering to deep learning: Advancing recommender systems with longitudinal data in the financial services industry

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2025-01-25 DOI: 10.1016/j.ejor.2025.01.022

Stephanie Beyer Díaz, Kristof Coussement, Arno De Caigny

{"title":"From collaborative filtering to deep learning: Advancing recommender systems with longitudinal data in the financial services industry","authors":"Stephanie Beyer Díaz, Kristof Coussement, Arno De Caigny","doi":"10.1016/j.ejor.2025.01.022","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.01.022","url":null,"abstract":"Recommender systems (RS) are highly relevant for multiple domains, allowing to construct personalized suggestions for consumers. Previous studies have strongly focused on collaborative filtering approaches, but the inclusion of longitudinal data (LD) has received limited attention. To address this gap, we investigate the impact of incorporating LD for recommendations, comparing traditional collaborative filtering approaches, multi-label classifier (MLC) algorithms, and a deep learning model (DL) in the form of gated recurrent units (GRU). Additional analysis for the best performing model is provided through SHapley Additive exPlanations (SHAP), to uncover relations between the different recommended products and features. Thus, this article contributes to operational research literature by (1) comparing several MLC techniques and RS, including state-of-the-art DL models in a real-life scenario, (2) the comparison of various featurization techniques to assess the impact of incorporating LD on MLC performance, (3) the evaluation of LD as sequential input through the use of DL models, (4) offering interpretable model insights to improve the understanding of RS with LD. The results uncover that DL models are capable of extracting information from longitudinal features for overall higher and statistically significant performance. Further, SHAP values reveal that LD has the higher impact on model output and managerial relevant temporal patterns emerge across product categories.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"5 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143077788","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

Trade-off between utility and fairness in two-agent single-machine scheduling

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2025-01-25 DOI: 10.1016/j.ejor.2025.01.025

Alessandro Agnetis, Mario Benini, Gaia Nicosia, Andrea Pacifici

引用次数: 0

A new effective heuristic for the Prisoner Transportation Problem

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2025-01-25 DOI: 10.1016/j.ejor.2025.01.029

Luciano Ferreira, Marcos Vinicius Milan Maciel, José Valério de Carvalho, Elsa Silva, Filipe Pereira Alvelos

引用次数: 0

Dynamic worker allocation in Seru production systems with actor–critic and pointer networks

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2025-01-24 DOI: 10.1016/j.ejor.2025.01.012

Dongni Li, Hongbo Jin, Yaoxin Zhang

{"title":"Dynamic worker allocation in Seru production systems with actor–critic and pointer networks","authors":"Dongni Li, Hongbo Jin, Yaoxin Zhang","doi":"10.1016/j.ejor.2025.01.012","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.01.012","url":null,"abstract":"Following the rapid evolution of manufacturing industries, customer demands may change dramatically, which challenges the conventional production systems. <ce:italic>Seru</ce:italic> production system (SPS) is a key to deal with uncertain varieties and fluctuating volumes. In dynamic scenarios, orders with uncertain demands arrive over time. For each arriving order, appropriate workers should be allocated to assemble it. This study investigates the dynamic worker allocation problem with the objective of maximizing the revenue obtained by the SPS. To tackle this problem, a novel algorithm that integrates actor–critic and pointer networks is proposed. The global-and-local attention mechanism and twin focus encoders are particularly designed to address the dynamic and uncertain properties of the problem. The algorithm is compared to three approaches, including the standard actor–critic algorithm, proximal policy optimization algorithm, and the approximation algorithm with the best approximation ratio, in different scenarios, i.e., small, medium, and large factories. The proposed algorithm outperforms the standard actor–critic approach and proximal policy optimization algorithm, showing performance gaps ranging from 7.23% to 37.44%. It also outperforms the approximation algorithm, with gaps between 56.73% and 96.94%. Numerical results of the three scenarios show that the proposed algorithm is more efficient and effective in handling uncertainty and dynamics, making it a promising solution for real-world manufacturing production systems.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"38 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143077790","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

Integrating public transport in sustainable last-mile delivery: Column generation approaches

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2025-01-24 DOI: 10.1016/j.ejor.2024.12.047

Diego Delle Donne, Alberto Santini, Claudia Archetti

引用次数: 0

The first mile is the hardest: A deep learning-assisted matheuristic for container assignment in first-mile logistics

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2025-01-24 DOI: 10.1016/j.ejor.2025.01.024

Simon Emde, Ana Alina Tudoran

{"title":"The first mile is the hardest: A deep learning-assisted matheuristic for container assignment in first-mile logistics","authors":"Simon Emde, Ana Alina Tudoran","doi":"10.1016/j.ejor.2025.01.024","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.01.024","url":null,"abstract":"Urban logistics has been recognized as one of the most complex and expensive part of e-commerce supply chains. An increasing share of this complexity comes from the first mile, where shipments are initially picked up to be fed into the transportation network. First-mile pickup volumes have become fragmented due to the enormous growth of e-commerce marketplaces, which allow even small-size vendors access to the global market. These local vendors usually cannot palletize their own shipments but instead rely on containers provided by a logistics provider. From the logistics provider’s perspective, this situation poses the following novel problem: from a given pool of containers, how many containers of what size should each vendor receive when? It is neither desirable to supply too little container capacity because undersupply leads to shipments being loose-loaded, i.e., loaded individually without consolidation in a container; nor should the assigned containers be too large because oversupply wastes precious space. We demonstrate NP-hardness of the problem and develop a matheuristic, which uses a mathematical solver to assemble partial container assignments into complete solutions. The partial assignments are generated with the help of a deep neural network (DNN), trained on realistic data from a European e-commerce logistics provider. The deep learning-assisted matheuristic allows serving the same number of vendors with about 6% fewer routes than the rule of thumb used in practice due to better vehicle utilization. We also investigate the trade-off between loose-loaded shipments and space utilization and the effect on the routes of the collection vehicles.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"39 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143077789","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

The interplay between charitable donation strategies and sales mode selection in the platform

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2025-01-23 DOI: 10.1016/j.ejor.2025.01.031

Chen Zhu, Georges Zaccour

{"title":"The interplay between charitable donation strategies and sales mode selection in the platform","authors":"Chen Zhu, Georges Zaccour","doi":"10.1016/j.ejor.2025.01.031","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.01.031","url":null,"abstract":"Motivated by the emergence of offline and online donations, this paper explores the interplay between charitable donations and strategic choice of sales mode in a philanthropic supply chain consisting of a manufacturer and a platform. We consider two donation strategies, offline donations and both offline and online donations that are traceable by blockchain technology, and two business models, i.e., reselling sales mode and agency sales mode. Donations by the manufacturer are used to boost its charitable image, which in turn affects positively the demand. As such image can only be built over time, we adopt a differential game formalism that captures both the strategic interactions between the two players and the dynamic nature of the problem. We characterize and compare the equilibrium strategies and outcomes for different choices of selling mode and donation option. Our findings can be summarized as follows. First, we obtain that only under some conditions that online donations enhance the charitable image, members’ profits, consumer surplus, and social welfare. Second, regardless of the sales mode, the conditions for the platform to adopt online donations are the most stringent, and the conditions for the enhancement of the charitable image are the most lenient. Third, the implementation of online donations does not have much impact on the Pareto regions of the agency mode but has a much greater impact on the Pareto regions of the reselling mode, especially for medium and large online donation amounts. These changes hinge on the trade-offs for members between online and offline donations.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"20 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143077792","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

The collaborative berth allocation problem with row-generation algorithms for stable cost allocations

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2025-01-22 DOI: 10.1016/j.ejor.2024.12.048

Xiaohuan Lyu, Eduardo Lalla-Ruiz, Frederik Schulte

{"title":"The collaborative berth allocation problem with row-generation algorithms for stable cost allocations","authors":"Xiaohuan Lyu, Eduardo Lalla-Ruiz, Frederik Schulte","doi":"10.1016/j.ejor.2024.12.048","DOIUrl":"https://doi.org/10.1016/j.ejor.2024.12.048","url":null,"abstract":"Recent supply chain disruptions and crisis response policies (e.g., the COVID-19 pandemic and the Red Sea crisis) have highlighted the role of container terminals as crucial and scarce resources in the global economy. To tackle these challenges, the industry increasingly aims for advanced operational collaboration among multiple stakeholders, as demonstrated by the ambitions of the recently founded Gemini alliance. Nonetheless, collaborative planning models often disregard the requirements and incentives of stakeholders or simply solve idealized small instances. Motivated by the above, we design novel and effective collaboration mechanisms among terminal operators that share the resources (berths and quay cranes). We first define the collaborative berth allocation problem and propose a mixed integer linear programming (MILP) model to minimize the total cost of all terminals, referred to as the coalitional costs. We adopt the core and the nucleolus concepts from cooperative game theory to allocate the coalitional costs such that stakeholders have stable incentives to collaborate. To obtain solutions for realistic instance sizes, we propose two exact row-generation-based core and nucleolus algorithms that are versatile and can be used for various combinatorial optimization problems. To the best of our knowledge, the proposed row-generation approach for the nucleolus is the first of its kind for combinatorial optimization problems. Extensive experiments demonstrate that the collaborative berth allocation approach achieves up to 28.44% of cost savings, increasing the solution space in disruptive situations, while the proposed core and nucleolus solutions guarantee the collaboration incentives for individual terminals.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"48 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143049752","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