首页 > 最新文献

Transportation Research Part E-Logistics and Transportation Review最新文献

英文 中文
Morning commute in a Y-shaped traffic network with early and late arrivals 早间通勤呈y型交通网络,有早到和晚到
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-11-20 DOI: 10.1016/j.tre.2025.104501
Dongdong He , Yuanyuan Li , Tianjia Yang , Jianjun Wu , Xianbiao Hu
This paper studies the morning commute problem when both early and late arrivals are considered in a Y-shaped network with two upstream links and a downstream link. Commuters from one origin pass through an upstream bottleneck with a limited capacity and then traverse the downstream bottleneck common to commuters from two origins before arriving at their workplace in the central business district (CBD). We aim to examine the queuing patterns at user equilibrium and provide policy guidance on improving social welfare under different scenarios. First, we analytically characterize the equilibrium travel patterns of two commuter groups in a Y-shaped network, allowing both early and late arrivals. Based on the given bottleneck capacities and demand distributions, we identify the conditions under which each equilibrium pattern emerges. Second, we explore commuters’ schedule preferences and queuing patterns at the upstream bottleneck under user equilibrium. Third, we investigate strategies to improve social welfare through capacity management interventions, including capacity expansion, ramp metering, and adjustments to spatial demand distribution. Our results show that expanding the downstream bottleneck capacity consistently improves system performance when the demand and capacity ratios are not large. The effectiveness of upstream capacity management also depends on the demand and capacity ratios between the two bottlenecks. Given the demand ratio, we derive the optimal ramp metering strategy that minimizes the total travel cost. Notably, this strategy equalizes the upstream and downstream capacities when the demand ratio is low. Furthermore, when bottleneck capacities are fixed, combining spatial demand redistribution with capacity management at the upstream bottleneck (i.e., ramp metering or capacity expansion) can lead to improvements in social welfare. Finally, we illustrate the main analytical results with numerical analysis.
本文研究了具有两条上游链路和一条下游链路的y型网络中,同时考虑早到站和晚到站的早晨通勤问题。来自一个地方的通勤者要经过一个容量有限的上游瓶颈,然后再穿过下游瓶颈,这是来自两个地方的通勤者在到达他们位于中央商务区(CBD)的工作场所之前所遇到的。本文旨在研究用户均衡下的排队模式,为不同情景下改善社会福利提供政策指导。首先,我们分析了一个y型网络中两个通勤群体的均衡出行模式,允许早到和晚到。基于给定的瓶颈容量和需求分布,我们确定了每种均衡模式出现的条件。其次,研究了用户均衡下上下游瓶颈处通勤者的出行偏好和排队模式。第三,我们研究了通过容量管理干预措施改善社会福利的策略,包括容量扩张、匝道计量和空间需求分布的调整。我们的研究结果表明,当需求和容量比不大时,扩大下游瓶颈容量可以持续改善系统性能。上游容量管理的有效性还取决于两个瓶颈之间的需求和容量比率。给定需求比,我们推导出最优匝道计量策略,使总出行成本最小化。值得注意的是,该策略在需求比较低时均衡了上游和下游的产能。此外,当瓶颈容量固定时,将空间需求再分配与上游瓶颈的容量管理(即匝道计量或容量扩张)相结合可以改善社会福利。最后,对主要分析结果进行了数值分析。
{"title":"Morning commute in a Y-shaped traffic network with early and late arrivals","authors":"Dongdong He ,&nbsp;Yuanyuan Li ,&nbsp;Tianjia Yang ,&nbsp;Jianjun Wu ,&nbsp;Xianbiao Hu","doi":"10.1016/j.tre.2025.104501","DOIUrl":"10.1016/j.tre.2025.104501","url":null,"abstract":"<div><div>This paper studies the morning commute problem when both early and late arrivals are considered in a Y-shaped network with two upstream links and a downstream link. Commuters from one origin pass through an upstream bottleneck with a limited capacity and then traverse the downstream bottleneck common to commuters from two origins before arriving at their workplace in the central business district (CBD). We aim to examine the queuing patterns at user equilibrium and provide policy guidance on improving social welfare under different scenarios. First, we analytically characterize the equilibrium travel patterns of two commuter groups in a Y-shaped network, allowing both early and late arrivals. Based on the given bottleneck capacities and demand distributions, we identify the conditions under which each equilibrium pattern emerges. Second, we explore commuters’ schedule preferences and queuing patterns at the upstream bottleneck under user equilibrium. Third, we investigate strategies to improve social welfare through capacity management interventions, including capacity expansion, ramp metering, and adjustments to spatial demand distribution. Our results show that expanding the downstream bottleneck capacity consistently improves system performance when the demand and capacity ratios are not large. The effectiveness of upstream capacity management also depends on the demand and capacity ratios between the two bottlenecks. Given the demand ratio, we derive the optimal ramp metering strategy that minimizes the total travel cost. Notably, this strategy equalizes the upstream and downstream capacities when the demand ratio is low. Furthermore, when bottleneck capacities are fixed, combining spatial demand redistribution with capacity management at the upstream bottleneck (i.e., ramp metering or capacity expansion) can lead to improvements in social welfare. Finally, we illustrate the main analytical results with numerical analysis.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"206 ","pages":"Article 104501"},"PeriodicalIF":8.8,"publicationDate":"2025-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145555464","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
Cooperative mechanisms for shared power equipment warehousing among new energy power generation enterprises in China’s new power system: A study based on a quantum game theory approach 中国新电力系统中新能源发电企业共享电力设备仓储合作机制——基于量子博弈论方法的研究
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-11-20 DOI: 10.1016/j.tre.2025.104514
Zhifeng Shen , Yongming Ye , Khan Faiz Ahmed , Aftab Ali , Minhas Asim , Guanghui Wang
Large-scale cooperation among new energy power generation enterprises to jointly establish shared warehousing can significantly reduce power equipment warehousing costs and enhance emergency response capacity. However, due to the competitive nature of technology secrecy and trust deficits, such enterprises often fall into a “prisoner’s dilemma,” hindering true large-scale cooperation. While the infinitely repeated game (Folk Theorem) in classical game theory theoretically resolves the “prisoner’s dilemma,” in practice, enterprises can hardly establish long-term, stable repeated relationships for shared warehousing, which limits its feasibility. To resolve this practical dilemma, this study introduces quantum game theory and constructs a quantum game model for shared warehousing cooperation among new energy power generation enterprises, aiming to achieve cooperation in a single round. Through theoretical derivation and numerical simulation, this study finds: (1) With maximum objective entanglement, if one enterprise adopts a fully quantum strategy, the other needs to employ it only with a cooperative tendency for the single-round quantum game to reach a unique Nash equilibrium and Pareto optimal point. (2) Further evolutionary game analysis indicates that, based on this, the evolution of the industry group also invariably exhibits a unique Evolutionarily Stable Strategy (ESS): full-scale cooperation across all participants. Based on these findings, this study proposes: (1) Enterprises should strengthen strategic mutual trust by signing “entanglement contracts”; (2) Smart logistics technologies should be vigorously applied to achieve “entanglement” at the data level; (3) Industry-level platform development should be strengthened; and (4) Governments and the State Grid Corporation should provide proactive guidance. This study not only offers new pathways for cost reduction and efficiency enhancement in the new energy power generation sector at the logistics level but, more importantly, also reveals that quantum game theory—as a novel cooperative mechanism beyond classical game frameworks—provides a revolutionary theoretical perspective and methodological approach for addressing the “trust deficit” challenge in real-world economic management.
新能源发电企业之间大规模合作,共同建立共享仓储,可以显著降低电力设备仓储成本,增强应急响应能力。然而,由于技术保密的竞争性和信任赤字,这类企业往往陷入“囚徒困境”,阻碍了真正的大规模合作。经典博弈论中的无限重复博弈(Folk定理)在理论上解决了“囚徒困境”,但在实践中,企业很难建立长期稳定的共享仓储重复关系,限制了共享仓储的可行性。为解决这一现实困境,本研究引入量子博弈论,构建新能源发电企业共享仓储合作的量子博弈模型,以实现一轮合作为目标。通过理论推导和数值模拟,本研究发现:(1)在目标纠缠最大的情况下,如果一方企业采用全量子策略,另一方企业只需要在有合作倾向的情况下采用全量子策略,就可以使单轮量子博弈达到唯一的纳什均衡和帕累托最优点。(2)进一步的演化博弈分析表明,在此基础上,产业集团的演化也必然呈现出一种独特的演化稳定策略:所有参与者的全面合作。基于以上研究结果,本研究提出:(1)企业应通过签订“纠缠契约”加强战略互信;(2)大力应用智慧物流技术,实现数据层面的“纠缠”;(3)加强行业级平台开发;(4)政府和国家电网公司应积极引导。本研究不仅为物流层面的新能源发电领域降低成本和提高效率提供了新的途径,更重要的是揭示了量子博弈论作为一种超越经典博弈框架的新型合作机制,为解决现实世界经济管理中的“信任赤字”挑战提供了革命性的理论视角和方法途径。
{"title":"Cooperative mechanisms for shared power equipment warehousing among new energy power generation enterprises in China’s new power system: A study based on a quantum game theory approach","authors":"Zhifeng Shen ,&nbsp;Yongming Ye ,&nbsp;Khan Faiz Ahmed ,&nbsp;Aftab Ali ,&nbsp;Minhas Asim ,&nbsp;Guanghui Wang","doi":"10.1016/j.tre.2025.104514","DOIUrl":"10.1016/j.tre.2025.104514","url":null,"abstract":"<div><div>Large-scale cooperation among new energy power generation enterprises to jointly establish shared warehousing can significantly reduce power equipment warehousing costs and enhance emergency response capacity. However, due to the competitive nature of technology secrecy and trust deficits, such enterprises often fall into a “prisoner’s dilemma,” hindering true large-scale cooperation. While the infinitely repeated game (Folk Theorem) in classical game theory theoretically resolves the “prisoner’s dilemma,” in practice, enterprises can hardly establish long-term, stable repeated relationships for shared warehousing, which limits its feasibility. To resolve this practical dilemma, this study introduces quantum game theory and constructs a quantum game model for shared warehousing cooperation among new energy power generation enterprises, aiming to achieve cooperation in a single round. Through theoretical derivation and numerical simulation, this study finds: (1) With maximum objective entanglement, if one enterprise adopts a fully quantum strategy, the other needs to employ it only with a cooperative tendency for the single-round quantum game to reach a unique Nash equilibrium and Pareto optimal point. (2) Further evolutionary game analysis indicates that, based on this, the evolution of the industry group also invariably exhibits a unique Evolutionarily Stable Strategy (ESS): full-scale cooperation across all participants. Based on these findings, this study proposes: (1) Enterprises should strengthen strategic mutual trust by signing “entanglement contracts”; (2) Smart logistics technologies should be vigorously applied to achieve “entanglement” at the data level; (3) Industry-level platform development should be strengthened; and (4) Governments and the State Grid Corporation should provide proactive guidance. This study not only offers new pathways for cost reduction and efficiency enhancement in the new energy power generation sector at the logistics level but, more importantly, also reveals that quantum game theory—as a novel cooperative mechanism beyond classical game frameworks—provides a revolutionary theoretical perspective and methodological approach for addressing the “trust deficit” challenge in real-world economic management.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"206 ","pages":"Article 104514"},"PeriodicalIF":8.8,"publicationDate":"2025-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145555364","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
Unlocking the potential: hybrid blockchain and AI-enabled traceability model development and implementation in the dairy industry – proof-of-concept 释放潜力:混合区块链和人工智能可追溯性模型在乳制品行业的开发和实施-概念验证
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-11-14 DOI: 10.1016/j.tre.2025.104552
Mohit Malik , Rahul S Mor , Vijay Kumar Gahlawat , Vikas Kumar
Conventional traceability systems without real-time information transmission are susceptible to tampering. In contrast, blockchain and artificial intelligence (AI)-enabled traceability models offer transparency and accountability, given their decentralized nature and immutability. This research conceptualizes and develops a hybrid blockchain and AI-enabled traceability (prototype) model and implements it in the dairy industry. The study includes a collaborative research methodology, including a literature review to analyze the existing traceability solutions, identify data entry points, select model requirements, and deploy smart contracts, decentralized applications (Dapps) and Web3 technologies to develop and validate the proposed model via Testnet. The findings present the user interface developed as a prototype traceability model and its characteristics, such as transparency, decentralized nature, and immutability, followed by practical validation. The post-implementation data analysis highlighted the security, privacy, smart contract validation rules, and comparative insights, as well as the alignment of the theoretical model with practical applications using Web3 technologies. This research contributes to the literature on hybrid blockchain and AI-enabled traceability, highlighting the potential for exploring opportunities in the food industry.
没有实时信息传输的传统溯源系统容易被篡改。相比之下,区块链和人工智能(AI)支持的可追溯性模型提供了透明度和问责制,因为它们具有分散性和不可变性。本研究概念化并开发了一个混合区块链和人工智能支持的可追溯性(原型)模型,并在乳制品行业中实施。该研究包括一种协作研究方法,包括文献综述,以分析现有的可追溯性解决方案,确定数据入口点,选择模型需求,并部署智能合约,分散应用程序(Dapps)和Web3技术,通过Testnet开发和验证拟议的模型。研究结果展示了作为原型可追溯性模型开发的用户界面及其特征,如透明度、分散性和不变性,随后进行了实际验证。实施后的数据分析强调了安全性、隐私性、智能合约验证规则和比较见解,以及使用Web3技术的理论模型与实际应用的一致性。这项研究为关于混合区块链和人工智能可追溯性的文献做出了贡献,突出了在食品行业探索机会的潜力。
{"title":"Unlocking the potential: hybrid blockchain and AI-enabled traceability model development and implementation in the dairy industry – proof-of-concept","authors":"Mohit Malik ,&nbsp;Rahul S Mor ,&nbsp;Vijay Kumar Gahlawat ,&nbsp;Vikas Kumar","doi":"10.1016/j.tre.2025.104552","DOIUrl":"10.1016/j.tre.2025.104552","url":null,"abstract":"<div><div>Conventional traceability systems without real-time information transmission are susceptible to tampering. In contrast, blockchain and artificial intelligence (AI)-enabled traceability models offer transparency and accountability, given their decentralized nature and immutability. This research conceptualizes and develops a hybrid blockchain and AI-enabled traceability (prototype) model and implements it in the dairy industry. The study includes a collaborative research methodology, including a literature review to analyze the existing traceability solutions, identify data entry points, select model requirements, and deploy smart contracts, decentralized applications (Dapps) and Web3 technologies to develop and validate the proposed model via <em>Testnet</em>. The findings present the user interface developed as a prototype traceability model and its characteristics, such as transparency, decentralized nature, and immutability, followed by practical validation. The post-implementation data analysis highlighted the security, privacy, smart contract validation rules, and comparative insights, as well as the alignment of the theoretical model with practical applications using Web3 technologies. This research contributes to the literature on hybrid blockchain and AI-enabled traceability, highlighting the potential for exploring opportunities in the food industry.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"205 ","pages":"Article 104552"},"PeriodicalIF":8.8,"publicationDate":"2025-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145520167","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
A continuum approximation approach for designing corridor-based heterogeneous transit service using modular autonomous vehicles 采用模块化自动驾驶车辆设计基于走廊的异构交通服务的连续统近似方法
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-11-13 DOI: 10.1016/j.tre.2025.104512
Xiaoling Luo , Wenbo Fan , Yongxiang Zhang , Andrea D’Ariano , Tommaso Bosi , Yuan Liu , Wei Wu , Xiaofeng Li
The conventional bus service struggles to efficiently accommodate heterogeneous demand due to the rigid design with fixed vehicle capacity. The advent of modular automated vehicles (MAVs), which can dynamically couple or decouple into variable transit units, offers a novel operation mode with variable transport capacity to respond to demand heterogeneity. To enhance the performance of MAV-based transit corridors, where MAVs can only couple or decouple at certain stations due to space constraints, this study employs the continuum approximation (CA) approach in developing an optimization model aimed at minimizing both patrons’ and agency costs. The problem is split into two: subproblem (1) ordinary operation decisions to determine the locations of ordinary stations and service headway; and subproblem (2) (de)coupling operation decisions to determine the locations of (de)coupling stations, the capacity of (de)coupling stations, and the number of en-route coupling/decoupling MAVs. The closed-form solutions are derived for the subproblem (1) and several linearization techniques are employed to convert the original nonlinear problem (2) into a linear form. To evaluate the proposed model, a hypothetical corridor with heterogeneous demand is examined. We initially compare the CA results with the feasible design after discretization, demonstrating that the approximation errors by the CA approach are acceptable with a maximum deviation of less than 3.40%. In addition, the proposed model can obtain cost savings of 10.60 and 2.01 mins/patron compared to fixed-capacity bus service and two-stage designs (the ordinary operation decisions and (de)coupling operation decisions are optimized separately). The results indicate the effectiveness of adopting MAVs and the necessity of joint design for both ordinary operation and (de)coupling operation decisions. Sensitivity analysis is performed in terms of the demand level, the unit cost of the (de)coupling station, the unit operating cost, and MAV capacity. Finally, we use a real-world case study in Chengdu, China, to demonstrate the application of the proposed model in practice.
传统的公交服务由于其固定载客量的刚性设计,难以有效地满足异构需求。模块化自动驾驶车辆(MAVs)的出现,可以动态耦合或解耦成可变的运输单元,提供了一种具有可变运输能力的新型运营模式,以应对需求的异质性。由于空间限制,MAVs只能在某些站点耦合或解耦,为了提高基于MAVs的交通走廊的性能,本研究采用连续体近似(CA)方法开发了一个优化模型,旨在最大限度地降低顾客和代理成本。该问题分为两个子问题(1)普通运营决策,确定普通站点的位置和服务车头时距;子问题(2)解耦操作决策,确定解耦站的位置、解耦站的容量以及途中耦合/解耦mav的数量。导出了子问题(1)的闭型解,并利用几种线性化技术将原非线性问题(2)转化为线性形式。为了评估所提出的模型,我们考察了一个具有异质需求的假设走廊。我们将离散化后的CA结果与可行设计进行了初步比较,结果表明,CA方法的近似误差是可以接受的,最大偏差小于3.40%。此外,与固定容量公交服务和两阶段设计相比(分别优化了普通运营决策和(去)耦合运营决策),所提模型可获得10.60和2.01 min /乘客的成本节约。结果表明,在常规运行和(非)耦合运行决策中,采用mav的有效性和联合设计的必要性。根据需求水平、(解)耦站单位成本、单位运行成本和MAV容量进行敏感性分析。最后,我们以中国成都的实际案例为例,验证了该模型在实践中的应用。
{"title":"A continuum approximation approach for designing corridor-based heterogeneous transit service using modular autonomous vehicles","authors":"Xiaoling Luo ,&nbsp;Wenbo Fan ,&nbsp;Yongxiang Zhang ,&nbsp;Andrea D’Ariano ,&nbsp;Tommaso Bosi ,&nbsp;Yuan Liu ,&nbsp;Wei Wu ,&nbsp;Xiaofeng Li","doi":"10.1016/j.tre.2025.104512","DOIUrl":"10.1016/j.tre.2025.104512","url":null,"abstract":"<div><div>The conventional bus service struggles to efficiently accommodate heterogeneous demand due to the rigid design with fixed vehicle capacity. The advent of modular automated vehicles (MAVs), which can dynamically couple or decouple into variable transit units, offers a novel operation mode with variable transport capacity to respond to demand heterogeneity. To enhance the performance of MAV-based transit corridors, where MAVs can only couple or decouple at certain stations due to space constraints, this study employs the continuum approximation (CA) approach in developing an optimization model aimed at minimizing both patrons’ and agency costs. The problem is split into two: subproblem (1) ordinary operation decisions to determine the locations of ordinary stations and service headway; and subproblem (2) (de)coupling operation decisions to determine the locations of (de)coupling stations, the capacity of (de)coupling stations, and the number of en-route coupling/decoupling MAVs. The closed-form solutions are derived for the subproblem (1) and several linearization techniques are employed to convert the original nonlinear problem (2) into a linear form. To evaluate the proposed model, a hypothetical corridor with heterogeneous demand is examined. We initially compare the CA results with the feasible design after discretization, demonstrating that the approximation errors by the CA approach are acceptable with a maximum deviation of less than 3.40%. In addition, the proposed model can obtain cost savings of 10.60 and 2.01 mins/patron compared to fixed-capacity bus service and two-stage designs (the ordinary operation decisions and (de)coupling operation decisions are optimized separately). The results indicate the effectiveness of adopting MAVs and the necessity of joint design for both ordinary operation and (de)coupling operation decisions. Sensitivity analysis is performed in terms of the demand level, the unit cost of the (de)coupling station, the unit operating cost, and MAV capacity. Finally, we use a real-world case study in Chengdu, China, to demonstrate the application of the proposed model in practice.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"205 ","pages":"Article 104512"},"PeriodicalIF":8.8,"publicationDate":"2025-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145520168","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
An integrated optimization approach for e-order fulfillment using self-owned and crowdsourced delivery 一个集成的优化方法,为电子订单履行使用自有和众包交付
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-11-12 DOI: 10.1016/j.tre.2025.104505
Dapei Jiang , Xiangyong Li , Wei Yang , Yuxuan Zhao
In this paper, we investigate the e-order fulfillment problem with crowdsourced delivery personnel (EOFP-CDP), which aims to enhance order fulfillment performance by integrating crowdsourced delivery with self-owned logistics. We begin by presenting a mixed-integer programming formulation that enables the determination of optimal solutions for small-scale instances, capturing the complexities of the problem. We then propose a heuristic algorithm that combines adaptive large neighborhood search with variable neighborhood search. Through extensive experiments, we demonstrate the effectiveness of this algorithm in improving e-order fulfillment performance. We also conduct a comprehensive sensitivity analysis to examine the impact of crowdsourced delivery on e-order fulfillment. Specifically, we explore the role of key cost factors–such as travel, loading, and time costs–associated with crowdsourced delivery personnel and their influence on fulfillment outcomes. Finally, a case study based on JD.com validates the practical advantages of the consolidation-delivery mode within e-tailer fulfillment systems.
本文以众包配送人员(EOFP-CDP)为研究对象,通过将众包配送与自有物流相结合来提高订单履行绩效。我们首先提出一个混合整数规划公式,该公式能够确定小规模实例的最佳解决方案,从而捕获问题的复杂性。然后,我们提出了一种将自适应大邻域搜索与可变邻域搜索相结合的启发式算法。通过大量的实验,我们证明了该算法在提高电子订单履行性能方面的有效性。我们还进行了全面的敏感性分析,以检验众包交付对电子订单履行的影响。具体来说,我们探讨了关键成本因素的作用,例如与众包交付人员相关的差旅、装载和时间成本,以及它们对履行结果的影响。最后,以京东为例,验证了整合配送模式在电子零售商配送系统中的实际优势。
{"title":"An integrated optimization approach for e-order fulfillment using self-owned and crowdsourced delivery","authors":"Dapei Jiang ,&nbsp;Xiangyong Li ,&nbsp;Wei Yang ,&nbsp;Yuxuan Zhao","doi":"10.1016/j.tre.2025.104505","DOIUrl":"10.1016/j.tre.2025.104505","url":null,"abstract":"<div><div>In this paper, we investigate the e-order fulfillment problem with crowdsourced delivery personnel (EOFP-CDP), which aims to enhance order fulfillment performance by integrating crowdsourced delivery with self-owned logistics. We begin by presenting a mixed-integer programming formulation that enables the determination of optimal solutions for small-scale instances, capturing the complexities of the problem. We then propose a heuristic algorithm that combines adaptive large neighborhood search with variable neighborhood search. Through extensive experiments, we demonstrate the effectiveness of this algorithm in improving e-order fulfillment performance. We also conduct a comprehensive sensitivity analysis to examine the impact of crowdsourced delivery on e-order fulfillment. Specifically, we explore the role of key cost factors–such as travel, loading, and time costs–associated with crowdsourced delivery personnel and their influence on fulfillment outcomes. Finally, a case study based on JD.com validates the practical advantages of the consolidation-delivery mode within e-tailer fulfillment systems.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"205 ","pages":"Article 104505"},"PeriodicalIF":8.8,"publicationDate":"2025-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145515634","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
AIRCREWSCHED: A meta review of aircrew scheduling and its research challenges AIRCREWSCHED:机组调度及其研究挑战的meta综述
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-11-11 DOI: 10.1016/j.tre.2025.104525
Xiaoqian Sun , Yuanfei Leng , Guohua Wu , Simeng Yan , Sebastian Wandelt
Aircrew scheduling is an important part of the aviation industry. As airline networks expand and operational models evolve, crew scheduling becomes more complex and challenging, requiring the development and application advanced optimization techniques. Given the diverse nature of this field, covering aspects of air transport management, computer science, and operations research, synthesizing the state of the art and identify important research gaps, is often problematic. In this study, we provide a meta review on survey and overview papers in the field. As part of our comprehensive dissection of the extant literature, we introduce the AIRCREWSCHED framework, which encapsulates twelve essential research challenges that have emerged through our meta review on aircrew scheduling, covering, among others, aspects of artificial intelligence, integration, resource sharing mechanisms, crew individuality, and sustainability considerations. We believe that our meta review aids the community to make orchestrated efforts in advancing aircrew scheduling.
机组调度是航空事业的重要组成部分。随着航空公司网络的扩展和运营模式的发展,机组调度变得更加复杂和具有挑战性,需要开发和应用先进的优化技术。考虑到这一领域的多样性,涵盖航空运输管理、计算机科学和运筹学的各个方面,综合最先进的技术并确定重要的研究差距,往往是有问题的。在本研究中,我们对该领域的调查和综述论文进行了meta综述。作为我们对现有文献的全面剖析的一部分,我们介绍了AIRCREWSCHED框架,该框架概括了通过我们对机组调度的元综述出现的12个基本研究挑战,其中包括人工智能、集成、资源共享机制、机组个性和可持续性考虑等方面。我们相信,我们的meta审查有助于社区在推进机组调度方面做出精心安排的努力。
{"title":"AIRCREWSCHED: A meta review of aircrew scheduling and its research challenges","authors":"Xiaoqian Sun ,&nbsp;Yuanfei Leng ,&nbsp;Guohua Wu ,&nbsp;Simeng Yan ,&nbsp;Sebastian Wandelt","doi":"10.1016/j.tre.2025.104525","DOIUrl":"10.1016/j.tre.2025.104525","url":null,"abstract":"<div><div>Aircrew scheduling is an important part of the aviation industry. As airline networks expand and operational models evolve, crew scheduling becomes more complex and challenging, requiring the development and application advanced optimization techniques. Given the diverse nature of this field, covering aspects of air transport management, computer science, and operations research, synthesizing the state of the art and identify important research gaps, is often problematic. In this study, we provide a meta review on survey and overview papers in the field. As part of our comprehensive dissection of the extant literature, we introduce the AIRCREWSCHED framework, which encapsulates twelve essential research challenges that have emerged through our meta review on aircrew scheduling, covering, among others, aspects of artificial intelligence, integration, resource sharing mechanisms, crew individuality, and sustainability considerations. We believe that our meta review aids the community to make orchestrated efforts in advancing aircrew scheduling.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"205 ","pages":"Article 104525"},"PeriodicalIF":8.8,"publicationDate":"2025-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145498736","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
On the satisfaction function of random utility models: A theoretical review with new developments in weibit-based choice models 关于随机实用新型的满意函数:基于wei比特的选择模型新进展的理论回顾
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-11-10 DOI: 10.1016/j.tre.2025.104523
Yu Gu , Anthony Chen , Songyot Kitthamkesorn
This study presents a theoretical review of the satisfaction function, the expected maximum utility or minimum disutility of travel choices, which plays an important role in the random utility theory and has wide applications in transportation system analyses. New developments in the satisfaction function of the recently developed weibit-based multiplicative random utility models are discussed and compared with the extensively studied logsum-type satisfaction function derived from logit-based models. A characterization of weibit-based choice probabilities is established based on the weibit-based satisfaction function, which is shown to be a multiplicative analogue of the well-known relationship between logit-based choice probabilities and logsum-type satisfaction functions. A comparison with the conventional logit-based satisfaction function is made, from which we show that the weibit-based satisfaction function is inherently more appropriate for reflecting the percentage variation in disutility. Furthermore, potential applications of the weibit-based satisfaction function are illustrated, including weibit-based choice probability generation, utility-based accessibility measurement, and accessibility-based vulnerability analysis.
本文对出行选择的期望最大效用或最小负效用的满意函数进行了理论综述,该函数在随机效用理论中占有重要地位,在交通系统分析中有着广泛的应用。讨论了最近发展的基于微比特的乘法型随机实用模型的满意度函数的新进展,并与广泛研究的基于对数模型的对数型满意度函数进行了比较。基于weibit的满意函数建立了基于weibit的选择概率的表征,它被证明是众所周知的基于logit的选择概率与logsum类型的满意函数之间关系的乘法模拟。通过与传统的基于对数的满意度函数的比较,我们发现基于微比特的满意度函数本质上更适合反映负效用的百分比变化。进一步阐述了基于微位的满意度函数的潜在应用,包括基于微位的选择概率生成、基于效用的可达性度量和基于可达性的脆弱性分析。
{"title":"On the satisfaction function of random utility models: A theoretical review with new developments in weibit-based choice models","authors":"Yu Gu ,&nbsp;Anthony Chen ,&nbsp;Songyot Kitthamkesorn","doi":"10.1016/j.tre.2025.104523","DOIUrl":"10.1016/j.tre.2025.104523","url":null,"abstract":"<div><div>This study presents a theoretical review of the satisfaction function, the expected maximum utility or minimum disutility of travel choices, which plays an important role in the random utility theory and has wide applications in transportation system analyses. New developments in the satisfaction function of the recently developed weibit-based multiplicative random utility models are discussed and compared with the extensively studied logsum-type satisfaction function derived from logit-based models. A characterization of weibit-based choice probabilities is established based on the weibit-based satisfaction function, which is shown to be a multiplicative analogue of the well-known relationship between logit-based choice probabilities and logsum-type satisfaction functions. A comparison with the conventional logit-based satisfaction function is made, from which we show that the weibit-based satisfaction function is inherently more appropriate for reflecting the percentage variation in disutility. Furthermore, potential applications of the weibit-based satisfaction function are illustrated, including weibit-based choice probability generation, utility-based accessibility measurement, and accessibility-based vulnerability analysis.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"205 ","pages":"Article 104523"},"PeriodicalIF":8.8,"publicationDate":"2025-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145478187","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
Internet of things platform encroachment and manufacturer product selection strategy:The role of technology level and data value 物联网平台入侵与厂商产品选择策略:技术水平与数据价值的作用
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-11-08 DOI: 10.1016/j.tre.2025.104542
Xiufeng Li , Bo Li , Dongping Song
In the Internet of Things (IoT) setting, IoT platforms not only provide technology services to manufacturers but also market their store brand smart products, thus encroaching on the product market. However, existing research has not yet addressed the uncertainties inherent in IoT technology or the comprehensive impact of data value collected by smart devices on platform encroachment and manufacturers’ product decisions. To fill this gap, this paper utilizes game theory models to develop a bidirectional interaction model between an IoT platform and a smart product manufacturer. The findings are as follows: Firstly, even in the face of high encroachment costs, a higher value of data from smart devices will motivate the platform to encroach upon the smart product market. Secondly, when IoT technology value is high, the manufacturer’s single-product strategy prevents platform encroachment, whereas a dual-product strategy encourages it. In contrast, under lower IoT technology, selling both traditional and smart products leads to internal competition, eroding both. Finally, our finding also illustrates that, with moderate demand spillover, platforms see little profit from encroaching on the smart product market. Instead, they can avoid competition by focusing solely on IoT services, prompting manufacturers to produce only smart products.
在物联网(IoT)环境下,物联网平台不仅为制造商提供技术服务,还为其商店品牌智能产品提供营销,从而蚕食产品市场。然而,现有的研究尚未解决物联网技术固有的不确定性,也没有解决智能设备收集的数据价值对平台侵蚀和制造商产品决策的综合影响。为了填补这一空白,本文利用博弈论模型建立了物联网平台与智能产品制造商之间的双向交互模型。研究发现:第一,即使面对较高的入侵成本,智能设备数据价值的提高也会激励平台对智能产品市场的入侵。其次,当物联网技术价值较高时,制造商的单产品策略阻止了平台的入侵,而双产品策略则鼓励了平台的入侵。相反,在物联网技术水平较低的情况下,同时销售传统产品和智能产品会导致内部竞争,两者都受到侵蚀。最后,我们的发现还表明,在适度的需求溢出下,平台从侵占智能产品市场中获得的利润很少。相反,他们可以通过专注于物联网服务来避免竞争,从而促使制造商只生产智能产品。
{"title":"Internet of things platform encroachment and manufacturer product selection strategy:The role of technology level and data value","authors":"Xiufeng Li ,&nbsp;Bo Li ,&nbsp;Dongping Song","doi":"10.1016/j.tre.2025.104542","DOIUrl":"10.1016/j.tre.2025.104542","url":null,"abstract":"<div><div>In the Internet of Things (IoT) setting, IoT platforms not only provide technology services to manufacturers but also market their store brand smart products, thus encroaching on the product market. However, existing research has not yet addressed the uncertainties inherent in IoT technology or the comprehensive impact of data value collected by smart devices on platform encroachment and manufacturers’ product decisions. To fill this gap, this paper utilizes game theory models to develop a bidirectional interaction model between an IoT platform and a smart product manufacturer. The findings are as follows: Firstly, even in the face of high encroachment costs, a higher value of data from smart devices will motivate the platform to encroach upon the smart product market. Secondly, when IoT technology value is high, the manufacturer’s single-product strategy prevents platform encroachment, whereas a dual-product strategy encourages it. In contrast, under lower IoT technology, selling both traditional and smart products leads to internal competition, eroding both. Finally, our finding also illustrates that, with moderate demand spillover, platforms see little profit from encroaching on the smart product market. Instead, they can avoid competition by focusing solely on IoT services, prompting manufacturers to produce only smart products.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"205 ","pages":"Article 104542"},"PeriodicalIF":8.8,"publicationDate":"2025-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145466759","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
SPO-VCS: An end-to-end smart predict-then-optimize framework with alternating differentiation method for relocation problems in large-scale vehicle crowd sensing SPO-VCS:基于交替微分方法的端到端智能预测-然后优化框架,用于大规模车辆人群传感中的搬迁问题
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-11-08 DOI: 10.1016/j.tre.2025.104515
Xinyu Wang, Yiyang Peng, Wei Ma
Ubiquitous mobile devices have catalyzed the development of vehicle crowd sensing (VCS). In particular, vehicle sensing systems show great potential in the flexible acquisition of extensive spatio-temporal urban data through built-in smart sensors under diverse sensing scenarios. However, vehicle systems like taxis often exhibit biased coverage due to the heterogeneous nature of trip requests and varying routes. To achieve a high sensing coverage, a critical challenge lies in how to optimally relocate vehicles to minimize the divergence between the spatio-temporal distributions of vehicles and target sensing distributions. Conventional approaches typically employ a two-stage predict-then-optimize (PTO) process: first predicting real-time vehicle distributions and subsequently generating an optimal relocation strategy based on the prediction. However, this approach can lead to suboptimal decision-making due to the propagation of errors from upstream prediction. To this end, we develop an end-to-end Smart Predict-then-Optimize (SPO) framework by integrating optimization into prediction within the deep learning architecture, and the entire framework is trained by minimizing the task-specific matching divergence rather than the upstream prediction error. Methodologically, we formulate the vehicle relocation problem by quadratic programming (QP) and incorporate a novel unrolling approach based on the Alternating Direction Method of Multipliers (ADMM) within the SPO framework to compute gradients of the QP layer, facilitating backpropagation and gradient-based optimization for end-to-end learning. The effectiveness of the proposed framework is validated using two real-world taxi datasets ranging from mid-size to large-scale in Hong Kong and Chengdu, China. Utilizing the alternating differentiation method, the general SPO framework presents a novel concept of addressing decision-making problems with uncertainty, demonstrating significant potential for advancing applications in logistics and intelligent transportation systems.
无处不在的移动设备促进了车辆人群传感(VCS)的发展。特别是,车载传感系统在多种传感场景下,通过内置智能传感器灵活获取广泛的城市时空数据,显示出巨大的潜力。然而,像出租车这样的车辆系统,由于出行请求的异质性和不同的路线,往往表现出有偏差的覆盖。如何优化车辆的重新定位,使车辆的时空分布与目标感知分布之间的差异最小化,是实现高感知覆盖的关键问题。传统的方法通常采用两阶段预测-优化(PTO)过程:首先预测实时车辆分布,然后根据预测生成最优的搬迁策略。然而,由于上游预测的误差传播,这种方法可能导致次优决策。为此,我们通过将优化集成到深度学习架构中的预测中,开发了一个端到端的智能预测-然后优化(SPO)框架,整个框架通过最小化任务特定匹配发散而不是上游预测误差来训练。在方法上,我们通过二次规划(QP)来制定车辆重新定位问题,并在SPO框架内结合一种基于交替方向乘数法(ADMM)的新颖展开方法来计算QP层的梯度,从而促进反向传播和基于梯度的端到端学习优化。使用两个真实世界的出租车数据集验证了所提出框架的有效性,这些数据集从香港到中国成都的中型到大型不等。利用交替微分法,通用SPO框架提出了一个解决不确定性决策问题的新概念,展示了在物流和智能运输系统中推进应用的巨大潜力。
{"title":"SPO-VCS: An end-to-end smart predict-then-optimize framework with alternating differentiation method for relocation problems in large-scale vehicle crowd sensing","authors":"Xinyu Wang,&nbsp;Yiyang Peng,&nbsp;Wei Ma","doi":"10.1016/j.tre.2025.104515","DOIUrl":"10.1016/j.tre.2025.104515","url":null,"abstract":"<div><div>Ubiquitous mobile devices have catalyzed the development of vehicle crowd sensing (VCS). In particular, vehicle sensing systems show great potential in the flexible acquisition of extensive spatio-temporal urban data through built-in smart sensors under diverse sensing scenarios. However, vehicle systems like taxis often exhibit biased coverage due to the heterogeneous nature of trip requests and varying routes. To achieve a high sensing coverage, a critical challenge lies in how to optimally relocate vehicles to minimize the divergence between the spatio-temporal distributions of vehicles and target sensing distributions. Conventional approaches typically employ a two-stage predict-then-optimize (PTO) process: first predicting real-time vehicle distributions and subsequently generating an optimal relocation strategy based on the prediction. However, this approach can lead to suboptimal decision-making due to the propagation of errors from upstream prediction. To this end, we develop an end-to-end Smart Predict-then-Optimize (SPO) framework by integrating optimization into prediction within the deep learning architecture, and the entire framework is trained by minimizing the task-specific matching divergence rather than the upstream prediction error. Methodologically, we formulate the vehicle relocation problem by quadratic programming (QP) and incorporate a novel unrolling approach based on the Alternating Direction Method of Multipliers (ADMM) within the SPO framework to compute gradients of the QP layer, facilitating backpropagation and gradient-based optimization for end-to-end learning. The effectiveness of the proposed framework is validated using two real-world taxi datasets ranging from mid-size to large-scale in Hong Kong and Chengdu, China. Utilizing the alternating differentiation method, the general SPO framework presents a novel concept of addressing decision-making problems with uncertainty, demonstrating significant potential for advancing applications in logistics and intelligent transportation systems.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"205 ","pages":"Article 104515"},"PeriodicalIF":8.8,"publicationDate":"2025-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145461622","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
Customized bus routing problem considering co-opetition with taxis at transport hubs 考虑交通枢纽与出租车合作竞争的定制公交路线问题
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-11-08 DOI: 10.1016/j.tre.2025.104502
Yuhang Guo, Kun An, Wanjing Ma
At transport hubs, long taxi queues greatly degrade the passenger transfer experience, particularly at night when conventional buses and subways stop running. To address the difficulties in hailing taxis at transport hubs and improve hub transfer efficiency, we propose a combined mode referred to as the Customized Bus Plus Taxi (CBPT) service. In this mode, the customized bus (CB) transports passengers from the hub to bus stops closer to their destinations, where hailing a taxi is easier, which reduces both passenger travel time and costs. A logit model is constructed to capture passenger choices between CBPT services and taxi-alone services at hubs. A Mixed-integer Non-linear Programming (MINLP) model is formulated to solve the joint optimization problem for CB route and frequency design, considering time-varying demand. A customized gradient algorithm and a rolling horizon scheme are developed to solve the MINLP model. The application to Shanghai Hongqiao Hub demonstrates that the algorithm can solve a real-world problem in reasonable time. The results indicate that the CBPT service mode can reduce total costs by 43 % and waiting time costs by 84 % compared to using taxi services alone. The average taxi queuing time at the hub decreases from 50 mins to 8 mins. The CBPT service mode can greatly improve passenger transfer efficiency at the hub.
在交通枢纽,长时间的出租车排队极大地降低了乘客的换乘体验,特别是在夜间,传统的公共汽车和地铁停止运行。为了解决在交通枢纽打车的困难,提高枢纽换乘效率,我们提出了一种称为定制巴士加出租车(CBPT)服务的组合模式。在这种模式下,定制巴士(CB)将乘客从枢纽运送到距离目的地更近的公交车站,在那里更容易叫到出租车,从而减少了乘客的出行时间和成本。建立了一个logit模型,以捕获乘客在枢纽的CBPT服务和出租车单独服务之间的选择。建立了考虑时变需求的混合整数非线性规划(MINLP)模型,解决了CB线路和频率设计的联合优化问题。提出了一种自定义梯度算法和滚动地平线方案来求解MINLP模型。在上海虹桥枢纽的应用表明,该算法可以在合理的时间内解决实际问题。结果表明,与单独使用出租车服务相比,CBPT服务模式可将总成本降低43%,等待时间成本降低84%。出租车在枢纽的平均排队时间从50分钟减少到8分钟。CBPT服务模式可以大大提高枢纽的客运效率。
{"title":"Customized bus routing problem considering co-opetition with taxis at transport hubs","authors":"Yuhang Guo,&nbsp;Kun An,&nbsp;Wanjing Ma","doi":"10.1016/j.tre.2025.104502","DOIUrl":"10.1016/j.tre.2025.104502","url":null,"abstract":"<div><div>At transport hubs, long taxi queues greatly degrade the passenger transfer experience, particularly at night when conventional buses and subways stop running. To address the difficulties in hailing taxis at transport hubs and improve hub transfer efficiency, we propose a combined mode referred to as the Customized Bus Plus Taxi (CBPT) service. In this mode, the customized bus (CB) transports passengers from the hub to bus stops closer to their destinations, where hailing a taxi is easier, which reduces both passenger travel time and costs. A logit model is constructed to capture passenger choices between CBPT services and taxi-alone services at hubs. A Mixed-integer Non-linear Programming (MINLP) model is formulated to solve the joint optimization problem for CB route and frequency design, considering time-varying demand. A customized gradient algorithm and a rolling horizon scheme are developed to solve the MINLP model. The application to Shanghai Hongqiao Hub demonstrates that the algorithm can solve a real-world problem in reasonable time. The results indicate that the CBPT service mode can reduce total costs by 43 % and waiting time costs by 84 % compared to using taxi services alone. The average taxi queuing time at the hub decreases from 50 mins to 8 mins. The CBPT service mode can greatly improve passenger transfer efficiency at the hub.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"205 ","pages":"Article 104502"},"PeriodicalIF":8.8,"publicationDate":"2025-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145461626","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
期刊
Transportation Research Part E-Logistics and Transportation Review
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1