Transportation Research Part B-Methodological最新文献

筛选
英文 中文
Real-time policy for yard allocation of transshipment containers in a terminal 码头转运集装箱堆场分配的实时策略
IF 5.8 1区 工程技术
Transportation Research Part B-Methodological Pub Date : 2025-02-01 DOI: 10.1016/j.trb.2024.103138
Abdo Abouelrous , Rommert Dekker , Laurens Bliek , Yingqian Zhang
{"title":"Real-time policy for yard allocation of transshipment containers in a terminal","authors":"Abdo Abouelrous ,&nbsp;Rommert Dekker ,&nbsp;Laurens Bliek ,&nbsp;Yingqian Zhang","doi":"10.1016/j.trb.2024.103138","DOIUrl":"10.1016/j.trb.2024.103138","url":null,"abstract":"<div><div>In this article, we investigate the problem of allocating storage space in a container terminal’s yard to transshipment containers. The main decision here concerns the block to which a container is assigned for storage until it is loaded later by another vessel. We propose a setting where some target performance measures are imposed on the discharge operations. In turn, the allocation decisions are made so as to reduce driving time from the storage blocks to the berth locations of the vessels that will pick up the containers. The trick here is to find an appropriate trade-off between the times spent on discharge and loading so that neither are delayed significantly. Using results from renewal theory, queuing theory and machine learning, we are able to quantify the effect of our allocation decisions on quay crane productivity. Thereafter, we formulate a mathematical optimization problem for the yard-allocation of containers and apply a meta-heuristic to solve it. Our method was developed for deployment by a software consultancy company for container terminals. We test our method using a real-time simulation and compare it with a benchmark from the literature. We show that our method generates reductions in vessel berth times and provide an overview on its economic impact.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"192 ","pages":"Article 103138"},"PeriodicalIF":5.8,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142989516","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
What do walking and e-hailing bring to scale economies in on-demand mobility? 步行和网约车为按需出行的规模经济带来了什么?
IF 5.8 1区 工程技术
Transportation Research Part B-Methodological Pub Date : 2025-02-01 DOI: 10.1016/j.trb.2025.103156
Kenan Zhang , Javier Alonso-Mora , Andres Fielbaum
{"title":"What do walking and e-hailing bring to scale economies in on-demand mobility?","authors":"Kenan Zhang ,&nbsp;Javier Alonso-Mora ,&nbsp;Andres Fielbaum","doi":"10.1016/j.trb.2025.103156","DOIUrl":"10.1016/j.trb.2025.103156","url":null,"abstract":"<div><div>This study investigates the impact of walking and e-hailing on the scale economies of on-demand mobility services. An analytical framework is developed to i) explicitly characterize the physical interactions between passengers and vehicles in the matching and pickup processes, and ii) derive the closed-form degree of scale economies (DSE) to quantify scale economies. The general model is then specified for conventional street-hailing and e-hailing, with and without walking before pickup and after dropoff. We show that, under a system-optimum fleet size, the market always exhibits economies of scale regardless of the matching mechanism and the walking behaviors, though the scale effect diminishes as passenger demand increases. Yet, street-hailing and e-hailing show different scale economies in their matching process. While street-hailing matching shows a constant DSE of two, e-hailing matching is more sensitive to demand and its DSE diminishes to one when passenger competition emerges. Walking, on the other hand, has mixed effects on the scale economies: while the reduced pickup and in-vehicle times bring a positive scale effect, the extra walking time and possible concentration of vacant vehicles and waiting passengers on streets negatively affect scale economies. All these analytical results are validated through agent-based simulations on Manhattan with real-life demand patterns.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"192 ","pages":"Article 103156"},"PeriodicalIF":5.8,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143072638","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Solving the equity-aware dial-a-ride problem using an exact branch-cut-and-price algorithm 使用精确的分支削减和价格算法解决股票感知的拨号搭车问题
IF 5.8 1区 工程技术
Transportation Research Part B-Methodological Pub Date : 2025-02-01 DOI: 10.1016/j.trb.2024.103149
Shuocheng Guo , Iman Dayarian , Jian Li , Xinwu Qian
{"title":"Solving the equity-aware dial-a-ride problem using an exact branch-cut-and-price algorithm","authors":"Shuocheng Guo ,&nbsp;Iman Dayarian ,&nbsp;Jian Li ,&nbsp;Xinwu Qian","doi":"10.1016/j.trb.2024.103149","DOIUrl":"10.1016/j.trb.2024.103149","url":null,"abstract":"<div><div>This paper proposes a Branch-Cut-and-Price (BCP) algorithm to solve an equitable variant of the Dial-a-Ride problem (DARP), namely Equity-Aware DARP (EDARP), a bi-objective optimization problem that simultaneously minimizes the total routing cost and maximizes the Equity-of-Travel (EoT) outcomes for individual passengers. For passengers, EoT is specified as their detour rate, measured by the ratio between total in-vehicle time and door-to-door direct trip time. The EoT objective of EDARP is to minimize the maximum detour rate among all passengers while satisfying the DARP constraints. We model the EDARP using a min–max trip-based formulation, which is solved exactly using a tailored BCP algorithm. The BCP algorithm adopts the Column Generation method by decomposing the problem into a master problem and a subproblem. The subproblem is an Elementary Shortest Path Problem with Resource Constraints and Min–Max EoT (ESPPRC-MME), which is NP-hard. To efficiently solve the ESPPRC-MME, we develop a minimal-ride-time calibration algorithm and establish families of resource extension functions in compliance with equity-related resources. We also extend the applicability of EDARP to the operation of the dial-a-ride service during the pandemic aiming to minimize the maximum exposure risk of individual travelers. The effectiveness of our models and algorithms are comprehensively evaluated using both classic DARP instances as well as EDARP instances generated from real-world paratransit trip datasets. Computational results show that our BCP algorithm can optimally solve 50 out of 54 real-world instances (up to 55 passengers and 13 vehicles covering 110 nodes) within a time limit of one hour. Important practical insights are also discussed by investigating the Pareto front and the Lorenz curves for trip inequity based on the optimal outcomes of real-world instances.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"192 ","pages":"Article 103149"},"PeriodicalIF":5.8,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142887900","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
Equilibrium horizontal queues and a paradox of tolling 均衡水平队列与收费悖论
IF 5.8 1区 工程技术
Transportation Research Part B-Methodological Pub Date : 2025-02-01 DOI: 10.1016/j.trb.2025.103152
Lewis J. Lehe, Ayush Pandey
{"title":"Equilibrium horizontal queues and a paradox of tolling","authors":"Lewis J. Lehe,&nbsp;Ayush Pandey","doi":"10.1016/j.trb.2025.103152","DOIUrl":"10.1016/j.trb.2025.103152","url":null,"abstract":"<div><div>This paper shows that, in a static traffic model with elastic demand, increasing a toll may raise the equilibrium trip rate through a network. The result is obtained in models with horizontal queues and rules about merges and diverges assumed in the Cell Transmission Model for Network Traffic. The paper looks at three networks: (i) a road with a fixed bottleneck at the end; (ii) a road with a “triggerneck” diverge; and (iii) a ring road with two on-ramps and two off-ramps. In the triggerneck network, a toll increase may raise the total trip rate when traffic using an exit with bottleneck has a lower value of travel time savings than traffic bypassing the bottleneck. In the ring road, a toll increase may raise the total trip rate when the initial equilibrium is hypercongested. The derivations use an extensible “recipe” for analysis of networks with horizontal queues. Many diagrams and numerical examples are provided to illustrate.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"192 ","pages":"Article 103152"},"PeriodicalIF":5.8,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143027374","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Investment and financing of roadway digital infrastructure for automated driving 自动驾驶道路数字化基础设施投融资
IF 5.8 1区 工程技术
Transportation Research Part B-Methodological Pub Date : 2025-02-01 DOI: 10.1016/j.trb.2024.103146
Amir Ahmadian , Sina Bahrami , Mehdi Nourinejad , Yafeng Yin
{"title":"Investment and financing of roadway digital infrastructure for automated driving","authors":"Amir Ahmadian ,&nbsp;Sina Bahrami ,&nbsp;Mehdi Nourinejad ,&nbsp;Yafeng Yin","doi":"10.1016/j.trb.2024.103146","DOIUrl":"10.1016/j.trb.2024.103146","url":null,"abstract":"<div><div>Connected automated vehicles (CAVs) are equipped with sensors, enabling them to scan and analyze their surrounding environment. This capability empowers CAVs to make informed and efficient decisions regarding their motion; however, the limited spatial range and resolution of these sensors present challenges for achieving full autonomy. Cooperative sensing through vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communications offers an alternative approach to enrich CAVs’ environmental understanding. This study explores the optimal investment policy for vehicular connectivity and road-side sensor deployment under varying traffic flow conditions. It also extends the self-financing theorem to the sensor equipped roads and investigates whether an optimal toll can cover both the construction costs and the costs of equipping roads with sensing components. The stylized model of CAV mobility considers the interplay between stationary sensors installed road-side as a part of the infrastructure and mobile sensors of CAVs. Results indicate that under constrained budgets and low traffic flow, investing in infrastructure improvement is preferred. However, as traffic flow increases, prioritizing connectivity and data sharing among CAVs becomes more lucrative. Notably, in high traffic flow, a shift back to investing in stationary sensors may occur, depending on system settings. The findings provide insights into budget allocation to enhance CAV performance, advancing the development of efficient and safe automated driving systems. The analyses on the self-financing theorem also show that the optimal user tolls do not cover the cost of constructing digital infrastructure. However, if social planners consider the safety benefits of sensor equipped roads, the construction of digital infrastructure can be covered by the optimal user tolls. In addition, the revenue from optimal user tolls can cover the cost of equipping existing roads with sensors if their flow-capacity ratio is greater than a certain threshold.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"192 ","pages":"Article 103146"},"PeriodicalIF":5.8,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142918064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Parking reservation scheme in a commuting system with shared autonomous vehicles and parking space constraint 具有共享自动驾驶车辆和停车空间约束的通勤系统停车预约方案
IF 5.8 1区 工程技术
Transportation Research Part B-Methodological Pub Date : 2025-02-01 DOI: 10.1016/j.trb.2024.103116
Zhe-Yi Tang , Li-Jun Tian , Peng Liu , Hai-Jun Huang
{"title":"Parking reservation scheme in a commuting system with shared autonomous vehicles and parking space constraint","authors":"Zhe-Yi Tang ,&nbsp;Li-Jun Tian ,&nbsp;Peng Liu ,&nbsp;Hai-Jun Huang","doi":"10.1016/j.trb.2024.103116","DOIUrl":"10.1016/j.trb.2024.103116","url":null,"abstract":"<div><div>This study examines the effects of parking reservation schemes on travel choices and flow distribution in a commuting system comprising regular vehicles (RVs) and shared autonomous vehicles (SAVs), when faced with limited parking spaces. All possible departure patterns under three parking reservation schemes are explored, involving unreserved and reserved RV commuters, as well as SAV commuters. Associated factors, such as the number of parking slots, the number of unreserved slots, and the additional SAV cost, are analyzed. The impacts of these factors on various metrics, including modal split, SAV market share, traffic congestion, individual travel cost, and system performance, are investigated. Analytical analysis reveals that managing the numbers of parking slots and unreserved parking slots can reduce individual travel cost and alleviate traffic congestion. Additionally, the study suggests an optimal reservation scheme for the number of parking slots and the ratio of unreserved slots, along with the additional SAV cost, to minimize total travel cost and maximize system efficiency. These findings could shape future urban mobility parking policies, accommodating mixed traffic of regular and autonomous vehicles.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"192 ","pages":"Article 103116"},"PeriodicalIF":5.8,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142867438","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
Who should not share? The merits of withholding unused vehicles 谁不应该分享?扣留未使用车辆的好处
IF 5.8 1区 工程技术
Transportation Research Part B-Methodological Pub Date : 2025-02-01 DOI: 10.1016/j.trb.2025.103159
Roman Zakharenko
{"title":"Who should not share? The merits of withholding unused vehicles","authors":"Roman Zakharenko","doi":"10.1016/j.trb.2025.103159","DOIUrl":"10.1016/j.trb.2025.103159","url":null,"abstract":"<div><div>People repeatedly demand travel, using available vehicles scattered around space. What can justify vehicle withholding (i.e. preventing others from using it, for own future use) from the social welfare perspective? This paper investigates heterogeneity in the potential cost of search for alternative vehicles as such justification. It is shown that travellers whose search cost is substantially higher than that of others (e.g. limited-mobility people) can optimally withhold a vehicle. The heterogeneity of search costs should be sufficiently strong, e.g. a uniform distribution is not variable enough to justify withholding by anyone. In an example calibrated for car use in London, it is shown that at most 39% of car users should withhold their vehicles under the most extreme modelling assumptions, while all others should share. An extension of the model rules out some other justifications for withholding, such as short duration of stay and aversion of risk of having to search for another vehicle.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"193 ","pages":"Article 103159"},"PeriodicalIF":5.8,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143133525","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimizing carbon emissions in green logistics for time-dependent routing 优化绿色物流中碳排放的时间依赖性路线
IF 5.8 1区 工程技术
Transportation Research Part B-Methodological Pub Date : 2025-02-01 DOI: 10.1016/j.trb.2025.103155
Yiming Liu , Yang Yu , Roberto Baldacci , Jiafu Tang , Wei Sun
{"title":"Optimizing carbon emissions in green logistics for time-dependent routing","authors":"Yiming Liu ,&nbsp;Yang Yu ,&nbsp;Roberto Baldacci ,&nbsp;Jiafu Tang ,&nbsp;Wei Sun","doi":"10.1016/j.trb.2025.103155","DOIUrl":"10.1016/j.trb.2025.103155","url":null,"abstract":"<div><div>This paper considers a green vehicle routing problem termed the time-dependent green vehicle routing problem with time windows (TDGVRPTW). The TDGVRPTW is an extension of the green vehicle routing problem with time windows in green logistics. It considers time-dependent vehicle speed and aims to minimize carbon emissions. Since the travel times and carbon emissions between locations depend on the departure time from the starting location, optimizing carbon emissions requires determining the optimal departure times from the depot and customers. This paper presents a branch-price-and-cut (BPC) algorithm to solve the TDGVRPTW. The problem is formulated based on a set-partitioning model. To solve the pricing problem associated with the set-partitioning model, we first define backward non-dominated time-dependent arcs and optimal timed routes. We also introduce three types of routes, forward, backward, and patchwork optimal timed routes, and analyze their characteristics. Then, we introduce a method to adjust the times in backward and patchwork optimal timed routes from the latest to the earliest. We prove that this method guarantees correctness and effectively reduces complexity. We propose a bidirectional labeling algorithm to generate routes. The pricing problem employs state-of-the-art techniques, including limited memory subset row cuts (lm-SRCs), ng-route relaxation, and bucket graphs to enhance the algorithm’s efficiency. The BPC algorithm is tested on a set of instances derived from benchmark cases in the literature. Its various components and pricing strategies are evaluated, and its performance is compared with other algorithms from the literature. The results confirm the effectiveness of the proposed algorithm and its newly designed components in solving the TDGVRPTW.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"192 ","pages":"Article 103155"},"PeriodicalIF":5.8,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143027373","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
Timing and size decisions of green technology investment for competitive ocean carriers under green regulations 绿色法规下竞争性海运承运人绿色技术投资的时机与规模决策
IF 5.8 1区 工程技术
Transportation Research Part B-Methodological Pub Date : 2025-02-01 DOI: 10.1016/j.trb.2025.103160
Jiaguo Liu , Jie Wu , Xiaowen Fu , Peter M. Kort
{"title":"Timing and size decisions of green technology investment for competitive ocean carriers under green regulations","authors":"Jiaguo Liu ,&nbsp;Jie Wu ,&nbsp;Xiaowen Fu ,&nbsp;Peter M. Kort","doi":"10.1016/j.trb.2025.103160","DOIUrl":"10.1016/j.trb.2025.103160","url":null,"abstract":"<div><div>In response to increasingly stringent green regulations, ocean carriers are transitioning their emissions reduction strategy from reducing ship speeds to investing in green equipment. However, because carriers face uncertain demand and a competitive freight market, it is challenging for them to determine the timing and size of green equipment investments. Hence, we construct a real options game (ROG) model to investigate green investment timing and size decisions by two competing carriers within the framework of green regulations. We derive the optimal investment timing and size for the two carriers under various strategies and examine the effect of key factors on the optimal decisions. We show that leaders’ investment strategies depend on the initial freight market size and differences in carriers’ investment costs. Moreover, we observe that stringent green regulations significantly incentivize carriers to make green investments earlier but result in smaller investment sizes. Surprisingly, high-growth and high-volatility weaken early investment incentives but result in larger investment sizes. Interestingly, high speed does not always incentivize early investment due to its dual impact on cost performance, i.e., improving service levels but raising fuel costs. Intense quantity competition accelerates the leader's investment but delays the follower's, whereas intense service competition delays investments for both but leads to larger investment sizes. Our work provides an economic explanation for the varying adoption behaviors of carriers and offers managerial insights for competing carriers and policy insights for the government.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"193 ","pages":"Article 103160"},"PeriodicalIF":5.8,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143133524","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Modeling the residual queue and queue-dependent capacity in a static traffic assignment problem 静态流量分配问题中剩余队列和队列相关容量的建模
IF 5.8 1区 工程技术
Transportation Research Part B-Methodological Pub Date : 2025-02-01 DOI: 10.1016/j.trb.2025.103158
Hao Fu , William H.K. Lam , Wei Ma , Yuxin Shi , Rui Jiang , Huijun Sun , Ziyou Gao
{"title":"Modeling the residual queue and queue-dependent capacity in a static traffic assignment problem","authors":"Hao Fu ,&nbsp;William H.K. Lam ,&nbsp;Wei Ma ,&nbsp;Yuxin Shi ,&nbsp;Rui Jiang ,&nbsp;Huijun Sun ,&nbsp;Ziyou Gao","doi":"10.1016/j.trb.2025.103158","DOIUrl":"10.1016/j.trb.2025.103158","url":null,"abstract":"<div><div>The residual queue during a given study period (e.g., peak hour) is an important feature that should be considered when solving a traffic assignment problem under equilibrium for strategic traffic planning. Although studies have focused extensively on static or quasi-dynamic traffic assignment models considering the residual queue, they have failed to capture the situation wherein the equilibrium link flow passing through the link is less than the link physical capacity under congested conditions. To address this critical issue, we introduce a novel static traffic assignment model that explicitly incorporates the residual queue and queue-dependent link capacity. The proposed model ensures that equilibrium link flows remain within the physical capacity bounds, yielding estimations more aligned with data observed by traffic detectors, especially in oversaturated scenarios. A generalized link cost function considering queue-dependent capacity, with an additional queuing delay term is proposed. The queuing delay term represents the added travel cost under congestion, offering a framework wherein conventional static models, both with and without physical capacity constraints, become special cases of our model. Our study rigorously analyzes the mathematical properties of the new model, establishing the theoretical uniqueness of solutions for link flow and residual queue under certain conditions. We also introduce a gradient projection-based alternating minimization algorithm tailored for the proposed model. Numerical examples are conducted to demonstrate the superiority and merit of the proposed model and solution algorithm.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"192 ","pages":"Article 103158"},"PeriodicalIF":5.8,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143072517","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信