样式: 排序: IF: - GO 导出 标记为已读
-
Alternative service network design for bus systems responding to time-varying road disruptions Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-08-17 Hankun Zheng, Huijun Sun, Jianjun Wu, Liujiang Kang
In practice, road disruptions occur frequently, interrupting multiple bus routes at the same time and causing widespread passenger delays. Typically, these disrupted roads are repaired sequentially and then gradually put into service. In response to such time-varying road disruptions, this paper aims to assist bus operators in developing effective alternative service networks for passengers. The proposed
-
Boundedly rational departure time choice in a dynamic continuum user equilibrium model for an urban city Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-08-07 Liangze Yang, Jie Du, S.C. Wong, Chi-Wang Shu
Based on Wardrop’s first principle, the perfectly rational dynamic user equilibrium is widely used to study dynamic traffic assignment problems. However, due to imperfect travel information and a certain “inertia” in decision-making, the boundedly rational dynamic user equilibrium is more suitable to describe realistic travel behavior. In this study, we consider the departure time choice problem incorporating
-
Sustainable hub location under uncertainty Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-08-05 Gita Taherkhani, Mojtaba Hosseini, Sibel A. Alumur
This paper addresses the sustainable design of hub networks under uncertainty in the context of less-than-truckload transportation, taking into account factors related to carbon pricing. The problem is modeled to maximize profits in a stochastic demand environment, where a portion of the demand may remain unserved depending on the trade-off between profits, costs, and carbon emissions. The model explicitly
-
Automated lane changing control in mixed traffic: An adaptive dynamic programming approach Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-08-01 Sayan Chakraborty, Leilei Cui, Kaan Ozbay, Zhong-Ping Jiang
The majority of the past research dealing with lane-changing controller design of autonomous vehicles (s) is based on the assumption of full knowledge of the model dynamics of the and the surrounding vehicles. However, in the real world, this is not a very realistic assumption as accurate dynamic models are difficult to obtain. Also, the dynamic model parameters might change over time due to various
-
Uncapacitated single-allocation hub median location with edge upgrading: Models and exact solution algorithms Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-07-30 Mercedes Landete, Juan M. Muñoz-Ocaña, Antonio M. Rodríguez-Chía, Francisco Saldanha-da-Gama
In this paper, a class of single-allocation hub location problems is investigated from the perspective of upgrading. The latter is understood as an improvement of a set of edges to increase their individual performance, e.g., a decreased unit transportation cost. The goal is to obtain an improved optimal solution to the problem compared to that obtained if upgrading was not done. A budget constraint
-
Approximate dynamic programming for pickup and delivery problem with crowd-shipping Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-07-29 Kianoush Mousavi, Merve Bodur, Mucahit Cevik, Matthew J. Roorda
We study a variant of dynamic pickup and delivery crowd-shipping operation for delivering online orders within a few hours from a brick-and-mortar store. This crowd-shipping operation is subject to a high degree of uncertainty due to the stochastic arrival of online orders and crowd-shippers that impose several challenges for efficient matching of orders to crowd-shippers. We formulate the problem
-
Queue replacement principle for corridor problems with heterogeneous commuters Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-07-25 Takara Sakai, Takashi Akamatsu, Koki Satsukawa
This study investigates the theoretical properties of a departure time choice problem considering commuters’ heterogeneity with respect to the value of schedule delay in corridor networks. Specifically, we develop an analytical method to solve the dynamic system optimal (DSO) and dynamic user equilibrium (DUE) problems. To derive the DSO solution, we first demonstrate the bottleneck-based decomposition
-
The use of pooled RP-SP choice data to simultaneously identify alternative attributes and random coefficients on those attributes Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-07-08 Mehek Biswas, Chandra R. Bhat, Abdul Rawoof Pinjari
Random utility maximization-based discrete choice models involve utility functions that are typically specified with explanatory variables representing alternative-specific attributes. It may be useful to specify some alternative-specific attributes as stochastic in situations when the analyst cannot accurately measure the attribute values considered by the decision maker. In addition, the parameters
-
Using traffic assignment models to assist Bayesian inference for origin–destination matrices Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-07-05 Martin L. Hazelton, Lara Najim
Estimation of traffic volumes between each origin and destination of travel is a standard practice in transport engineering. Commonly the available data constitute traffic counts at various locations on the network, supplemented by a survey-based prior estimate of mean origin–destination traffic volumes. Statistical inference in this type of network tomography problem is known to be challenging. Moreover
-
The integer programing extreme value (IPEV) model: An application for estimation of the leisure trip demand Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-07-04 Koichi Kuriyama, Yasushi Shoji, Takahiro Tsuge
We developed an integer programing extreme value (IPEV) model that accounts the integer property of trip data and has the same advantages as the multiple discrete–continuous extreme value choice (MDCEV) model. The proposed model is consistent with utility theory and provides a single structural framework for simultaneously modeling the choice of alternatives and quantity decisions with the constraint
-
Beyond centralization: Non-cooperative perimeter control with extended mean-field reinforcement learning in urban road networks Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-07-02 Xinghua Li, Xinyuan Zhang, Xinwu Qian, Cong Zhao, Yuntao Guo, Srinivas Peeta
Perimeter control is a traffic management approach aimed at regulating vehicular accumulation within urban regional networks by managing flows on all border-crossing roads. Methods based on the macroscopic fundamental diagram (MFD) fall short in providing specific metering for individual roads. Recent advancements in the cell transmission model (CTM) have attempted to address this limitation but are
-
Exploring the role of Mobility-as-a-Service in morning commuting trips Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-06-28 Manlian Pan, Xiaotong Sun
Promising the seamless integration of multiple transportation modes, Mobility-as-a-Service (MaaS) has gained popularity over the years, yet its effectiveness in enticing private car users and improving travel efficiency remains uncertain. This study explores the competitiveness of MaaS-enabled multi-modal travel options versus private car usage through equilibrium analysis. In addition to pricing that
-
From silver to platinum: The impact of frequent flier tier levels on air travellers’ behaviour Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-06-27 Christiaan Behrens, Gerben de Jong, Jos van Ommeren
We estimate the switching costs created by tier levels, one of the main components of airline frequent flier programs, by exploiting discrete tier thresholds. We first demonstrate that travellers increase their demand to reach a higher tier level just before the end of the calendar year when tier levels are determined, but do not manipulate demand in earlier months. This allows for a novel fuzzy discontinuity
-
A multi-stage spatial queueing model with logistic arrivals and departures consistent with the microscopic fundamental diagram and hysteresis Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-06-26 Yang Gao, David Levinson
This paper introduces a spatial queueing model for a single bottleneck during morning peak hours. Utilizing the logistic function and after appropriate calibration, it articulates the arrival and departure flows in continuous, differentiable terms. By validating the model across different peak periods and locations, the demand model’s robustness is superior to other commonly used functions. This model
-
A Branch-and-Price algorithm for the electric autonomous Dial-A-Ride Problem Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-06-24 Yue Su, Nicolas Dupin, Sophie N. Parragh, Jakob Puchinger
The Electric Autonomous Dial-A-Ride Problem (E-ADARP) consists in scheduling a fleet of electric autonomous vehicles to provide ride-sharing services for customers that specify their origins and destinations. The E-ADARP considers the following perspectives: (i) a weighted-sum objective that minimizes both total travel time and total excess user ride time; (ii) the employment of electric autonomous
-
Is order-2 proportionality good enough for approximating the most likely path flow in user equilibrium traffic assignment? Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-06-18 Liyang Feng, Jun Xie, Xiaobo Liu, Youhua Tang, David Z.W. Wang, Yu (Marco) Nie
The proportionality condition is a standard approach to dealing with the non-uniqueness issue in the user equilibrium (UE) traffic assignment problems (TAP). Although the proportionality condition can reduce the degree of arbitrariness, it remains unclear how much arbitrariness remains and whether it can meaningfully affect model outcomes and relevant decisions that depend on them. The answers to these
-
Mathematical formulations for the multi-period alternative fuel refueling station location problem with routing under decision-dependent flow dynamics Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-06-18 Özlem Mahmutoğulları, Hande Yaman
The refueling station location problem with routing considers vehicles’ ranges and drivers’ preferences about their routes to improve the alternative fuel station infrastructure. Comprehensive planning is necessary for developing a mature infrastructure to overcome budgetary constraints and spatial limitations. Hence, adopting a multi-period planning approach becomes crucial when taking into account
-
Gasoline and electric vehicle ownership rationing over time: Lottery vs. First-come-first-served schemes Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-06-14 Wen-Jing Liu, Zhi-Chun Li, Hai Yang
This paper addresses the ownership rationing issues of gasoline vehicles (GV) and electric vehicles (EV) in a given time horizon. A state-owned vehicle manufacturer is assumed to be the producer of these vehicles. Two typical rationing schemes for the GV and EV ownership that have been implemented in some Chinese megacities, namely a simultaneous lottery scheme for both GV and EV and a hybrid scheme
-
Railway line planning with passenger routing: Direct-service network representations and a two-phase solution approach Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-06-13 Zhiyuan Yao, Lei Nie, Huiling Fu
The railway line planning problem (LPP) plays a crucial role in determining the quality of services provided to passengers, as well as operation costs borne by railway companies. In periodic railway LPPs, it is common to consider passenger transfers between train lines to realize a general passenger travel cost setting in the railway system. While detecting passenger transfers requires incorporating
-
Modeling shared parking services at spatially correlated locations through a weibit-based combined destination and parking choice equilibrium model Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-06-10 Yu Gu, Anthony Chen, Songyot Kitthamkesorn
This paper proposes a weibit-based equilibrium choice model for investigating the effect of the emerging shared parking services, which have recently received increasing interest, on combined destination location and parking choice behaviors. The model considers the features of shared parking services, including the avoidance of cruising to search for a parking space and limited supply of shared parking
-
Sequencing ship operations considering the trajectory of the quay crane spreader Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-06-10 Baolin Wen, Kap Hwan Kim, Xuehao Feng
This study addresses the sequencing problem in ship operations, with the aim of minimizing the quay crane operation time in a ship bay. By analysing realistic trajectories of the quay crane spreader in various situations, a mathematical model for expressing the transport times of the spreader is established and a method for determining the shortest-time trajectory for a given bay configuration is proposed
-
How mandatory are ‘Mandatory’ lane changes? An analytical and experimental study on the costs of missing freeway exits Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-06-08 Zhaohan Wang, Mohsen Ramezani, David Levinson
Lane changing, recognised as one of the most intricate manoeuvres in road traffic, has attracted extensive scholarly interest. To date, the concept of lane change has been categorised into two distinct classifications, namely mandatory and discretionary. Mandatory lane changes (MLCs) are often regarded as absolute, implying that the possibility of not executing the lane change is frequently disregarded
-
The consistent vehicle routing problem with stochastic customers and demands Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-06-04 Aldair Alvarez, Jean-François Cordeau, Raf Jans
This paper introduces the consistent vehicle routing problem with stochastic customers and demands. We consider driver consistency as customer-driver assignments that remain fixed when the realizations of the random variables are observed. We study the problem in a two-stage scenario-based stochastic programming framework. In the first stage, customers are assigned to drivers, while in the second stage
-
Ring road investment, cordon tolling, and urban spatial structure Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-03-01 Zhi-Chun Li, Li Cheng, André de Palma
Ring roads, as candidate cordons, provide a convenient condition for implementing cordon tolling schemes. This paper presents a methodology for investigating the ring road investment and cordon tolling problems in a congested ring-radial city. A two-dimensional urban system equilibrium for a ring-radial city is first formulated, in which interrelated equilibria among stakeholders, including the authorities
-
Autonomous vehicles policy and safety investment: An equilibrium analysis with endogenous demand Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-03-01 Herbert Dawid, Xuan Di, Peter M. Kort, Gerd Muehlheusser
The safety concerns for autonomous vehicles (AV) are shown to be a roadblock to their adoption. This paper addresses these concerns by studying a unified, game-theoretic framework (leader–follower game) of mixed traffic in which AVs and human-driven vehicles (HV) coexist, with endogenous vehicle demand and different types of accidents emerging in mixed traffic as crucial building blocks. We study the
-
Two-stage recoverable robust optimization for an integrated location–allocation and evacuation planning problem Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-02-24 Yunqiang Yin, Xinrui Xu, Dujuan Wang, Yugang Yu, T.C.E. Cheng
We consider an integrated location–allocation and evacuation planning problem in a disaster context, where the effects of a disaster, including the uncertain capacities of relief facilities (rescue centers and distribution centers), uncertain demands for relief supplies and casualty treatment services, and uncertain availability of transportation links are characterized by a discrete scenario set.
-
Autonomous Vehicles: Moral dilemmas and adoption incentives Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-02-19 Eberhard Feess, Gerd Muehlheusser
In unavoidable traffic accidents, autonomous vehicles (AVs) face the dilemma of protecting either the passenger(s) or third parties. Recent studies show that, in accidents involving an AV, most people prefer the AV to behave such that it minimizes expected harm. At the same time, however, they are more willing to adopt an AV if it prioritizes the passenger(s), i.e. themselves. A regulator therefore
-
Average minimum distance to visit a subset of random points in a compact region Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-02-16 Chao Lei, Yanfeng Ouyang
This paper seeks an analytical estimate of the expected distance for visiting an arbitrary subset of independently and uniformly distributed random points within a compact region. This problem has many real-world application contexts such as the emerging on-demand transportation and logistics services (e.g., ridesharing, customized buses). The lower bounds of the expected optimal tour length are analytically
-
A branch-and-cut algorithm for scheduling train platoons in urban rail networks Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-02-08 Simin Chai, Jiateng Yin, Andrea D’Ariano, Ronghui Liu, Lixing Yang, Tao Tang
With the emerging of virtual coupling technologies, the concept of train platoon, where different vehicles can be flexibly and dynamically grouped or decoupled, has become a hot research topic. In this study, we investigate the scheduling of train platoons for urban rail networks with time-dependent demand to mitigate passenger inconvenience. We propose a mixed-integer linear programming (MILP) model
-
The dry dock scheduling problem Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-02-07 Shuai Jia, Chung-Lun Li, Qiang Meng
Dry docks are essential facilities for ship maintenance and thus are critical assets of a shipyard. In this paper, we study a dry dock scheduling problem that arises from shipyard operations and management. The problem involves decisions on assigning ships to a set of dry docks and sequencing the ships in each dry dock, subject to complicated but realistic operational constraints such as parallel ship
-
-
Continuum dynamic traffic models with novel local route-choice strategies for urban cities Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-02-01 Chengyuan Wu, Liangze Yang, Jie Du, Xin Pei, S.C. Wong
In dynamic traffic assignment problems, travelers choose routes that minimize their cost of traveling to their destination. In traditional continuum models, travelers have a global perception of traffic; in this study, two novel reactive route-choice strategies are devised in which travelers have a local perception of traffic. In Strategy A, travelers identify a set of feasible temporary destinations
-
Weighting strategies for pairwise composite marginal likelihood estimation in case of unbalanced panels and unaccounted autoregressive structure of the errors Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-01-30 Sebastian Büscher, Dietmar Bauer
Composite Marginal Likelihood (CML) estimation and its advancements are popular ways to reduce the computational burden involved in the estimation of Multinomial Probit (MNP) models. CMLs use the product of marginal likelihoods of decision makers instead of the complete joint likelihood, reducing the numerical load. This allows for the estimation of models for larger and more complex data sets. The
-
A bathtub model of transit congestion Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-01-29 Lewis J. Lehe, Ayush Pandey
Studies of transit dwell times suggest that the delay caused by passengers boarding and alighting rises with the number of passengers on each vehicle. This paper incorporates such a “friction effect” into an isotropic model of a transit route with elastic demand. We derive a strongly unimodal “Network Alighting Function” giving the steady-state rate of passenger flows in terms of the accumulation of
-
Highway toll allocation Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-01-30 Hao Wu, René van den Brink, Arantza Estévez-Fernández
An important operational aspect in the management of tolled highways is how the collected tolls should be allocated over the different highway segments, either operated by different operators or by different units of one operator. This paper analyzes this toll allocation problem both from an axiomatic and a game theoretic perspective. Based on different toll charging systems, specifically the distance-based
-
Delay-throughput tradeoffs for signalized networks with finite queue capacity Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-01-18 Shaohua Cui, Yongjie Xue, Kun Gao, Kai Wang, Bin Yu, Xiaobo Qu
Network-level adaptive signal control is an effective way to reduce delay and increase network throughput. However, in the face of asymmetric exogenous demand, the increase of network performance via adaptive signal control alone is at the expense of service fairness (i.e., phase actuation fairness and network resource utilization fairness). In addition, for oversaturated networks, arbitrary adaptive
-
Single-leg shipping revenue management for expedited services with ambiguous elasticity in transit-time-sensitive demand Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-01-17 Qinghe Sun, Wei Li, Qiang Meng
The growing demand for expedited shipping services from transit-time-sensitive (TTS) shippers poses a dilemma for ocean carriers, who must navigate the trade-off between transit time and the associated fuel costs. Charging a premium for expedited services offers a potential solution, but it requires careful consideration to avoid detrimental effects on demand. This study focuses on single-leg shipping
-
Passenger-oriented rolling stock scheduling in the metro system with multiple depots: Network flow based approaches Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-01-19 Entai Wang, Lixing Yang, Jiateng Yin, Jinlei Zhang, Ziyou Gao
This study investigates a rolling stock scheduling problem on a metro line with multiple depots. Two novel optimization models, i.e., an arc-based and a path-based network-flow models, are formulated with the aim of improving the service level and reducing the operation cost simultaneously, in which the flexible train composition mode is also taken into consideration to well match the transport capacity
-
A data-driven optimization approach to improving maritime transport efficiency Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2024-01-18 Ran Yan, Yan Liu, Shuaian Wang
Ship inspections conducted by port state control (PSC) can effectively reduce maritime risks and protect the marine environment. The effectiveness of PSC depends on accurately selecting ships with higher risk for inspection. Ship risk profile (SRP) is currently the most common method of quantifying ship risk, but the thresholds of the factors that determine a ship’s risk and classification in the SRP
-
-
Dynamic container slot allocation for a liner shipping service Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2023-12-28 Tingsong Wang, Qiang Meng, Xuecheng Tian
In this paper, we study a dynamic container slot allocation problem (DCSAP) for a liner container shipping company that aims to make an acceptance or rejection decision to each dynamically arriving container slot booking request. To capture the dynamic arrival feature and real-time acceptance/rejection decision of the booking request, we formulate the DCSAP as a dynamic programming (DP) model with
-
A flexible train composition strategy with extra-long trains for high-speed railway corridors with time-varying demand Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2023-12-26 Guangming Xu, Linhuan Zhong, Wei Liu, Jing Guo
To accommodate the uneven spatio-temporal distribution of passenger demand and improve the maximum transportation capacity for high-speed railway (HSR) corridors, this study proposes a demand-oriented flexible train composition strategy. The proposed strategy allows flexibility in selecting the number of train composition units (e.g., train carriages) for each train to accommodate the demand variations
-
Integrated scheduling optimization of AGV and double yard cranes in automated container terminals Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2023-12-23 Xiaoju Zhang, Huijuan Li, Jiuh-Biing Sheu
Double yard cranes in one yard block refer to two yard cranes that run in different rails and can pass each other. They can both reach to the seaside and landside of the yard blocks. But interference between the double yard cranes occurs during picking up or putting down containers, which has to be solved when assigning tasks to the double yard cranes. AGVs assignment have also to be considered when
-
Dynamic spatio-temporal interactive clustering strategy for free-floating bike-sharing Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2023-12-21 Zihao Tian, Jing Zhou, Lixin Tian, David Z.W. Wang
As an important part of green travel mode, operation service of bike-sharing system is increasingly intelligent and refined. Operators can effectively match supply to demand through reasonable delivery and rebalancing methods. One of the most important foundations of these strategies is zone management. Therefore, this paper establishes a new framework of management area division, which includes three
-
Deep hybrid model with satellite imagery: How to combine demand modeling and computer vision for travel behavior analysis? Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2023-12-19 Qingyi Wang, Shenhao Wang, Yunhan Zheng, Hongzhou Lin, Xiaohu Zhang, Jinhua Zhao, Joan Walker
Classical demand modeling analyzes travel behavior using only low-dimensional numeric data (i.e. sociodemographics and travel attributes) but not high-dimensional urban imagery. However, travel behavior depends on the factors represented by both numeric data and urban imagery, thus necessitating a synergetic framework to combine them. This study creates a theoretical framework of deep hybrid models
-
Local stability of traffic equilibria in an isotropic network Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2023-12-15 Ayush Pandey, Lewis J. Lehe, Vikash V. Gayah
For a static economic model of auto traffic in an isotropic zone, this paper classifies possible equilibria into three types, by whether traffic is hypercongested and by the relative slopes of “supply” and “demand” curves. We then conduct a local stability analysis of each type when density, demand and the unit travel time (inverse speed) evolve gradually and simultaneously according to dynamical systems
-
Optimal investments of port authorities facing ambiguity on uncertain market demands Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2023-12-15 Hsiao-Chi Chen, Shi-Miin Liu
This study explores how two competing port authorities facing ambiguity about uncertain market demands determine their optimal investments. Using the Choquet expected utility function, the port authorities are categorized into four types: ambiguity-averse and risk-averse, ambiguity-neutral and risk-averse, ambiguity-averse and risk-neutral, and ambiguity-neutral and risk-neutral. Each type can reach
-
Carsharing equitable relocation problem: A two-stage stochastic programming approach with learning-embedded endogenous uncertainty in demand Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2023-12-11 Si Zhang, Huijun Sun, Yang Liu, Ying Lv, Jianjun Wu, Xiaoyan Feng
Uncertain demand may exacerbate the imbalance of the supply–demand for a one-way carsharing system and complicate vehicle relocation decisions. To consider the effect of the uncertainty, this study proposes a two-stage stochastic nonlinear programming model, integrating long-term and short-term decisions and maximizing the profit of the carsharing companies. Specifically, in the first stage, tactical
-
Modeling elasticity, similarity, stochasticity, and congestion in a network equilibrium framework using a paired combinatorial weibit choice model Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2023-12-09 Guoyuan Li, Anthony Chen, Seungkyu Ryu, Songyot Kitthamkesorn, Xiangdong Xu
In the traffic assignment problem for predicting traffic flow patterns in a transportation network, it is important to account for route overlap and non-identical perception variance in route choice analysis. In this study, we establish a novel route choice model, named the paired combinatorial weibit (PCW) model, to capture the route overlap and route-specific perception variance. The PCW model retains
-
Apron layout planning–Optimal positioning of aircraft stands Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2023-12-06 Thomas Hagspihl, Rainer Kolisch, Pirmin Fontaine, Sebastian Schiffels
At many airports, space on the apron is scarce and has to be used efficiently. To that end, we optimize the layout of aircraft parking positions adjacent to the airport terminal, pursuing two lexicographically ordered objectives. First, we minimize the number of aircraft that have to be diverted to remote parking positions, because positions adjacent to the terminal are not available. Second, we minimize
-
Alternate closed-form weibit-based model for assessing travel choice with an oddball alternative Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2023-12-01 Yu Gu, Anthony Chen, Songyot Kitthamkesorn, Sunghoon Jang
Herein, a weibit-based model is proposed as an alternative to Recker's logit choice model with an “oddball” alternative, which explicitly focuses on a single alternative that has unique attributes to other conventional alternatives in the choice set [Recker, W.W. (1995). Discrete choice with an oddball alternative. Transportation Research, 29B, 201–212]. While retaining the closed-form probability
-
Statistical inference of travelers’ route choice preferences with system-level data Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2023-12-01 Pablo Guarda, Sean Qian
Traditional network models encapsulate travel behavior among all origin–destination pairs based on a simplified and generic travelers’ utility function. Typically, the utility function consists of travel time solely, and its coefficients are equated to estimates obtained from discrete choice models and stated preference data. While this modeling strategy is reasonable, the inherent sampling bias in
-
Maximum capture problem based on paired combinatorial weibit model to determine park-and-ride facility locations Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2023-11-25 Songyot Kitthamkesorn, Anthony Chen, Seungkyu Ryu, Sathaporn Opasanon
Park-and-ride (P&R) facilities are key components in encouraging people to use the transit system by allowing them to leave their private vehicles at certain locations. The well-known multinomial logit (MNL) model is often used to develop a random utility maximization–based mathematical programming formulation to determine P&R facility locations. According to the independently and identically distributed
-
-
Credit charge-cum-reward scheme for green multi-modal mobility Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2023-11-11 Hongxing Ding, Hai Yang, Xiaoran Qin, Hongli Xu
To promote green mobility and alleviate congestion and emissions, this study proposes a credit charge-cum-reward (CCR) scheme where the government determines mode-specific credit charging and rewarding rates together with charging and redemption prices to achieve regulation objectives. Over a CCR scheme period, travelers choose either driving by consuming credits or taking transit to accumulate credits
-
Ensuring the robustness of link flow observation systems in sensor failure events Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2023-11-08 Xinyao Yu, Shoufeng Ma, Ning Zhu, William H.K. Lam, Hao Fu
Network link flow data are an intuitive information for monitoring the traffic condition of the entire network, and can be used to enhance traffic management and control. Link flow observation systems are typically designed using flow conservation equations to obtain the information of flow on unobserved links by inference. The occurrence of sensor failures in such systems may lead to flow information
-
Scalable reinforcement learning approaches for dynamic pricing in ride-hailing systems Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2023-11-08 Zengxiang Lei, Satish V. Ukkusuri
Dynamic pricing is a widely applied strategy by ride-hailing companies, such as Uber and Lyft, to match the trip demand with the availability of drivers. Deciding proper pricing policies is challenging and existing reinforcement learning (RL)-based solutions are restricted in solving small-scale problems. In this study, we contribute to RL-based approaches that can address the dynamic pricing problem
-
The impact of autonomous ships in regional waterways Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2023-11-02 Wei Wang, Shuaian Wang, Lu Zhen, Gilbert Laporte
Technological innovation has been reshaping all walks of life, and the marine shipping industry is no exception. Autonomous vessels have gained significant attention due to their numerous advantages. However, regulatory constraints and expensive manufacturing costs are impeding the application of autonomous vessels. To overcome these challenges, this research conducts experiments with autonomous ships
-
A stochastic dynamic network loading model for mixed traffic with autonomous and human-driven vehicles Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2023-10-26 Fang Zhang, Jian Lu, Xiaojian Hu, Qiang Meng
In this study, we develop a stochastic dynamic network loading (DNL) model for the mixed traffic with autonomous vehicles (AVs) and human-driven vehicles (HVs). The source of stochasticity is the uncertainty inherent in the arrival process of the two classes of vehicular flow. The developed model captures both within-link and between-link traffic flow dependencies and evaluates the network state distribution
-
A data-driven discrete simulation-based optimization algorithm for car-sharing service design Transp. Res. Part B Methodol. (IF 5.8) Pub Date : 2023-10-21 Tianli Zhou, Evan Fields, Carolina Osorio
This paper formulates a discrete simulation-based optimization (SO) algorithm for a family of large-scale car-sharing service design problems. We focus on the profit-optimal assignment of vehicle fleet across a network of two-way (i.e., round-trip) car-sharing stations. The proposed approach is a metamodel SO approach. A novel metamodel based on a mixed-integer program (MIP) is formulated. The metamodel