Transportation Research Part B-Methodological最新文献

{"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}

{"title":"Robust vessel traffic scheduling with uncertain Berth Service Times in a Seaport","authors":"Runqing Zhao ,&nbsp;Shengnan Shu ,&nbsp;Lingxiao Wu ,&nbsp;Shuai Jia","doi":"10.1016/j.trb.2025.103294","DOIUrl":"10.1016/j.trb.2025.103294","url":null,"abstract":"<div><div>We consider a planning horizon during which a set of vessels visit a seaport for cargo transshipment. To access the designated berths, vessels should travel from the anchorage ground to the port basin by passing through a navigation channel. As soon as the vessels have completed the cargo transshipment, they need to travel from the port basin back to the anchorage ground through the navigation channel again. Navigation channel traffic is affected by the tidal effect and is bottlenecked by the limited capacity. The incoming vessels may wait for the tide to enter the channel after arriving at the anchorage ground; while the outgoing vessels need to wait for the tide to enter the channel upon completion of cargo transshipment. During these operations, the port operators need to assign tidal windows for vessels to travel into or out of the port, as well as the berthing and unberthing times of vessels, in order to minimize the overall operating cost. We formulate the problem as a two-stage robust optimization model, considering the uncertain vessel service times at berths. By exploiting the problem structure, we develop an adapted column and constraint generation algorithm framework, where the second-stage problem is solved by an enumeration-based method for generating candidate vessel service sequences and a dynamic programming algorithm for allocating the uncertainty budgets to vessels. The computation experiments show that our proposed algorithm generates optimal solutions within acceptable computation times (less than 30 s), and performs better than well established benchmark methods in terms of both worst-case performance and mean performance metrics. Several managerial insights can be derived from our experimental results to guide port operations in terms of the application of the robust models and benefits to the industry.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103294"},"PeriodicalIF":6.3,"publicationDate":"2025-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145019443","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":"Railway deregulation in the west and east: The impacts of organizational structure patterns on air-HSRs competition","authors":"Yixiao Wang ,&nbsp;Kun Wang ,&nbsp;Eric Pels ,&nbsp;Jianhong Wu","doi":"10.1016/j.trb.2025.103304","DOIUrl":"10.1016/j.trb.2025.103304","url":null,"abstract":"<div><div>In the context of railway deregulation in the West and East, introducing competition (through open access) to railways can be achieved via different organizational structures. Using game theoretic method, this is the first attempt to model three organizational structures, namely, full separation, holding, and full integration, and to investigate their impacts on air-HSRs competition. Analytically and numerically (based on the Beijing-Shanghai route), for a profit-oriented HSR infrastructure, a holding structure helps HSR to compete most effectively with air, delivering the highest profits for the HSR competitor and the HSR industry. Compared with other structures, a full integration structure produces the highest market share for the HSR incumbent and HSR consumer surplus, resulting in predatory pricing against the HSR competitor. Moreover, integration leads to strong economic incentives for the incumbent to implement limit pricing to dislodge entry. These results provide an elucidation for the puzzle of why railway deregulation in the Chinese market has lagged compared with that in Europe. Further sensitivity analysis shows that the regulation of the access charging regime has an effect on the impact of the organizational structure in which a welfare-oriented regulation should be coupled with a profit-oriented structure such as full separation. In general, each structure has pros and cons, and different authority goals (promote modal shift, increase competition, improve welfare, etc.) and statuses serve as a prerequisite for choosing the optimal structure.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103304"},"PeriodicalIF":6.3,"publicationDate":"2025-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145010650","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":"Routing a fleet of unmanned aerial vehicles: A trajectory optimisation-based framework","authors":"Walton P. Coutinho ,&nbsp;Jörg Fliege ,&nbsp;Maria Battarra ,&nbsp;Anand Subramanian","doi":"10.1016/j.trb.2025.103312","DOIUrl":"10.1016/j.trb.2025.103312","url":null,"abstract":"<div><div>We consider an aerial survey operation in which a fleet of unmanned aerial vehicles (UAVs) is required to visit several locations and then land in one of the available landing sites while optimising some performance criteria, subject to operational constraints and flight dynamics. We aim to minimise the maximum flight time of the UAVs. To efficiently solve this problem, we propose an algorithmic framework consisting of: (i) a nonlinear programming formulation of trajectory optimisation that accurately reflects the underlying flight dynamics and operational constraints; (ii) two sequential trajectory optimisation heuristics, designed to cope with the challenging task of finding feasible flight trajectories for a given route; and (iii) a routing metaheuristic combining iterated local search and a set-partitioning-based integer programming formulation. The proposed framework is tested on randomly generated instances with up to 50 waypoints, showing its efficacy.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103312"},"PeriodicalIF":6.3,"publicationDate":"2025-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145004420","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 multitrait-multimethod model linking consumers’ priorities and preferences in public transport usage","authors":"Thomas J. Magor,&nbsp;Leonard V. Coote","doi":"10.1016/j.trb.2025.103307","DOIUrl":"10.1016/j.trb.2025.103307","url":null,"abstract":"<div><div>The interrelatedness of stated choice and best worst experiments motivates the core question of the current research; that is, does a shared behavioural process given rise to responses to both preference elicitation methods. The basic premise of the paper is that a common, underlying behavioural process gives rise to the responses of decision makers to both preference elicitation methods; and therefore, the patterns of preference heterogeneity between both methods can be mapped. We investigate this using a multitrait-multimethod specification of mixed logit which has the following two defining characteristics: firstly, the partitioning of the unobserved sources of preference heterogeneity into components that are general to the methods and second, components that are unique to each method. The core findings show that common underlying sources of preference heterogeneity do give rise to decision makers’ responses in both stated choice and best worst experiments (following a specifically theorised stucture). Our primary empirical contribution is – for within subjects deigns where data is generated from the same respondents across two or more preference elicitation methods – that the preference heterogeneity for alike attributes in each of the elicitation methods can be empirically shown to converge on the same source. This remains an assumption in much prior research of this type, but until now, method effects related to the use of different preference elicitation tasks have confounded the interpretation of jointly estimated models that combined attribute priorities and preferences. The implications of our work for transport researchers is that best worst and stated choice experiments can be used in complementary ways – given the empirical support for this core assumption.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103307"},"PeriodicalIF":6.3,"publicationDate":"2025-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144996549","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":"The value of partial and full pre-trip information under stochastic demand and bottleneck capacity in the morning commute","authors":"Zihan Wu ,&nbsp;Zi-Yang Wang ,&nbsp;Xiao Han ,&nbsp;Rui Jiang ,&nbsp;Ronghui Liu","doi":"10.1016/j.trb.2025.103311","DOIUrl":"10.1016/j.trb.2025.103311","url":null,"abstract":"<div><div>This paper studies the welfare effects of providing pre-trip information to morning commuters in a single-bottleneck model, where both bottleneck capacity and travel demand are exogenously stochastic and assumed to follow an arbitrary joint distribution. We first derive the equilibrium travel costs under varying levels of information completeness, and then examine how information completeness influences travel costs and the key factors driving the welfare outcomes of information provision. We find that the welfare effects of providing pre-trip information are associated with the information completeness, the degree of correlation between bottleneck capacity and demand, and the frequency and amplitude of bottleneck capacity and demand changes. Although providing full information is never welfare-reducing, providing partial information can increase travel costs compared to no information (i.e., information paradox) when demand and bottleneck capacity are moderately correlated. Nevertheless, transitioning from partial to full information consistently leads to a reduction in travel costs. Our numerical examples further confirm the theoretical results and highlight the necessity of accounting for uncertainties in both supply and demand when developing traveler information systems.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103311"},"PeriodicalIF":6.3,"publicationDate":"2025-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144932670","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 geometric cognition pedestrian dynamics model considering heterogeneous collision avoidance behaviors","authors":"Bohan Li ,&nbsp;Yunchao Qu ,&nbsp;Yao Xiao ,&nbsp;Jianjun Wu ,&nbsp;Ziyou Gao","doi":"10.1016/j.trb.2025.103309","DOIUrl":"10.1016/j.trb.2025.103309","url":null,"abstract":"<div><div>Collision avoidance is one of the crucial behaviors in pedestrian dynamics, especially in high-density scenarios where it frequently occurs to maintain crowd safety and stability. However, the heterogeneity of this behavior has not been well investigated. Given the advantages of geometric compatibility, a microscopic pedestrian flow model combining the Voronoi diagram and velocity obstacle approaches has been proposed to fully quantify heterogeneous collision avoidance behavior. In this model, the velocity region is dynamically partitioned into three sub-regions to describe the avoidance behaviors with different levels of aggressiveness. The concept of the difference to collision velocity is defined to characterize the evolution of aggressiveness, and a heuristic velocity region evolution rule is proposed to determine the walking velocity. To demonstrate the effectiveness of the model, a series of pedestrian flow scenarios are validated in terms of fundamental diagrams, self-organization phenomena, and behavioral heterogeneity. The impact of heterogeneous collision avoidance behaviors on crowd phenomena is then analyzed according to simulations. The DF-GLS algorithm is used to determine the crowd re-stabilization time. The results show that more aggressive behaviors lead to obvious stop-and-go wave and smaller Yamori’s band index of lane formation phenomenon. Sudden aggressive behaviors will disrupt crowd stability and even cause the crowd into a disorganized state. This model offers valuable insights and supports the optimization of emergency evacuation strategies with practical applications.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103309"},"PeriodicalIF":6.3,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144922206","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}