European Journal of Operational Research最新文献

筛选
英文 中文
E-retailer’s Secondhand Product Market Entry and Manufacturer’s Rebate Decisions Considering Fairness Concerns 考虑公平问题的电子零售商二手产品市场准入与制造商返利决策
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-07-16 DOI: 10.1016/j.ejor.2025.07.018
Yuanyuan Ji, Ruozhen Qiu, Shoufeng Ji, Minghe Sun, Zhiping Fan
{"title":"E-retailer’s Secondhand Product Market Entry and Manufacturer’s Rebate Decisions Considering Fairness Concerns","authors":"Yuanyuan Ji, Ruozhen Qiu, Shoufeng Ji, Minghe Sun, Zhiping Fan","doi":"10.1016/j.ejor.2025.07.018","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.07.018","url":null,"abstract":"With the prosperity of the online secondhand product transactions, e-retailers are entering the secondhand product market to meet consumers’ demands. Facing competition from the secondhand products, manufacturers use rebates to enhance the competitiveness the new products. This work explores the implications of the manufacturer’s rebate on a supply chain comprising of a manufacturer and an e-retailer where both of them have distributional fairness concerns and the e-retailer makes decision to enter the secondhand product market. Four Stackelberg game models are formulated when the supply chain members are fairness-neutral and fairness-minded and when the e-retailer enters and does not enter the secondhand product market. The equilibrium results of these Stackelberg game models are obtained through backward induction, and the impacts of the important parameters on the equilibrium results are examined through theoretical analyses. Numerical experiments are conducted to verify the theoretical results, and sensitivity analyses are performed to confirm the impacts of the important parameters on the equilibrium results. Some important findings are obtained. First, the manufacturer’s rebate mitigates the impacts of the e-retailer’s secondhand product market entry. The e-retailer will enter the secondhand product market only when consumers are not very sensitive to the manufacturer’s rebate. Second, with the manufacturer’s rebate, the supply chain members’ fairness concerns reduce the barriers for the e-retailer to enter the secondhand product market. Third, an appropriate rebate value benefits both supply chain members by increasing their profits. Finally, a high consumers’ rebate sensitivity reduces the supply chain members’ profits when they are fairness-minded.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"13 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144664800","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
Scheduling mixed batch machines with inclusive processing set restrictions and non-identical capacities 具有包含加工集限制和容量不相同的混合批处理机的调度
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-07-15 DOI: 10.1016/j.ejor.2025.07.012
Jinwen Ou, Weidong Li
{"title":"Scheduling mixed batch machines with inclusive processing set restrictions and non-identical capacities","authors":"Jinwen Ou, Weidong Li","doi":"10.1016/j.ejor.2025.07.012","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.07.012","url":null,"abstract":"A new batch scheduling problem, name mixed batch scheduling problem, is received attentions recently. In a mixed batch scheduling model, the processing time of a job batch <mml:math altimg=\"si1.svg\" display=\"inline\"><mml:mi>H</mml:mi></mml:math> is defined as <mml:math altimg=\"si2.svg\" display=\"inline\"><mml:mrow><mml:mi>α</mml:mi><mml:msub><mml:mrow><mml:mo>max</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>∈</mml:mo><mml:mi>H</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>}</mml:mo></mml:mrow><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:mi>α</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mo>∑</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>∈</mml:mo><mml:mi>H</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>, where <mml:math altimg=\"si3.svg\" display=\"inline\"><mml:mrow><mml:mi>α</mml:mi><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">∈</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>]</mml:mo></mml:mrow></mml:mrow></mml:math> is a constant. In other words, the processing time of a job batch is the weighted sum of the maximum processing time and the total processing time of jobs in the batch. In this paper, we study the problem of scheduling mixed batch machines with non-identical capacities under inclusive processing set restrictions, where the objective is to minimize the makespan of finishing all the jobs. We present a fast approximation algorithm with a performance ratio of <mml:math altimg=\"si4.svg\" display=\"inline\"><mml:mrow><mml:mn>4</mml:mn><mml:mo>/</mml:mo><mml:mn>3</mml:mn><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">+</mml:mo><mml:mi>α</mml:mi></mml:mrow></mml:math> for the problem, which improves up the existing performance bounds in the literature. By providing a technical lemma, we are able to develop the first polynomial time approximation scheme (PTAS) for the problem. We also design linear-time approximation schemes for two important special cases of the problem.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"109 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144664720","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
Enhancing transportation service management with bi-level optimization: Competitive pricing and hub location 通过双层优化:具有竞争力的价格和枢纽位置,加强运输服务管理
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-07-15 DOI: 10.1016/j.ejor.2025.07.033
Seyed Parsa Parvasi, MirMohammad Musavi, Seyed Ali Torabi, Wei Yim Yap, Jasmine Siu Lee Lam
{"title":"Enhancing transportation service management with bi-level optimization: Competitive pricing and hub location","authors":"Seyed Parsa Parvasi, MirMohammad Musavi, Seyed Ali Torabi, Wei Yim Yap, Jasmine Siu Lee Lam","doi":"10.1016/j.ejor.2025.07.033","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.07.033","url":null,"abstract":"This paper highlights the importance of efficient service network design through hub management in reducing transportation costs and offering competitive service prices. For this, it addresses the problem of how a new entrant in the transportation market can design its hub network and set competitive prices. Meanwhile, the incumbent can react to new market conditions by revising its service prices. We develop a new bi-level mathematical model within a Stackelberg game competition framework. Using logit model, we examine customer preferences. A novel decomposition-based solution technique is proposed which transforms the original model into a tri-level structure by separating the hub location and pricing decisions for the entrant. The Lambert-W function is employed to reduce this tri-level problem to a new bi-level format, which effectively splits the hub location and pricing tasks. Additionally, we implement a new hybrid hyper-heuristic and a modified learning-based tabu search meta-heuristic method for pricing and hub location, respectively. The results show that fewer hubs from the incumbent increase the entrant's competitive advantage, allowing it to improve market share and profit by strategically differentiating its network. Also, the difference in discount rates between the hubs of the two competitors is an important factor in shaping their competitive advantage in capturing market share. This advantage becomes more significant as customer sensitivity to service price increases.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"210 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144664796","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
Decision space dynamic niching-based method for constrained multiobjective evolutionary optimization 基于决策空间动态生态位的约束多目标进化优化方法
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-07-15 DOI: 10.1016/j.ejor.2025.07.002
Fan Yu, Qun Chen, Jinlong Zhou
{"title":"Decision space dynamic niching-based method for constrained multiobjective evolutionary optimization","authors":"Fan Yu, Qun Chen, Jinlong Zhou","doi":"10.1016/j.ejor.2025.07.002","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.07.002","url":null,"abstract":"Finding a set with a good approximation to the Pareto-optimal solutions in the multiobjective optimization problem (MOP) is a challenging task in terms of convergence toward and diversity across the Pareto optimal front (PoF). In some cases, solving MOPs requires satisfying certain constraints, which significantly increases the complexity of the problem. Such problems are constrained multiobjective optimization problems (CMOPs) and pose considerable computational challenges. Many constrained multiobjective evolutionary algorithms (CMOEAs) face challenges in avoiding becoming trapped in local optima, which impacts convergence, and offer solutions that lack good coverage of the PoF, implying weak diversity. All these nonoptimal or partially optimal solutions in the objective space are essentially clustered in local optimality dilemmas in the decision space. To better eliminate the convergence and diversity challenges caused by clustered solutions, this paper proposes a decision space dynamic niching-based (DSDN) method to better address CMOPs. Specifically, the DSDN method adds a dynamic decision space niche as an additional criterion to the traditional Pareto-constrained dominance principle (Pareto-CDP). The better preserved solutions must satisfy the Pareto-CDP and the condition within the niche radius of other solutions, which strictly meets the original dominance relationship requirement while relaxing the nondominance threshold. As a result, the dynamic adjustment of the niche radius (<mml:math altimg=\"si161.svg\" display=\"inline\"><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi></mml:mrow></mml:msub></mml:math>) effectively balances the exploitation and exploration of solutions in the decision space while enhancing both convergence and diversity in the objective space. Experiments conducted on four widely recognized test suites and three real-world case studies have demonstrated that the DSDN method yields significantly better results than the original Pareto-CDP algorithms. Furthermore, the proposed approach is competitive with or comparable to seven other state-of-the-art CMOEAs.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"13 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144664797","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
Entrepreneurs’ optimal decisions in equity crowdfunding campaigns 股权众筹活动中企业家的最优决策
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-07-15 DOI: 10.1016/j.ejor.2025.07.004
Hana Tzur, Ella Segev
{"title":"Entrepreneurs’ optimal decisions in equity crowdfunding campaigns","authors":"Hana Tzur, Ella Segev","doi":"10.1016/j.ejor.2025.07.004","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.07.004","url":null,"abstract":"Equity crowdfunding is a method of financing an initiative whereby an entrepreneur sells shares in her firm to a group of people (the crowd) on a dedicated platform. Understanding the forces that shape the behavior of both buyers in the crowd and entrepreneurs in equity crowdfunding platforms can help design more efficient platforms and increase the welfare of all participants. We therefore develop a common value sequential crowdfunding game-theoretic model, where the entrepreneur sells a percentage of her firm in order to raise money for its establishment and then shares the future value of the firm with the crowd. Buyers on the platform who visit the campaign decide whether or not to invest in it. Each buyer’s decision depends on the amount that has already been invested before him and on his own knowledge about the firm and the market in which it operates (which we model as a noisy signal that he obtains regarding the true value of the firm). By offering a different percentage in the firm, the entrepreneur leads the crowd to a different equilibrium. We characterize these equilibria and then analyze the entrepreneur’s decision. We show that the entrepreneur’s optimal percentage she offers for sale is non monotonic in the ex-ante probability of success. This is in-line with recent empirical findings. We further show that when buyers’ signals are very noisy, the entrepreneur may prefer buyers that have a less accurate signal regarding the true value of the firm over buyers with a more accurate signal.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"13 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144664702","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
Generator sets for the Minkowski sum problem 发电机组的Minkowski和问题
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-07-15 DOI: 10.1016/j.ejor.2025.07.005
Mark Lyngesen, Sune Lauth Gadegaard, Lars Relund Nielsen
{"title":"Generator sets for the Minkowski sum problem","authors":"Mark Lyngesen, Sune Lauth Gadegaard, Lars Relund Nielsen","doi":"10.1016/j.ejor.2025.07.005","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.07.005","url":null,"abstract":"This paper develops a new theoretical framework for <ce:italic>generator sets</ce:italic> in the context of Minkowski Sum Problems (MSPs) arising in multi-objective optimization. In MSPs, the nondominated set of the global problem equals the nondominated set of the Minkowski sum of several local nondominated sets. We introduce the concept of generator sets: subsets of local nondominated vectors that are sufficient to construct the global nondominated set. We present novel theoretical results that characterize conditions for vectors to belong to a generator set or to be redundant. Moreover, we develop algorithms for finding generator sets and identifying redundant local vectors. Finally, we conduct extensive numerical experiments to test the impact of varying characteristics of the instances on the resulting global nondominated set and the number of redundant vectors.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"47 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144664795","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 impact of collaboration on sustainability and profit in the fashion rental supply chain 合作对时装租赁供应链可持续性和利润的影响
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-07-15 DOI: 10.1016/j.ejor.2025.07.001
Jack A.A. van der Veen, Taher Ahmadi, Bo van der Rhee, V. Venugopal
{"title":"The impact of collaboration on sustainability and profit in the fashion rental supply chain","authors":"Jack A.A. van der Veen, Taher Ahmadi, Bo van der Rhee, V. Venugopal","doi":"10.1016/j.ejor.2025.07.001","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.07.001","url":null,"abstract":"The global fashion industry is under increased scrutiny for its environmental and social impacts and therefore compelled to innovate towards more sustainable models. Some of the more notable initiatives are moving from a traditional consumer-ownership-based model to a consumer-use-based model and collaborating with key supply chain stakeholders to achieve higher levels of sustainability. Though collaboration is perceived to be an enabler and is vital for sustainable development, many collaborative efforts have failed because the effects of collaboration on sustainability and the associated trade-offs remain unclear. This paper aims to contribute to this context by clarifying the effects of collaboration levels on the degree of sustainability practices for producing fashion items. Specifically, we investigate a two-echelon fashion supply chain, comprising a supplier and a fashion rental retailer through analytical modeling. The supplier decides on the sustainability level and the selling price to the retailer, while the retailer decides on the order quantity. Given the rising demand for environmentally friendly products, consumer demand for renting fashion items is assumed to increase with the degree of sustainability practices adopted. The findings show that a higher level of collaboration enhances overall sustainability and at the same time improves profitability. Furthermore, the research demonstrates that a higher level of collaboration can mitigate the negative effect on profitability resulting from the need to adhere to minimum sustainability thresholds, possibly mandated by regulators. Based on the findings, actionable insights for practitioners, policymakers, and regulators are outlined.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"31 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144664767","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
Robot-aided electric vehicle routing problem with lockers and prime customers prioritization 机器人辅助电动车路径问题与储物柜和主要客户优先排序
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-07-14 DOI: 10.1016/j.ejor.2025.07.007
Nima Moradi, Fereshteh Mafakheri, Chun Wang, Roberto Baldacci
{"title":"Robot-aided electric vehicle routing problem with lockers and prime customers prioritization","authors":"Nima Moradi, Fereshteh Mafakheri, Chun Wang, Roberto Baldacci","doi":"10.1016/j.ejor.2025.07.007","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.07.007","url":null,"abstract":"Satisfactory and fast customer service is one of the critical parts of last-mile delivery. Companies like Amazon prioritize Prime members with same-day delivery while offering lockers for customer convenience. Additionally, robot-aided Electric Vehicle (EV) delivery is recognized for its cost efficiency and fast service in densely populated areas. Integrating EVs, delivery robots, and lockers, and prioritizing Prime customers can improve efficiency and service responsiveness. This integrated approach offers home delivery by EVs and robots and self-pickup from lockers. Every customer is assigned a prize (profit), with a higher profit associated with the Prime membership. Each EV dispatches robots, with a “dispatch-wait-collect” tactic, to serve the customers, while some customers are allocated to the lockers. This study introduces the Robot-Aided Electric Vehicle Routing Problem with Lockers and Prime Customer Prioritization (REVRP-LPCP), which aims to determine the least-cost routes for EVs and robots, assign customers to lockers, and prioritize prime customers by serving them within a single-period planning horizon. The REVRP-LPCP is formulated using a mixed-integer linear programming model, improving the EV-only-based delivery system by 52.94% and 21.95% in EV route and utilization costs on average. A metaheuristic is introduced, incorporating problem-specific repair and improvement operators to efficiently address large instances of the problem, outperforming Gurobi in 36 large instances by an average of 2.79% in terms of solution quality. Also, our method has identified 44 new best solutions in the related benchmarks. A comprehensive sensitivity analysis is conducted, assessing various scenarios and providing managerial insights.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"73 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144664798","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
Indiscriminate disruption of conditional inference on multivariate Gaussians 多变量高斯函数条件推理的无差别中断
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-07-12 DOI: 10.1016/j.ejor.2025.06.011
William N. Caballero, Matthew LaRosa, Alexander A. Fisher, Vahid Tarokh
{"title":"Indiscriminate disruption of conditional inference on multivariate Gaussians","authors":"William N. Caballero, Matthew LaRosa, Alexander A. Fisher, Vahid Tarokh","doi":"10.1016/j.ejor.2025.06.011","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.06.011","url":null,"abstract":"The multivariate Gaussian distribution underpins myriad operations-research, decision-analytic, and machine-learning models (e.g., Bayesian optimization, Gaussian influence diagrams, and variational autoencoders). However, despite recent advances in adversarial machine learning (AML), inference for Gaussian models in the presence of an adversary is notably understudied. Therefore, we consider a self-interested attacker who wishes to disrupt a decisionmaker’s conditional inference and subsequent actions by corrupting a set of evidentiary variables. To avoid detection, the attacker also desires the attack to appear plausible wherein plausibility is determined by the density of the corrupted evidence. We consider white- and grey-box settings such that the attacker has complete and incomplete knowledge about the decisionmaker’s underlying multivariate Gaussian distribution, respectively. Select instances are shown to reduce to quadratic and stochastic quadratic programs, and structural properties are derived to inform solution methods. We assess the impact and efficacy of these attacks in three examples, including, a real estate evaluation application, an interest rate prediction task, and the use of linear Gaussian state space models. Each example leverages an alternative underlying model, thereby highlighting the attacks’ broad applicability. Through these applications, we also juxtapose the behavior of the white- and grey-box attacks to understand how uncertainty and structure affect attacker behavior.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"37 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144613304","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 Development Strategy of Supply Chain Intelligent Technology Considering Technology Development Uncertainty 考虑技术发展不确定性的供应链智能技术发展策略
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-07-12 DOI: 10.1016/j.ejor.2025.07.026
Peng Han, Yanfang Huo, Weihua Liu, Ershi Qi, Helen Cai
{"title":"The Development Strategy of Supply Chain Intelligent Technology Considering Technology Development Uncertainty","authors":"Peng Han, Yanfang Huo, Weihua Liu, Ershi Qi, Helen Cai","doi":"10.1016/j.ejor.2025.07.026","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.07.026","url":null,"abstract":"It’s crucial for both manufacturing and logistics industries to improve logistics efficiency and reduce logistics loss during transportation, storage, and other processes through the development and application of intelligent technology. By focusing on three potential modes of intelligent technology development cooperation between a manufacturer and its logistics provider, we examine the impact of such collaboration on reducing Logistics loss, as well as explore the optimal mode of cooperation for both firms. Our analytical results indicate that compared to independent technology development, collaborative development of intelligent technology can mitigate the adverse effects of double-marginalization. Comparing the three modes of cooperation, we find that higher development cost can incentivize the collaboration between two firms, while higher integration cost and price elasticity may make the cost sharing mode preferable. It is noteworthy that the uncertainty of intelligent technology development exerts a significant moderating effect on the choice of cooperation mode. Heightened technology development uncertainty tends to incentivize both firms to pursue joint development in order to alleviate the negative impact of the uncertainty.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"9 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144613305","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学术官方微信