Transportation Research Part B-Methodological最新文献

{"title":"Welfare optimal bicycle network expansions with induced demand","authors":"Mads Paulsen,&nbsp;Jeppe Rich","doi":"10.1016/j.trb.2024.103095","DOIUrl":"10.1016/j.trb.2024.103095","url":null,"abstract":"<div><div>In this paper, we determine a welfare-optimal investment strategy for bicycle networks while considering the joint impact of travel time savings and induced demand throughout the investment horizon. The paper extends an expansion strategy with fixed demand recently published in Paulsen and Rich (2023). Accommodating induced demand requires that we can express how expansions of the network affect demand through changes in travel time, and also how demand contributes to the net present value function due to accumulated health and travel time savings. It is shown how the net present value function can be approximated through approximations of demand and consumer surplus functions enabling optimisation on a large scale. This process is formulated as a sequence of binary mathematical programs spanning the entire period. We test the approach by applying it to a large-scale network of Cycle Superhighways for Greater Copenhagen. It is demonstrated that the optimised infrastructure investment plan renders benefit–cost ratios exceeding 10 and that accounting for demand effects in the optimisation increases the societal net present value by more than 15% while also changing the geographical structure of the invested network. The paper emphasises the significance of approaching infrastructure investment strategies from a dynamic perspective instead of relying on static evaluations, which is the predominant practice in practical planning.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"190 ","pages":"Article 103095"},"PeriodicalIF":5.8,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142444894","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":"Airline cabin crew pairing with accurate characterization of cross-class substitution: A branch-and-price approach","authors":"Xin Wen ,&nbsp;Sai-Ho Chung ,&nbsp;Tsan-Ming Choi ,&nbsp;Xiaowen Fu","doi":"10.1016/j.trb.2024.103084","DOIUrl":"10.1016/j.trb.2024.103084","url":null,"abstract":"<div><div>Given the increasing heterogeneity of the types of aircraft operated, many airlines have switched from the traditional team scheduling approach to the individual scheduling approach for cabin crew planning. The individual approach not only allows for greater scheduling flexibility, but also helps achieve better utilization of available manpower through cross-class substitution (i.e., assigning a high-class crew member to substitute a low-class crew member), which is especially important in view of the recent industry-wide manpower shortage led by the post-pandemic traffic recovery. In this study, we present a new crew pairing approach with accurate characterization of cross-class substitution. This approach is novel as it can distinguish the substitutions among different pairs of crew classes with precise characterization of work time and costs. We develop a branch-and-price solution approach. A new specialized flight network that characterizes each crew class for each flight is constructed to realize the recognition of substitution heterogeneity. Although the size of the new flight network increases dramatically, it can be simplified to consider only one crew class for each flight in each column generation iteration without affecting optimality. We also propose a new column-fixing branching strategy to identify integer solutions for the newly developed model with non-negative integer variables. Computational experiments based on real-world collected flight schedules are conducted to validate the performance of the proposed approach in obtaining high-quality solutions (e.g., achieving a 0.01% optimality gap). The cost saving of the new crew pairing approach is examined, which is shown to vary greatly across different manpower availability levels and part-time cost settings. Besides, rich managerial insights are derived. Among others, we find that if it is expensive for a high crew class to directly substitute a low class (e.g., one that is experiencing a shortage), indirect assistance can be provided through an intermediate class.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"190 ","pages":"Article 103084"},"PeriodicalIF":5.8,"publicationDate":"2024-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142444893","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":"Dynamic spatial price equilibrium, dynamic user equilibrium, and freight transportation in continuous time: A differential variational inequality perspective","authors":"Terry L. Friesz","doi":"10.1016/j.trb.2024.103085","DOIUrl":"10.1016/j.trb.2024.103085","url":null,"abstract":"<div><div>In this paper we provide a statement of dynamic spatial price equilibrium (DSPE) in continuous time as a basis for modeling freight flows in a network economy. The model presented describes a spatial price equilibrium due to its reliance on the notion that freight movements occur in response to differences between the local and distant prices of goods for which there is excess demand; moreover, local and distant delivered prices are equated at equilibrium. We propose and analyze a differential variational inequality (DVI) associated with dynamic spatial price equilibrium to study the Nash-like aggregate game at the heart of DSPE using the calculus of variations and optimal control theory. Our formulation explicitly considers inventory and the time lag between shipping and demand fulfillment. We stress that such a time lag cannot be readily accommodated in a discrete-time formulation. We provide an in-depth analysis of the DVI's necessary conditions that reveals the dynamic user equilibrium nature of freight flows obtained from the DVI, alongside the role played by freight transport in maintaining equilibrium commodity prices and the delivered-price-equals-local-price property of spatial price equilibrium. By intent, our contribution is wholly theoretical in nature, focusing on a mathematical statement of the defining equations and inequalities for dynamic spatial price equilibrium (DSPE), while also showing there is an associated differential variational inequality (DVI), any solution of which is a DSPE. The model of spatial price equilibrium we present integrates the theory of spatial price equilibrium in a dynamic setting with the path delay operator notion used in the theory of dynamic user equilibrium. It should be noted that the path delay operator used herein is based on LWR theory and fully vetted in the published dynamic user equilibrium literature. This integration is new and constitutes a significant addition to the spatial price equilibrium and freight network equilibrium modeling literatures. Among other things, it points the way for researchers interested in dynamic traffic assignment to become involved in dynamic freight modeling using the technical knowledge they already possess. In particular, it suggests that algorithms developed for dynamic user equilibrium may be adapted to the study of urban freight modelled as a dynamic spatial price equilibrium. As such, our work provides direction for future DSPE algorithmic research and application. However, no computational experiments are reported herein; instead, the computing of dynamic spatial price equilibria is the subject of a separate manuscript.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"190 ","pages":"Article 103085"},"PeriodicalIF":5.8,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142442889","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":"Impacts of a sustainable aviation fuel mandate on airline competition — Full-service carrier vs. low-cost carrier","authors":"Ruotian Chen ,&nbsp;Hangjun Yang ,&nbsp;Kun Wang ,&nbsp;Changmin Jiang","doi":"10.1016/j.trb.2024.103098","DOIUrl":"10.1016/j.trb.2024.103098","url":null,"abstract":"<div><div>The aviation industry has proposed the collective goal of achieving net-zero carbon emissions by 2050. In addition to the existing market-based methods (MBMs), the use of renewable energies, in particular, sustainable aviation fuel (SAF), could be one of the most promising means for achieving this long-term target. This paper investigates how an SAF mandate from the government can lead to heterogeneous impacts on two types of airlines, namely, full-service carriers (FSCs) and low-cost carriers (LCCs), that compete in the same markets. A game-theoretic economic model is constructed that accounts for the different service quality levels and cost structures (i.e., fuel efficiency) between FSCs and LCCs. Our analytical results suggest that the SAF mandate favors LCCs over FSCs. The share of SAF blended into fuel raises the airfares of both types of airlines while reducing the traffic and profit of FSCs. The impacts on the LCC traffic and profit depend on its fuel efficiency relative to that of FSC. When LCCs are sufficiently fuel efficient, the SAF mandate can increase their traffic and profit. The government subsidy on airline's SAF use is also analyzed, deriving the optimal subsidy levels for FSC and LCC respectively to achieve pareto-improvement in social welfare and consumer surplus. We also examine how air passengers’ environmental awareness affects the outcomes of SAF mandate implementation. Our economic model also accounts for passengers’ heterogeneous preferences in terms of service quality and price sensitivity.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"190 ","pages":"Article 103098"},"PeriodicalIF":5.8,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142442888","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":"Corrigendum to “Beyond centralization: Non-cooperative perimeter control with extended mean-field reinforcement learning in urban road networks” [Transportation Research Part B, 186 (2024) 103016]","authors":"Xinghua Li ,&nbsp;Xinyuan Zhang ,&nbsp;Xinwu Qian ,&nbsp;Cong Zhao ,&nbsp;Yuntao Guo ,&nbsp;Srinivas Peeta","doi":"10.1016/j.trb.2024.103097","DOIUrl":"10.1016/j.trb.2024.103097","url":null,"abstract":"","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"190 ","pages":"Article 103097"},"PeriodicalIF":5.8,"publicationDate":"2024-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142653501","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 new generalized statistical model for continuous decisions under stochastic constraints and bounded rationality","authors":"Baibing Li","doi":"10.1016/j.trb.2024.103096","DOIUrl":"10.1016/j.trb.2024.103096","url":null,"abstract":"<div><div>This paper develops a new generalized statistical modeling approach for choice problems where decision-makers are faced with a continuous set of alternatives. In the existing literature, decision-making behavior is usually analyzed in the context where there are only a few discrete alternatives from which decision-makers may choose. This paper generalizes this approach and investigates the scenario where the choice set of decision-makers is a continuous space characterized by stochastic nonlinear constraints. We develop a family of choice distributions to describe decision-makers’ choice behavior for continuous decision-making problems under stochastic constraints and bounded rationality. The proposed choice distribution family provides a generic statistical modeling and prediction approach based on the underlying mechanism that drives the decision-making process to reflect a trade-off between conflicting decision criteria and resource constraints. Finally, two case studies are used to illustrate the developed method.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"190 ","pages":"Article 103096"},"PeriodicalIF":5.8,"publicationDate":"2024-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142653507","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":"Urban rail train timetabling for the end-of-service period with passenger accessibility and operation cost: An advanced benders decomposition algorithm","authors":"Fang Wen,&nbsp;Yao Chen,&nbsp;Yun Bai,&nbsp;Qiaozhen Zhu,&nbsp;Ninghai Li","doi":"10.1016/j.trb.2024.103094","DOIUrl":"10.1016/j.trb.2024.103094","url":null,"abstract":"<div><div>Train timetable during the end-of-service period is crucial for passenger accessibility and operation cost in urban rail transit networks. Existing studies have investigated the last train timetabling problem for improving passenger accessibility. This study investigates a train timetabling problem for the end-of-service period, which concentrates on the coordination of the service ending time on different lines and the last several train timetables. A mixed-integer linear programming model based on a space–time network is proposed to determine the number of train services provided in the end-of-service period while coordinating the timetables of both last and non-last trains, of which the objective function minimizes the number of inaccessible passengers and operation costs. To address the computational challenges, a Benders decomposition algorithm is developed and enhanced with dedicated acceleration strategies. A dual solution algorithm is proposed to efficiently generate the optimal dual solution of the subproblems. A reformulation and update strategy is proposed for the Benders cuts, and a relax-and-fix heuristic is developed to improve solving efficiency of the master problem. Small-scale numerical experiments demonstrate the optimality and efficiency of the proposed Benders decomposition algorithm. Large-scale experiments in the Wuhan network show that the proposed model and algorithm can improve passenger accessibility by 6.8% without additional operation cost, and by 38.7% with a 28.4% increment in operation cost.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"190 ","pages":"Article 103094"},"PeriodicalIF":5.8,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142417313","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 multi-compartment truck and trailer petrol station replenishment problem with domino hazard risks","authors":"Weitiao Wu,&nbsp;Yu Li","doi":"10.1016/j.trb.2024.103078","DOIUrl":"10.1016/j.trb.2024.103078","url":null,"abstract":"<div><div>Petroleum is the foundation of the oil industry and many transportation systems. As a typical hazardous material, transportation of petroleum products by road trucks will create an explosion risk and pose a potential threat to safety. The petrol distribution system with economic viability and safety calls for a well-designed distribution network and effective transportation management. In this paper, we introduce a new multi-compartment truck and trailer petrol station replenishment problem with domino hazard risks, a topic of great practical significance but with limited research attention. The problem jointly optimizes truck routing-scheduling, trailer routing-scheduling, and inventory decisions for oil depots and petrol stations. The evaporation effects of petrol during the transportation, transfer, and inventory process are explicitly considered. Multi-source data are acquired to construct the weighted social factor, including population density, GDP output intensity, POI density, and travel intensity. The comprehensive risk assessment model tailored with the domino effect and social factor is applied to quantitatively measure the risks associated with storage and transportation processes. To tackle this complex non-convex multi-objective problem, we propose a problem decomposition strategy that decomposes the original master problem into two subproblems. A customized multi-objective adaptive large neighborhood search algorithm, combining the benefits of multi-objective random variable neighborhood descent search procedure, archived multi-objective simulated annealing, and hypercube-based selection mechanism, is developed to solve the trailer-related subproblem. For the truck-related subproblem, a first-in-first-out heuristic and a linear relaxation method combined with valid inequalities are employed to rapidly compute the upper and lower bounds. This integrated matheuristic framework effectively coordinates the solutions of the two subproblems. Our model is applied to a metropolitan-wide real-world case study in Guangzhou, China. The results highlight a trade-off between distribution cost minimization and social risk minimization. The detachable mode for trucks and trailers reduces transportation costs, particularly as the distribution network expands. The compartment structure of the trailer greatly affects the efficiency of the distribution network.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"190 ","pages":"Article 103078"},"PeriodicalIF":5.8,"publicationDate":"2024-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142417312","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":"Liner fleet deployment and empty container repositioning under demand uncertainty: A robust optimization approach","authors":"Xi Xiang ,&nbsp;Xiaowei Xu ,&nbsp;Changchun Liu ,&nbsp;Shuai Jia","doi":"10.1016/j.trb.2024.103088","DOIUrl":"10.1016/j.trb.2024.103088","url":null,"abstract":"<div><div>This paper investigates a robust optimization problem concerning the integration of fleet deployment and empty container repositioning in a shipping line network, where a fleet of vessels is dispatched to transport both laden and empty containers, aiming to fulfill a predetermined set of requests over a defined time horizon. The sizes of customer demands are uncertain and are characterized by a budgeted uncertainty set. This study aims to ascertain the vessel types assigned to each shipping route, the routing of laden containers, and the repositioning of empty containers in a manner that minimizes the total cost. Simultaneously, it ensures the feasibility of all transportation plans for any realization of demand within the uncertainty set. We introduce a path-based two-stage robust formulation for addressing the problem. In the first stage, the assignment of vessel types to each shipping route is determined, and the second stage focuses on establishing the routing of laden containers and repositioning of empty containers under a worst-case scenario. We propose the Column-and-Constraint Generation algorithm for solving the proposed robust formulation. To address large-scale size instances, we propose an acceleration technique, i.e., the piece-wise affine policy, which reduces the dimensions of the uncertainty set while maintaining a bounded compromise in solution quality. Comprehensive numerical experiments derived from real-world industries, such as the Shanghai port and CMA CGM, are conducted to validate the proposed formulation and solution methodologies.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"190 ","pages":"Article 103088"},"PeriodicalIF":5.8,"publicationDate":"2024-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142417310","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 convoy movement problem under travel time uncertainty","authors":"Byung Jun Ju,&nbsp;Byung Do Chung","doi":"10.1016/j.trb.2024.103091","DOIUrl":"10.1016/j.trb.2024.103091","url":null,"abstract":"<div><div>A convoy represents a collection of vehicles traveling with a spacing of 50–100 m between them for tactical purposes. The convoy movement problem is a variant of the vehicle routing problem, an NP-hard problem aimed at determining the paths and schedules of convoys. Given the uncertainties in travel times during wartime, attributable to various factors such as road conditions and enemy threats, it is essential to consider uncertain travel times when determining convoy paths and schedules. Therefore, this study introduces a robust convoy movement problem under travel time uncertainty. A polyhedral set for uncertain travel times is used to derive a robust counterpart for the problem. To solve the proposed problem, we establish an exact algorithm that determines optimal solutions by iteratively generating and integrating multiple paths of convoys. This algorithm involves four steps: generation of <em>k</em>-th robust shortest paths, construction of path combinations, adjustment of departure times, and conduction of optimality check. These steps are iterated sequentially until the optimal solution is obtained. In computational experiments, the exact algorithm demonstrates superior performance and reduced computation time compared with the commercial solver CPLEX on both real instances and randomly generated instances. In addition, we conduct a sensitivity analysis for several parameters related to the problem, providing valuable managerial insights for decision-makers.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"190 ","pages":"Article 103091"},"PeriodicalIF":5.8,"publicationDate":"2024-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142417311","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}