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

Multi-objective cooperative co-evolution algorithm with hypervolume-based Q-learning for hybrid seru system 基于超体积q学习的混合血清系统多目标协同进化算法

IF 6 2区管理学

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

Zhecong Zhang , Yang Yu , Xuqiang Qi , Yangguang Lu , Xiaolong Li , Ikou Kaku

{"title":"Multi-objective cooperative co-evolution algorithm with hypervolume-based Q-learning for hybrid seru system","authors":"Zhecong Zhang , Yang Yu , Xuqiang Qi , Yangguang Lu , Xiaolong Li , Ikou Kaku","doi":"10.1016/j.ejor.2025.02.025","DOIUrl":"10.1016/j.ejor.2025.02.025","url":null,"abstract":"<div><div>The hybrid <em>seru</em> system (HSS), which is an innovative production pattern that emerges from real-world production situations, is practical because it includes both <em>serus</em> and a flow line, allowing temporary workers who are unable to complete all tasks to be assigned to the flow line<em>.</em> We focus on the HSS by minimising both makespan and total labour time. The HSS includes two complicated coupled NP-hard subproblems: hybrid <em>seru</em> formation and hybrid <em>seru</em> scheduling. Thus, we developed a multi-objective cooperative co-evolution algorithm with hypervolume-based Q-learning (MOCC<img>HVQL) involving hybrid <em>seru</em> formation and scheduling subpopulations, evolved using a genetic algorithm. To achieve balance between exploration and exploitation, a hypervolume-based Q-learning mechanism is proposed to adaptively adjust the number of non-dominated hybrid <em>seru</em> formations/scheduling in co-evolution. To reduce computational time and enhance population diversity, a population partitioning mechanism is proposed. Extensive comparative results demonstrate that the MOCC<img>HVQL outperforms state-of-the-art algorithms in terms of solution convergence and diversity, with the hypervolume metric increasing by 22 % and inverse generational distance metric decreasing by 76 %. Compared with a pure <em>seru</em> system (PSS), the HSS can significantly reduce training tasks, thereby conserving the training budget. In scenarios with fewer workers and more batches, a positive phenomenon, where the HSS significantly decreases the training tasks relative to PSS while only slightly increasing the makespan, was observed. In specific instances, the HSS reduced the number of training tasks by 50 %, while only increasing the makespan by 10.5 %.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"324 3","pages":"Pages 839-854"},"PeriodicalIF":6.0,"publicationDate":"2025-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143532977","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

Prelim p. 2; First issue - Editorial Board 预览第 2 页；第一期 - 编辑委员会

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2025-02-18 DOI: 10.1016/S0377-2217(25)00122-5

引用次数: 0

Integer linear programming formulations for the maximum flow blocker problem 最大流阻塞问题的整数线性规划公式

IF 6 2区管理学

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

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":"10.1016/j.ejor.2025.02.013","url":null,"abstract":"<div><div>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.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"324 3","pages":"Pages 742-758"},"PeriodicalIF":6.0,"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}

引用次数: 0

It’s All in the Mix: Technology choice between driverless and human-driven vehicles in sharing systems 这一切都在混合中：共享系统中无人驾驶和人类驾驶汽车之间的技术选择

IF 6 2区管理学

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

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":"10.1016/j.ejor.2025.02.004","url":null,"abstract":"<div><div>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.</div><div>We analyze a strategic fleet sizing and composition problem, integrating a rebalancing problem, which we formalize as a Markov decision process. We incorporate the rebalancing problem with a time-dependent fluid approximation to devise a scalable linear programming solution approach, which we improve by state-dependent emergency rebalancing. We present a numerical study on artificial and real-world instances that reveals significant profit improvement potential of driverless and mixed fleets compared to human-driven fleets. For real-world instances, the profit improvement amounts up to 20.4% over exclusively human-driven fleets. If both vehicle types incur equal operational costs, operators optimally mix a small number of driverless vehicles with a large number of human-driven vehicles. Mixed fleets are particularly beneficial if demand varies over time, and operators consequently shift rebalancing to lower-demand periods.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"324 3","pages":"Pages 969-980"},"PeriodicalIF":6.0,"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}

引用次数: 0

Structural feedback and behavioral decision making in queuing systems: A hybrid simulation framework 排队系统中的结构反馈和行为决策：一个混合仿真框架

IF 6 2区管理学

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

Sergey Naumov , Rogelio Oliva

{"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":"10.1016/j.ejor.2025.02.010","url":null,"abstract":"<div><div>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.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"324 3","pages":"Pages 855-870"},"PeriodicalIF":6.0,"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}

引用次数: 0

Maximum-expectation matching under recourse 追索权下的最大期望匹配

IF 6 2区管理学

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

João Pedro Pedroso , Shiro Ikeda

{"title":"Maximum-expectation matching under recourse","authors":"João Pedro Pedroso , Shiro Ikeda","doi":"10.1016/j.ejor.2025.02.012","DOIUrl":"10.1016/j.ejor.2025.02.012","url":null,"abstract":"<div><div>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.</div><div>An application of this problem is found in kidney exchange programs, going on in several countries, where a vertex is an incompatible patient–donor pair and an edge indicates cross-compatibility between two pairs; the objective is to match these pairs so as to maximize the number of served patients. A new scheme is proposed for matching rearrangement in case of failure, along with a prototype algorithm for computing the optimal expectation for the number of matched edges (or vertices), considering a possibly limited number of rearrangements.</div><div>Computational experiments reveal the relevance and limitations of the algorithm, in general terms and for the kidney exchange application.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"324 3","pages":"Pages 732-741"},"PeriodicalIF":6.0,"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}

引用次数: 0

Should blockchain be used to eliminate greenwashing for green and live-streaming platform operations under carbon trading systems? 是否应该使用区块链来消除碳交易体系下绿色和直播平台运营的“洗绿”行为？

IF 6 2区管理学

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

Xiaoping Xu , Xinru Chen , T.C.E. Cheng , Tsan-Ming Choi , Yuanyuan Yang

引用次数: 0

Integrated assessment of a robust Choquet integral preference model for efficient multicriteria decision support 基于多准则决策支持的稳健Choquet积分偏好模型的综合评估

IF 6 2区管理学

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

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":"10.1016/j.ejor.2025.02.011","url":null,"abstract":"<div><div>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.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"324 3","pages":"Pages 871-892"},"PeriodicalIF":6.0,"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}

引用次数: 0

Minimising Makespan and total tardiness for the flowshop group scheduling problem with sequence dependent setup times 最小化与序列相关的流程车间组调度问题的最大完工时间和总延迟时间

IF 6 2区管理学

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

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":"10.1016/j.ejor.2025.02.009","url":null,"abstract":"<div><div>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.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"324 2","pages":"Pages 436-453"},"PeriodicalIF":6.0,"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}

引用次数: 0

Low-rank matrix estimation via nonconvex spectral regularized methods in errors-in-variables matrix regression 误差变量矩阵回归中的非凸谱正则化低秩矩阵估计

IF 6 2区管理学

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

Xin Li , Dongya Wu

{"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}

引用次数: 0