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

Integrated and shared charging optimization of electric buses and shared micromobility incorporating solar photovoltaic 基于太阳能光伏的电动公交车集成共享充电优化与共享微出行

IF 8.8 1区工程技术 Q1 ECONOMICS

Transportation Research Part E-Logistics and Transportation Review

Pub Date : 2026-01-28 DOI: 10.1016/j.tre.2026.104709

Xiaohan Liu , Arsalan Najafi , Sheng Jin , Hua Wang , Xiaolei Ma , Kun Gao

Public transport electrification contributes to the net-zero goal in the transport sector. However, high-power bus charging during peak hours places additional strain on the grid, while under-utilization of charging infrastructure limits its potential economic and social benefits. This study focuses on these challenges through integrated and shared optimization of battery electric buses (BEB) and shared micromobility systems (SMS) incorporating solar photovoltaic. We present a bi-level mixed-integer linear programming model (B-MILM) to jointly optimize BEB charging infrastructure, BEB charging schedules, solar PV installed capacity, and SMS charging schedule. The B-MILM is solved using a value-function-based exact approach. We derive a group of inequalities based on the problem characteristics to reduce solution time. A large-scale case study in Gothenburg, Sweden, demonstrates that solar photovoltaic and shared charging services yield annual cost savings 110% - 120% above investment costs for public transit agencies, even when the service fee revenue is excluded. Charging dispatching costs for e-scooter operators are reduced by up to 54%, and daily BEB charging grid loads decrease by 3% to 34% across seasons. The greenhouse emissions from electricity consumption of BEBs and e-scooters are reduced by 3%. The results offer new insights for sustainable charging and energy infrastructure planning and management for electric public transit.

公共交通电气化有助于实现交通部门的净零目标。然而，高峰时段的大功率公交车充电给电网带来了额外的压力，充电基础设施的利用率不足限制了其潜在的经济效益和社会效益。本研究通过集成和共享优化电池电动公交车（BEB）和包含太阳能光伏的共享微移动系统（SMS）来关注这些挑战。我们提出了一个双层混合整数线性规划模型（B-MILM）来共同优化BEB充电基础设施、BEB充电计划、太阳能光伏装机容量和SMS充电计划。B-MILM采用基于值函数的精确方法求解。为了缩短求解时间，我们根据问题的特征导出了一组不等式。瑞典哥德堡的一项大规模案例研究表明，即使不包括服务费收入，太阳能光伏和共享充电服务每年也能比公共交通机构的投资成本节省110% - 120%。电动滑板车运营商的充电调度成本降低了54%，电动滑板车充电电网的日负荷在不同季节减少了3%至34%。电动自行车和电动滑板车的电力消耗温室气体排放量减少了3%。研究结果为电动公共交通的可持续充电和能源基础设施规划和管理提供了新的见解。

