Transportation Research Part B-Methodological最新文献

A systematic review of node models for macroscopic network loading of traffic flows 交通流宏观网络负荷节点模型的系统综述

IF 5.8 1区工程技术

Transportation Research Part B-Methodological Pub Date : 2025-06-12 DOI: 10.1016/j.trb.2025.103273

Xiaolin Gong, Mark P.H. Raadsen, Michiel C.J. Bliemer

{"title":"A systematic review of node models for macroscopic network loading of traffic flows","authors":"Xiaolin Gong, Mark P.H. Raadsen, Michiel C.J. Bliemer","doi":"10.1016/j.trb.2025.103273","DOIUrl":"10.1016/j.trb.2025.103273","url":null,"abstract":"<div><div>Node models in macroscopic network loading procedures are used to distribute competing flows arising at motorway ramps, junctions, and intersections, influencing congestion and queuing delays. Despite decades of research on macroscopic node model development, a comprehensive literature review on their characteristics, categories, emerging trends, and further research opportunities does not yet exist. This study fills this gap by conducting a systematic literature review on the node models in macroscopic network loading frameworks. We identify representative characteristics of node models and then systematically classify and interpret those characteristics across existing node model studies present in the literature. We propose six general principles for node models and explore five extension categories characterising additional features. This paper makes two contributions to the field. Firstly, it provides a comprehensive classification of node model research, grounded in the proposed principles and extension categories. This classification is substantiated by relevant references and culminates in the development of a node model classification table. Secondly, it identifies future research directions and opportunities, providing guidance and insights for researchers and practitioners engaged in the study of macroscopic node models.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"199 ","pages":"Article 103273"},"PeriodicalIF":5.8,"publicationDate":"2025-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144270114","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

End-to-end logistics in metropolitan areas: A stochastic dynamic order-assignment and dispatching problem 都市圈端到端物流：一个随机动态订单分配与调度问题

IF 5.8 1区工程技术

Transportation Research Part B-Methodological Pub Date : 2025-06-06 DOI: 10.1016/j.trb.2025.103249

M. Arya Zamal , Albert H. Schrotenboer , Tom Van Woensel

{"title":"End-to-end logistics in metropolitan areas: A stochastic dynamic order-assignment and dispatching problem","authors":"M. Arya Zamal , Albert H. Schrotenboer , Tom Van Woensel","doi":"10.1016/j.trb.2025.103249","DOIUrl":"10.1016/j.trb.2025.103249","url":null,"abstract":"<div><div>The growth of e-commerce requires efficient integration of first-mile pickup, middle-mile consolidation, and last-mile delivery. These so-called integrated end-to-end logistics operations are particularly visible in metropolitan areas where fast delivery services are in high demand. Inspired by real-world practices at our industry partner, this paper introduces the Stochastic Dynamic Order-Assignment and Dispatching Problem (SDOA-DP). It concerns stochastic and dynamic pickup-and-delivery orders arising at an end-to-end logistics delivery platform, for which the company, as a decision maker, needs to determine in real-time how to assign orders to middle-mile linehaul schedules and when to dispatch first- and last-mile two-echelon vehicle routes. We model the SDOA-DP as a Markov Decision Process and propose a novel solution approach based on a parameterized Cost Function Approximation (CFA) for order assignment in the middle mile and a parameterized Adaptive Large Neighborhood Search (ALNS) for vehicle dispatch and two-echelon routing in the first and last-mile. The CFA balances the cost of using linehauls with the time slack available for first- and last-mile planning while ensuring time windows are met. The parameterization in the ALNS ensures that we balance routing cost and delivery speed by limiting the frequency and timing of dispatching vehicle routes. We learn the best value of the parameterization using Bayesian optimization. Computational experiments show that our approach yields a 22% on-average improvement compared to a baseline policy. If we learn a single best parameterization for various system settings, we observe almost as good cost savings, showing that our approach is robust and reliable for practitioners. Finally, we applied our method to a case study of our industry partner and showed that our method could potentially reduce daily costs by 30.5% across various operational contexts.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"199 ","pages":"Article 103249"},"PeriodicalIF":5.8,"publicationDate":"2025-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144230486","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

Rolling stock shunt operation planning in urban rail transit depots with maintenance consideration 考虑维修的城市轨道交通车辆段车辆分流作业规划

IF 5.8 1区工程技术

Transportation Research Part B-Methodological Pub Date : 2025-06-05 DOI: 10.1016/j.trb.2025.103252

Dian Wang , Ling Yao , Andrea D’Ariano , Shuguang Zhan , Lisha Wang

{"title":"Rolling stock shunt operation planning in urban rail transit depots with maintenance consideration","authors":"Dian Wang , Ling Yao , Andrea D’Ariano , Shuguang Zhan , Lisha Wang","doi":"10.1016/j.trb.2025.103252","DOIUrl":"10.1016/j.trb.2025.103252","url":null,"abstract":"<div><div>This study investigates the daily rolling stock shunt operation planning in a rail depot. Given the layout of a depot and the rolling stocks (that arrive at and depart from this depot within an operation day) with given maintenance schedule, the studied problem lies in determining: 1) the position where each rolling stock is parked, outside washed, and/or maintained, and 2) the conflict-free shunting plan of rolling stocks to move within a depot. We transform the track-circuits in the depot into different multi-layer directed graphs to illustrate the shunting processes of rolling stocks. By means of these graphs, we formulate the studied problem as a mixed integer linear programming model by considering a more general variant of four requirements that make sense in practice but are not or rarely considered in previous works and by presenting a flexible technique to model the track capacity, to reduce the additional shunting movements of rolling stocks. Besides, we design a two-stage decomposition manner to efficiently solve real-life problem instances, wherein the problem in each stage is addressed by a presented logic-based Benders decomposition algorithm enhanced by customized acceleration mechanisms. Finally, a set of realistic and real-life instances with different scales (derived from the largest depot of the Chongqing Rail Transit Line 3 in China) are investigated. Computational results demonstrate that our best algorithm solves a real-life instance to optimality in approximately 8 s that is considerably shorter than the time of rail staffs to solve this instance manually, thus our approach can provide strong automatical computer-aided decision supports. Our approach is also very efficient in optimizing another objective that is also widely used, and can provide management insights to rail staffs.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"199 ","pages":"Article 103252"},"PeriodicalIF":5.8,"publicationDate":"2025-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144222181","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

Data-driven optimization for container ship bunkering management under fuel price uncertainty 燃油价格不确定条件下集装箱船加注管理数据驱动优化

IF 5.8 1区工程技术

Transportation Research Part B-Methodological Pub Date : 2025-06-04 DOI: 10.1016/j.trb.2025.103250

Xuecheng Tian , Shuaian Wang , Yan Liu , Ying Yang

{"title":"Data-driven optimization for container ship bunkering management under fuel price uncertainty","authors":"Xuecheng Tian , Shuaian Wang , Yan Liu , Ying Yang","doi":"10.1016/j.trb.2025.103250","DOIUrl":"10.1016/j.trb.2025.103250","url":null,"abstract":"<div><div>Fuel prices are a crucial and volatile component of operational costs in maritime transportation. This paper optimizes container ship bunkering decisions under the uncertainty of multi-port fuel prices, using data-driven optimization frameworks that integrate machine learning and mathematical programming models. We address two primary challenges: (i) incorporating spatiotemporal correlations between multi-port fuel prices into predictive models, and (ii) determining the most effective data-driven modeling framework for this problem. To address the first challenge, we develop a two-channel long short-term memory model specifically designed to capture the spatiotemporal dependencies of multi-port fuel prices. For the second challenge, we construct two data-driven modeling frameworks for ship bunkering management: a two-stage contextual deterministic programming model with point predictions (TDP framework) and a multistage contextual stochastic programming model with distributional estimates (MSD framework). Through comprehensive computational experiments using both real-world and synthetic data, we obtain two crucial insights: (i) accounting for the spatiotemporal correlations among multi-port fuel prices significantly improves the accuracy of fuel price predictions; and (ii) the TDP framework is more suited to container shipping routes with fewer ports, while the MSD framework offers advantages in contexts with a higher number of ports.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"198 ","pages":"Article 103250"},"PeriodicalIF":5.8,"publicationDate":"2025-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144242214","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 ridesharing routing problem with flexible pickup and drop-off points 具有灵活上下车点的拼车路线问题

IF 5.8 1区工程技术

Transportation Research Part B-Methodological Pub Date : 2025-05-25 DOI: 10.1016/j.trb.2025.103234

Zuhayer Mahtab , Shichun Hu , Maged Dessouky , Fernando Ordoñez

{"title":"The ridesharing routing problem with flexible pickup and drop-off points","authors":"Zuhayer Mahtab , Shichun Hu , Maged Dessouky , Fernando Ordoñez","doi":"10.1016/j.trb.2025.103234","DOIUrl":"10.1016/j.trb.2025.103234","url":null,"abstract":"<div><div>In major metropolitan areas, ride-sharing systems can help reduce traffic congestion and increase the transportation system’s efficiency. In this paper, we propose a Branch-and-Price based approach for solving the ride-share routing problem with flexible pickup and drop-off points. We assume a ride-sharing system where drivers have their own origins and destinations, where all the drivers’ and passengers’ information is known beforehand, and all the problem data information is static and deterministic. We assume that drivers can pick up or drop off passengers from or to flexible meeting points that are within a passenger’s walking time limit from their origin or destination and are determined on a continuous plane. We formulate a mixed integer nonlinear model for routing and selecting pickup and drop-off points. Our solution approach decomposes this problem in two: selecting pickup and drop-off points and a rideshare routing problem. We develop an efficient algorithm to select the best pickup and drop-off points and show computationally that it is more efficient at finding pickup and drop-off points than considering a fixed set of discrete meeting points. To evaluate the performance of our approach, we perform numerical experiments on a San Francisco Taxicab dataset. Results show that our approach is efficient, solving instances with up to 600 points within 31 CPU minutes. For these datasets, incorporating flexible pickup and drop-off points can reduce the total vehicle travel time of the rideshare system by 4% on average.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"198 ","pages":"Article 103234"},"PeriodicalIF":5.8,"publicationDate":"2025-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144131233","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

Optimizing dual-fuel ship operations considering methane slip 考虑甲烷泄漏的双燃料船舶运行优化

IF 5.8 1区工程技术

Transportation Research Part B-Methodological Pub Date : 2025-05-24 DOI: 10.1016/j.trb.2025.103247

Yidan Shangguan, Xuecheng Tian, King-Wah Pang, Shuaian Wang

{"title":"Optimizing dual-fuel ship operations considering methane slip","authors":"Yidan Shangguan, Xuecheng Tian, King-Wah Pang, Shuaian Wang","doi":"10.1016/j.trb.2025.103247","DOIUrl":"10.1016/j.trb.2025.103247","url":null,"abstract":"<div><div>Liquefied natural gas (LNG) is increasingly viewed as a promising fuel for dual-fuel ships due to its cost-effectiveness, low emissions, and alignment with regulatory requirements. However, the high methane content of LNG, ranging from 85% to 95%, presents a significant challenge because of the phenomenon of methane slip whereby unburned methane escapes from the engine’s combustion chamber and other parts of the storage and transportation systems. Methane slip, which peaks at low ship speeds and decreases at higher speeds, can lead to substantial environmental pollution if it is not properly managed. This study rigorously examines the impact of sailing speed on methane slip rates and recognizes the complexities of fuel usage in dual-fuel ships. We develop a nonlinear mixed-integer programming model designed for container shipping companies that aims to optimize fleet composition, sailing speed, and fuel usage strategies. The objective of the model is to minimize total operational costs, including fuel expenses and taxes related to carbon emissions and methane slip. To address the computational challenges posed by the model’s nonlinearity, we propose a tailored solution method that uses sailing time as a proxy for speed, discretizing these times for effective implementation. The validity of this method is supported by theoretical guarantees and demonstrated through numerical experiments. Our computational results indicate that accounting for methane slip in the operational management of dual-fuel ships can help mitigate financial losses under certain conditions.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"198 ","pages":"Article 103247"},"PeriodicalIF":5.8,"publicationDate":"2025-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144131232","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

Modeling instantaneous queuing effects in the traffic assignment problem with consideration of demand fluctuations in the modeling period 考虑建模期内需求波动的交通分配问题瞬时排队效应建模

IF 5.8 1区工程技术

Transportation Research Part B-Methodological Pub Date : 2025-05-15 DOI: 10.1016/j.trb.2025.103248

Yuxin Shi , William H.K. Lam , Hao Fu , H.W. Ho , Mei Lam Tam , Wei Ma

{"title":"Modeling instantaneous queuing effects in the traffic assignment problem with consideration of demand fluctuations in the modeling period","authors":"Yuxin Shi , William H.K. Lam , Hao Fu , H.W. Ho , Mei Lam Tam , Wei Ma","doi":"10.1016/j.trb.2025.103248","DOIUrl":"10.1016/j.trb.2025.103248","url":null,"abstract":"<div><div>Instantaneous traffic queues, introducing fluctuated queuing delays, significantly affect the journey times and route choices of travelers particularly during the peak hour periods in congested road networks. Distinguished from average residual queues in static traffic assignment problems, instantaneous queues form and dissipate within minuscule time frames of a modeling period, triggered by an inflow exceeding link capacity, owning to instantaneous demand fluctuations. The inclusion of instantaneous queuing effects is of paramount importance, given their more frequent occurrence compared to residual queues. However, little attention has been given to these instantaneous queuing effects in static traffic assignment models for strategic planning. To fill this gap, this paper proposes a novel instantaneous traffic assignment (ITA) model to incorporate instantaneous queuing effects in congested road networks, accounting for within-period demand fluctuations. The enhanced ITA modeling framework is proposed encompassing two fixed-point problems for network loading and a logit-based stochastic user equilibrium assignment model. The ITA model is formulated as an equivalent variational inequality problem. The mathematical properties of the proposed model such as the stability of the unique solutions can be rigorously proved. An improved method of successive weighted average algorithm with an adaptive step size is developed to solve the proposed model in order to facilitate the examination of instantaneous queuing effects in real-world contexts for large-scale networks. Numerical examples are conducted to demonstrate the merits and efficacy of the proposed ITA model. The feasibility and applicability of the proposed model in reality are further illustrated in case studies of three different road networks.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"197 ","pages":"Article 103248"},"PeriodicalIF":5.8,"publicationDate":"2025-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143948196","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

Liner fleet deployment and slot allocation problem: A distributionally robust optimization model with joint chance constraints 班轮机队部署与舱位分配问题：一个具有联合机会约束的分布鲁棒优化模型

IF 5.8 1区工程技术

Transportation Research Part B-Methodological Pub Date : 2025-05-10 DOI: 10.1016/j.trb.2025.103236

Tao Zhang , Shuaian Wang , Xu Xin

{"title":"Liner fleet deployment and slot allocation problem: A distributionally robust optimization model with joint chance constraints","authors":"Tao Zhang , Shuaian Wang , Xu Xin","doi":"10.1016/j.trb.2025.103236","DOIUrl":"10.1016/j.trb.2025.103236","url":null,"abstract":"<div><div>In this paper, we address the classical liner fleet deployment and slot allocation joint optimization problem in the maritime field with uncertain container transportation demand. We relax the assumption in existing studies that the demand distribution function is known because container transportation demand is deeply affected by the world’s economic and political landscape. With the help of advances in distributionally robust optimization theory, we develop a two-stage data-driven robust chance-constrained model. This distribution-free model requires only limited historical demand data as input and jointly optimizes the class (i.e., capacity) and number of liners assigned on each route and the scheme for allocating containers on each leg to maximize the profit (container transportation revenue minus fleet operating costs, voyage costs, and capital costs) of the liner company. The joint chance constraint in the model requires that the transportation demand of the contract shipper be satisfied with a pre-determined probability. We then reformulate the model as a second-order cone programming and design a customized algorithm to explore the global optimal solution based on the outer approximation algorithm framework. This paper can serve as a baseline distribution-free model for solving liner fleet deployment and slot allocation joint optimization problems.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"197 ","pages":"Article 103236"},"PeriodicalIF":5.8,"publicationDate":"2025-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143928914","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

Post-disruption lane reversal optimization with surrogate modeling to improve urban traffic resilience 基于代理模型的干扰后车道反转优化提高城市交通弹性

IF 5.8 1区工程技术

Transportation Research Part B-Methodological Pub Date : 2025-05-09 DOI: 10.1016/j.trb.2025.103237

Qing-Long Lu , Wenzhe Sun , Cheng Lyu , Jan-Dirk Schmöcker , Constantinos Antoniou

{"title":"Post-disruption lane reversal optimization with surrogate modeling to improve urban traffic resilience","authors":"Qing-Long Lu , Wenzhe Sun , Cheng Lyu , Jan-Dirk Schmöcker , Constantinos Antoniou","doi":"10.1016/j.trb.2025.103237","DOIUrl":"10.1016/j.trb.2025.103237","url":null,"abstract":"<div><div>Rapid post-disruption recovery is essential but challenging, given the complex interactions between vehicular flows and the network supply. Simulation-based methods are widely used to assist the planner with realistic user-system interactions in the recovery measure optimization, though the application to large-scale transportation networks remains computationally expensive. This study explores the feasibility of using surrogate models as a time-efficient alternative to resource-intensive simulations. Lane reversal control is employed as a novel recovery measure and an optimization framework prioritizing systematic recovery is developed. A resilience loss indicator based on macroscopic fundamental diagram (MFD) dynamics is used to evaluate the real-time performance of the transportation system. The proposed surrogate model, therefore, also focuses on approximating recovery evaluation indicators, i.e., the resilience loss, other than link flows and density. The surrogate model contains a dynamic analytical network model and a Gaussian process regression (GPR) model. The former provides the analytical resilience loss and considers the temporal correlation of network changes resulting from time-dependent lane reversal decisions. The latter captures the difference between simulated and analytical resilience losses. Experiments are conducted on a large real-world road network in Kyoto City. The proposed approach demonstrates its efficacy by mitigating traffic resilience loss by about 6% under scenarios of 15 and 20 controllable links with a mere five algorithm iterations, requiring only 150 simulation runs. We also illustrate a trade-off between recovery performance and control resources that more controllable links unnecessarily offer better resilience improvement given the short decision-making duration and the very tight computational budget.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"197 ","pages":"Article 103237"},"PeriodicalIF":5.8,"publicationDate":"2025-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143923404","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 novel multi-objective evolutionary algorithm for transit network design and frequency-setting problem considering passengers’ choice behaviors under station congestion 考虑乘客选择行为的交通网络设计与频率设置问题的多目标进化算法

IF 5.8 1区工程技术

Transportation Research Part B-Methodological Pub Date : 2025-05-08 DOI: 10.1016/j.trb.2025.103238

Mingzhang Liang , Min Xu , Shuaian Wang

{"title":"A novel multi-objective evolutionary algorithm for transit network design and frequency-setting problem considering passengers’ choice behaviors under station congestion","authors":"Mingzhang Liang , Min Xu , Shuaian Wang","doi":"10.1016/j.trb.2025.103238","DOIUrl":"10.1016/j.trb.2025.103238","url":null,"abstract":"<div><div>The transit network design and frequency-setting problem (TNDFSP) plays a critical role in urban transit system planning. Due to the conflict between the level of service and operating costs, extensive research has been conducted to obtain a set of trade-off solutions between the interests of users and operators. However, most studies ignored the effects of station congestion in TNDFSP, resulting in unrealistic solutions or a failure to achieve optimal design schemes. Therefore, this study investigates the multi-objective optimization of TNDFSP considering users’ choice behaviors under station congestion. To address the problem, a multi-objective bilevel optimization model is first formulated. The upper level is a bi-objective optimization model with two conflicting objectives: minimizing users’ cost and minimizing operator’s cost. The lower-level problem is a passenger assignment problem under station congestion. Moreover, a novel multi-objective evolutionary algorithm based on objective space decomposition (MOEA-OSD) is proposed to solve the complex problem. When dealing with multi-objective optimizations, a decomposition mechanism is developed to convert the problem into multiple subproblems. These subproblems are optimized using an evolutionary approach with newly designed selection process and elite preservation strategy to achieve desirable convergence and diversity. The computational results obtained using Mandl’s benchmark demonstrate the efficacy of MOEA-OSD and the advantage of the proposed model in achieving more comprehensive trade-off solutions.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"197 ","pages":"Article 103238"},"PeriodicalIF":5.8,"publicationDate":"2025-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143917981","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