Transportation Research Part B-Methodological最新文献

{"title":"Integrated cruise fleet deployment and itinerary scheduling problem: An enhanced Benders decomposition approach","authors":"Ying Yang,&nbsp;Silong Zhang,&nbsp;Shuaian Wang","doi":"10.1016/j.trb.2025.103321","DOIUrl":"10.1016/j.trb.2025.103321","url":null,"abstract":"<div><div>With the growing popularity of cruise tourism, the issue of comprehensive and precise cruise management is emphasized by the industrial field, which demands effective strategies in both tactical-level cruise deployment and operational-level itinerary scheduling. This rising concern and the expectation of integrated decision, however, increase the complexity of the problem and the difficulty of optimization. This paper provides a cohesive framework and scalable algorithms for the integrated cruise fleet deployment and itinerary scheduling problem. First, to address this problem, we propose an integer programming model based on a time-expanded network that captures the movement dynamics of cruises over a planning horizon. Several problem-specific reformulations including cumulative-flow-based variables and route-based time-expanded network representation are introduced, based on which, we prove that the itinerary scheduling problem is totally unimodular and the integer variables can be relaxed. Second, we introduce a tailored Benders decomposition approach augmented by the simultaneous Magnanti–Wong method, where a valid and pre-obtainable Magnanti–Wong bound is designed, yielding Pareto-optimal cuts in small computation time in each iteration. Finally, we validate our approach using extensive numerical experiments on both simulation instances and a real case study. The results demonstrate the effectiveness of our integrated solving scheme and the practical applicability of our advanced decomposition method, marking a significant advancement in the field of cruise fleet management.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"201 ","pages":"Article 103321"},"PeriodicalIF":6.3,"publicationDate":"2025-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145223011","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}

{"title":"A scalable optimization approach for equitable facility location: Methodology and transportation applications","authors":"Drew Horton ,&nbsp;Joshua Murrell ,&nbsp;Daphne Skipper ,&nbsp;Emily Speakman ,&nbsp;Tom Logan","doi":"10.1016/j.trb.2025.103319","DOIUrl":"10.1016/j.trb.2025.103319","url":null,"abstract":"<div><div>Efficient and equitable access to essential services, such as healthcare, food, and education, is an important goal in urban planning, public policy, and transport logistics. However, existing facility location models often do not scale well to large instances, or primarily focus on optimizing average accessibility, neglecting equity concerns, particularly for disadvantaged populations. This paper proposes a novel, scalable framework for equitable facility location, introducing a linearized proxy for the Kolm-Pollak Equally-Distributed Equivalent (EDE) metric to balance efficiency and fairness. Computational experiments demonstrate that our approach scales to extremely large problem instances, while being sensitive enough to account for inequity throughout the distribution, not merely via the maximum value. Moreover, optimal solutions represent significant improvements for the worst-off residents in terms of distance to an open amenity, while also attaining a near-optimal average experience for all users. An extensive real-world case study on supermarket access illustrates the practical applicability of the framework, with additional examples coming from polling applications. As such, the model is extended to handle real-world considerations such as capacity constraints, split demand assignments, and location-specific penalties. By bridging the gap between equity theory and practical optimization, this work offers a robust and versatile tool for researchers and practitioners in urban planning, transportation, and public policy.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"201 ","pages":"Article 103319"},"PeriodicalIF":6.3,"publicationDate":"2025-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145222821","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}