{"title":"Integrated and shared charging optimization of electric buses and shared micromobility incorporating solar photovoltaic","authors":"Xiaohan Liu , Arsalan Najafi , Sheng Jin , Hua Wang , Xiaolei Ma , Kun Gao","doi":"10.1016/j.tre.2026.104709","DOIUrl":"10.1016/j.tre.2026.104709","url":null,"abstract":"<div><div>Public transport electrification contributes to the net-zero goal in the transport sector. However, high-power bus charging during peak hours places additional strain on the grid, while under-utilization of charging infrastructure limits its potential economic and social benefits. This study focuses on these challenges through integrated and shared optimization of battery electric buses (BEB) and shared micromobility systems (SMS) incorporating solar photovoltaic. We present a bi-level mixed-integer linear programming model (B-MILM) to jointly optimize BEB charging infrastructure, BEB charging schedules, solar PV installed capacity, and SMS charging schedule. The B-MILM is solved using a value-function-based exact approach. We derive a group of inequalities based on the problem characteristics to reduce solution time. A large-scale case study in Gothenburg, Sweden, demonstrates that solar photovoltaic and shared charging services yield annual cost savings 110% - 120% above investment costs for public transit agencies, even when the service fee revenue is excluded. Charging dispatching costs for e-scooter operators are reduced by up to 54%, and daily BEB charging grid loads decrease by 3% to 34% across seasons. The greenhouse emissions from electricity consumption of BEBs and e-scooters are reduced by 3%. The results offer new insights for sustainable charging and energy infrastructure planning and management for electric public transit.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"208 ","pages":"Article 104709"},"PeriodicalIF":8.8,"publicationDate":"2026-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146072509","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

Dynamic pricing strategies based on Consumers’ psychology during product-harm crises 产品危害危机中基于消费者心理的动态定价策略

IF 8.8 1区工程技术 Q1 ECONOMICS

Transportation Research Part E-Logistics and Transportation Review

Pub Date : 2026-01-28 DOI: 10.1016/j.tre.2026.104705

Kaifu Li, Deqing Ma, Jinsong Hu, Xue Wang

Product-harm crises happen unexpectedly, triggering product recalls and altering consumer psychology, posing significant challenges to brands. This paper examines a monopoly brand selling a single product, identifying three crisis scenarios: no crisis, severe crisis, and mild crisis. Incorporating the crisis’s long-term effect, consumers’ price mapping psychology (PMP), and their vigilance to the crisis, we explore the dynamic pricing strategy for a far-sighted brand manager. The results suggest that in the absence of a crisis, the brand manager, weighing against consumers’ PMP and the law of demand (LOD), sets price based on the product’s basic quality. Regardless of whether the product survives the crisis, a risk premium will always be charged before a crisis to cushion recall costs. After the crisis, price drops, but demand may soften as consumers grow intolerant of implicated products and require products with superior basic quality. Thus, the crisis and its long-term effects inevitably harm both the supply and demand sides. Although the negative impact cannot be eliminated by dynamic pricing strategies, the brand can benefit from greater market share and minimize profit loss rates by leveraging consumers’ PMP and laxity. Interestingly, despite being exploited, consumers benefit from increased utility and consumer surplus. Notably, the hazard myopia of a brand manager is only more beneficial when the crisis arrives later. Brands confronted with crises must reduce production costs or be priced out of the market. By capitalizing on recalled products’ salvage value, the brand will lower the risk premium due to eased recall cost pressures.

产品危害危机突发，引发产品召回，改变消费者心理，给品牌带来重大挑战。本文以单一产品的垄断品牌为研究对象，确定了三种危机情景：无危机、严重危机和轻微危机。结合危机的长期影响、消费者的价格映射心理（PMP）和他们对危机的警惕性，我们探讨了一个有远见的品牌经理的动态定价策略。结果表明，在没有危机的情况下，品牌经理会权衡消费者的PMP和需求定律（LOD），根据产品的基本质量来定价。不管产品是否能在危机中幸存下来，在危机发生前总会收取风险溢价，以缓冲召回成本。危机过后，价格下降，但需求可能会减弱，因为消费者越来越不能容忍有问题的产品，并要求产品具有更高的基本质量。因此，这场危机及其长期影响不可避免地损害了供需双方。虽然负面影响不能通过动态定价策略消除，但品牌可以通过利用消费者的PMP和宽松性来获得更大的市场份额，并将利润损失率降至最低。有趣的是，尽管被剥削，消费者受益于效用的增加和消费者剩余。值得注意的是，品牌经理的风险短视只会在危机晚些时候到来时更有利。面临危机的品牌必须降低生产成本，否则就会被挤出市场。通过利用召回产品的残值，该品牌将降低因召回成本压力减轻而带来的风险溢价。

{"title":"Dynamic pricing strategies based on Consumers’ psychology during product-harm crises","authors":"Kaifu Li, Deqing Ma, Jinsong Hu, Xue Wang","doi":"10.1016/j.tre.2026.104705","DOIUrl":"10.1016/j.tre.2026.104705","url":null,"abstract":"<div><div>Product-harm crises happen unexpectedly, triggering product recalls and altering consumer psychology, posing significant challenges to brands. This paper examines a monopoly brand selling a single product, identifying three crisis scenarios: no crisis, severe crisis, and mild crisis. Incorporating the crisis’s long-term effect, consumers’ price mapping psychology (PMP), and their vigilance to the crisis, we explore the dynamic pricing strategy for a far-sighted brand manager. The results suggest that in the absence of a crisis, the brand manager, weighing against consumers’ PMP and the law of demand (LOD), sets price based on the product’s basic quality. Regardless of whether the product survives the crisis, a risk premium will always be charged before a crisis to cushion recall costs. After the crisis, price drops, but demand may soften as consumers grow intolerant of implicated products and require products with superior basic quality. Thus, the crisis and its long-term effects inevitably harm both the supply and demand sides. Although the negative impact cannot be eliminated by dynamic pricing strategies, the brand can benefit from greater market share and minimize profit loss rates by leveraging consumers’ PMP and laxity. Interestingly, despite being exploited, consumers benefit from increased utility and consumer surplus. Notably, the hazard myopia of a brand manager is only more beneficial when the crisis arrives later. Brands confronted with crises must reduce production costs or be priced out of the market. By capitalizing on recalled products’ salvage value, the brand will lower the risk premium due to eased recall cost pressures.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"208 ","pages":"Article 104705"},"PeriodicalIF":8.8,"publicationDate":"2026-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146071619","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

Real-time metro train rescheduling under uncertainties: A hybrid machine learning and integer L-shaped approach 不确定条件下地铁列车实时调度：一种混合机器学习和整数l型方法

IF 8.8 1区工程技术 Q1 ECONOMICS

Transportation Research Part E-Logistics and Transportation Review

Pub Date : 2026-01-28 DOI: 10.1016/j.tre.2026.104704

Boyi Su , Fangsheng Wang , Shuai Su , Andrea D’Ariano , Zhikai Wang , Tao Tang

Metro trains inevitably encounter faults during operation, leading to disturbances or disruptions. Considering the uncertainties in both the scenario type (such as delay, out-of-service, and rescue) and the duration of these disturbances or disruptions, this paper investigates the real-time train rescheduling problem in the context of Industry 5.0. A risk-averse two-stage stochastic programming model is formulated to generate rescheduling solutions for each possible uncertainty realization and ensure their seamless transition. In this model, the first stage makes rescheduling decisions that are independent of uncertainty realizations, such as the number of dispatched backup trains and whether to short-turn trains during fault handling. The second stage adopts all dispatching measures applicable to metro lines and makes additional rescheduling decisions. To integrate human factors into decision-making, the general conservative attitude of dispatchers towards risk management is captured using a mean-conditional value-at-risk criterion. Under the traditional integer L-shaped framework, the model is decomposed into a first-stage master problem and several second-stage subproblems. Aligning with the technological advancements of Industry 5.0, supervised machine learning is used to predict the objective values of the subproblems instead of solving them explicitly, thereby enabling the rapid addition of approximate optimality cuts and improving computational efficiency. Numerical experiments are conducted on the Beijing Yizhuang Metro Line. The computational results show that the proposed solution approach reduces the average computation time by 99.02% compared to GUROBI, and the developed stochastic model lowers the average objective value by over 22% compared to the practical strategy, contributing to the development of intelligent and resilient metro systems.

地铁列车在运行中不可避免地会遇到故障，导致骚乱或中断。考虑到场景类型（如延误、停运和救援）和这些干扰或中断持续时间的不确定性，本文研究了工业5.0背景下的实时列车重新调度问题。建立了一种规避风险的两阶段随机规划模型，对每种可能的不确定性实现生成重调度解，并保证它们的无缝过渡。在该模型中，第一阶段做出独立于不确定性实现的重调度决策，如调度备份列车的数量和故障处理期间是否短线列车。第二阶段采用适用于地铁线路的所有调度措施，并作出额外的重新调度决策。为了将人为因素整合到决策中，使用平均条件风险值标准捕获调度员对风险管理的一般保守态度。在传统的整数l型框架下，将模型分解为一个第一阶段主问题和几个第二阶段子问题。与工业5.0的技术进步相一致，使用监督式机器学习来预测子问题的客观值，而不是明确地求解子问题，从而可以快速添加近似最优性切割，提高计算效率。以北京亦庄地铁线为例进行了数值试验。计算结果表明，所提出的求解方法比GUROBI平均计算时间减少99.02%，所建立的随机模型比实际策略平均目标值降低22%以上，有助于智能弹性地铁系统的发展。

{"title":"Real-time metro train rescheduling under uncertainties: A hybrid machine learning and integer L-shaped approach","authors":"Boyi Su , Fangsheng Wang , Shuai Su , Andrea D’Ariano , Zhikai Wang , Tao Tang","doi":"10.1016/j.tre.2026.104704","DOIUrl":"10.1016/j.tre.2026.104704","url":null,"abstract":"<div><div>Metro trains inevitably encounter faults during operation, leading to disturbances or disruptions. Considering the uncertainties in both the scenario type (such as delay, out-of-service, and rescue) and the duration of these disturbances or disruptions, this paper investigates the real-time train rescheduling problem in the context of Industry 5.0. A risk-averse two-stage stochastic programming model is formulated to generate rescheduling solutions for each possible uncertainty realization and ensure their seamless transition. In this model, the first stage makes rescheduling decisions that are independent of uncertainty realizations, such as the number of dispatched backup trains and whether to short-turn trains during fault handling. The second stage adopts all dispatching measures applicable to metro lines and makes additional rescheduling decisions. To integrate human factors into decision-making, the general conservative attitude of dispatchers towards risk management is captured using a mean-conditional value-at-risk criterion. Under the traditional integer L-shaped framework, the model is decomposed into a first-stage master problem and several second-stage subproblems. Aligning with the technological advancements of Industry 5.0, supervised machine learning is used to predict the objective values of the subproblems instead of solving them explicitly, thereby enabling the rapid addition of approximate optimality cuts and improving computational efficiency. Numerical experiments are conducted on the Beijing Yizhuang Metro Line. The computational results show that the proposed solution approach reduces the average computation time by 99.02% compared to GUROBI, and the developed stochastic model lowers the average objective value by over 22% compared to the practical strategy, contributing to the development of intelligent and resilient metro systems.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"208 ","pages":"Article 104704"},"PeriodicalIF":8.8,"publicationDate":"2026-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146072508","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

Inducing information provision on hybrid fresh produce e-commerce platforms via supplier freshness-keeping effort 通过供应商保鲜工作诱导混合生鲜电子商务平台的信息供给

IF 8.8 1区工程技术 Q1 ECONOMICS

Transportation Research Part E-Logistics and Transportation Review

Pub Date : 2026-01-27 DOI: 10.1016/j.tre.2026.104711

Lunhai Liang , Fei Ye , T.C. Edwin Cheng

This paper investigates the interplay between a platform’s information sharing decisions and its business mode selections and demonstrates how suppliers’ freshness-keeping efforts affect this interplay in a fresh produce supply chain with a supplier and a platform. We develop a theoretical model with stochastic and freshness-dependent demand, which the supplier can maintain product freshness through freshness-keeping efforts. The platform may share private demand information to support the supplier’s freshness-keeping decision and operates three business modes, namely the reselling mode (R), agency mode (A), and hybrid mode (H). Our findings show that under Mode A, the platform always voluntarily shares information, achieving a win–win outcome for both the platform and the supplier. Under Modes R and H, although information sharing drives up the wholesale price, the platform still prefers to share information when the supplier’s freshness-keeping efficiency is sufficiently high. Specifically, under Mode H, a dual-threshold information-sharing policy emerges: even when freshness-keeping efficiency is moderate, the platform shares information only when the commission rate is moderate. Furthermore, we find that information sharing motivates the supplier to enhance freshness-keeping efforts, which in turn improves product freshness. This mechanism termed the freshness-keeping improvement effect of information sharing functions as a critical incentive for the platform to voluntarily share demand information. Additionally, adopting Mode H may increase the wholesale price and exacerbate the double-marginalization problem when the commission rate is sufficiently low. Finally, we find that the platform and the supplier can reach consensus on the HS strategy (i.e., Mode H with information sharing) and subsequently achieve a win–win outcome only when the commission rate is moderate. However, information sharing may hinder consensus on adopting Mode H and narrow the win–win region..

本文研究了平台的信息共享决策与其商业模式选择之间的相互作用，并展示了供应商的保鲜努力如何影响供应商和平台的生鲜农产品供应链中的这种相互作用。我们建立了一个具有随机和新鲜度依赖需求的理论模型，供应商可以通过保鲜努力来保持产品的新鲜度。平台可以共享私人需求信息来支持供应商的保鲜决策，并运营三种商业模式，即转售模式(R)、代理模式(A)和混合模式(H)。我们的研究结果表明，在模式A下，平台总是自愿共享信息，实现了平台和供应商的双赢。在R和H模式下，虽然信息共享推高了批发价格，但当供应商的保鲜效率足够高时，平台仍然倾向于共享信息。具体而言，在H模式下，出现了双阈值信息共享策略：即使在保持新鲜度效率适中的情况下，平台也只在佣金率适中的情况下共享信息。此外，我们发现信息共享激励供应商加强保鲜工作，从而提高产品的新鲜度。这一机制被称为信息共享功能的新鲜度改善效应，是平台自愿共享需求信息的关键激励。另外，在佣金率足够低的情况下，采用H模式可能会增加批发价格，加剧双重边缘化问题。最后，我们发现只有在佣金率适中的情况下，平台和供应商才能就HS策略（即信息共享的H模式）达成共识，进而实现双赢。然而，信息共享可能会阻碍采用H模式的共识，缩小双赢区域。

{"title":"Inducing information provision on hybrid fresh produce e-commerce platforms via supplier freshness-keeping effort","authors":"Lunhai Liang , Fei Ye , T.C. Edwin Cheng","doi":"10.1016/j.tre.2026.104711","DOIUrl":"10.1016/j.tre.2026.104711","url":null,"abstract":"<div><div>This paper investigates the interplay between a platform’s information sharing decisions and its business mode selections and demonstrates how suppliers’ freshness-keeping efforts affect this interplay in a fresh produce supply chain with a supplier and a platform. We develop a theoretical model with stochastic and freshness-dependent demand, which the supplier can maintain product freshness through freshness-keeping efforts. The platform may share private demand information to support the supplier’s freshness-keeping decision and operates three business modes, namely the reselling mode (R), agency mode (A), and hybrid mode (H). Our findings show that under Mode A, the platform always voluntarily shares information, achieving a win–win outcome for both the platform and the supplier. Under Modes R and H, although information sharing drives up the wholesale price, the platform still prefers to share information when the supplier’s freshness-keeping efficiency is sufficiently high. Specifically, under Mode H, a dual-threshold information-sharing policy emerges: even when freshness-keeping efficiency is moderate, the platform shares information only when the commission rate is moderate. Furthermore, we find that information sharing motivates the supplier to enhance freshness-keeping efforts, which in turn improves product freshness. This mechanism termed the freshness-keeping improvement effect of information sharing functions as a critical incentive for the platform to voluntarily share demand information.Additionally, adopting Mode H may increase the wholesale price and exacerbate the double-marginalization problem when the commission rate is sufficiently low. Finally, we find that the platform and the supplier can reach consensus on the HS strategy (i.e., Mode H with information sharing) and subsequently achieve a win–win outcome only when the commission rate is moderate. However, information sharing may hinder consensus on adopting Mode H and narrow the win–win region..</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"208 ","pages":"Article 104711"},"PeriodicalIF":8.8,"publicationDate":"2026-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146071724","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

“Keeping up with changing customer demand”: An adaptive data-driven approach for storage and repositioning decisions in automated g warehouses “跟上不断变化的客户需求”：一种在自动化仓库中用于存储和重新定位决策的自适应数据驱动方法

IF 8.8 1区工程技术 Q1 ECONOMICS

Transportation Research Part E-Logistics and Transportation Review

Pub Date : 2026-01-27 DOI: 10.1016/j.tre.2026.104710

Majid Karimi , Nima Zaerpour , René de Koster

In warehouses, products are often not stored in their optimal positions, elongating retrieval and order picking time. A main reason is that storage assignment is based on historical demand frequency, whereas current demand patterns might just differ. However, as many warehouses are now automated or robotized, opportunities exist to dynamically and opportunistically reposition product loads based on real known demand and still reduce the makespan (the total time needed for retrieval, storage, and optional repositioning). We investigate the optimal retrieval of a known block of requests by explicitly additionally allowing in-between repositioning options. Surprisingly, in spite of the extra work and time involved, we show opportunistic repositioning may indeed be beneficial for reducing the makespan. We study the problem for two automated unit-load storage warehouses: automated storage and retrieval (AS/R) crane-based systems and robotic mobile fulfillment (RMF) systems, which have different travel metrics for the retrieval robots. The data-driven storage and repositioning (DDSR) problem, formulated as an integer linear program, leverages actual customer order data. The problem appears to be intractable for realistic systems due to the combinatorial nature of the possible repositions. We then reformulate the model, making it more tractable for moderate-sized problems. This model appears to beat real-life storage assignment heuristics like closest-open location assignment or demand-frequency class-based storage (even when these have full foresight of demand changes). The benefits appear to be around a 14%-30% shorter makespan, depending on the number of loads to be retrieved. For larger rack space utilization, the benefits decrease (since there are fewer options for repositioning). The method is sufficiently fast to be used in real warehouse systems, e.g., by using a rolling horizon policy where repositions are calculated for the next block of requests while the current requests are executed. Our method offers managers an additional powerful tool to reduce system response time and thereby increase throughput capacity by smarter scheduling of their automated equipment and more efficient use of available storage space.

在仓库中，产品往往没有储存在最佳位置，延长了检索和拣货时间。一个主要原因是存储分配是基于历史需求频率的，而当前的需求模式可能会有所不同。然而，由于许多仓库现在都是自动化的或机器人化的，因此存在根据实际已知需求动态地和机会地重新定位产品负载的机会，并且仍然可以减少makespan（检索、存储和可选重新定位所需的总时间）。我们通过明确地允许中间重新定位选项来研究已知请求块的最佳检索。令人惊讶的是，尽管涉及额外的工作和时间，我们表明机会主义的重新定位可能确实有利于缩短完工时间。本文研究了基于起重机的自动存取（AS/R）系统和机器人移动履约（RMF）系统两种具有不同存取机器人行程指标的自动化单元负载仓库的问题。数据驱动的存储和重新定位（DDSR）问题，被表述为一个整数线性程序，利用实际的客户订单数据。由于可能重新定位的组合性质，这个问题对于现实系统来说似乎是难以解决的。然后我们重新制定模型，使其更易于处理中等规模的问题。该模型似乎优于现实生活中的存储分配启发式方法，如最近开放位置分配或基于需求频率的存储（即使这些方法对需求变化有充分的预见）。这样做的好处似乎是缩短了14%-30%的完工时间，具体取决于要检索的负载数量。对于更大的机架空间利用率，好处会减少（因为重新定位的选择更少）。该方法足够快，可以在实际的仓库系统中使用，例如，通过使用滚动地平线策略，在执行当前请求时计算下一个请求块的重新定位。我们的方法为管理人员提供了一个额外的强大工具，可以通过更智能地调度自动化设备和更有效地利用可用存储空间来减少系统响应时间，从而提高吞吐量。

{"title":"“Keeping up with changing customer demand”: An adaptive data-driven approach for storage and repositioning decisions in automated g warehouses","authors":"Majid Karimi , Nima Zaerpour , René de Koster","doi":"10.1016/j.tre.2026.104710","DOIUrl":"10.1016/j.tre.2026.104710","url":null,"abstract":"<div><div>In warehouses, products are often not stored in their optimal positions, elongating retrieval and order picking time. A main reason is that storage assignment is based on historical demand frequency, whereas current demand patterns might just differ. However, as many warehouses are now automated or robotized, opportunities exist to dynamically and opportunistically reposition product loads based on real known demand and still reduce the makespan (the total time needed for retrieval, storage, and optional repositioning). We investigate the optimal retrieval of a known block of requests by explicitly additionally allowing in-between repositioning options. Surprisingly, in spite of the extra work and time involved, we show opportunistic repositioning may indeed be beneficial for reducing the makespan. We study the problem for two automated unit-load storage warehouses: automated storage and retrieval (AS/R) crane-based systems and robotic mobile fulfillment (RMF) systems, which have different travel metrics for the retrieval robots. The data-driven storage and repositioning (DDSR) problem, formulated as an integer linear program, leverages actual customer order data. The problem appears to be intractable for realistic systems due to the combinatorial nature of the possible repositions. We then reformulate the model, making it more tractable for moderate-sized problems. This model appears to beat real-life storage assignment heuristics like closest-open location assignment or demand-frequency class-based storage (even when these have full foresight of demand changes). The benefits appear to be around a 14%-30% shorter makespan, depending on the number of loads to be retrieved. For larger rack space utilization, the benefits decrease (since there are fewer options for repositioning). The method is sufficiently fast to be used in real warehouse systems, <em>e.g.</em>, by using a rolling horizon policy where repositions are calculated for the next block of requests while the current requests are executed. Our method offers managers an additional powerful tool to reduce system response time and thereby increase throughput capacity by smarter scheduling of their automated equipment and more efficient use of available storage space.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"208 ","pages":"Article 104710"},"PeriodicalIF":8.8,"publicationDate":"2026-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146072515","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

Drone scheduling optimization for continuous sea area monitoring 面向海域连续监测的无人机调度优化

IF 8.8 1区工程技术 Q1 ECONOMICS

Transportation Research Part E-Logistics and Transportation Review

Pub Date : 2026-01-27 DOI: 10.1016/j.tre.2026.104701

Yun Liu , Jun Xia , Zhou Xu

Drones equipped with industrial sensors offer a promising solution for environmental surveillance. This paper studies a new drone scheduling problem for sea area emission surveillance, where drones are utilized to monitor vessel emissions across a continuous sea area for a given planning horizon. The challenges of this optimization problem stem from the varying monitoring requirements within a continuous area due to vessel dynamics and the operational issues of drone deployment, such as multi-trip operations. To address these issues, we discretize the continuous sea area using hexagonal grids and represent the problem through a time-expanded network, resulting in a mixed-integer linear programming formulation for its optimization. To solve large-scale instances, we propose a Lagrangian relaxation-based approach enhanced with a customized lower bounding heuristic. Numerical experiments demonstrate that our approach is very effective and efficient in obtaining high-quality solutions. We conduct a real-world case study based on the Gulf of Mexico’s AIS data to examine the practical implementation of the proposed optimization tool. Furthermore, we investigate how the drone’s operational factors, including the sensor range, endurance, and operational flexibility, affect the monitoring performance.

配备工业传感器的无人机为环境监测提供了一个很有前途的解决方案。本文研究了一种新的用于海域排放监测的无人机调度问题，利用无人机在给定的规划视界内对连续海域的船舶排放进行监测。这一优化问题的挑战源于连续区域内不同的监测需求，这是由于船舶动力学和无人机部署的操作问题，例如多次作业。为了解决这些问题，我们使用六角形网格对连续海域进行离散化，并通过时间扩展网络表示问题，从而得到一个用于优化的混合整数线性规划公式。为了解决大规模实例，我们提出了一种基于拉格朗日松弛的方法，该方法增强了自定义的下边界启发式。数值实验表明，该方法能有效地获得高质量的解。我们基于墨西哥湾的AIS数据进行了实际案例研究，以检验所提出的优化工具的实际实施情况。此外，我们研究了无人机的操作因素，包括传感器范围，续航力和操作灵活性，如何影响监控性能。

{"title":"Drone scheduling optimization for continuous sea area monitoring","authors":"Yun Liu , Jun Xia , Zhou Xu","doi":"10.1016/j.tre.2026.104701","DOIUrl":"10.1016/j.tre.2026.104701","url":null,"abstract":"<div><div>Drones equipped with industrial sensors offer a promising solution for environmental surveillance. This paper studies a new drone scheduling problem for sea area emission surveillance, where drones are utilized to monitor vessel emissions across a continuous sea area for a given planning horizon. The challenges of this optimization problem stem from the varying monitoring requirements within a continuous area due to vessel dynamics and the operational issues of drone deployment, such as multi-trip operations. To address these issues, we discretize the continuous sea area using hexagonal grids and represent the problem through a time-expanded network, resulting in a mixed-integer linear programming formulation for its optimization. To solve large-scale instances, we propose a Lagrangian relaxation-based approach enhanced with a customized lower bounding heuristic. Numerical experiments demonstrate that our approach is very effective and efficient in obtaining high-quality solutions. We conduct a real-world case study based on the Gulf of Mexico’s AIS data to examine the practical implementation of the proposed optimization tool. Furthermore, we investigate how the drone’s operational factors, including the sensor range, endurance, and operational flexibility, affect the monitoring performance.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"208 ","pages":"Article 104701"},"PeriodicalIF":8.8,"publicationDate":"2026-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146072517","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 structure of global delay propagation in air transport 航空运输中全局延迟传播的结构

IF 8.8 1区工程技术 Q1 ECONOMICS

Transportation Research Part E-Logistics and Transportation Review

Pub Date : 2026-01-27 DOI: 10.1016/j.tre.2026.104688

Josu Blanco, Antònia Tugores, José J. Ramasco, Massimiliano Zanin

The modelling and understanding of how flight delays propagate between airports of a country or region is a major topic of research in air transport that has been tackled through different techniques in the last decade. Much less attention has been devoted to the large-scale structure of the propagation, i.e. if and how delays can propagate between regional networks and continents. By leveraging on two complementary analysis approaches, we show how such propagation takes place across the main world regions, describing how it is modulated by seasons, the number of flights connecting them and their relative distance. We further propose a methodology to detect which airports act as gateways for global-scale propagation, and discuss the operational applications of these findings.

模拟和理解航班延误如何在一个国家或地区的机场之间传播是航空运输研究的一个主要课题，在过去十年中已经通过不同的技术解决了这个问题。很少有人关注传播的大规模结构，即延迟是否以及如何在区域网络和大陆之间传播。通过利用两种互补的分析方法，我们展示了这种传播是如何在世界主要地区发生的，描述了它是如何被季节、连接它们的航班数量和它们的相对距离所调节的。我们进一步提出了一种方法来检测哪些机场充当全球规模传播的网关，并讨论了这些发现的操作应用。

引用次数: 0

Integrated approach for operations in robotic mobile fulfillment centers under order uncertainty 订单不确定性下机器人移动履约中心的集成操作方法

IF 8.8 1区工程技术 Q1 ECONOMICS

Transportation Research Part E-Logistics and Transportation Review

Pub Date : 2026-01-23 DOI: 10.1016/j.tre.2026.104683

Hatef Kiabakht, Mohsen S. Sajadieh

The rapid growth of e-commerce has significantly increased the complexity of warehouse operations, particularly in robotic mobile fulfillment centers (RMFCs), where decision-making under uncertain customer demand poses substantial challenges. This study proposes an integrated two-stage stochastic optimization model that jointly addresses item-to-pod assignment, pod positioning, order allocation, pod selection, and sequencing decisions. Item shortages are explicitly incorporated into the model to enhance operational robustness under demand uncertainty.

To manage the resulting computational complexity, we develop a prioritization-based item assignment strategy combined with a clustering-oriented order allocation mechanism, embedded within a tailored heuristic algorithm. Computational experiments show that the proposed heuristic achieves near-optimal performance on small-scale instances, with solution gaps of approximately 9–14% relative to exact solutions. For large-scale instances, the heuristic consistently outperforms the solver’s incumbent solutions by 9–29% and yields substantially better results than established metaheuristic benchmarks, including genetic algorithms and simulated annealing, whose deviations increase to 45–56% as problem size grows, while maintaining practical computation times.

Sensitivity analyses further demonstrate that increasing pod capacity and improving replenishment center placement can reduce robot travel distances by up to 30%. In addition, lower demand dispersion and structured item assignment significantly mitigate shortages and enhance overall system efficiency. Comparative experiments against sequential planning approaches confirm that the integrated stochastic framework delivers up to 20% reductions in robot travel under high demand variability, albeit at moderately higher computational cost.

From a managerial perspective, these improvements translate into substantial operational and economic benefits. Industry benchmarks suggest that even moderate reductions in robot travel distance (15–20%) can yield annual cost savings ranging from several hundred thousand dollars in medium-scale facilities to multi-million-dollar savings in large-scale RMFC deployments. Overall, the results highlight the strong practical value of integrated stochastic planning for improving efficiency and resilience in robotic fulfillment systems.

电子商务的快速发展大大增加了仓库运营的复杂性，特别是在机器人移动履行中心（rmfc）中，在不确定的客户需求下做出决策带来了巨大的挑战。本研究提出了一个集成的两阶段随机优化模型，该模型联合解决了物品到豆荚分配、豆荚定位、订单分配、豆荚选择和排序决策。在需求不确定的情况下，项目短缺被明确地纳入模型，以增强操作的鲁棒性。为了管理由此产生的计算复杂性，我们开发了一个基于优先级的项目分配策略，结合了一个面向聚类的顺序分配机制，嵌入在一个定制的启发式算法中。计算实验表明，所提出的启发式算法在小规模实例上达到了接近最优的性能，相对于精确解的解差约为9-14%。对于大规模实例，启发式始终比求解器的现有解决方案高出9-29%，并且产生的结果明显优于已建立的元启发式基准，包括遗传算法和模拟退火，其偏差随着问题规模的增长而增加到45-56%，同时保持实际计算时间。敏感性分析进一步表明，增加吊舱容量和改善补给中心的位置可以将机器人的移动距离减少多达30%。此外，较低的需求分散和结构化的项目分配显著缓解了短缺，提高了整体系统效率。与顺序规划方法的对比实验证实，在高需求可变性下，集成的随机框架可以将机器人的行程减少20%，尽管计算成本较高。从管理的角度来看，这些改进转化为实质性的操作和经济效益。行业基准表明，即使是机器人移动距离的适度减少（15-20%），每年也可以节省成本，从中等规模设施的数十万美元到大规模RMFC部署的数百万美元不等。总体而言，研究结果突出了集成随机规划在提高机器人履约系统效率和弹性方面的强大实用价值。

{"title":"Integrated approach for operations in robotic mobile fulfillment centers under order uncertainty","authors":"Hatef Kiabakht, Mohsen S. Sajadieh","doi":"10.1016/j.tre.2026.104683","DOIUrl":"10.1016/j.tre.2026.104683","url":null,"abstract":"<div><div>The rapid growth of e-commerce has significantly increased the complexity of warehouse operations, particularly in robotic mobile fulfillment centers (RMFCs), where decision-making under uncertain customer demand poses substantial challenges. This study proposes an integrated two-stage stochastic optimization model that jointly addresses item-to-pod assignment, pod positioning, order allocation, pod selection, and sequencing decisions. Item shortages are explicitly incorporated into the model to enhance operational robustness under demand uncertainty.</div><div>To manage the resulting computational complexity, we develop a prioritization-based item assignment strategy combined with a clustering-oriented order allocation mechanism, embedded within a tailored heuristic algorithm. Computational experiments show that the proposed heuristic achieves near-optimal performance on small-scale instances, with solution gaps of approximately 9–14% relative to exact solutions. For large-scale instances, the heuristic consistently outperforms the solver’s incumbent solutions by 9–29% and yields substantially better results than established metaheuristic benchmarks, including genetic algorithms and simulated annealing, whose deviations increase to 45–56% as problem size grows, while maintaining practical computation times.</div><div>Sensitivity analyses further demonstrate that increasing pod capacity and improving replenishment center placement can reduce robot travel distances by up to 30%. In addition, lower demand dispersion and structured item assignment significantly mitigate shortages and enhance overall system efficiency. Comparative experiments against sequential planning approaches confirm that the integrated stochastic framework delivers up to 20% reductions in robot travel under high demand variability, albeit at moderately higher computational cost.</div><div>From a managerial perspective, these improvements translate into substantial operational and economic benefits. Industry benchmarks suggest that even moderate reductions in robot travel distance (15–20%) can yield annual cost savings ranging from several hundred thousand dollars in medium-scale facilities to multi-million-dollar savings in large-scale RMFC deployments. Overall, the results highlight the strong practical value of integrated stochastic planning for improving efficiency and resilience in robotic fulfillment systems.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"208 ","pages":"Article 104683"},"PeriodicalIF":8.8,"publicationDate":"2026-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146033364","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 efficacy of decentralized disaster relief resource allocation within communities: The role of community-based sharing captains 社区内分散救灾资源分配的有效性：社区共享队长的作用

IF 8.8 1区工程技术 Q1 ECONOMICS

Transportation Research Part E-Logistics and Transportation Review

Pub Date : 2026-01-23 DOI: 10.1016/j.tre.2026.104690

Olivia Wang , Zhengyang Li , Cynthia Chen

Motivated by numerous observations that neighbors want to help and be helped by each other, this study investigates the feasibility of a decentralized resource allocation strategy where sharing captains distribute disaster relief resources within their community. Here sharing captains are residents themselves who step up during a disaster and take on the role of sharing/distributing resources with/to their neighbors. Using data from two socioeconomically different communities in Seattle, we simulate and compare the efficacy of the proposed decentralized strategy and the status quo fixed-point distribution method that relies on residents to come and get resources on their own. Our findings reveal that the decentralized approach significantly reduces residents’ deprivation costs (a measure on residents’ suffering due to resource shortage) and reaches 100% resource coverage faster than the fixed-point distribution strategy. For both communities, our experiments suggest that an effective range of sharing captains is between 30 and 40. Though the success of the decentralized strategy lies fundamentally on residents’ willingness to share, a satisfactory outcome can be reached even when a substantial share of residents (40%) are unwilling to share with anybody. This is in contrast to only 3% and 7% of the residents in these two communities who are found to be unwilling to share with anybody. Furthermore, sharing captains’ own biases in distributing resources appear to have a marginal effect on the resource allocation outcomes. On selecting sharing captains, a comprehensive strategy considering multiple factors (sharing preferences, number of social ties, and civic engagement) shall be adopted.

基于邻居之间相互帮助和相互帮助的愿望，本研究探讨了一种分散资源分配策略的可行性，即共享船长在其社区内分配救灾资源。这里的“分享队长”指的是居民自己，他们在灾难发生时挺身而出，承担起与邻居分享/分配资源的角色。利用来自西雅图两个社会经济状况不同的社区的数据，我们模拟并比较了所提出的分散策略和现状的依靠居民自己来获取资源的定点分配方法的效果。研究结果表明，与定点分配策略相比，分散式分配策略显著降低了居民的剥夺成本（衡量居民因资源短缺而遭受的痛苦），并更快地达到100%的资源覆盖。我们的实验表明，对于这两个社区来说，有效的共享船长范围在30到40人之间。虽然分散化策略的成功从根本上取决于居民的分享意愿，但即使有相当一部分居民（40%）不愿与任何人分享，也能取得令人满意的结果。相比之下，这两个社区中只有3%和7%的居民不愿意与任何人分享。此外，分享船长在分配资源方面的偏见似乎对资源配置结果具有边际效应。在选择共享船长时，应考虑多种因素（共享偏好、社会关系数量、公民参与）的综合策略。

{"title":"The efficacy of decentralized disaster relief resource allocation within communities: The role of community-based sharing captains","authors":"Olivia Wang , Zhengyang Li , Cynthia Chen","doi":"10.1016/j.tre.2026.104690","DOIUrl":"10.1016/j.tre.2026.104690","url":null,"abstract":"<div><div>Motivated by numerous observations that neighbors want to help and be helped by each other, this study investigates the feasibility of a decentralized resource allocation strategy where sharing captains distribute disaster relief resources within their community. Here sharing captains are residents themselves who step up during a disaster and take on the role of sharing/distributing resources with/to their neighbors. Using data from two socioeconomically different communities in Seattle, we simulate and compare the efficacy of the proposed decentralized strategy and the status quo fixed-point distribution method that relies on residents to come and get resources on their own. Our findings reveal that the decentralized approach significantly reduces residents’ deprivation costs (a measure on residents’ suffering due to resource shortage) and reaches 100% resource coverage faster than the fixed-point distribution strategy. For both communities, our experiments suggest that an effective range of sharing captains is between 30 and 40. Though the success of the decentralized strategy lies fundamentally on residents’ willingness to share, a satisfactory outcome can be reached even when a substantial share of residents (40%) are unwilling to share with anybody. This is in contrast to only 3% and 7% of the residents in these two communities who are found to be unwilling to share with anybody. Furthermore, sharing captains’ own biases in distributing resources appear to have a marginal effect on the resource allocation outcomes. On selecting sharing captains, a comprehensive strategy considering multiple factors (sharing preferences, number of social ties, and civic engagement) shall be adopted.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"208 ","pages":"Article 104690"},"PeriodicalIF":8.8,"publicationDate":"2026-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146033361","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

Enhanced column-and-constraint generation algorithm for robust logistics network design problem with capacity sharing 容量共享鲁棒物流网络设计问题的改进列约束生成算法

IF 8.8 1区工程技术 Q1 ECONOMICS

Transportation Research Part E-Logistics and Transportation Review

Pub Date : 2026-01-23 DOI: 10.1016/j.tre.2026.104699

Hongtao Hu , Kejian Jiang , Zhu Wang , Jia Shu

Achieving robustness has become an essential issue due to the significant volatility of the logistics networks. Current works prioritize the demand uncertainty, but not sufficiently consider the financial budget uncertainty in warehousing. This deficiency renders the collaborators with weak financial endurance intractable to maintain the scheme robustness, impairing the overall network resilience. Therefore, inspired by the Nash equilibrium, a logistics network design method focusing on capacity sharing is proposed. This method allows participants to share capacity in the distribution centers, improving resilience and reducing costs. Firstly, a two-stage robust model considering the uncertainty of demand and financial budget is established to minimize the operating costs of the logistics network. Then, the Nash equilibrium-based constraints are incorporated into the model to ensure a fair distribution of benefits and costs among participants. Subsequently, a two-stage method is designed with an enhanced column and constraint generation algorithm (C

&

CG) using optimal cut, and reverse Nash equilibrium-based constraints are proposed for the worst financial condition. The effectiveness of the algorithm and model is verified through a series of numerical benchmarks and sensitivity analysis for Nash equilibrium-based constraints, sharing restrictions, uncertainty of demand and financial budget. The results show that the proposed method is efficient and flexible when incorporating capacity sharing and highlighting the influence of the Nash equilibrium-based constraints. Finally, it presents that the Nash equilibrium-based constraints are more suitable for logistics networks through sharing alliances.

由于物流网络的显著波动性，实现稳健性已成为一个重要问题。目前的工作优先考虑需求的不确定性，但没有充分考虑仓储财务预算的不确定性。这使得财务承受能力较弱的协作者难以维持方案的鲁棒性，从而损害了整个网络的弹性。因此，受纳什均衡的启发，提出了一种以容量共享为中心的物流网络设计方法。这种方法允许参与者在配送中心共享容量，提高弹性并降低成本。首先，建立了考虑需求不确定性和财务预算不确定性的两阶段鲁棒模型，使物流网络的运营成本最小化。然后，在模型中引入基于纳什均衡的约束，以确保参与者之间的收益和成本公平分配。随后，设计了一种采用最优切割的增强型列约束生成算法（C&；CG）的两阶段方法，并针对最坏财务状况提出了基于反向纳什均衡的约束。通过对基于纳什均衡约束、共享约束、需求不确定性和财务预算的一系列数值基准和敏感性分析，验证了算法和模型的有效性。结果表明，该方法在考虑容量共享的同时，突出了纳什均衡约束的影响，具有较高的效率和灵活性。最后，提出了基于纳什均衡的约束更适用于共享联盟的物流网络。

{"title":"Enhanced column-and-constraint generation algorithm for robust logistics network design problem with capacity sharing","authors":"Hongtao Hu , Kejian Jiang , Zhu Wang , Jia Shu","doi":"10.1016/j.tre.2026.104699","DOIUrl":"10.1016/j.tre.2026.104699","url":null,"abstract":"<div><div>Achieving robustness has become an essential issue due to the significant volatility of the logistics networks. Current works prioritize the demand uncertainty, but not sufficiently consider the financial budget uncertainty in warehousing. This deficiency renders the collaborators with weak financial endurance intractable to maintain the scheme robustness, impairing the overall network resilience. Therefore, inspired by the Nash equilibrium, a logistics network design method focusing on capacity sharing is proposed. This method allows participants to share capacity in the distribution centers, improving resilience and reducing costs. Firstly, a two-stage robust model considering the uncertainty of demand and financial budget is established to minimize the operating costs of the logistics network. Then, the Nash equilibrium-based constraints are incorporated into the model to ensure a fair distribution of benefits and costs among participants. Subsequently, a two-stage method is designed with an enhanced column and constraint generation algorithm (C<span><math><mo>&</mo></math></span>CG) using optimal cut, and reverse Nash equilibrium-based constraints are proposed for the worst financial condition. The effectiveness of the algorithm and model is verified through a series of numerical benchmarks and sensitivity analysis for Nash equilibrium-based constraints, sharing restrictions, uncertainty of demand and financial budget. The results show that the proposed method is efficient and flexible when incorporating capacity sharing and highlighting the influence of the Nash equilibrium-based constraints. Finally, it presents that the Nash equilibrium-based constraints are more suitable for logistics networks through sharing alliances.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"208 ","pages":"Article 104699"},"PeriodicalIF":8.8,"publicationDate":"2026-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146033363","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