Omega-international Journal of Management Science最新文献_第3页

Joint design of transit and bike-sharing systems by multi-objective optimization considering stochastic user equilibrium 考虑随机用户均衡的公交与共享系统多目标优化联合设计

IF 7.2 2区管理学 Q1 MANAGEMENT

Omega-international Journal of Management Science

Pub Date : 2025-12-03 DOI: 10.1016/j.omega.2025.103484

Mingzhang Liang , Min Xu , Shuaian Wang

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.

在战略规划层面，我们研究了公共交通和共享单车系统（JDTB）的联合优化设计，其中公交网络、公交线路运行频率、共享单车停放位置和相关的自行车部署数量同时确定。考虑到公交系统和共享单车系统是由不同目标的运营商运营的，我们提出了一个多目标双层优化模型来求解JDTB问题。上层优化有两个相互竞争的目标：公交目标是使用户和公交运营商的总成本最小化，共享单车目标是使共享单车利润最大化。在较低的层次上，提出了一个随机用户均衡分配模型来捕捉集成公交自行车系统中用户的选择行为。为了实现更现实的选择行为，提供实用可靠的JDTB解决方案，该模型考虑了影响用户决策过程的各种因素，包括交通系统中的拥堵和共线问题，自行车的可用性和重用性，以及出行链中的多模式组合和换乘。提出了结合迭代平衡方案的对角化方法和基于NSGA-II的元启发式算法，分别解决了SUE和JDTB问题。数值实验证明了所提出的模型和算法在实现公交和共享单车运营商利益之间的权衡解决方案方面的有效性。