{"title":"Toward mobility incentive: Integrating green service and carbon inclusion scheme into the ride-hailing market","authors":"Wei Tang ,&nbsp;Xiqun (Michael) Chen ,&nbsp;Der-Horng Lee","doi":"10.1016/j.trb.2025.103320","DOIUrl":"10.1016/j.trb.2025.103320","url":null,"abstract":"<div><div>Increasing individual responsibility for reducing emissions is a potentially effective way to address mobility sustainability issues. In recent years, the carbon inclusion scheme has been widely implemented to incentivize individual low-carbon travel behaviors. Motivated by the practice, this paper examines the ride-hailing market that integrates the green service with the carbon inclusion scheme to comprehend how the government-led carbon inclusion scheme affects the operation of the ride-hailing market and the prospects of reducing carbon emissions and promoting electrification. We propose two product strategies for the ride-hailing platform: (a) One-product strategy with mixed service provided by electric vehicles (EVs) and fuel vehicles (FVs); and (b) Differentiated-product strategy with green service provided by EVs and basic service provided by FVs. We also consider the significant differences in adopting electric buses in different countries/regions when discussing the impact of carbon inclusion on the ride-hailing market. Our findings indicate that without government-led carbon inclusion, it is more appropriate for the ride-hailing platform to adopt the one-product strategy. With government-led carbon inclusion, when the electrification rate of external public transportation is not very high, and the carbon incentive is high enough, the platform can improve its profit by adopting the differentiated-product strategy. Considering the platform's profit maximization decisions, our analysis also highlights that when the electrification rate of the external option is low and the carbon incentive is high, the impact of the carbon inclusion scheme on the ride-hailing market is better in all aspects, which is a win-win outcome that the ride-hailing platform, drivers, and the government would all like (if the government wants to see better driver welfare, electrification and carbon reduction in the ride-hailing market). Additionally, increasing the potential number of EVs in the ride-hailing market and the total number of drivers makes sense both for the platform (to gain higher profits) and government (which may be concerned about increasing driver welfare, the electrification rate and total carbon reduction of the ride-hailing market). The gained managerial insights provide decision support for the platform operating differentiated services and the government implementing carbon inclusion schemes.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"201 ","pages":"Article 103320"},"PeriodicalIF":6.3,"publicationDate":"2025-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145128230","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}

{"title":"A modeling methodology for car-following behaviors of automated vehicles: Trade-off between stability and mobility","authors":"Yuqin Zhang ,&nbsp;Ke Ma ,&nbsp;Zhigang Xu ,&nbsp;Hang Zhou ,&nbsp;Chengyuan Ma ,&nbsp;Xiaopeng Li","doi":"10.1016/j.trb.2025.103316","DOIUrl":"10.1016/j.trb.2025.103316","url":null,"abstract":"<div><div>Empirical studies have indicated that automated vehicle (AV) automakers tend to prioritize mobility over stability in designing car-following (CF) models, which may raise safety concerns. A likely explanation for this issue is that hardware-induced response delays challenge the ability of the CF models, as designed by automakers, to maintain an equilibrium between stability and mobility. To address these concerns, this study proposes a modeling methodology for the CF model in AVs aimed at achieving a trade-off between stability and mobility. This methodology seeks to identify the optimal parameters that enhance mobility under stability constraints. First, the linear CF model is calibrated using data from 20 commercial AVs produced by multiple automakers, and the unique response delay values of the linear CF model for each AV are identified. Next, the parameter regions ensuring stability are derived theoretically based on the calibrated response delays for each AV. An optimal mobility objective function is constructed to minimize time headway and reaction time, with the boundaries of the stable parameter regions serving as constraints. It allows the selection of CF parameters that maximize mobility while remaining within the stable regions. This proposed modeling method is applied to all AVs, and the optimal parameters are tested in simulations. Simulation results demonstrate that the proposed optimal model effectively dampens oscillations, reduces safety risks, and maintains shorter spacing, thus achieving an ideal trade-off between stability and mobility for AVs.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103316"},"PeriodicalIF":6.3,"publicationDate":"2025-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145095629","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}

{"title":"Optimizing continuous-time berth allocation, time-variant quay crane and yard assignment","authors":"Zhiyuan Yang ,&nbsp;Miaomiao Wang ,&nbsp;Shuaian Wang ,&nbsp;Lu Zhen","doi":"10.1016/j.trb.2025.103317","DOIUrl":"10.1016/j.trb.2025.103317","url":null,"abstract":"<div><div>Efficient container terminal operations depend on the coordinated use of three key resources: berths, quay cranes (QCs), and yard space. Decisions involving these components are highly interrelated. Berth allocation affects QC scheduling, which in turn influences yard-side transport. However, the majority of the literature treat these problems separately or under simplifying assumptions such as discrete berth allocation, time-invariant QC allocation, or omission of yard assignment. To the best of our known, this paper is the first to formulate a unified continuous-time optimization model that integrates continuous berth allocation, time-variant QC scheduling, and yard space assignment. To solve our proposed comprehensive decision model, we develop an exact algorithm and accelerate this by designing some novel valid inequalities and M-tightening techniques. The algorithmic efficiency and the benefits of considering the aforementioned decision features are validated through computational experiments. In addition, sensitivity analyses are conducted to derive potentially useful managerial insights.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103317"},"PeriodicalIF":6.3,"publicationDate":"2025-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145060023","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}

