Omega-international Journal of Management Science最新文献

筛选
英文 中文
Joint design of transit and bike-sharing systems by multi-objective optimization considering stochastic user equilibrium 考虑随机用户均衡的公交与共享系统多目标优化联合设计
IF 7.2 2区 管理学
Omega-international Journal of Management Science Pub Date : 2026-06-01 Epub Date: 2025-12-03 DOI: 10.1016/j.omega.2025.103484
Mingzhang Liang , Min Xu , Shuaian Wang
{"title":"Joint design of transit and bike-sharing systems by multi-objective optimization considering stochastic user equilibrium","authors":"Mingzhang Liang ,&nbsp;Min Xu ,&nbsp;Shuaian Wang","doi":"10.1016/j.omega.2025.103484","DOIUrl":"10.1016/j.omega.2025.103484","url":null,"abstract":"<div><div>In this study, we investigate the joint optimization design of transit and bike-sharing systems (JDTB) at the strategic planning level, where the transit network, operating frequencies of transit lines, bike-sharing parking locations, and associated bike deployment numbers are simultaneously determined. Considering that transit and bike-sharing systems are operated by different operators with various objectives, we propose a multi-objective bi-level optimization model to formulate the JDTB problem. The upper-level optimization has two competing objectives: namely, the transit objective to minimize overall costs for both users and the transit operator, and the bike-sharing objective to maximize bike-sharing profits. At the lower level, a stochastic user equilibrium (SUE) assignment model is proposed to capture users’ choice behaviors in integrated transit-bike systems. To achieve more realistic choice behaviors and provide practical and reliable JDTB solutions, this model considers various impact factors on users’ decision-making processes, including congestion and common-line issues in transit systems, bike availability and reuse, as well as multimode combination and transfers in trip chains. Moreover, a diagonalization method combined with an iterative balancing scheme as well as a meta-heuristic algorithm based on NSGA-II are developed to solve the SUE and JDTB problems, respectively. Numerical experiments demonstrate the efficacy of the proposed model and algorithm in achieving trade-off solutions between the interests of transit and bike-sharing operators.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"141 ","pages":"Article 103484"},"PeriodicalIF":7.2,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145735256","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
Data-driven auction design for blockchain-based digital asset trading: A mixed method 基于区块链的数字资产交易数据驱动拍卖设计:一种混合方法
IF 7.2 2区 管理学
Omega-international Journal of Management Science Pub Date : 2026-06-01 Epub Date: 2025-12-03 DOI: 10.1016/j.omega.2025.103482
Yifang Ding , Su Xiu Xu , Meng Cheng , Sini Guo , Xiang T.R. Kong , George Q. Huang
{"title":"Data-driven auction design for blockchain-based digital asset trading: A mixed method","authors":"Yifang Ding ,&nbsp;Su Xiu Xu ,&nbsp;Meng Cheng ,&nbsp;Sini Guo ,&nbsp;Xiang T.R. Kong ,&nbsp;George Q. Huang","doi":"10.1016/j.omega.2025.103482","DOIUrl":"10.1016/j.omega.2025.103482","url":null,"abstract":"<div><div>This paper is motivated by a real project with a leading culture assets and equity swap organization in South China. Our preliminary survey assesses the potential of digital collectibles swap, with professionals aiming to boost liquidity and consumers driven by social attributes and meta-item diversity. In our setting, each agent owns a digital asset and wants another meta-item. However, the traditional <em>Vickrey-Clarke-Groves</em> (VCG) auction runs at a deficit. We thus introduce a novel mechanism that combines the VCG auction with <em>limited supply</em> and <em>platform escrow</em> concepts, called <em>LSE-VCG auction</em>. To improve the surplus of platform (auctioneer), we use <em>limited supply</em> to constrain the number of winners and <em>platform escrow</em> to increase market demand. The LSE-VCG auction and its externality-inclusive variant satisfy both truthful telling and participation rationality. If multilateral matching achieves maximal social welfare, then the substitute condition does not hold (<em>impossibility theorem</em>). We prove that the platform’s surplus can be improved by limited supply in some conditions. Our experimental results show that the VCG auction solely with limited supply could reach greater social welfare, agents’ profits and ratio of swap relative to the sequential Vickrey auctions. Moreover, a mix of limited supply and platform escrow schemes can further improve the platform’s profit and successful trading ratio. For the platform, truthful telling is a desirable strategy that brings high revenues, which promotes a transparent and beneficial auction environment. Besides, the impacts of externalities, auction timing, market size, value distribution and size of XOR bids are investigated. Furthermore, our auction mechanism is likely effective in addressing large-scale problems. Finally, we apply four effective machine learning methods to predict the limited supply number with partial information before the auction.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"141 ","pages":"Article 103482"},"PeriodicalIF":7.2,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145658437","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 shift scheduling with discretionary rest breaks 强有力的轮班安排和自由裁量的休息时间
IF 7.2 2区 管理学
Omega-international Journal of Management Science Pub Date : 2026-06-01 Epub Date: 2025-12-16 DOI: 10.1016/j.omega.2025.103500
Sara Mattia , Fabrizio Rossi , Stefano Smriglio
{"title":"Robust shift scheduling with discretionary rest breaks","authors":"Sara Mattia ,&nbsp;Fabrizio Rossi ,&nbsp;Stefano Smriglio","doi":"10.1016/j.omega.2025.103500","DOIUrl":"10.1016/j.omega.2025.103500","url":null,"abstract":"<div><div>Shift scheduling is a critical task in workforce management, which consists of covering the staffing needs by feasible work shifts at minimum labor cost. Work shifts must include rest breaks according to national regulations and collective agreements, significantly impacting the expected Level of Service (LoS) provided to the customers. Therefore, managers tend to preserve the LoS by rigidly scheduling breaks at a centralized level. This affects the well-being of employees, who, especially in large organizations, require more discretion in choosing rest breaks to reduce work stress. This paper presents a two-stage robust optimization model with decision-dependent uncertainty to handle discretionary break assignment. This is a challenging problem both in theory and practice. We formulate it as a <em>bilevel program</em> and develop a tailored heuristic algorithm to find high-quality shift schedules for staffing patterns of several service systems. This methodology allows managers to assess the cost of discretion and to finely determine the best trade-off among discretion, LoS, and labor cost.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"141 ","pages":"Article 103500"},"PeriodicalIF":7.2,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145788042","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 bi-objective sustainable EOQ model with all-units discounts 具有全单位折扣的双目标可持续EOQ模型
IF 7.2 2区 管理学
Omega-international Journal of Management Science Pub Date : 2026-06-01 Epub Date: 2025-12-16 DOI: 10.1016/j.omega.2025.103503
José M. Gutiérrez, Antonio Sedeño-Noda
{"title":"A bi-objective sustainable EOQ model with all-units discounts","authors":"José M. Gutiérrez,&nbsp;Antonio Sedeño-Noda","doi":"10.1016/j.omega.2025.103503","DOIUrl":"10.1016/j.omega.2025.103503","url":null,"abstract":"<div><div>A bi-objective sustainable Economic Order Quantity (EOQ) model considering all-units discounts is addressed. Two criteria are considered in the model, namely, the classical cost function of the EOQ and a <span><math><msub><mrow><mtext>CO</mtext></mrow><mrow><mn>2</mn></mrow></msub></math></span> emission function, which must be simultaneously minimized. Moreover, all-units discounts are taken into account since they are a very common practice in real world wholesalers/sellers businesses to encourage higher volume sales in order to reduce the inventory level. Therefore, the aim of the new model is to identify the non-dominated solution set (Pareto optimal set).</div><div>It will be shown that the Pareto optimal solution set for the new sustainable EOQ variant is not always a convex set (or equivalently, the nondominated solution set could occasionally be non-continuous) and this set is defined by means of cases study (depending on the problem’s variables values).</div><div>The new characterization of the Pareto optimal set of the new extension of this bi-objective sustainable EOQ model allows us to define the corresponding Pareto frontier. These findings have been implemented in <span>Python</span> and tested for a randomly generated set of instances.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"141 ","pages":"Article 103503"},"PeriodicalIF":7.2,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145788091","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
Blockchain adoption for promoting carbon emission reduction in relation to social comparison and competition 透过社会比较和竞争,推动碳减排
IF 7.2 2区 管理学
Omega-international Journal of Management Science Pub Date : 2026-06-01 Epub Date: 2025-12-06 DOI: 10.1016/j.omega.2025.103487
Benyong Hu , Fuxia Ren , Xu Chen , Chao Meng
{"title":"Blockchain adoption for promoting carbon emission reduction in relation to social comparison and competition","authors":"Benyong Hu ,&nbsp;Fuxia Ren ,&nbsp;Xu Chen ,&nbsp;Chao Meng","doi":"10.1016/j.omega.2025.103487","DOIUrl":"10.1016/j.omega.2025.103487","url":null,"abstract":"<div><div>This paper examines the impact and value of blockchain adoption on firms’ carbon emission reduction decisions. Accounting for social comparison between eco-conscious and general consumers, we develop game-theoretic models of producers and consumers under both monopoly and competition conditions, and where low-carbon and traditional (non-low-carbon) products coexist. We first show that the probability of eco-conscious consumers purchasing low-carbon products is raised as blockchain changes the demand structure in the competition market. Interestingly, however, adopting blockchain in the competition market does not necessarily lead to higher carbon emission reduction. This is different from the positive effect of blockchain in the monopoly market that promotes carbon emission reduction. Second, in stark contrast to the monopoly market, we identify that competition is more conducive to the adoption of blockchain and the promotion of carbon emission reduction by a firm. Nevertheless, competition does not always improve consumer surplus—A counterintuitive result. Third, our analysis concludes that, as the fraction of eco-conscious consumers continues to increase, social comparison instead has a dampening effect on firms’ incentives to adopt blockchain and enhance carbon emission reduction. These findings provide a new theoretical mechanism concerning blockchain adoption in promoting sustainability within the social comparison context and a quantitative basis for government carbon regulation.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"141 ","pages":"Article 103487"},"PeriodicalIF":7.2,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145735255","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
Dynamic stochastic parcel locker assignment with uncertain pick-up times 不确定取件时间的动态随机储物柜分配
IF 7.2 2区 管理学
Omega-international Journal of Management Science Pub Date : 2026-04-01 Epub Date: 2025-11-25 DOI: 10.1016/j.omega.2025.103478
Simona Mancini , Margaretha Gansterer
{"title":"Dynamic stochastic parcel locker assignment with uncertain pick-up times","authors":"Simona Mancini ,&nbsp;Margaretha Gansterer","doi":"10.1016/j.omega.2025.103478","DOIUrl":"10.1016/j.omega.2025.103478","url":null,"abstract":"<div><div>Automated parcel lockers are used by logistics providers in order to increase the efficiency of last-mile delivery operations particularly in urban areas. We consider the case of a company that operates lockers and dynamically receives delivery orders that have to be accepted or rejected immediately. On a second decision stage, the set of accepted orders has be assigned to the lockers such that customer compatibility requirements and maximum fulfillment times are respected. As both future arrivals of orders as well as customer pickup-times are unknown, the company faces a dynamic stochastic problem. To generate solutions, we propose a decision framework based on a classification approach. The classifier uses a mixed integer model to learn from optimal solutions within a deterministic setting and exploits this information within the dynamic stochastic process. We assess the proposed method within an extensive computational study where both artificial instances and a real world case are addressed. The obtained results show that the classification-based framework outperforms all benchmark methods, which include (i) scenario sampling, (ii) classical decision trees, and (iii) several deterministic policies. Managerial insights with regard to most important systems’ features within the decision process are derived. The newly proposed decision framework is generalizable such that it can be applied to related dynamic stochastic matching problems.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"140 ","pages":"Article 103478"},"PeriodicalIF":7.2,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145616411","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
Cooperation between competing digital content platforms: Open access for content sharing 相互竞争的数字内容平台之间的合作:内容共享的开放访问
IF 7.2 2区 管理学
Omega-international Journal of Management Science Pub Date : 2026-04-01 Epub Date: 2025-11-24 DOI: 10.1016/j.omega.2025.103480
Wenshuo Zhang , Minqiang Li , Haiyang Feng , Nan Feng
{"title":"Cooperation between competing digital content platforms: Open access for content sharing","authors":"Wenshuo Zhang ,&nbsp;Minqiang Li ,&nbsp;Haiyang Feng ,&nbsp;Nan Feng","doi":"10.1016/j.omega.2025.103480","DOIUrl":"10.1016/j.omega.2025.103480","url":null,"abstract":"<div><div>Continuous investment in content by digital content platforms (DCPs) has intensified competition for exclusive content, while subscriber base growth has slowed in an increasingly saturated market. In this context, cooperation through open content access has emerged as a practical strategy for DCPs to sustain further growth. Specifically, a DCP (e.g., HBO Max) may offer subscription-based access to its exclusive content via a competitor’s platform (e.g., Amazon Prime Video) to attract its focal subscribers. This strategy facilitates subscriber multi-homing by providing price discounts and reducing access costs for high-demand subscribers using the other open-access DCP. To examine the cooperation incentives of two competing DCPs, we develop a game-theoretic model that captures each DCP’s strategic decisions regarding open content access, alongside its discount strategy for attracting high-demand subscribers under open content access and its content strategy for securing exclusive content creators. The model explicitly incorporates the strategic interactions between the subscriber and content sides of a two-sided market, accounting for both creator-side and subscriber-side network effects. Our findings reveal that as the network effect on either side strengthens, the equilibrium outcome shifts across different cooperation cases, with one-way cooperation (where only one DCP’s exclusive content is available on the other DCP) replacing two-way cooperation (where each DCP’s exclusive content is accessible on the other DCP) as the equilibrium. A similar shift occurs as competition between the DCPs for content creators intensifies, provided that the content access cost remains relatively low. In contrast, when the content access cost is relatively high, two-way cooperation persists as the equilibrium. In the asymmetric DCP scenario, when the gap between the DCPs’ focal subscriber bases is relatively narrow and the competitive intensity is relatively high, two one-way cooperation cases emerge as equilibria, with either the larger or the smaller DCP serving as the open-access platform. In comparing these two cases, the larger DCP prioritizes the content strategy of setting a higher content price, whereas the smaller DCP focuses on the discount strategy of offering a higher discount rate.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"140 ","pages":"Article 103480"},"PeriodicalIF":7.2,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145681767","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 branch-and-price approach for computing the minimum number of pairwise comparisons in multicriteria selection based on convex cones 基于凸锥的多准则选择中两两比较最小次数计算的分支-价格方法
IF 7.2 2区 管理学
Omega-international Journal of Management Science Pub Date : 2026-04-01 Epub Date: 2025-11-24 DOI: 10.1016/j.omega.2025.103481
Özgür Özpeynirci , Selin Özpeynirci
{"title":"A branch-and-price approach for computing the minimum number of pairwise comparisons in multicriteria selection based on convex cones","authors":"Özgür Özpeynirci ,&nbsp;Selin Özpeynirci","doi":"10.1016/j.omega.2025.103481","DOIUrl":"10.1016/j.omega.2025.103481","url":null,"abstract":"<div><div>We study the multiple criteria selection problem (MCSP), where the aim is to identify the most preferred alternative among a set of known alternatives evaluated on multiple criteria. While several methods have been developed for MCSP, which utilize pairwise comparisons, it remains unknown how close these approaches are to the theoretical minimum number of pairwise comparisons required. To address this gap, we propose a computational framework that determines the theoretical lower bound on the number of pairwise comparisons required under the assumption that the DM’s value function is known. Although this assumption is not realistic for real-world decision support, it is essential for establishing a rigorous performance standard against which algorithms can be evaluated. While this framework provides a basis for benchmarking interactive algorithms, its applicability is specific to pairwise comparison procedures that utilize convex cones.</div><div>The benchmark is formulated as a large-scale integer programming problem and solved via a branch-and-price approach, where column generation is used to generate only the most promising convex cones. We further extend the model to incorporate transitivity, which can reduce the number of comparisons but increases computational effort. Extensive computational experiments are conducted across diverse problem instances. Beyond providing benchmark values, the results reveal structural patterns—such as when the optimal solution relies primarily on 2-point or 3-point cones, and when higher-level cones are required. These insights not only strengthen the role of the benchmark as a theoretical reference, but also offer practical guidance for designing more efficient algorithms for MCSP.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"140 ","pages":"Article 103481"},"PeriodicalIF":7.2,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145616412","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-driver transportation scheduling for improving supply chain resilience 提高供应链弹性的多驾驶员运输调度
IF 7.2 2区 管理学
Omega-international Journal of Management Science Pub Date : 2026-04-01 Epub Date: 2025-11-13 DOI: 10.1016/j.omega.2025.103461
Shaojun Lu , Yiyu Song , Min Kong , Chaoming Hu , Amir M. Fathollahi-Fard , Maxim A. Dulebenets
{"title":"Multi-driver transportation scheduling for improving supply chain resilience","authors":"Shaojun Lu ,&nbsp;Yiyu Song ,&nbsp;Min Kong ,&nbsp;Chaoming Hu ,&nbsp;Amir M. Fathollahi-Fard ,&nbsp;Maxim A. Dulebenets","doi":"10.1016/j.omega.2025.103461","DOIUrl":"10.1016/j.omega.2025.103461","url":null,"abstract":"<div><div>Optimizing transportation scheduling enhances the flexibility of resource allocation and transport operations, thereby reducing delays and costs while improving the resilience of supply chains. This study investigates a transportation scheduling problem aimed at minimizing the maximum completion time, incorporating key real-world considerations such as multiple drivers, loading and unloading times, round-trip transportation, distributed logistics centers, and the deterioration effect. Several structural properties of the problem are derived through a comprehensive preliminary analysis. Building on these properties, an exact algorithm for task sequencing is developed, and a Mixed-Integer Linear Programming model is formulated. A lower bound for the problem is also established. Given the NP-hard nature of the problem, we propose an enhanced Variable Neighborhood Search (VNS) algorithm, which integrates the exact algorithm with four neighborhood structures to accelerate convergence and improve solution quality. Experimental results indicate that the proposed intelligent algorithm significantly outperforms five state-of-the-art metaheuristics in both convergence speed and solution quality. This study further integrates deep learning to predict the best runtime of the proposed intelligent algorithm across problems of varying scales, which can reduce computational time in practical optimization scenarios. Sensitivity analysis highlights the critical influence of normal transportation times and the deterioration coefficient on scheduling performance, offering valuable theoretical insights for supply chain management. The findings of this research contribute to optimizing transportation task scheduling, enhancing supply chain resilience, and promoting sustainable development goals in supply chain management.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"140 ","pages":"Article 103461"},"PeriodicalIF":7.2,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145616410","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
Adaptation strategies-based supply chain viability optimization under bidirectional ripple effects 双向连锁效应下基于适应策略的供应链生存力优化
IF 7.2 2区 管理学
Omega-international Journal of Management Science Pub Date : 2026-04-01 Epub Date: 2025-11-17 DOI: 10.1016/j.omega.2025.103467
Wei Pu , Xiangbin Yan , Shuang Ma
{"title":"Adaptation strategies-based supply chain viability optimization under bidirectional ripple effects","authors":"Wei Pu ,&nbsp;Xiangbin Yan ,&nbsp;Shuang Ma","doi":"10.1016/j.omega.2025.103467","DOIUrl":"10.1016/j.omega.2025.103467","url":null,"abstract":"<div><div>Long-term disruptions can trigger ripple effects across the supply chain, impacting both upstream and downstream stakeholders. To mitigate the consequences of such bidirectional ripple effects, including financial losses, consumer dissatisfaction, and declines in supply chain performance, an efficient optimization framework is required to enhance supply chain viability (SCV) through the integration of agility, resilience, and sustainability.</div><div>To strengthen the adaptive capacity and long-term viability of supply chain networks, we propose an adaptation strategies-based optimization framework. These adaptation strategies include utilizing third-party logistics (3PL) and implementing self-healing mechanisms. We then develop a two-stage multi-period stochastic programming model incorporating these strategies. This model explicitly captures bidirectional ripple effects by integrating the forward and backward propagation of dynamic disruptions. Additionally, we develop an advanced multi-objective particle swarm optimization (AMOPSO) solution method for solving the two-stage multi-period stochastic programming.</div><div>Using real-world data from China’s small appliances industry during COVID-19, we demonstrate the applicability of the proposed optimization model in enhancing SCV and mitigating bidirectional ripple effects, and the efficiency and robustness of the developed AMOPSO solution method. The optimal results reveal improvements of 3.22% in agility, 17.03% in resilience, and 23.02% in sustainability. Thus, the proposed optimization framework can improve supply chain viability under bidirectional ripple effects. The framework, along with the developed adaptation strategies-based stochastic optimization model and AMOPSO solution method, provides a novel approach to supply chain viability optimization and offers a practical decision-support method to original equipment manufacturers (OEMs) under bidirectional ripple effects.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"140 ","pages":"Article 103467"},"PeriodicalIF":7.2,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145616413","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书