{"title":"Prelim p. 2; First issue - Editorial Board","authors":"","doi":"10.1016/S0377-2217(25)00122-5","DOIUrl":"10.1016/S0377-2217(25)00122-5","url":null,"abstract":"","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"323 1","pages":"Page ii"},"PeriodicalIF":6.0,"publicationDate":"2025-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143436775","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}
Isma Bentoumi, Fabio Furini, A. Ridha Mahjoub, Sébastien Martin
{"title":"Integer linear programming formulations for the maximum flow blocker problem","authors":"Isma Bentoumi, Fabio Furini, A. Ridha Mahjoub, Sébastien Martin","doi":"10.1016/j.ejor.2025.02.013","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.02.013","url":null,"abstract":"Given a network with capacities and blocker costs associated with its arcs, we study the maximum flow blocker problem (FB). This problem seeks to identify a minimum-cost subset of arcs to be removed from the network, ensuring that the maximum flow value from the source to the destination in the remaining network does not exceed a specified threshold. The FB finds applications in telecommunication networks and monitoring of civil infrastructures, among other domains. We undertake a comprehensive study of several new integer linear programming (ILP) formulations designed for the FB. The first type of model, featuring an exponential number of constraints, is solved through tailored Branch-and-Cut algorithms. In contrast, the second type of ILP model, with a polynomial number of variables and constraints, is solved using a state-of-the-art ILP solver. The latter formulation establishes a structural connection between the FB and the maximum flow interdiction problem (FI), introducing a novel approach to obtaining solutions for each problem from the other. The ILP formulations proposed for solving the FB are evaluated thanks to a theoretical analysis assessing the strength of their LP relaxations. Additionally, the exact methods presented in this paper undergo a thorough comparison through an extensive computational campaign involving a set of real-world and synthetic instances. Our tests aim to evaluate the performance of the exact algorithms and identify the features of instances that can be solved with proven optimality.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"9 371 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143532974","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}
Layla Martin, Stefan Minner, Marco Pavone, Maximilian Schiffer
{"title":"It’s All in the Mix: Technology choice between driverless and human-driven vehicles in sharing systems","authors":"Layla Martin, Stefan Minner, Marco Pavone, Maximilian Schiffer","doi":"10.1016/j.ejor.2025.02.004","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.02.004","url":null,"abstract":"Operators of vehicle-sharing systems such as carsharing or ride-hailing can benefit from integrating driverless vehicles into their fleet. In this context, we study the impact of optimal fleet size and composition on an operator’s profitability, which entails a non-trivial tradeoff between operational benefits and higher upfront investment for driverless vehicles.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"28 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143477825","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":"Structural feedback and behavioral decision making in queuing systems: A hybrid simulation framework","authors":"Sergey Naumov, Rogelio Oliva","doi":"10.1016/j.ejor.2025.02.010","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.02.010","url":null,"abstract":"Traditional queuing models mostly leave human judgment and decision making outside the scope of the system, ignoring their role as determinants of system performance. However, empirical evidence has shown that human behavior can substantially alter the system’s output. In this paper, we develop a hybrid approach that improves our understanding of the interplay between individual heterogeneous human agents and aggregate system behavior. We formulate human behavioral responses as feedback control processes, explicitly capturing the agent’s objectives and available information about the system’s state, accounting for delays and possible distortions. Our modeling approach taps into a behavioral modeling tradition that values realism and representativeness, making the formulations flexible and easily adaptable to specific situations. We illustrate our approach by considering a queuing system with delay announcement, commonly found in service and manufacturing settings. We find that the system continuously cycles between periods of low and high utilization, creating a suboptimal mode with predictable periods of high and low congestion and fewer customers served overall. By structuring the effect of behavioral responses as feedback loops, we formally analyze the observed system behavior and map it to behavioral decisions. The proposed modeling and analysis framework can guide system design and improve performance in scenarios where key dynamics are driven by both feedback structure and stochasticity. It provides generalizable structural explanations of the impact of human behavior in queuing systems.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"20 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143477823","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":"Maximum-expectation matching under recourse","authors":"João Pedro Pedroso, Shiro Ikeda","doi":"10.1016/j.ejor.2025.02.012","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.02.012","url":null,"abstract":"This paper addresses the problem of maximizing the expected size of a matching in the case of unreliable vertices and/or edges. The assumption is that the solution is built in several steps. In a given step, edges with successfully matched vertices are made permanent; but upon edge or vertex failures, the remaining vertices become eligible for reassignment. This process may be repeated a given number of times, and the objective is to end with the overall maximum number of matched vertices.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"70 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143477829","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}
Xiaoping Xu, Xinru Chen, T.C.E. Cheng, Tsan-Ming Choi, Yuanyuan Yang
{"title":"Should blockchain be used to eliminate greenwashing for green and live-streaming platform operations under carbon trading systems?","authors":"Xiaoping Xu, Xinru Chen, T.C.E. Cheng, Tsan-Ming Choi, Yuanyuan Yang","doi":"10.1016/j.ejor.2025.02.017","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.02.017","url":null,"abstract":"This study examines a supply chain comprising a live-streaming platform and a manufacturer that sells its products via the platform in the agency or resale mode. Under the carbon trading system, the manufacturer adopts green technology and exhibits the greenwashing behaviour, and the platform chooses whether to use blockchain to eliminate this behaviour. We find that the existence of greenwashing generates a higher profit for the platform in the agency mode. In the resale mode, the existence of greenwashing generates a higher (lower) profit for the platform if the additional profit brought by blockchain is low (high) at a low or moderate cap. However, when the cap is high, the existence of greenwashing hurts the platform’s profit. Furthermore, considering the government’s decision, we find that the existence of greenwashing hurts (improves) the social welfare at a high (low) correlation coefficient between the carbon trading price and potential market demand.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"54 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143641016","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}
Eleftherios Siskos, Antoine Desbordes, Peter Burgherr, Russell McKenna
{"title":"Integrated assessment of a robust Choquet integral preference model for efficient multicriteria decision support","authors":"Eleftherios Siskos, Antoine Desbordes, Peter Burgherr, Russell McKenna","doi":"10.1016/j.ejor.2025.02.011","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.02.011","url":null,"abstract":"Decision problems are often characterized by complex criteria dependencies, which can hamper the development of an efficient and theoretically accurate multicriteria decision aid model. These criteria interactions have the form of either a redundancy or synergistic effect and require arduous and demanding preference statements for their quantification. This paper investigates interactions between pairs of criteria in decision models and addresses them with the proposition of an MCDA framework, coupling the elicitation protocol of the method of cards and the 2-additive Choquet integral preference model. An interactive robustness control algorithm ensures the concurrent acquisition of a stable decision model and satisfactory evaluation results. Robustness is assessed with a portfolio of robustness indicators, spanning from the variability of the preference parameters to the reduction of the model's feasible space and rank acceptability indices. At the core of the algorithm, a heuristic module generates pairwise elicitation questions and selects those delivering the highest expected information gain. The whole framework is stress-tested with a small-scale decision problem, where three versions of the heuristics are automatically applied, with the machine randomly answering the questions. Subsequently, the same problem is approached with the involvement of a real decision maker, with a view to appraising the required cognitive effort and receiving valuable feedback.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"31 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143477822","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}
Xuan He, Quan-Ke Pan, Liang Gao, Janis S. Neufeld, Jatinder N.D. Gupta
{"title":"Minimising Makespan and total tardiness for the flowshop group scheduling problem with sequence dependent setup times","authors":"Xuan He, Quan-Ke Pan, Liang Gao, Janis S. Neufeld, Jatinder N.D. Gupta","doi":"10.1016/j.ejor.2025.02.009","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.02.009","url":null,"abstract":"The challenge of optimizing multiple objectives while considering job groups and partial due dates is prevalent in the flowshop group scheduling problem (FGSP). Despite its significance, the multi-objective FGSP with partial due dates (MFGSP) remains largely unaddressed in existing FGSP literature. In this paper, we bridge this gap by introducing a mixed integer linear programming model and an iterated greedy algorithm tailored for MFGSP with sequence-dependent group setup times, aimed at minimizing both makespan and total tardiness concurrently. Our proposed approach delves into the specific characteristics of times, acknowledging the inherent conflicts between objectives and the unique nature of each objective. We propose two novel local search operators: one inspired by the asymmetric traveling salesman problem and the other based on a domination criterion. These operators are seamlessly integrated into the iterated greedy algorithm framework, augmented with a cone-weighted scalar method as a fitness function and adaptive perturbation parameters. Extensive experimental evaluations demonstrate the efficacy and efficiency of our proposed algorithm, showcasing its capability to solve the MFGSP effectively. Through this research, we contribute a practical and versatile solution to a largely unexplored area in group scheduling optimization.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"22 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143477830","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":"Low-rank matrix estimation via nonconvex spectral regularized methods in errors-in-variables matrix regression","authors":"Xin Li , Dongya Wu","doi":"10.1016/j.ejor.2025.02.005","DOIUrl":"10.1016/j.ejor.2025.02.005","url":null,"abstract":"<div><div>High-dimensional matrix regression has been studied in various aspects, such as statistical properties, computational efficiency and application to specific instances including multivariate regression, system identification and matrix compressed sensing. Current studies mainly consider the idealized case that the covariate matrix is obtained without noise, while the more realistic scenario that the covariates may always be corrupted with noise or missing data has received little attention. We consider the general errors-in-variables matrix regression model and proposed a unified framework for low-rank estimation based on nonconvex spectral regularization. Then from the statistical aspect, recovery bounds for any stationary points are provided to achieve statistical consistency. From the computational aspect, the proximal gradient method is applied to solve the nonconvex optimization problem and is proved to converge to a small neighborhood of the global solution in polynomial time. Consequences for concrete models such as matrix compressed sensing models with additive noise and missing data are obtained via verifying corresponding regularity conditions. Finally, the performance of the proposed nonconvex estimation method is illustrated by numerical experiments on both synthetic and real neuroimaging data.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"323 2","pages":"Pages 626-641"},"PeriodicalIF":6.0,"publicationDate":"2025-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143443565","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 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":"https://doi.org/10.1016/j.ejor.2025.02.007","url":null,"abstract":"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.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"121 1","pages":""},"PeriodicalIF":6.4,"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}