{"title":"Deep learning-based travel choice prediction with provable and adaptable fairness guarantees","authors":"Zhiwei Chen ,&nbsp;Yufei Xu ,&nbsp;Srinivas Peeta","doi":"10.1016/j.trb.2025.103318","DOIUrl":"10.1016/j.trb.2025.103318","url":null,"abstract":"<div><div>Deep Learning (DL) models offer substantial potential for travel choice predictions but are often plagued by algorithmic unfairness where disadvantaged population groups such as racial minorities and low-income populations often receive disproportionately worse prediction outcomes (e.g. accuracy) compared to their counterparts. Studies to address this issue in the transportation domain are relatively new and they fail to provide provable fairness guarantees and cannot address the diverse interpretations of fairness in practice. This study introduces a novel DL approach that provides provable fairness guarantees while being adaptable to various fairness standards. It embeds statistical hypothesis testing within a practical equality constraint to control disparities in prediction accuracy across different population groups, thus providing provable and adaptable fairness guarantees. This approach results in a threshold modification problem, formulated as a mixed-integer non-linear programming model that is proven to be NP-hard. To allow for efficient problem solving, theoretical properties of the threshold modification problem are investigated, enabling the decomposition of the original problem into smaller, more manageable subproblems. This decomposition provides insights into the problem's structure and enables the development of an efficient \"Accuracy-First-Threshold-Second \" algorithmic framework. Within this framework, an exact solution method is proposed to achieve optimal solutions, whereas a heuristic method, incorporating a sandwich algorithm and a bounded-enumeration algorithm, is designed to efficiently approximate near-optimal solutions. Extensive experiments demonstrate the computational performance of the proposed solution algorithms as well as the ability of the proposed fair DL approach to provide provable and adaptable fairness guarantees for travel choice predictions. This study offers a flexible and theoretically robust solution to fairness in travel choice prediction, with potential applications for enhancing equity in transportation systems.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103318"},"PeriodicalIF":6.3,"publicationDate":"2025-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145049026","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}

{"title":"Integrated optimization of train makeup problem and resource scheduling in railway marshalling yards: A hybrid MILP-CP approach with Logic-based Benders decomposition","authors":"Peiran Han ,&nbsp;Lingyun Meng ,&nbsp;Xiaojie Luan ,&nbsp;Nikola Bešinović ,&nbsp;Jianrui Miao ,&nbsp;Yihui Wang ,&nbsp;Zhengwen Liao","doi":"10.1016/j.trb.2025.103306","DOIUrl":"10.1016/j.trb.2025.103306","url":null,"abstract":"<div><div>In the marshalling yard, various complex operations occur, leading to inefficiencies in railcar connections. Therefore, designing an effective operational research methodology is essential for the marshalling yard, and even for the local rail freight network. This paper addresses the integrated Train Makeup and Resource Scheduling (TMRS) problem. A Mixed-Integer Linear Programming (MILP) model is developed, where the train makeup problem is formulated as an assignment problem, guiding the overall operations. Additionally, a series of hybrid flow shop scheduling tasks are established to coordinate the operations of trains, blocks, and railcars. Due to the complexity of TMRS, the integrated problem is reformulated as a hybrid mixed-integer linear programming (MILP) and constraint programming (CP) model. Logic-based benders decomposition (LBBD) is used to partition the TMRS problem, with lower bounds designed and integrated into the solving procedure to accelerate the convergence. We propose feasibility cuts, optimality cuts, and symmetry cuts based on the structure of the subproblem, which are dynamically added to the master problem. Two numerical examples are designed to demonstrate the effectiveness of the proposed hybrid modelling approach, lower bounds, and cuts. Finally, the proposed approach and algorithm are tested on a series of artificial instances and real-scale examples, demonstrating their practical effectiveness and ability to achieve high-quality solutions.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103306"},"PeriodicalIF":6.3,"publicationDate":"2025-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145026694","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}

