Transportation Research Part E-Logistics and Transportation Review最新文献_第5页

Is it necessary for the supply chain to implement artificial intelligence-driven sales services at both the front-end and back-end stages? 供应链是否有必要在前端和后端阶段实施人工智能驱动的销售服务？

IF 8.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part E-Logistics and Transportation Review

Pub Date : 2025-02-01 DOI: 10.1016/j.tre.2024.103923

Yuyan Wang , Junhong Gao , T.C.E. Cheng , Mingzhou Jin , Xiaohang Yue , Huajie Wang

This paper explores the application of artificial intelligence (AI) in supply chain management, focusing on its impact on service models at both the front and back ends of the supply chain (SC). We employ a Stackelberg game model to construct an SC system consisting of a single manufacturer and a single retailer, aiming to assess the impact of AI on SC performance and explore strategic selection considerations within this framework. Our findings are as follows: (1) AI implementation generally leads to lower product pricing, but its effect on market demand follows a nonlinear pattern. In particular, when the manufacturer integrates AI, the simultaneous use of AI by the retailer will not change the wholesale price but will lead to a decrease in the retail price and market demand. (2) In situations where the back-end cost efficiency is sufficiently high, the optimal choice for both the manufacturer and retailer might be to refrain from adopting AI. Conversely, adopting AI is preferable when the back-end cost efficiency is sufficiently low. Furthermore, when the back-end cost efficiency is moderate, the manufacturer benefits from adopting AI, but the retailer’s profit suffers. (3) Regardless of whether the manufacturer adopts AI, the retailer’s most prudent option is not to implement AI.

本文探讨了人工智能（AI）在供应链管理中的应用，重点关注其对供应链（SC）前端和后端服务模式的影响。我们采用斯塔克尔伯格博弈模型构建了一个由单一制造商和单一零售商组成的供应链系统，旨在评估人工智能对供应链绩效的影响，并在此框架内探讨战略选择方面的考虑因素。我们的研究结果如下(1) 人工智能的实施通常会降低产品定价，但其对市场需求的影响呈现非线性模式。特别是，当制造商集成人工智能时，零售商同时使用人工智能不会改变批发价格，但会导致零售价格和市场需求下降。(2) 在后端成本效率足够高的情况下，制造商和零售商的最优选择可能是不采用人工智能。反之，当后端成本效率足够低时，最好采用人工智能。此外，当后端成本效率适中时，制造商会从采用人工智能中获益，但零售商的利润会受损。(3) 无论制造商是否采用人工智能，零售商最谨慎的选择是不采用人工智能。