{"title":"Joint design of transit and bike-sharing systems by multi-objective optimization considering stochastic user equilibrium","authors":"Mingzhang Liang , Min Xu , 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":"2025-12-03","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区管理学 Q1 MANAGEMENT

Omega-international Journal of Management Science

Pub 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

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 Vickrey-Clarke-Groves (VCG) auction runs at a deficit. We thus introduce a novel mechanism that combines the VCG auction with limited supply and platform escrow concepts, called LSE-VCG auction. To improve the surplus of platform (auctioneer), we use limited supply to constrain the number of winners and platform escrow 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 (impossibility theorem). 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.

本文的研究灵感来源于一个华南地区领先的文化资产和股权交换机构的实际项目。我们的初步调查评估了数字收藏品交换的潜力，专业人士的目标是提高流动性，而消费者则受到社会属性和元项目多样性的驱动。在我们的设置中，每个代理拥有一个数字资产，并需要另一个元项。然而，传统的维克里-克拉克-格罗夫斯（VCG）拍卖出现了赤字。因此，我们引入了一种将VCG拍卖与有限供应和平台托管概念相结合的新机制，称为LSE-VCG拍卖。为了提高平台（拍卖商）的剩余，我们用有限的供应来约束中标者的数量，用平台托管来增加市场需求。LSE-VCG拍卖及其外部性包容型拍卖既满足真实陈述，又满足参与理性。如果多边匹配达到最大的社会福利，则替代条件不成立（不可能定理）。证明了在一定条件下，有限供给可以提高平台的剩余量。我们的实验结果表明，相对于连续的Vickrey拍卖，单独有限供应的VCG拍卖可以获得更大的社会福利、代理人利润和互换比率。此外，限量供应与平台托管方案相结合，可以进一步提高平台的利润和交易成功率。对于平台来说，诚实是一种可取的策略，可以带来高收入，从而促进透明和有益的拍卖环境。此外，研究了外部性、拍卖时机、市场规模、价值分布和异或出价规模的影响。此外，我们的拍卖机制可能对解决大规模问题有效。最后，我们应用四种有效的机器学习方法，在拍卖前使用部分信息预测有限供应数量。

{"title":"Data-driven auction design for blockchain-based digital asset trading: A mixed method","authors":"Yifang Ding , Su Xiu Xu , Meng Cheng , Sini Guo , Xiang T.R. Kong , 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":"2025-12-03","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

The roles of lean and corporate social responsibility in acquisitions 精益和企业社会责任在收购中的作用

IF 7.2 2区管理学 Q1 MANAGEMENT

Omega-international Journal of Management Science

Pub Date : 2025-12-02 DOI: 10.1016/j.omega.2025.103483

Yuqi Peng , Zhihao Zhang

We study how Lean operations and corporate social responsibility (CSR) jointly influence manufacturers’ decisions to pursue acquisitions. Lean improves efficiency through waste reduction but also removes resource buffers, making firms more cautious about the uncertainty, integration challenges, and potential operational disruptions of acquisitions. In contrast, CSR builds stakeholder trust, buffers risk, and broadens strategic flexibility, which can reduce perceived integration risks and increase willingness to engage in acquisitions. Using data from U.S. manufacturing firms (2005–2016) and bootstrap-based conditional logit models, we find that Lean reduces acquisition likelihood, while CSR attenuates this effect. We further find that the moderating role of CSR can be different, contingent on the multi-dimensional impacts of CSR, where environmental and social CSR dimensions encourage acquisitions, whereas governance discourages them. Theoretical and managerial insights are also discussed.

我们研究了精益运营和企业社会责任（CSR）如何共同影响制造商追求收购的决策。精益通过减少浪费来提高效率，但也消除了资源缓冲，使公司对不确定性、整合挑战和收购带来的潜在运营中断更加谨慎。相反，企业社会责任建立了利益相关者的信任，缓冲了风险，扩大了战略灵活性，这可以降低感知到的整合风险，增加参与收购的意愿。利用美国制造业公司（2005-2016）的数据和基于自助的条件logit模型，我们发现精益降低了收购可能性，而企业社会责任则减弱了这种影响。我们进一步发现，社会责任的调节作用可能会有所不同，这取决于社会责任的多维影响，其中环境和社会社会责任维度鼓励收购，而治理则阻碍收购。还讨论了理论和管理见解。

引用次数: 0

Two-stage robust optimization approach for integrated supply chain planning with hybrid-dark stores 混合暗店集成供应链规划的两阶段鲁棒优化方法

IF 7.2 2区管理学 Q1 MANAGEMENT

Omega-international Journal of Management Science

Pub Date : 2025-11-27 DOI: 10.1016/j.omega.2025.103479

Youngchul Shin , Younsoo Lee

The rapid growth of e-commerce has led to the emergence of dark stores, where traditional brick-and-mortar stores are repurposed into micro-fulfillment centers to meet online demand. Recently, a growing number of retailers have adopted hybrid-dark stores (HDSs), which operate simultaneously as physical retail outlets and fulfillment centers, enabling flexible space allocation and internal inventory transfers across both areas. While this dual functionality offers greater operational agility, it also introduces significant complexity into supply chain operations, particularly under demand uncertainty. To address this challenge, we propose a two-stage robust optimization approach for supply chain planning with HDSs. In the first stage, a target-oriented robust optimization framework determines binary production and space allocation decisions. In the second stage, adaptive recourse actions are taken for the remaining continuous decisions. Computational experiments demonstrate that the proposed approach consistently outperforms benchmark models in terms of cost efficiency and adaptability under demand uncertainty. Furthermore, sensitivity analyses provide managerial insights for practitioners managing supply chains with HDSs.

电子商务的快速发展导致了“暗店”的出现，传统的实体店被改造成微型履行中心，以满足在线需求。最近，越来越多的零售商采用了混合暗店（hds），它同时作为实体零售店和履行中心运营，从而实现了灵活的空间分配和内部库存转移。虽然这种双重功能提供了更大的操作灵活性，但它也给供应链操作带来了显著的复杂性，特别是在需求不确定的情况下。为了应对这一挑战，我们提出了一种针对hds的供应链规划的两阶段稳健优化方法。在第一阶段，一个面向目标的鲁棒优化框架确定二进制生产和空间分配决策。在第二阶段，对剩余的连续决策采取自适应追索行动。计算实验表明，该方法在成本效率和需求不确定性下的适应性方面始终优于基准模型。此外，敏感性分析为管理hds供应链的从业者提供了管理见解。

{"title":"Two-stage robust optimization approach for integrated supply chain planning with hybrid-dark stores","authors":"Youngchul Shin , Younsoo Lee","doi":"10.1016/j.omega.2025.103479","DOIUrl":"10.1016/j.omega.2025.103479","url":null,"abstract":"<div><div>The rapid growth of e-commerce has led to the emergence of dark stores, where traditional brick-and-mortar stores are repurposed into micro-fulfillment centers to meet online demand. Recently, a growing number of retailers have adopted hybrid-dark stores (HDSs), which operate simultaneously as physical retail outlets and fulfillment centers, enabling flexible space allocation and internal inventory transfers across both areas. While this dual functionality offers greater operational agility, it also introduces significant complexity into supply chain operations, particularly under demand uncertainty. To address this challenge, we propose a two-stage robust optimization approach for supply chain planning with HDSs. In the first stage, a target-oriented robust optimization framework determines binary production and space allocation decisions. In the second stage, adaptive recourse actions are taken for the remaining continuous decisions. Computational experiments demonstrate that the proposed approach consistently outperforms benchmark models in terms of cost efficiency and adaptability under demand uncertainty. Furthermore, sensitivity analyses provide managerial insights for practitioners managing supply chains with HDSs.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"140 ","pages":"Article 103479"},"PeriodicalIF":7.2,"publicationDate":"2025-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145681766","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区管理学 Q1 MANAGEMENT

Omega-international Journal of Management Science

Pub Date : 2025-11-25 DOI: 10.1016/j.omega.2025.103478

Simona Mancini , Margaretha Gansterer

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.

物流供应商使用自动包裹储物柜，以提高最后一英里交付业务的效率，特别是在城市地区。我们考虑一个公司的情况，该公司经营储物柜并动态接收必须立即接受或拒绝的交付订单。在第二个决策阶段，已接受的订单集已分配给储物柜，以便满足客户兼容性要求和最大完成时间。由于未来的订单到达和客户提货时间都是未知的，因此公司面临着一个动态随机问题。为了生成解决方案，我们提出了一个基于分类方法的决策框架。分类器使用混合整数模型从确定性设置中的最优解中学习，并在动态随机过程中利用此信息。我们在广泛的计算研究中评估所提出的方法，其中人工实例和真实世界的案例都得到了解决。得到的结果表明，基于分类的框架优于所有基准方法，包括(i)场景采样，（ii）经典决策树和（iii）几个确定性策略。关于决策过程中最重要的系统特征的管理见解得到了推导。新提出的决策框架具有一定的泛化性，可以应用于相关的动态随机匹配问题。

{"title":"Dynamic stochastic parcel locker assignment with uncertain pick-up times","authors":"Simona Mancini , 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":"2025-11-25","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

A branch-and-price approach for computing the minimum number of pairwise comparisons in multicriteria selection based on convex cones 基于凸锥的多准则选择中两两比较最小次数计算的分支-价格方法

IF 7.2 2区管理学 Q1 MANAGEMENT

Omega-international Journal of Management Science

Pub Date : 2025-11-24 DOI: 10.1016/j.omega.2025.103481

Özgür Özpeynirci , Selin Özpeynirci

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.

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.

我们研究了多标准选择问题（MCSP），其目的是在一组已知的备选方案中识别出最受欢迎的备选方案。虽然已经开发了几种用于MCSP的方法，这些方法利用两两比较，但仍然不知道这些方法与理论所需的两两比较的最小数量有多接近。为了解决这一差距，我们提出了一个计算框架，该框架在假设DM的值函数已知的情况下确定所需两两比较次数的理论下界。尽管这个假设对于现实世界的决策支持来说是不现实的，但它对于建立一个严格的性能标准是必要的，根据这个标准可以对算法进行评估。虽然这个框架为交互式算法的基准测试提供了基础，但它的适用性仅限于利用凸锥的两两比较过程。该基准被表述为一个大规模整数规划问题，并通过分支-价格方法解决，其中列生成用于仅生成最有希望的凸锥。我们进一步扩展了模型，加入了传递性，这可以减少比较的次数，但增加了计算量。在不同的问题实例中进行了广泛的计算实验。除了提供基准值之外，结果还揭示了结构模式，例如当最优解决方案主要依赖于2点或3点锥时，以及当需要更高级别的锥时。这些见解不仅加强了基准的理论参考作用，而且为设计更高效的MCSP算法提供了实践指导。

{"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 , 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":"2025-11-24","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

Cooperation between competing digital content platforms: Open access for content sharing 相互竞争的数字内容平台之间的合作：内容共享的开放访问

IF 7.2 2区管理学 Q1 MANAGEMENT

Omega-international Journal of Management Science

Pub Date : 2025-11-24 DOI: 10.1016/j.omega.2025.103480

Wenshuo Zhang , Minqiang Li , Haiyang Feng , Nan Feng

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.

数字内容平台（dcp）对内容的持续投资加剧了对独家内容的竞争，而在日益饱和的市场中，用户基础增长放缓。在此背景下，通过开放内容获取进行合作已成为数字内容提供商维持进一步增长的一项切实可行的战略。具体来说，DCP（例如HBO Max）可能会通过竞争对手的平台（例如Amazon Prime Video）提供基于订阅的独家内容访问，以吸引其重点用户。该策略通过为使用其他开放访问DCP的高需求用户提供价格折扣和降低访问成本来促进用户多归巢。为了研究两个竞争的DCP的合作动机，我们开发了一个博弈论模型，该模型捕捉了每个DCP关于开放内容访问的战略决策，以及在开放内容访问下吸引高需求用户的折扣策略和确保独家内容创作者的内容策略。该模型明确地结合了双边市场中订阅者和内容方之间的战略互动，考虑了创作者和订阅者双方的网络效应。研究发现，随着双方网络效应的增强，均衡结果在不同合作情况下发生变化，单向合作（只有一个DCP的独家内容可以在另一个DCP上获得）取代双向合作（每个DCP的独家内容可以在另一个DCP上获得）成为均衡。在内容访问成本相对较低的情况下，dcp之间对内容创作者的竞争加剧，也会出现类似的转变。相反，当内容访问成本较高时，双向合作作为均衡仍然存在。在非对称DCP场景下，当DCP焦点用户群之间的差距较窄且竞争强度较高时，出现两种单向合作均衡，即较大的DCP或较小的DCP作为开放接入平台。在比较这两种情况时，较大的DCP优先考虑设定较高内容价格的内容策略，而较小的DCP则侧重于提供较高折扣率的折扣策略。

{"title":"Cooperation between competing digital content platforms: Open access for content sharing","authors":"Wenshuo Zhang , Minqiang Li , Haiyang Feng , 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":"2025-11-24","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

IF 7.2 2区管理学 Q1 MANAGEMENT

Omega-international Journal of Management Science

Pub Date : 2025-11-19 DOI: 10.1016/j.omega.2025.103475

Yishan Han , Biao Xu , Yao Wang , Shanxing Gao

Top-

K

recommendation involves inferring latent user preferences and generating personalized recommendations accordingly, which is now ubiquitous in various decision systems. Nonetheless, recommender systems usually suffer from severe popularity bias, leading to the over-recommendation of popular items. Such a bias deviates from the central aim of reflecting user preference faithfully, compromising both customer satisfaction and retailer profits. Despite the prevalence, existing methods tackling popularity bias still have limitations due to the considerable accuracy-debias tradeoff and the sensitivity to extensive parameter selection, further exacerbated by the extreme sparsity in positive user-item interactions.

In this paper, we present a Popularity-aware top-

K

recommendation algorithm integrating multi-behavior Side Information (PopSI), aiming to enhance recommendation accuracy and debias performance simultaneously. Specifically, by leveraging multiple user feedback that mirrors similar user preferences and formulating it as a three-dimensional tensor, PopSI can utilize all slices to capture the desiring user preferences effectively. Subsequently, we introduced a novel orthogonality constraint to refine the estimated item feature space, enforcing it to be invariant to item popularity features thereby addressing our model’s sensitivity to popularity bias. Comprehensive experiments on real-world e-commerce datasets demonstrate the general improvements of PopSI over state-of-the-art debias methods with a marginal accuracy-debias tradeoff and scalability to practical applications.

Top-K推荐涉及推断潜在的用户偏好并相应地生成个性化推荐，这在各种决策系统中普遍存在。尽管如此，推荐系统通常会遭受严重的流行偏见，导致过度推荐热门产品。这种偏差偏离了忠实反映用户偏好的中心目标，损害了顾客满意度和零售商利润。尽管流行，现有的解决流行偏差的方法仍然有局限性，由于相当大的准确性-偏差权衡和对广泛参数选择的敏感性，进一步加剧了积极用户-项目交互的极端稀疏性。本文提出了一种融合多行为侧信息（PopSI）的人气感知top-K推荐算法，旨在同时提高推荐精度和推荐性能。具体来说，通过利用反映类似用户偏好的多个用户反馈，并将其形成三维张量，PopSI可以利用所有切片来有效地捕获期望的用户偏好。随后，我们引入了一种新的正交性约束来改进估计的物品特征空间，使其对物品流行度特征不变，从而解决了我们的模型对流行度偏差的敏感性。在真实世界的电子商务数据集上进行的综合实验表明，PopSI比最先进的debias方法有了总体改进，并在边际精度-debias权衡和实际应用的可扩展性方面进行了改进。

{"title":"Towards popularity-aware recommendation: A multi-behavior enhanced framework with orthogonality constraint","authors":"Yishan Han , Biao Xu , Yao Wang , Shanxing Gao","doi":"10.1016/j.omega.2025.103475","DOIUrl":"10.1016/j.omega.2025.103475","url":null,"abstract":"<div><div>Top-<span><math><mi>K</mi></math></span> recommendation involves inferring latent user preferences and generating personalized recommendations accordingly, which is now ubiquitous in various decision systems. Nonetheless, recommender systems usually suffer from severe <em>popularity bias</em>, leading to the over-recommendation of popular items. Such a bias deviates from the central aim of reflecting user preference faithfully, compromising both customer satisfaction and retailer profits. Despite the prevalence, existing methods tackling popularity bias still have limitations due to the considerable accuracy-debias tradeoff and the sensitivity to extensive parameter selection, further exacerbated by the extreme sparsity in positive user-item interactions.</div><div>In this paper, we present a <strong>Pop</strong>ularity-aware top-<span><math><mi>K</mi></math></span> recommendation algorithm integrating multi-behavior <strong>S</strong>ide <strong>I</strong>nformation (PopSI), aiming to enhance recommendation accuracy and debias performance simultaneously. Specifically, by leveraging multiple user feedback that mirrors similar user preferences and formulating it as a three-dimensional tensor, PopSI can utilize all slices to capture the desiring user preferences effectively. Subsequently, we introduced a novel orthogonality constraint to refine the estimated item feature space, enforcing it to be invariant to item popularity features thereby addressing our model’s sensitivity to popularity bias. Comprehensive experiments on real-world e-commerce datasets demonstrate the general improvements of PopSI over state-of-the-art debias methods with a marginal accuracy-debias tradeoff and scalability to practical applications.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"140 ","pages":"Article 103475"},"PeriodicalIF":7.2,"publicationDate":"2025-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145571183","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区管理学 Q1 MANAGEMENT

Omega-international Journal of Management Science

Pub Date : 2025-11-17 DOI: 10.1016/j.omega.2025.103467

Wei Pu , Xiangbin Yan , Shuang Ma

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.

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.

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.

长期的中断会引发整个供应链的连锁反应，影响上游和下游的利益相关者。为了减轻这种双向连锁反应的后果，包括财务损失、消费者不满和供应链绩效下降，需要一个有效的优化框架，通过整合敏捷性、弹性和可持续性来提高供应链的可行性（SCV）。为了增强供应链网络的适应能力和长期生存能力，我们提出了一个基于适应策略的优化框架。这些适应策略包括利用第三方物流（3PL）和实施自我修复机制。然后，我们开发了一个包含这些策略的两阶段多周期随机规划模型。该模型通过整合动态中断的正向和反向传播来明确捕获双向涟漪效应。此外，针对两阶段多周期随机规划问题，提出了一种先进的多目标粒子群优化（AMOPSO）方法。利用2019冠状病毒病期间中国小家电行业的实际数据，我们证明了所提出的优化模型在增强SCV和减轻双向连锁反应方面的适用性，以及所开发的AMOPSO解决方法的效率和鲁棒性。优化结果表明，敏捷性提高3.22%，弹性提高17.03%，可持续性提高23.02%。因此，本文提出的优化框架可以提高供应链在双向连锁效应下的生存能力。该框架与已建立的基于自适应策略的随机优化模型和AMOPSO求解方法一起，为供应链生存力优化提供了一种新的途径，为双向连锁效应下的原始设备制造商（oem）提供了实用的决策支持方法。

{"title":"Adaptation strategies-based supply chain viability optimization under bidirectional ripple effects","authors":"Wei Pu , Xiangbin Yan , 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":"2025-11-17","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

A communication on the paper “An alternative weight sensitivity analysis for PROMETHEE II rankings” 关于论文“PROMETHEE II排名的另一种权重敏感性分析”的交流

IF 7.2 2区管理学 Q1 MANAGEMENT

Omega-international Journal of Management Science

Pub Date : 2025-11-16 DOI: 10.1016/j.omega.2025.103465

Evangelos Triantaphyllou , Richard O’Shea , Yves De Smet , Nguyen Anh Vu Doan

This short communication examines the description of a mixed integer programming approach first in traduced by Doan and De Smet [Doan, N.A.V. and De Smet, Y., 2018. An alternative weight sensitivity analysis for PROMETHEE II rankings. Omega, 80, 166–174] for performing a sensitivity analysis on criteria weights under an additive aggregation step. This work has already attracted considerable interest in the scientific community. However, the original MILP model suffers from some descriptive issues. In the present short communication these issues are identified and then rectified. The corrected MILP model is then extended to make it more versatile than the original one. It is also shown how it can become an integral part of an intelligent approach to multiple criteria decision analysis (MCDA) and thus become a valuable tool for decision making.

本文探讨了Doan和De Smet首次提出的混合整数规划方法的描述[Doan， N.A.V.和De Smet， Y., 2018]。PROMETHEE II排名的另一种权重敏感性分析。Omega, 80,166 - 174]用于在加性聚合步骤下对标准权重进行敏感性分析。这项工作已经引起了科学界相当大的兴趣。然而，原始的MILP模型存在一些描述性问题。在本简短的通讯中，查明了这些问题，然后加以纠正。然后对修正后的MILP模型进行扩展，使其比原始模型更通用。它还显示了它如何成为多标准决策分析（MCDA）的智能方法的一个组成部分，从而成为决策制定的有价值的工具。

引用次数: 0