{"title":"To park or to share your autonomous vehicle?","authors":"Zhuoye Zhang ,&nbsp;Fangni Zhang ,&nbsp;Wei Liu","doi":"10.1016/j.trb.2025.103305","DOIUrl":"10.1016/j.trb.2025.103305","url":null,"abstract":"<div><div>With the ability to drive autonomously during trips and park themselves, autonomous vehicles (AVs) are anticipated to revolutionize future mobility. How AVs interact with people and transform travel behavior patterns (mobility paradigm shift) is expected to be a “game changer”. This paper investigates an innovative future mobility paradigm where private-AV owners can share their vehicles on a mobility service platform when not in use. We develop tractable models to characterize the travel, parking, and vehicle-sharing choices of AV users, optimize operation strategies of the mobility service platform considering AV sharing, and evaluate their system-wide impacts. In particular, given the operation strategies of the mobility service platform, we formulate the system equilibrium that includes the AV owners’ choice equilibrium and the mobility service market equilibrium. We consider two different business formats for platform operator (namely reselling and commissioning) and three types of AV owners (risk-neutral, risk-averse or risk-seeking). Subject to the system equilibrium, we examine the pricing and fleet sizing strategies of the platform to achieve either profit-maximization or social welfare-maximization. Our analysis explores the impacts of introducing the AV sharing scheme on AV owners, mobility service operator and users, and social welfare. It shows that introducing the AV sharing scheme has the potential to create a win-win-win outcome for AV owners, mobility service operator, and users, with an overall improvement in social welfare. Moreover, both a social welfare-maximizing operator and a profit-maximizing operator may achieve a win-win-win outcome under certain conditions. With risk-averse AV owners, the reselling format proves to be superior to the commissioning format; with risk-seeking AV owners, the commissioning format will outperform the reselling format; while with risk-neutral AV owners, both formats can yield identical platform profit and social welfare. Numerical examples are presented to illustrate the analytical results and provide a deeper understanding of the potential implications of AV sharing.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":""},"PeriodicalIF":6.3,"publicationDate":"2025-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145010649","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}

{"title":"Integrated flexible transport service for passenger and freight under stochastic demand and service time","authors":"Enoch Lee ,&nbsp;Manzi Li ,&nbsp;Lubing Li ,&nbsp;Hong K. Lo","doi":"10.1016/j.trb.2025.103313","DOIUrl":"10.1016/j.trb.2025.103313","url":null,"abstract":"<div><div>The growth of e-commerce has increased the pressure on urban freight systems, exacerbating traffic congestion and environmental costs. Conversely, public transport often has underutilized capacity, which presents an opportunity for freight transport. Building on this potential, we propose an integrated flexible transport system that serves both passenger and freight. We develop a two-stage stochastic optimization model that accounts for uncertainties in demand location, servie time, and volume for the integrated system. The flexible bus routes are strategically planned in the first stage, and actual passenger and freight orders are assigned to each bus in the second stage. To solve the problem, a reliability-based decomposition method is proposed to optimize reliability measures, determine the optimal flexible transport route, and minimize costs. Numerical studies show that integrating freight and passenger operations reduces costs by 12 %, while accounting for stochasticity reduces costs by 11.8 % compared to deterministic models. A case study in Manhattan validates the model's scalability and effectiveness in large-scale, real-world setting.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103313"},"PeriodicalIF":6.3,"publicationDate":"2025-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145019444","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}

{"title":"Comparison of compact formulations for the electric vehicle routing problem","authors":"Zhiguo Wu ,&nbsp;Hande Yaman","doi":"10.1016/j.trb.2025.103314","DOIUrl":"10.1016/j.trb.2025.103314","url":null,"abstract":"<div><div>The electric vehicle routing problem is an extension of the capacitated vehicle routing problem, where en-route recharging needs to be addressed due to the limited driving range of electric vehicles. In this study, we compare four compact formulations that differ in the way they model the battery consumption. The first two formulations use Miller–Tucker–Zemlin’s approach, while the last two use single-commodity flows for this purpose. Within each approach, the two formulations have distinct ways of dealing with the fact that recharging stations may be visited more than once. In particular, two formulations make use of arcs that correspond to two-leg paths with a recharging station in the middle, whereas the other two formulations use copies of recharging stations, as suggested in the literature. We compare the linear programming bounds of these four formulations as well as the existing formulations from a theoretical point of view. Then, we analyze the performance of the new and existing formulations using six sets of benchmark instances. The computational results show that our formulations tighten the linear programming bounds and require less computation time to prove optimality.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103314"},"PeriodicalIF":6.3,"publicationDate":"2025-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145019578","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}