{"title":"Logic-based Benders decomposition combined with column generation for mobile 3D printer scheduling problem","authors":"Tao Li , Hu Qin , Nan Huang","doi":"10.1016/j.omega.2025.103442","DOIUrl":"10.1016/j.omega.2025.103442","url":null,"abstract":"<div><div>The principles of sharing become increasingly important for boosting business profitability. In the realm of the sharing economy, 3D printers possess the potential to meet the printing demands of an expanded customer base. This paper investigates a class of mobile 3D printer scheduling problems that consider various aspects such as printer allocation, transportation, and production. 3D printers can be transported using truck between customer locations to efficiently fulfill customer orders and achieve optimal resource allocation. A mixed-integer linear programming model is proposed to describe this problem. After analyzing the characteristics and structure of the model, a logic-based Benders decomposition algorithm framework is designed for solving this problem. To address the specific characteristics of the Benders sub-problem, we define a novel tandem sequence structure and develop a tandem-sequence-based column generation for solving the Benders sub-problem. Three strategies, namely dominance rules, effective upper bounds, and tandem sequence deduplication, are constructed to accelerate the algorithm’s convergence. To evaluate the performance of the proposed algorithm framework and acceleration strategies, a comprehensive set of 320 instances and a real-world set of 14 instances are generated for rigorous testing. The experimental results affirm the effectiveness of these approaches and algorithm.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"139 ","pages":"Article 103442"},"PeriodicalIF":7.2,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145424976","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":"Supply chain digital twin design and implementation at scale: A case study at the Ford Motor Company and generalizations","authors":"Dmitry Ivanov , Oleg Gusikhin","doi":"10.1016/j.omega.2025.103447","DOIUrl":"10.1016/j.omega.2025.103447","url":null,"abstract":"<div><div>In this study, we describe Ford’s practices and propose three industry-based frameworks for supply chain digital twin (SCDT) design and implementation at scale. First, a generalized three-layer framework for the design of SCDTs based on Ford's approach is developed. The layers are intracompany, Tier-1 network, and deep-tier network, classified based on data visibility. We describe how digital twins can enhance operational performance and be utilized for resilience stress testing. Second, generalized frameworks of SCDT implementation are shown composed of two dimensions, i.e., implementation scale and implementation scope. The three-stage implementation scale framework proposes a roadmap for transition from data-driven organizations to digital twin-driven management systems. The four-level implementation scope framework encompasses product, process, organization, and extended network levels, with a focus on the key role of the data analytics department in deploying SCDTs. We then generalize four fundamental principles for SCDTs: (i): object-driven and data-driven design and adaptation, (ii) visibility as the central angle of digital twin design and technology, (iii) digital twins are integrators of data and knowledge, and (iv) SCDT continuous adaptation. To the best of our knowledge, our paper is the first in the literature to report on the design and deployment of an SCDT at scale, which can be useful for academics and practitioners alike. We conclude that a properly developed SCDT can enable strategic and operational performance improvements, end-to-end visibility, agentic AI integration in decision-making, and supply chain stress testing, as well as create a new approach to managing the supply chain.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"139 ","pages":"Article 103447"},"PeriodicalIF":7.2,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145365179","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":"Fleet size planning in crowdsourced delivery: Balancing service level and driver utilization","authors":"Aliaa Alnaggar, Sahil Bhatt","doi":"10.1016/j.omega.2025.103445","DOIUrl":"10.1016/j.omega.2025.103445","url":null,"abstract":"<div><div>This paper addresses the fleet size planning problem for crowdsourced delivery platforms, focusing on optimizing the number of crowdsourced drivers to balance the platform’s service level and driver utilization. This is motivated by recent regulatory measures that limit the number of vehicle licenses a platform can hold, which caps fleet size as a means to enhance driver working conditions and mitigate congestion and emissions caused by an excessive number of idle vehicles on the road. We propose a two-stage optimization model where the first stage involves tactical decisions for determining fleet sizes, while the second stage captures the operational dynamics of the platform by a Markov decision process (MDP) in which uncertain crowd driver arrival in the MDP depends on fleet size decisions in the first stage, introducing decision-dependent uncertainty. To efficiently solve the model, we employ a value function approximation (VFA) algorithm that iteratively determines fleet sizes using Boltzmann exploration then approximates the second-stage MDP using a rolling-horizon parametric cost function approximation. Extensive computational experiments confirm the effectiveness of the VFA algorithm, demonstrating its ability to meet both service level and driver utilization targets under various conditions. The results show that a platform can achieve high driver utilization and meet its service level target while only marginally reducing its profit, especially when driver behavior is more predictable and fleet sizes are temporally adjusted.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"139 ","pages":"Article 103445"},"PeriodicalIF":7.2,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145365178","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 truck–drone delivery problem with location and routing decisions under uncertainty","authors":"Okan Dukkanci","doi":"10.1016/j.omega.2025.103446","DOIUrl":"10.1016/j.omega.2025.103446","url":null,"abstract":"<div><div>This study presents a new stochastic delivery problem with location and routing decisions, in which trucks and drones operate together. While trucks are routed between parking lots, drones are launched from parking lots to make deliveries to stores. The problem decides the location of parking lots, the route of trucks, and the assignment of stores to parking lots and drones. The objective function minimizes the total transportation cost of trucks and drones subject to the payload capacity of the trucks and drones, the flying range of the drones, and the time windows for parking lots. The uncertainty of demand and drone travel time is considered to adapt to the dynamics of the real world, such as the volatile customers’ demand and unpredictable weather conditions. We first develop a two-stage stochastic programming formulation and its deterministic equivalent problem reformulation. We propose the scenario decomposition algorithm as an exact solution approach to solve the proposed stochastic problem. We also develop improvement strategies to enhance the performance of the scenario decomposition algorithm. The computational experiments are conducted on two different data sets to evaluate the performance of the scenario decomposition algorithm, analyze the value of stochasticity and the expected value of perfect information, and examine the impact of some key parameters of the problem such as the number of drones per truck, unit transportation costs of drones and trucks, time windows, and payload capacity of trucks and drones.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"139 ","pages":"Article 103446"},"PeriodicalIF":7.2,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145365180","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":"Information disclosure and pricing decisions in competitive waste treatment systems: An agent-based approach","authors":"Junfei Hu , Zhe Tian , Liang Cui , Peng Zhou","doi":"10.1016/j.omega.2025.103463","DOIUrl":"10.1016/j.omega.2025.103463","url":null,"abstract":"<div><div>Private operators are increasingly involved in municipal solid waste management worldwide, resulting in competitive waste treatment systems. In such competitive systems, the gate fee as a crucial revenue stream for private operators needs to be set appropriately to capture a larger share of waste stream and maximize profit. Assessing the impact of information disclosure on gate fee pricing decisions provides valuable insights for policy analysis and decision-making. This study proposes an agent-based competitive waste treatment model to analyze gate fee pricing decisions under disclosed information. The proposed model outperforms traditional methods such as game theory by considering both cooperation and competition relationships among multiple agents. The experience-weighted attraction algorithm is utilized to solve the proposed model, enabling collaborative learning behavior to be considered in the decision-making process, thereby making it suitable for a disclosed environment. We apply the proposed approach to examine the Shenzhen waste treatment market in China. It has been found that without information disclosure, operators may misjudge allocation rules, causing landfills to withdraw from competition and significantly raise gate fees in retaliation. Besides, disclosing market information contributes to optimizing gate fee decisions, reducing government expenditure, and improving waste allocation. Disclosing allocation rules emerges as the most effective policy for Shenzhen waste treatment market. These findings are expected to provide government agencies with comprehensive insights into gate fee pricing decisions under conditions of information disclosure.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"139 ","pages":"Article 103463"},"PeriodicalIF":7.2,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145526323","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}
Maria Elvira Borges Tunú Pessoa , Eduarda Asfora Frej , Adiel Teixeira de Almeida
{"title":"A novel information-driven approach for selecting a project portfolio: A benefit-to-cost based method combining decomposition and holistic elicitation paradigms","authors":"Maria Elvira Borges Tunú Pessoa , Eduarda Asfora Frej , Adiel Teixeira de Almeida","doi":"10.1016/j.omega.2025.103456","DOIUrl":"10.1016/j.omega.2025.103456","url":null,"abstract":"<div><div>Portfolio selection is a challenging task that involves multiple conflicting objectives that must be considered. In this context, this paper proposes a structured approach to addressing portfolio selection problems, based on the Benefit-to-Cost Ratio (BCR) heuristic for ranking projects, with a focus on the information provided by the decision maker (DM). First, we present an approach that combines two types of preference information derived from elicitation paradigms in decision-making: decomposition-based ones, which consider information provided about the consequences of projects, and holistic-based ones, which consider information about actual candidate projects and subsets of projects. Then, we present a mathematical programming model that combines both types of information and computes dominance relationships between projects, considering their estimated BCR. To operationalize the proposed approach, an interactive Decision Support System (DSS) was developed, offering a user-friendly interface with graphical visualization tools to help the DM when providing preference information. Finally, a portfolio selection problem for technology projects of a Brazilian company in the retail sector is presented to demonstrate the practical applicability of the proposed approach, thereby illustrating the methodology's potential to enhance the practice of portfolio selection in real-world scenarios.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"139 ","pages":"Article 103456"},"PeriodicalIF":7.2,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145474872","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":"Two-stage distributionally robust optimization approach for drone-supported facility location and post-disaster relief distribution","authors":"Pan Gao , Min Li , Zhongming Wu , Zhenzhen Zhang","doi":"10.1016/j.omega.2025.103462","DOIUrl":"10.1016/j.omega.2025.103462","url":null,"abstract":"<div><div>This paper explores the drone-supported application in a two-stage capacitated facility location problem, focusing on the strategic planning and operational phases of humanitarian relief. The first stage involves selecting facility locations and allocating drones, while the second stage involves transporting relief supplies post-disaster. We address the uncertainty inherent in post-disaster demand by employing a two-stage distributionally robust optimization (DRO) framework. To characterize various distributions of uncertainty, two types of ambiguity sets are introduced to characterize the unknown demand distribution: the Wasserstein and the event-wise mean absolute deviation ambiguity set. Furthermore, the DRO problem under the Wasserstein ambiguity set is decomposed and then solved using a column-and-constraint generation algorithm, due to the computational intractability of enumerating dual vertices in practical settings. In contrast, for the DRO problem tied to the mean absolute deviation ambiguity set, an event-wise affine decision rule is utilized to handle the recourse problem. This leads to reforming the problem into mixed-integer linear programming models, enabling its solution using standard optimization solvers. Numerical results demonstrate the effectiveness of both approaches, with the DRO models delivering more reliable solutions in out-of-sample tests compared to other state-of-the-art models. Specifically, our DRO models significantly reduce unmet post-disaster demand and ensure smaller total cost fluctuations on both in-sample and out-of-sample tests.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"139 ","pages":"Article 103462"},"PeriodicalIF":7.2,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145525914","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":"Enhanced indexing using cumulative prospect theory utility function with expectile risk","authors":"Divyanee Garg , Ahmad Zaman Khan , Aparna Mehra","doi":"10.1016/j.omega.2025.103444","DOIUrl":"10.1016/j.omega.2025.103444","url":null,"abstract":"<div><div>In this article, we explore portfolio selection strategies for enhanced indexation, focusing on integrating behavioral insights from cumulative prospect theory (CPT) to address investor preferences and risk appetite while aiming to achieve returns that outperform the benchmark index. We incorporate loss aversion and probability distortion biases through the CPT utility function and expectile risk measure to mitigate portfolio risk. We propose dynamically adjusting reference points within the CPT utility function as the sum of the index return and a specified excess return to exceed the index’s performance. The excess return is calculated as the average of the positive alphas of the stocks in the benchmark index, derived from the capital asset pricing model. The proposed model is nonlinear, nonconvex, and nondifferentiable.</div><div>From an algorithmic standpoint, we design and implement the Real-Coded Genetic Algorithm to solve the newly proposed nondifferentiable nonconvex model. The efficacy of the model is tested using global datasets from Dow Jones, DAX, FTSE 100, and S&P 100. Our empirical evidence shows that by taking a lower risk than the index (measured by the portfolio’s beta), our proposed CPT-based EI model outperforms the ordinary least square regression-based enhanced indexing model, the quantile regression-based enhanced indexing model, the naive strategy, and the benchmark index across nearly all performance metrics. Moreover, increasing the loss aversion parameter in the CPT value function improves the out-of-sample performance metrics up to a certain threshold. To further validate the consistency of our model, we tested it under different market phases of the FTSE 100 index and found favorable results.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"139 ","pages":"Article 103444"},"PeriodicalIF":7.2,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145334800","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":"Robust de novo programming under different uncertainty sets and its application to the renewable energy sector","authors":"Noureddine Kouaissah","doi":"10.1016/j.omega.2025.103389","DOIUrl":"10.1016/j.omega.2025.103389","url":null,"abstract":"<div><div>This paper proposes robust models of de novo programming (R-DNP) using cardinality-constrained robustness with interval-based, ellipsoidal, and norm-based uncertainty sets. R-DNP has not been researched or explored, and we aim to fill this gap in the literature. In particular, we develop the robust counterpart of the weighted DNP (W-DNP), Chebyshev DNP (C-DNP), and extended DNP (E-DNP) models to incorporate different uncertainty sets and decision-makers’ preferences. Methodologically, the proposed approach extends the conventional DNP model to solve uncertain coefficients for each decision variable on the left-hand side of each objective function and on the total budget, overcoming the limitations of the current multicriteria solution procedure of the DNP approach. The proposed methods provide decision-makers with more flexibility to express their level of conservatism and preferences by setting priority weights and aspiration levels. The proposed method’s usefulness over the standard DNP is demonstrated by providing an illustrative example. Moreover, we validate the proposed formulations for solving real-world problems through a hypothetical application: optimizing onshore wind farm locations in Morocco. The work’s results confirm the validity of the proposed methodologies, showing that they can assist decision-makers in determining the optimal system design for sustainable electricity generation under uncertain conditions.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"138 ","pages":"Article 103389"},"PeriodicalIF":6.7,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144678923","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}
Asmerilda Hitaj , Elisa Mastrogiacomo , Elena Molho
{"title":"Robust bi-objective mean-CVaR portfolio selection: Applications to energy sector","authors":"Asmerilda Hitaj , Elisa Mastrogiacomo , Elena Molho","doi":"10.1016/j.omega.2025.103404","DOIUrl":"10.1016/j.omega.2025.103404","url":null,"abstract":"<div><div>A new approach to optimizing or hedging a portfolio of financial positions is presented and tested with applications to energy market. Motivated by uncertainty in the estimation of problem data we consider robust bi-objective optimization problems with mean and conditional value-at-risk objective functions where the underlying probability distribution of portfolio return is only known to belong to a certain set. To tackle the problem of uncertainty we consider two different approaches: in the first one, uncertainty is represented by an elliptic set centered at the sample estimators of mean and covariance matrix; in the second one, uncertainty takes into account experts beliefs. For both approaches, we derive analytical semi-closed-form solutions for the worst case mean-CVaR portfolio; in addition, we provide a characterization of the location of the robust Pareto frontier with respect to the corresponding original Pareto frontier.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"138 ","pages":"Article 103404"},"PeriodicalIF":7.2,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144911946","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}