{"title":"Is it necessary for the supply chain to implement artificial intelligence-driven sales services at both the front-end and back-end stages?","authors":"Yuyan Wang , Junhong Gao , T.C.E. Cheng , Mingzhou Jin , Xiaohang Yue , Huajie Wang","doi":"10.1016/j.tre.2024.103923","DOIUrl":"10.1016/j.tre.2024.103923","url":null,"abstract":"<div><div>This paper explores the application of artificial intelligence (AI) in supply chain management, focusing on its impact on service models at both the front and back ends of the supply chain (SC). We employ a Stackelberg game model to construct an SC system consisting of a single manufacturer and a single retailer, aiming to assess the impact of AI on SC performance and explore strategic selection considerations within this framework. Our findings are as follows: (1) AI implementation generally leads to lower product pricing, but its effect on market demand follows a nonlinear pattern. In particular, when the manufacturer integrates AI, the simultaneous use of AI by the retailer will not change the wholesale price but will lead to a decrease in the retail price and market demand. (2) In situations where the back-end cost efficiency is sufficiently high, the optimal choice for both the manufacturer and retailer might be to refrain from adopting AI. Conversely, adopting AI is preferable when the back-end cost efficiency is sufficiently low. Furthermore, when the back-end cost efficiency is moderate, the manufacturer benefits from adopting AI, but the retailer’s profit suffers. (3) Regardless of whether the manufacturer adopts AI, the retailer’s most prudent option is not to implement AI.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"194 ","pages":"Article 103923"},"PeriodicalIF":8.3,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142867655","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

The electric vehicle dial-a-ride problem: Integrating ride-sharing and time-of-use electricity pricing 电动汽车叫车问题：整合乘车共享和分时电价

IF 8.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part E-Logistics and Transportation Review

Pub Date : 2025-02-01 DOI: 10.1016/j.tre.2024.103946

Huichang Dong , Zhixing Luo , Nan Huang , Hongjian Hu , Hu Qin

This paper investigates The Electric Vehicle Dial-a-Ride Problem: Integrating Ride-Sharing and Time-of-Use Electricity Pricing (DAR-RSTOU), which involves designing a set of minimum-cost routes to service all customers for a fleet of electric vehicles (EVs). The characteristics of the problem include: (1) the use of EVs and consideration of partial charging strategies; (2) a maximum ride time duration limit for each customer; (3) the possibility of ride-sharing among customers; (4) accounting for Time-of-Use (TOU) electricity pricing policies. We propose a novel mixed integer programming model to describe the problem, aiming to minimize the weighted sum of the charging, total travel, and detour penalty costs. Additionally, we have devised a customized adaptive large neighborhood search heuristic with an enhanced feasibility-checking method for rapid solution evaluation and dynamic programming to optimize the charging strategy for the fleet. Computational experiments on adapted benchmark instances from DARP literature and on instances based on real data from electric taxis in Shenzhen assess the validity of the DAR-RSTOU formulation and the heuristic algorithm. Parameter experiments highlight the algorithm’s acceleration strategy effectiveness. Valuable managerial insights are derived from policy-oriented research on different electricity pricing strategies.

本文研究了电动汽车随叫随到问题：整合乘车共享和分时电价（DAR-RSTOU），该问题涉及到为一组电动汽车（ev）设计一组最低成本路线来服务所有客户。该问题的特点包括：(1)电动汽车的使用和部分充电策略的考虑；(2)每位乘客的最大乘车时间限制；(3)客户间共乘的可能性；(4)考虑分时电价政策。我们提出了一种新的混合整数规划模型来描述这个问题，其目的是最小化收费、总行程和绕行惩罚成本的加权和。此外，我们还设计了一种自适应大邻域搜索启发式算法，增强了可行性检查方法，用于快速求解和动态规划，以优化车队的充电策略。采用DARP文献中的自适应基准实例和基于深圳电动出租车实际数据的实例进行计算实验，评估了darr - rstou公式和启发式算法的有效性。参数实验验证了算法加速策略的有效性。从对不同电价策略的政策性研究中获得了有价值的管理见解。

{"title":"The electric vehicle dial-a-ride problem: Integrating ride-sharing and time-of-use electricity pricing","authors":"Huichang Dong , Zhixing Luo , Nan Huang , Hongjian Hu , Hu Qin","doi":"10.1016/j.tre.2024.103946","DOIUrl":"10.1016/j.tre.2024.103946","url":null,"abstract":"<div><div>This paper investigates The Electric Vehicle Dial-a-Ride Problem: Integrating Ride-Sharing and Time-of-Use Electricity Pricing (DAR-RSTOU), which involves designing a set of minimum-cost routes to service all customers for a fleet of electric vehicles (EVs). The characteristics of the problem include: (1) the use of EVs and consideration of partial charging strategies; (2) a maximum ride time duration limit for each customer; (3) the possibility of ride-sharing among customers; (4) accounting for Time-of-Use (TOU) electricity pricing policies. We propose a novel mixed integer programming model to describe the problem, aiming to minimize the weighted sum of the charging, total travel, and detour penalty costs. Additionally, we have devised a customized adaptive large neighborhood search heuristic with an enhanced feasibility-checking method for rapid solution evaluation and dynamic programming to optimize the charging strategy for the fleet. Computational experiments on adapted benchmark instances from DARP literature and on instances based on real data from electric taxis in Shenzhen assess the validity of the DAR-RSTOU formulation and the heuristic algorithm. Parameter experiments highlight the algorithm’s acceleration strategy effectiveness. Valuable managerial insights are derived from policy-oriented research on different electricity pricing strategies.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"194 ","pages":"Article 103946"},"PeriodicalIF":8.3,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142939723","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Localized package shipment with partial outsourcing: An exact optimization approach for Chinese courier companies 部分外包的本地化包裹运输：中国快递公司的精确优化方法

IF 8.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part E-Logistics and Transportation Review

Pub Date : 2025-02-01 DOI: 10.1016/j.tre.2024.103901

Zhuolin Wang , Rongping Zhu , Jian-Ya Ding , Yu Yang , Keyou You

This work is concerned with the daily package shipment problem that aims to find low-cost paths for a large volume of packages and transportation vehicles over a network of transshipment centers (TCs). For Chinese courier companies, this typically involves tens of thousands of origin–destination (OD) pairs and has to be solved in a limited time window every early morning. Inspired by their industry practices, where most vehicles (99.8% for our industry partner STO) only unload packages after departing from the origin and the shipment volumes can be split, we propose a novel Localized Package Shipment with Partial Outsourcing (LPSPO) model for each TC to individually decide their daily shipment profiles, which aligns with their current operations. Though the number of OD pairs in our localized model is considerably reduced, it is strongly NP-hard and we exploit the model structure to design a column generation-based algorithm, which iteratively identifies profitable paths for the restricted master problem. Then, we develop problem-specific cutting planes and variable bound tightening techniques to accelerate our algorithm. An extensive numerical study validates that our algorithm significantly outperforms CPLEX in solving the LPSPO model. Finally, experiments on realistic instances from a leading Chinese courier company illustrate that the LPSPO model may reduce its transportation costs by up to 10 million USD annually.

这项工作涉及日常包裹运输问题，旨在通过转运中心（tc）网络为大量包裹和运输车辆找到低成本的路径。对于中国的快递公司来说，这通常涉及数万对始发目的地（OD），必须在每天清晨的有限时间内解决。受他们的行业实践的启发，大多数车辆（我们的行业合作伙伴STO为99.8%）在离开原产地后只卸载包裹，并且出货量可以分割，我们提出了一种新颖的局部外包本地化包裹运输（LPSPO）模型，让每个TC单独决定他们的日常运输配置文件，这与他们当前的运营保持一致。虽然我们的局部化模型中的OD对数量大大减少，但它是强np困难的，我们利用模型结构设计了一个基于列生成的算法，该算法迭代地识别受限主问题的有利路径。然后，我们开发了针对特定问题的切割平面和可变边界收紧技术来加速我们的算法。大量的数值研究验证了我们的算法在求解LPSPO模型方面明显优于CPLEX。最后，通过对中国一家领先快递公司的实际案例进行实验，表明LPSPO模型可为其每年节省高达1000万美元的运输成本。

{"title":"Localized package shipment with partial outsourcing: An exact optimization approach for Chinese courier companies","authors":"Zhuolin Wang , Rongping Zhu , Jian-Ya Ding , Yu Yang , Keyou You","doi":"10.1016/j.tre.2024.103901","DOIUrl":"10.1016/j.tre.2024.103901","url":null,"abstract":"<div><div>This work is concerned with the daily package shipment problem that aims to find low-cost paths for a large volume of packages and transportation vehicles over a network of transshipment centers (TCs). For Chinese courier companies, this typically involves tens of thousands of origin–destination (OD) pairs and has to be solved in a limited time window every early morning. Inspired by their industry practices, where most vehicles (99.8% for our industry partner STO) only unload packages after departing from the origin and the shipment volumes can be split, we propose a novel Localized Package Shipment with Partial Outsourcing (LPSPO) model for each TC to individually decide their daily shipment profiles, which aligns with their current operations. Though the number of OD pairs in our localized model is considerably reduced, it is <em>strongly NP-hard</em> and we exploit the model structure to design a column generation-based algorithm, which iteratively identifies profitable paths for the restricted master problem. Then, we develop problem-specific cutting planes and variable bound tightening techniques to accelerate our algorithm. An extensive numerical study validates that our algorithm significantly outperforms CPLEX in solving the LPSPO model. Finally, experiments on realistic instances from a leading Chinese courier company illustrate that the LPSPO model may reduce its transportation costs by up to 10 million USD annually.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"194 ","pages":"Article 103901"},"PeriodicalIF":8.3,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142816528","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Integrated task assignment and path planning for multi-type robots in an intelligent warehouse system 智能仓库系统中多类型机器人的综合任务分配与路径规划

IF 8.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part E-Logistics and Transportation Review

Pub Date : 2025-02-01 DOI: 10.1016/j.tre.2024.103883

Zihan Qiu , Jiancheng Long , Yang Yu , Shukai Chen

This paper considers an intelligent warehouse system (IWS) that requires the seamless cooperation of three types of mobile robots: automated guided vehicles (AGVs), rail-guided vehicles (RGVs), and gantry lifting devices (GLDs). Compared to the conventional system, which comprises AGVs, the IWS is more flexible in addressing with the customized demands of diverse enterprises. This paper proposes an integrated task assignment and path planning problem for multi-type robots (e.g., AGVs, RGVs, and GLDs) in IWS. The cooperative constraints between AGVs and GLDs, RGVs and GLDs, as well as the conflict-free constraints among AGVs, are considered. It is challenging to solve the multi-type robots scheduling problem with the conflict-free constraints of AGVs because these constraints can result in the unfixed task completion time of AGVs and pose computational challenges of the task assignment for AGVs, RGVs, and GLDs. The proposed integrated task assignment and path planning problem for multi-type robots is modeled as a multi-commodity flow problem on a novel state-time–space network and is formulated as an integer linear programming (ILP) model, where the warehouse operator aims to minimize the total completion time of all tasks. We developed a Lagrangian relaxation heuristic with a customized efficient strategy to find feasible solutions. We also solved our proposed model using CPLEX. The tailored Lagrangian relaxation heuristic was tested on simulated and real instances provided by a manufacturing company. The results show that the proposed heuristic outperforms the baseline algorithm. Sensitivity analyses from the numerical experiments are discussed, which can help the company improve the efficiency of the IWS.

本文研究了一种智能仓库系统（IWS），该系统需要三种类型的移动机器人：自动导引车（agv）、轨道导引车（rgv）和龙门起重设备（GLDs）的无缝协作。与agv组成的传统系统相比，IWS可以更灵活地满足不同企业的定制需求。针对多类型机器人（agv、rgv和gld）在IWS中的任务分配和路径规划问题，提出了一种集成的任务分配和路径规划问题。考虑了agv与gld、rgv与gld之间的合作约束，以及agv之间的无冲突约束。由于agv的无冲突约束会导致agv的任务完成时间不固定，并对agv、rgv和gld的任务分配带来计算挑战，因此解决agv无冲突约束下的多类型机器人调度问题具有挑战性。将多类型机器人的任务分配和路径规划集成问题建模为一种新的状态-时间-空间网络上的多商品流问题，并将其表述为整数线性规划（ILP）模型，其中仓库操作员的目标是最小化所有任务的总完成时间。我们开发了一种拉格朗日松弛启发式方法，使用定制的有效策略来寻找可行的解。我们还使用CPLEX对模型进行了求解。在某制造企业提供的仿真和实际实例上对定制拉格朗日松弛启发式算法进行了验证。结果表明，所提启发式算法优于基线算法。并对数值实验结果进行了敏感性分析，以帮助公司提高IWS的效率。

{"title":"Integrated task assignment and path planning for multi-type robots in an intelligent warehouse system","authors":"Zihan Qiu , Jiancheng Long , Yang Yu , Shukai Chen","doi":"10.1016/j.tre.2024.103883","DOIUrl":"10.1016/j.tre.2024.103883","url":null,"abstract":"<div><div>This paper considers an intelligent warehouse system (IWS) that requires the seamless cooperation of three types of mobile robots: automated guided vehicles (AGVs), rail-guided vehicles (RGVs), and gantry lifting devices (GLDs). Compared to the conventional system, which comprises AGVs, the IWS is more flexible in addressing with the customized demands of diverse enterprises. This paper proposes an integrated task assignment and path planning problem for multi-type robots (e.g., AGVs, RGVs, and GLDs) in IWS. The cooperative constraints between AGVs and GLDs, RGVs and GLDs, as well as the conflict-free constraints among AGVs, are considered. It is challenging to solve the multi-type robots scheduling problem with the conflict-free constraints of AGVs because these constraints can result in the unfixed task completion time of AGVs and pose computational challenges of the task assignment for AGVs, RGVs, and GLDs. The proposed integrated task assignment and path planning problem for multi-type robots is modeled as a multi-commodity flow problem on a novel state-time–space network and is formulated as an integer linear programming (ILP) model, where the warehouse operator aims to minimize the total completion time of all tasks. We developed a Lagrangian relaxation heuristic with a customized efficient strategy to find feasible solutions. We also solved our proposed model using CPLEX. The tailored Lagrangian relaxation heuristic was tested on simulated and real instances provided by a manufacturing company. The results show that the proposed heuristic outperforms the baseline algorithm. Sensitivity analyses from the numerical experiments are discussed, which can help the company improve the efficiency of the IWS.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"194 ","pages":"Article 103883"},"PeriodicalIF":8.3,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142816536","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Order matching optimization of the ridesplitting service: A scenario with midway stops 拼车服务的订单匹配优化：中途停车场景

IF 8.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part E-Logistics and Transportation Review

Pub Date : 2025-02-01 DOI: 10.1016/j.tre.2024.103936

Mingyang Du , Xuefeng Li , Lin Cheng , Weike Lu , Wenxiang Li

Ridesplitting travel can provide numerous social and environmental benefits, including reducing vehicle usage and traffic congestion, and decreasing energy consumption and greenhouse gas emissions. This study examines the practicability of integrating the function of midway stops into ridesplitting services. Considering two coexisting matching forms: pre-pool-matching and en-route matching, the ridesplitting order dispatch problem with midway stops is formulated as an integer programming model with multiple objectives. Two methods are developed to address the proposed problem, i.e., an exact algorithm based on bipartite graph and a two-stage method based on Kuhn-Munkres algorithm. Based on the ride-hailing trip data, numerical experiments are conducted to examine the performance of the proposed methods. We also quantify the benefits of the ridesplitting matching with midway stops compared with the solo matching with midway stops and the traditional ridesplitting matching without midway stops. The impacts of the characteristics of midway stops on the order dispatching results are also discussed. The results indicate that compared with the solo ride-hailing matching with midway stops, the ridesplitting matching with midway stops could greatly improve distance savings of trips and the matching success rate of passengers. The research results can enrich the landing scene of ridesplitting service and promote the innovation and upgrading of this product.

拼车出行可以提供许多社会和环境效益，包括减少车辆使用和交通拥堵，减少能源消耗和温室气体排放。本研究探讨将中途站功能整合到拼车服务中的可行性。考虑池前匹配和途中匹配两种共存的匹配形式，将中途站的拼车顺序调度问题表述为一个多目标整数规划模型。提出了两种方法来解决所提出的问题，即基于二分图的精确算法和基于Kuhn-Munkres算法的两阶段方法。基于网约车出行数据，通过数值实验验证了所提方法的性能。我们还量化了带中途站的拼车匹配与带中途站的单独匹配和不带中途站的传统拼车匹配的效益。讨论了中途停车特性对订单调度结果的影响。结果表明，与中途站单独网约车匹配相比，中途站拼车匹配可以大大提高出行距离节约和乘客匹配成功率。研究成果可以丰富拼车服务落地场景，促进该产品的创新升级。

{"title":"Order matching optimization of the ridesplitting service: A scenario with midway stops","authors":"Mingyang Du , Xuefeng Li , Lin Cheng , Weike Lu , Wenxiang Li","doi":"10.1016/j.tre.2024.103936","DOIUrl":"10.1016/j.tre.2024.103936","url":null,"abstract":"<div><div>Ridesplitting travel can provide numerous social and environmental benefits, including reducing vehicle usage and traffic congestion, and decreasing energy consumption and greenhouse gas emissions. This study examines the practicability of integrating the function of midway stops into ridesplitting services. Considering two coexisting matching forms: pre-pool-matching and en-route matching, the ridesplitting order dispatch problem with midway stops is formulated as an integer programming model with multiple objectives. Two methods are developed to address the proposed problem, i.e., an exact algorithm based on bipartite graph and a two-stage method based on Kuhn-Munkres algorithm. Based on the ride-hailing trip data, numerical experiments are conducted to examine the performance of the proposed methods. We also quantify the benefits of the ridesplitting matching with midway stops compared with the solo matching with midway stops and the traditional ridesplitting matching without midway stops. The impacts of the characteristics of midway stops on the order dispatching results are also discussed. The results indicate that compared with the solo ride-hailing matching with midway stops, the ridesplitting matching with midway stops could greatly improve distance savings of trips and the matching success rate of passengers. The research results can enrich the landing scene of ridesplitting service and promote the innovation and upgrading of this product.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"194 ","pages":"Article 103936"},"PeriodicalIF":8.3,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142887894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Third-party sellers’ selling formats and advertising competition on e-commerce platforms 第三方卖家的销售模式和电商平台上的广告竞争

IF 8.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part E-Logistics and Transportation Review

Pub Date : 2025-02-01 DOI: 10.1016/j.tre.2024.103945

Chenyu Wang , Jingchun Sun , Siyu Shi , T.C. Edwin Cheng

Many e-commerce platforms allow third-party sellers (manufacturers and retailers) to sell on their websites for commission fees. In particular, manufacturers can sell directly on the platforms (agency selling) or wholesale products to their retailers, who then resell on the platforms (reselling). Competition arises among these downstream sellers. Moreover, manufacturers make pricing and advertising decisions under agency selling, while their retailers make these decisions under reselling, further complicating competition. This study establishes a game-theoretic model that includes two symmetric manufacturers to discuss the interactions between selling formats and sellers’ advertising decisions. Three possible selling modes exist: pure reselling (mode R), pure agency selling (mode A), and hybrid selling (mode H). We find that the equilibrium advertising decisions are different in these selling modes and that product value plays an important role. Specifically, the sellers (i.e., retailers) in mode R always advertise. However, only one seller (i.e., manufacturers) in mode A advertises when the product value is high. In mode H, the manufacturer has a higher profit margin than the retailer and always advertises to leverage this competitive advantage; however, the retailer advertises only when the product value is low. We find that agency selling yields a higher advertising effort than reselling, which may lead to a higher retail price. This finding differs from the traditional wisdom that retail prices in agency selling should be lower because of mitigated double marginalization. Our results demonstrate that agency selling can benefit manufacturers in the presence of advertising competition.

许多电子商务平台允许第三方卖家（制造商和零售商）在他们的网站上销售佣金。特别是，制造商可以直接在平台上销售（代理销售）或将产品批发给零售商，然后零售商在平台上转售（转售）。这些下游卖家之间产生了竞争。此外，制造商在代理销售下做出定价和广告决策，而零售商在转售下做出这些决策，这进一步使竞争复杂化。本文建立了一个包含两个对称制造商的博弈论模型，讨论了销售形式与销售者广告决策之间的相互作用。存在三种可能的销售模式：纯转售（模式R）、纯代理销售（模式A）和混合销售（模式H）。我们发现，在这些销售模式下，均衡广告决策是不同的，产品价值起着重要的作用。具体来说，模式R中的卖家（即零售商）总是在做广告。然而，在模式A中，只有一个卖家（即制造商）在产品价值高的时候做广告。在H模式下，制造商比零售商有更高的利润率，并且总是通过广告来利用这种竞争优势；然而，零售商只在产品价值低的时候做广告。我们发现代理销售比转售产生更高的广告努力，这可能导致更高的零售价格。这一发现不同于传统的观点，即代理销售的零售价格应该更低，因为减轻了双重边缘化。我们的研究结果表明，在广告竞争的情况下，代理销售可以使制造商受益。

{"title":"Third-party sellers’ selling formats and advertising competition on e-commerce platforms","authors":"Chenyu Wang , Jingchun Sun , Siyu Shi , T.C. Edwin Cheng","doi":"10.1016/j.tre.2024.103945","DOIUrl":"10.1016/j.tre.2024.103945","url":null,"abstract":"<div><div>Many e-commerce platforms allow third-party sellers (manufacturers and retailers) to sell on their websites for commission fees. In particular, manufacturers can sell directly on the platforms (agency selling) or wholesale products to their retailers, who then resell on the platforms (reselling). Competition arises among these downstream sellers. Moreover, manufacturers make pricing and advertising decisions under agency selling, while their retailers make these decisions under reselling, further complicating competition. This study establishes a game-theoretic model that includes two symmetric manufacturers to discuss the interactions between selling formats and sellers’ advertising decisions. Three possible selling modes exist: pure reselling (mode R), pure agency selling (mode A), and hybrid selling (mode H). We find that the equilibrium advertising decisions are different in these selling modes and that product value plays an important role. Specifically, the sellers (i.e., retailers) in mode R always advertise. However, only one seller (i.e., manufacturers) in mode A advertises when the product value is high. In mode H, the manufacturer has a higher profit margin than the retailer and always advertises to leverage this competitive advantage; however, the retailer advertises only when the product value is low. We find that agency selling yields a higher advertising effort than reselling, which may lead to a higher retail price. This finding differs from the traditional wisdom that retail prices in agency selling should be lower because of mitigated double marginalization. Our results demonstrate that agency selling can benefit manufacturers in the presence of advertising competition.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"194 ","pages":"Article 103945"},"PeriodicalIF":8.3,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142888985","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Building sustainable hazardous products supply chain against ambiguous risk with accelerated Benders decomposition algorithm 基于加速Benders分解算法的危险产品模糊风险可持续供应链构建

IF 8.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part E-Logistics and Transportation Review

Pub Date : 2025-02-01 DOI: 10.1016/j.tre.2024.103941

Jinpei Wang , Xuejie Bai , Yankui Liu

The detrimental consequences of accidents in the supply chain pose a major challenge to the management of transportation risks in the hazardous products supply chain. The development of a sustainable hazardous products risk management method is an important research problem. For this purpose, this paper investigates the hazardous products supply chain design problem with the deployment of an emergency response team (ERT) before and after supply accidents, and proposes a new hazardous products supply chain risk avoidance approach. Our approach considers the government as the upper decision-maker and the company as the lower decision-maker, and adopts a bilevel optimization framework to characterize the hierarchical relationship in our problem. To model the uncertainty of arcs risks and availability of partial distribution information, this paper constructs an ambiguous joint chance constraint based on the Wasserstein ambiguity set. To improve the reliability of the network arc connection and the sustainability of supply, a multi-objective bilevel distributionally robust (MBDR) model is developed. Moreover, we reformulate the proposed model as a computationally tractable mixed-integer linear programming (MILP) model. To further improve the solving efficiency, we design an accelerated Benders decomposition (BD) algorithm by incorporating two sets of valid inequalities. Finally, a practical case in Guangdong Province is presented to illustrate the superiority of our proposed method and algorithm. The computational results show that our MBDR model and BD algorithm perform better in terms of out-of-sample performance and exhibit good solving efficiency.

供应链事故的不利后果对危险品供应链运输风险管理提出了重大挑战。开发可持续的危险产品风险管理方法是一个重要的研究课题。为此，本文研究了在供应事故发生前后部署应急响应小组的危险品供应链设计问题，并提出了一种新的危险品供应链风险规避方法。我们的方法将政府作为上层决策者，公司作为下层决策者，并采用双层优化框架来表征问题中的层级关系。为了对弧线风险的不确定性和部分分布信息的可用性进行建模，本文基于Wasserstein模糊集构造了一个模糊联合机会约束。为了提高电网电弧连接的可靠性和供电的可持续性，提出了一种多目标双层分布鲁棒模型。此外，我们将所提出的模型重新表述为可计算的混合整数线性规划（MILP）模型。为了进一步提高求解效率，我们设计了一种结合两组有效不等式的加速Benders分解算法。最后，以广东省的一个实际案例说明了本文提出的方法和算法的优越性。计算结果表明，我们的MBDR模型和BD算法在样本外性能和求解效率方面都有较好的表现。

{"title":"Building sustainable hazardous products supply chain against ambiguous risk with accelerated Benders decomposition algorithm","authors":"Jinpei Wang , Xuejie Bai , Yankui Liu","doi":"10.1016/j.tre.2024.103941","DOIUrl":"10.1016/j.tre.2024.103941","url":null,"abstract":"<div><div>The detrimental consequences of accidents in the supply chain pose a major challenge to the management of transportation risks in the hazardous products supply chain. The development of a sustainable hazardous products risk management method is an important research problem. For this purpose, this paper investigates the hazardous products supply chain design problem with the deployment of an emergency response team (ERT) before and after supply accidents, and proposes a new hazardous products supply chain risk avoidance approach. Our approach considers the government as the upper decision-maker and the company as the lower decision-maker, and adopts a bilevel optimization framework to characterize the hierarchical relationship in our problem. To model the uncertainty of arcs risks and availability of partial distribution information, this paper constructs an ambiguous joint chance constraint based on the Wasserstein ambiguity set. To improve the reliability of the network arc connection and the sustainability of supply, a multi-objective bilevel distributionally robust (MBDR) model is developed. Moreover, we reformulate the proposed model as a computationally tractable mixed-integer linear programming (MILP) model. To further improve the solving efficiency, we design an accelerated Benders decomposition (BD) algorithm by incorporating two sets of valid inequalities. Finally, a practical case in Guangdong Province is presented to illustrate the superiority of our proposed method and algorithm. The computational results show that our MBDR model and BD algorithm perform better in terms of out-of-sample performance and exhibit good solving efficiency.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"194 ","pages":"Article 103941"},"PeriodicalIF":8.3,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142888988","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Patent licensing strategies in supply chains with downstream coopetition 具有下游合作的供应链专利许可策略

IF 8.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part E-Logistics and Transportation Review

Pub Date : 2025-02-01 DOI: 10.1016/j.tre.2024.103889

Hongmei Qi , Jihang Shi , Xuefeng Zhang

This study investigates a supply chain comprising a technology patent holder, a national brand, and an outsourcing manufacturer. Through the development of an analytical model, we explore the effects of downstream co-opetition on the patent holder’s licensing strategies and clarify the interactive dynamics between the involved parties. The key findings are as follows: (1) Enhancing consumer’s perceived value of products produced by the outsourcing manufacturer does not always lead to positive outcomes. (2) Expanding patent licensing to additional firms may not always be advantageous for the patent holder and, in certain cases, may even reduce its profitability. (3) Under specific conditions, there is an interaction between the patent holder’s licensing strategy and the national brand’s outsourcing decisions. Notably, when the national brand assumes a leadership role in decision-making, this interaction becomes more pronounced. (4) The existence of a feasible decision-making region enables not only a “win–win” outcome for decision makers but also a “win–win–win” scenario benefiting all participants.

本研究考察了一个由技术专利持有人、民族品牌和外包制造商组成的供应链。本文通过建立分析模型，探讨了下游合作竞争对专利持有人许可策略的影响，并阐明了相关各方之间的互动动态。主要发现如下：(1)提高消费者对外包制造商产品的感知价值并不总是带来积极的结果。(2)将专利许可扩大到更多的公司可能并不总是对专利持有人有利，在某些情况下，甚至可能降低其盈利能力。(3)在特定条件下，专利权人的授权策略与民族品牌的外包决策之间存在交互作用。值得注意的是，当国家品牌在决策中扮演领导角色时，这种互动变得更加明显。(4)可行决策区域的存在不仅使决策者获得“双赢”的结果，而且使所有参与者都能获得“三赢”的结果。

{"title":"Patent licensing strategies in supply chains with downstream coopetition","authors":"Hongmei Qi , Jihang Shi , Xuefeng Zhang","doi":"10.1016/j.tre.2024.103889","DOIUrl":"10.1016/j.tre.2024.103889","url":null,"abstract":"<div><div>This study investigates a supply chain comprising a technology patent holder, a national brand, and an outsourcing manufacturer. Through the development of an analytical model, we explore the effects of downstream co-opetition on the patent holder’s licensing strategies and clarify the interactive dynamics between the involved parties. The key findings are as follows: (1) Enhancing consumer’s perceived value of products produced by the outsourcing manufacturer does not always lead to positive outcomes. (2) Expanding patent licensing to additional firms may not always be advantageous for the patent holder and, in certain cases, may even reduce its profitability. (3) Under specific conditions, there is an interaction between the patent holder’s licensing strategy and the national brand’s outsourcing decisions. Notably, when the national brand assumes a leadership role in decision-making, this interaction becomes more pronounced. (4) The existence of a feasible decision-making region enables not only a “win–win” outcome for decision makers but also a “win–win–win” scenario benefiting all participants.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"194 ","pages":"Article 103889"},"PeriodicalIF":8.3,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142888989","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Group buying with consumer disappointment at failed deals 团购与消费者对失败交易的失望

IF 8.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part E-Logistics and Transportation Review

Pub Date : 2025-02-01 DOI: 10.1016/j.tre.2024.103903

Jie Wang , Benedict Jun Ma , Yanyi Yang , Chun-Hung Cheng , Yong-Hong Kuo

In group buying (GB), the retailer launches a deal with a discounted product price and a minimum group size requirement. Strategic consumers then determine whether to sign up for the GB deal or purchase the product at the regular price immediately. If GB fails, disappointed GB participants perceive a negative psychological utility and decide whether or not to buy it again at the regular price. Considering the disappointment caused by a GB failure, in our basic model, we formulate a two-period game to study the retailer’s optimal pricing decisions and consumers’ purchasing strategies. By deriving the likelihood function of a consumer signing up for the GB deal and utilizing rational expectations theory, we characterize how consumers form their own beliefs about the GB success rate. We find that consumer sentiment toward a failed GB deal serves an important role in a GB deal. Specifically, there exists a threshold of the disappointment factor where the retailer’s profit and consumers’ purchase decisions may change, and consumer leakage and retention may occur. We prove the existence of the subgame perfect Nash equilibrium and outline how the retailer should design the GB schedule. Our study shows that if properly designed, GB is an effective strategy to enhance consumer interests and improve profit. Moreover, a big discount should be offered when the disappointment factor is significant. When the consumer sentiment toward a failed GB deal is insignificant, the retailer should launch a GB deal; otherwise, he should provide the regular sales channel only. We conduct numerical experiments to study the impacts of different factors in a GB deal. Our key results continue to hold in several extensions from our basic model: retailer competition, observable secured group size, and social interactions between consumers.

在团购（GB）中，零售商以折扣产品价格和最低团体规模要求发起交易。然后，有战略眼光的消费者决定是签署国标协议，还是立即以正常价格购买产品。如果GB失败，失望的GB参与者感知到负的心理效用，并决定是否以正常价格再次购买。在我们的基本模型中，考虑到由于GB失败而导致的失望，我们制定了一个两期博弈来研究零售商的最优定价决策和消费者的购买策略。通过推导消费者签约GB交易的可能性函数并利用理性预期理论，我们描述了消费者如何形成自己对GB成功率的信念。我们发现，消费者对失败的GB交易的情绪在GB交易中起着重要作用。具体而言，零售商的利润和消费者的购买决策可能会发生变化，消费者流失和保留可能会出现，存在一个失望因素的阈值。证明了子博弈完美纳什均衡的存在性，并概述了零售商如何设计GB计划。我们的研究表明，如果设计得当，GB是提高消费者利益和提高利润的有效策略。此外，当失望因素很大时，应该提供较大的折扣。当消费者对失败的GB交易的情绪微不足道时，零售商应该推出GB交易；否则，他应该只提供常规的销售渠道。我们通过数值实验研究了不同因素对国库券交易的影响。我们的主要结果继续适用于我们的基本模型的几个扩展：零售商竞争、可观察的安全群体规模和消费者之间的社会互动。

{"title":"Group buying with consumer disappointment at failed deals","authors":"Jie Wang , Benedict Jun Ma , Yanyi Yang , Chun-Hung Cheng , Yong-Hong Kuo","doi":"10.1016/j.tre.2024.103903","DOIUrl":"10.1016/j.tre.2024.103903","url":null,"abstract":"<div><div>In group buying (GB), the retailer launches a deal with a discounted product price and a minimum group size requirement. Strategic consumers then determine whether to sign up for the GB deal or purchase the product at the regular price immediately. If GB fails, disappointed GB participants perceive a negative psychological utility and decide whether or not to buy it again at the regular price. Considering the disappointment caused by a GB failure, in our basic model, we formulate a two-period game to study the retailer’s optimal pricing decisions and consumers’ purchasing strategies. By deriving the likelihood function of a consumer signing up for the GB deal and utilizing rational expectations theory, we characterize how consumers form their own beliefs about the GB success rate. We find that consumer sentiment toward a failed GB deal serves an important role in a GB deal. Specifically, there exists a threshold of the disappointment factor where the retailer’s profit and consumers’ purchase decisions may change, and consumer leakage and retention may occur. We prove the existence of the subgame perfect Nash equilibrium and outline how the retailer should design the GB schedule. Our study shows that if properly designed, GB is an effective strategy to enhance consumer interests and improve profit. Moreover, a big discount should be offered when the disappointment factor is significant. When the consumer sentiment toward a failed GB deal is insignificant, the retailer should launch a GB deal; otherwise, he should provide the regular sales channel only. We conduct numerical experiments to study the impacts of different factors in a GB deal. Our key results continue to hold in several extensions from our basic model: retailer competition, observable secured group size, and social interactions between consumers.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"194 ","pages":"Article 103903"},"PeriodicalIF":8.3,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142816529","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Joint berth and flexible storage space allocation in container tower ports 集装箱塔式港口联合泊位与仓储空间灵活配置

IF 8.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part E-Logistics and Transportation Review

Pub Date : 2025-02-01 DOI: 10.1016/j.tre.2024.103942

Lu Zhen , Wencheng Wang , Shumin Lin , Linying Yang , Shenyan Jiang

The increasing demand for container shipping has increased the difficulty of yard management and container processing time. High-density container tower ports are next-generation ports. They have advantages, such as stable steel frame structures, high yard land utilization rates, and eliminating the need for container reshuffling operations. This study investigates berth and storage space allocation in container tower ports by considering flexible storage strategies, container allocation, sub-tower size division, and sub-tower allocation. A mixed-integer programming model is proposed to characterize the problem. A column generation-based heuristic algorithm with high performance in terms of solving speed and quality is explored to solve this problem. Numerical experiments verify the performance of the proposed algorithm. Some management insights that can help ports operate efficiently are revealed.

集装箱运输需求的增加增加了堆场管理的难度和集装箱处理的时间。高密度集装箱塔式港口是下一代港口。它们具有钢架结构稳定、堆场土地利用率高、无需集装箱重新洗牌等优点。本文从柔性存储策略、集装箱分配、子塔尺寸划分和子塔分配等方面对集装箱塔式港口的泊位和仓储空间分配进行了研究。提出了一个混合整数规划模型来描述该问题。为解决这一问题，提出了一种求解速度快、质量好、基于列生成的启发式算法。数值实验验证了该算法的有效性。揭示了一些有助于港口高效运营的管理见解。

引用次数: 0