for Journals by Title or ISSN
for Articles by Keywords
help
  Subjects -> TRANSPORTATION (Total: 159 journals)
    - AIR TRANSPORT (7 journals)
    - AUTOMOBILES (20 journals)
    - RAILROADS (4 journals)
    - ROADS AND TRAFFIC (4 journals)
    - SHIPS AND SHIPPING (27 journals)
    - TRANSPORTATION (97 journals)

TRANSPORTATION (97 journals)

Accident Analysis & Prevention     Partially Free   (Followers: 44)
AI & Society     Hybrid Journal   (Followers: 3)
Analytic Methods in Accident Research     Hybrid Journal   (Followers: 1)
Archives of Transport     Open Access   (Followers: 18)
Bitácora Urbano-Territorial     Open Access   (Followers: 2)
Botswana Journal of Technology     Full-text available via subscription  
Case Studies on Transport Policy     Hybrid Journal   (Followers: 4)
Cities in the 21st Century     Open Access   (Followers: 13)
Economics of Transportation     Partially Free   (Followers: 12)
Emission Control Science and Technology     Hybrid Journal   (Followers: 1)
EURO Journal of Transportation and Logistics     Hybrid Journal   (Followers: 6)
European Transport Research Review     Open Access   (Followers: 25)
Geosystem Engineering     Hybrid Journal   (Followers: 3)
IATSS Research     Open Access  
IEEE Vehicular Technology Magazine     Full-text available via subscription   (Followers: 7)
IET Electrical Systems in Transportation     Hybrid Journal   (Followers: 7)
IET Intelligent Transport Systems     Hybrid Journal   (Followers: 5)
International Innovation – Transport     Open Access   (Followers: 8)
International Journal of Applied Logistics     Full-text available via subscription   (Followers: 5)
International Journal of Crashworthiness     Hybrid Journal   (Followers: 5)
International Journal of Critical Infrastructure Protection     Hybrid Journal   (Followers: 6)
International Journal of e-Navigation and Maritime Economy     Open Access  
International Journal of Electric and Hybrid Vehicles     Hybrid Journal   (Followers: 7)
International Journal of Heavy Vehicle Systems     Hybrid Journal   (Followers: 8)
International Journal of Intelligent Transportation Systems Research     Hybrid Journal   (Followers: 7)
International Journal of Micro-Nano Scale Transport     Full-text available via subscription   (Followers: 1)
International Journal of Mobile Communications     Hybrid Journal   (Followers: 9)
International Journal of Ocean Systems Management     Hybrid Journal   (Followers: 3)
International Journal of Physical Distribution & Logistics Management     Hybrid Journal   (Followers: 8)
International Journal of Services Technology and Management     Hybrid Journal   (Followers: 1)
International Journal of Sustainable Transportation     Hybrid Journal   (Followers: 9)
International Journal of Traffic and Transportation Engineering     Open Access   (Followers: 16)
International Journal of Transportation Science and Technology     Full-text available via subscription   (Followers: 8)
International Journal of Vehicle Systems Modelling and Testing     Hybrid Journal   (Followers: 4)
International Journal of Vehicular Technology     Open Access   (Followers: 3)
Journal of Advanced Transportation     Hybrid Journal   (Followers: 11)
Journal of Mechatronics, Electrical Power, and Vehicular Technology     Open Access   (Followers: 1)
Journal of Modern Transportation     Full-text available via subscription   (Followers: 4)
Journal of Navigation     Hybrid Journal   (Followers: 111)
Journal of Sport & Social Issues     Hybrid Journal   (Followers: 9)
Journal of Sustainable Mobility     Full-text available via subscription  
Journal of Traffic and Transportation Engineering (English Edition)     Open Access  
Journal of Transport & Health     Hybrid Journal   (Followers: 4)
Journal of Transport and Land Use     Open Access   (Followers: 21)
Journal of Transport and Supply Chain Management     Open Access   (Followers: 8)
Journal of Transport Geography     Hybrid Journal   (Followers: 17)
Journal of Transport History     Full-text available via subscription   (Followers: 13)
Journal of Transport Literature     Open Access   (Followers: 7)
Journal of Transportation Safety & Security     Hybrid Journal   (Followers: 8)
Journal of Transportation Security     Hybrid Journal   (Followers: 3)
Journal of Transportation Systems Engineering and Information Technology     Full-text available via subscription   (Followers: 14)
Journal of Transportation Technologies     Open Access   (Followers: 12)
Journal of Waterway Port Coastal and Ocean Engineering     Full-text available via subscription   (Followers: 7)
Les Dossiers du Grihl     Open Access  
Logistique & Management     Full-text available via subscription  
Mobility in History     Full-text available via subscription   (Followers: 1)
Modern Transportation     Open Access   (Followers: 7)
Nonlinear Dynamics     Hybrid Journal   (Followers: 5)
Open Journal of Safety Science and Technology     Open Access   (Followers: 5)
Pervasive and Mobile Computing     Hybrid Journal   (Followers: 9)
Proceedings of the Institution of Mechanical Engineers Part F: Journal of Rail and Rapid Transit     Hybrid Journal   (Followers: 10)
PS: Political Science & Politics     Full-text available via subscription   (Followers: 23)
Public Transport     Hybrid Journal   (Followers: 16)
Recherche Transports Sécurité     Hybrid Journal   (Followers: 2)
Research in Transportation Business and Management     Partially Free   (Followers: 3)
Revista Transporte y Territorio     Open Access   (Followers: 1)
SourceOCDE Transports     Full-text available via subscription   (Followers: 1)
Sport, Education and Society     Hybrid Journal   (Followers: 13)
Sport, Ethics and Philosophy     Hybrid Journal   (Followers: 2)
Streetnotes     Open Access   (Followers: 3)
Synthesis Lectures on Mobile and Pervasive Computing     Full-text available via subscription   (Followers: 2)
Tire Science and Technology     Full-text available via subscription   (Followers: 2)
Transactions on Transport Sciences     Open Access   (Followers: 5)
Transport     Hybrid Journal   (Followers: 13)
Transport and Telecommunication Journal     Open Access   (Followers: 4)
Transport in Porous Media     Hybrid Journal   (Followers: 1)
Transport Reviews: A Transnational Transdisciplinary Journal     Hybrid Journal   (Followers: 9)
Transportation     Hybrid Journal   (Followers: 25)
Transportation Geotechnics     Full-text available via subscription   (Followers: 1)
Transportation Infrastructure Geotechnology     Hybrid Journal   (Followers: 7)
Transportation Journal     Full-text available via subscription   (Followers: 11)
Transportation Letters : The International Journal of Transportation Research     Hybrid Journal   (Followers: 1)
Transportation Research Part A: Policy and Practice     Hybrid Journal   (Followers: 30)
Transportation Research Part B: Methodological     Hybrid Journal   (Followers: 28)
Transportation Research Part C: Emerging Technologies     Hybrid Journal   (Followers: 18)
Transportation Research Procedia     Open Access   (Followers: 1)
Transportation Research Record : Journal of the Transportation Research Board     Full-text available via subscription   (Followers: 34)
Transportation Science     Full-text available via subscription   (Followers: 17)
TRANSPORTES     Open Access   (Followers: 4)
Transportmetrica A : Transport Science     Hybrid Journal   (Followers: 2)
Transportmetrica B : Transport Dynamics     Hybrid Journal   (Followers: 1)
Travel Behaviour and Society     Full-text available via subscription   (Followers: 3)
Travel Medicine and Infectious Disease     Hybrid Journal   (Followers: 1)
Urban, Planning and Transport Research     Open Access   (Followers: 16)
Vehicular Communications     Full-text available via subscription   (Followers: 1)
World Review of Intermodal Transportation Research     Hybrid Journal   (Followers: 3)
Транспортні системи та технології перевезень     Open Access  
Journal Cover   Transportation Research Part B: Methodological
  [SJR: 3.306]   [H-I: 70]   [28 followers]  Follow
    
   Hybrid Journal Hybrid journal (It can contain Open Access articles)
   ISSN (Print) 0191-2615
   Published by Elsevier Homepage  [2800 journals]
  • Planning and operating a shared goods and passengers on-demand rapid
           transit system for sustainable city-logistics
    • Abstract: Publication date: Available online 28 August 2015
      Source:Transportation Research Part B: Methodological
      Author(s): Ezzeddine Fatnassi, Jouhaina Chaouachi, Walid Klibi
      This article investigates the potential of integrating a shared goods and passengers on-demand rapid transit system in urban areas. Although persons and goods movements have different objectives and constraints, mixing their travels on the same network is within current trends. So we investigate in this paper how they could share a rapid transit network and use the available transportation capacity within a city more efficiently in an interconnected way. Based on the common characteristics of personal rapid transit (PRT) and freight rapid transit (FRT), this paper proposes an emergent and efficient transportation solution in order to enhance the sustainability of city logistics. Next, the operational level is focused on to characterize the dynamic transportation problem and to propose two strategies to formulate it. This problem aims to respond to the number of transportation requests arriving on a periodic basis with adequate service level while minimizing the empty movements of a set of electric vehicles with limited battery capacity. An efficient solution approach based on the forward optimization of periodic transportation sub-problems is proposed and validated. The applicability of the PRT–FRT mode is demonstrated and computational results in comparison to other transportation option is also presented and discussed.


      PubDate: 2015-08-29T06:01:03Z
       
  • Statistical methods for comparison of day-to-day traffic models
    • Abstract: Publication date: Available online 29 August 2015
      Source:Transportation Research Part B: Methodological
      Author(s): Martin L. Hazelton, Katharina Parry
      Day-to-day dynamic traffic models have considerable potential as tools for transport network management and planning, and also for the study of traveller behaviour. However, their efficacy for these purposes is dependent on appropriate model selection. In particular, while it can be tempting to incorporate sophisticated and intricate representations of traveller learning in day-to-day models, it is important to ask whether the available data are able to support such a level of model complexity. To this end, our overall aim is to investigate the extent to which it is possible to learn about day-to-day traveller behaviour from observations on traffic counts collected over a sequence of days. The paper makes two specific contributions. The first is the development of a principled Bayesian methodology for comparing day-to-day models using link count data, and a description of how it may be implemented in practice using Markov chain Monte Carlo methods. The second contribution is a suite of simulation studies that examine whether these techniques can select the correct model within a set of alternatives with a variety of complexities of behavioural representation. We find that successful model choice based on link count data is often possible when travellers are relatively sensitive to differences in route utilities.


      PubDate: 2015-08-29T06:01:03Z
       
  • Dynamic activity-travel assignment in multi-state supernetworks
    • Abstract: Publication date: Available online 29 August 2015
      Source:Transportation Research Part B: Methodological
      Author(s): Peng Liu, Feixiong Liao, Hai-Jun Huang, Harry Timmermans
      The integration of activity-based modeling and dynamic traffic assignment for travel demand analysis has recently attracted ever-increasing attention. However, related studies have limitations either on the integration structure or the number of choice facets being captured. This paper proposes a formulation of dynamic activity-travel assignment (DATA) in the framework of multi-state supernetworks, in which any path through a personalized supernetwork represents a particular activity-travel pattern (ATP) at a high level of spatial and temporal detail. DATA is formulated as a discrete-time dynamic user equilibrium (DUE) problem, which is reformulated as an equivalent variational inequality (VI) problem. A generalized dynamic link disutility function is established with the accommodation of different characteristics of the links in the supernetworks. Flow constraints and non-uniqueness of equilibria are also investigated. In the proposed formulation, the choices of departure time, route, mode, activity sequence, activity and parking location are all unified into one time-dependent ATP choice. As a result, the interdependences among all these choice facets can be readily captured. A solution algorithm based on the route-swapping mechanism is adopted to find the user equilibrium. A numerical example with simulated scenarios is provided to demonstrate the advantages of the proposed approach.


      PubDate: 2015-08-29T06:01:03Z
       
  • Efficient intermodal transportation auctions for B2B e-commerce logistics
           with transaction costs
    • Abstract: Publication date: October 2015
      Source:Transportation Research Part B: Methodological, Volume 80
      Author(s): Su Xiu Xu, Meng Cheng, George Q. Huang
      We propose efficient intermodal transportation auctions for the B2B e-commerce logistics problem (ELP). This paper is among the first to consider transaction costs into auctions. In the ELP, the shipper is a B2B e-commerce platform by which a number of online orders between goods sellers and buyers are generated, and 3PLs (third-party logistics providers) can fulfill these online orders. The shipper bears transaction costs while goods sellers or buyers eventually pay intermodal services. We extend both Vickrey–Clarke–Groves (VCG) auction and primal–dual Vickrey (PDV) auction to the ELP where total logistics chain cost is minimized. The VCG-like auction realizes incentive compatibility, allocative efficiency, individual rationality, and budget balance for general valuations; while the PDV-like auction need presume the condition of seller-submodularity, which implies that the effect of each 3PL is decreasing when coalition increases. Computational results show that incorporating transaction costs leads to considerable cost saving for the shipper, shipper’s group (that consists of the shipper herself, good sellers and buyers), and the logistics chain, as well as higher profitability for the group of 3PLs. As the variance of transaction costs increases, incorporating transaction costs leads to higher cost saving for the entities that matter to the shipper (i.e., herself, her group, and the logistics chain), and higher profitability for the group of 3PLs, regardless of valuation distribution type. Finally, we investigate the impact of self-interested shipper and the impact of the gap between intermodal service costs and transaction costs.


      PubDate: 2015-08-29T06:01:03Z
       
  • Link travel time inference using entry/exit information of trips on a
           network
    • Abstract: Publication date: October 2015
      Source:Transportation Research Part B: Methodological, Volume 80
      Author(s): Kai Yin, Wen Wang, Xiubin Bruce Wang, Teresa M. Adams
      This paper studies link travel time estimation using entry/exit time stamps of trips on a steady-state transportation network. We propose two inference methods based on the likelihood principle, assuming each link associates with a random travel time. The first method considers independent and Gaussian distributed link travel times, using the additive property that trip time has a closed-form distribution as the summation of link travel times. We particularly analyze the mean estimates when the variances of trip time estimates are known with a high degree of precision and examine the uniqueness of solutions. Two cases are discussed in detail: one with known paths of all trips and the other with unknown paths of some trips. We apply the Gaussian mixture model and the Expectation–Maximization (EM) algorithm to deal with the latter. The second method splits trip time proportionally among links traversed to deal with more general link travel time distributions such as log-normal. This approach builds upon an expected log-likelihood function which naturally leads to an iterative procedure analogous to the EM algorithm for solutions. Simulation tests on a simple nine-link network and on the Sioux Falls network respectively indicate that the two methods both perform well. The second method (i.e., trip splitting approximation) generally runs faster but with larger errors of estimated standard deviations of link travel times.


      PubDate: 2015-08-29T06:01:03Z
       
  • Bounding tandem queuing system performance with variational theory
    • Abstract: Publication date: Available online 21 August 2015
      Source:Transportation Research Part B: Methodological
      Author(s): Jia Li, H. Michael Zhang
      Queuing models are often used for traffic analysis, but analytical results concerning a system of queues are rare, thanks to the interdependence between queues. In this paper, we present an analysis of queuing systems to obtain bounds of their performance without studying the details of individual queues. Queuing dynamics is formulated in continuous-time, subject to variations of demands and bottleneck capacities. Our analysis develops new techniques built on the closed-form solution to a generalized queuing model for a single bottleneck. Taking advantage of its variational structure, we derive the upper and lower bounds for the total queue length in a tandem bottleneck system and discuss its implication for the kinematic wave counterpart. Numerical experiments are conducted to demonstrate the appropriateness of the derived upper and lower bounds as approximations in a stochastic setting.


      PubDate: 2015-08-24T21:43:47Z
       
  • A kinematic wave theory of capacity drop
    • Abstract: Publication date: Available online 24 August 2015
      Source:Transportation Research Part B: Methodological
      Author(s): Wen-Long Jin, Qi-Jian Gan, Jean-Patrick Lebacque
      Capacity drop at active bottlenecks is one of the most puzzling traffic phenomena, but a thorough understanding of its mechanism is critical for designing variable speed limit and ramp metering strategies. In this study, within the framework of the kinematic wave theory, we propose a simple model of capacity drop based on the observation that capacity drop occurs when an upstream queue forms at an active bottleneck. Different from existing models, the new model still uses continuous fundamental diagrams but employs an entropy condition defined by a discontinuous boundary flux function, which introduces a traffic state-dependent capacity constraint. For a lane-drop area, we demonstrate that the model is well-defined, and its Riemann problem can be uniquely solved. After deriving the flow-density relations upstream and downstream to a bottleneck location, we find that the model can replicate the following three characteristics of capacity drop: the maximum discharge flow-rate can be reached only when both upstream and downstream traffic conditions are uncongested, capacity drop occurs when the bottleneck is activated, and some steady traffic states cannot be observed at both locations. We show that the new model is bistable subject to perturbations in initial and boundary conditions. With empirical observations at a merging bottleneck we also verify the three characteristics of capacity drop predicted by the new model. Through this study, we establish that the new model is physically meaningful, conceptually simple, computationally efficient, and mathematically tractable. We finally discuss future extensions and potential applications of the new model.


      PubDate: 2015-08-24T21:43:47Z
       
  • Editorial Board
    • Abstract: Publication date: September 2015
      Source:Transportation Research Part B: Methodological, Volume 79




      PubDate: 2015-08-20T21:37:08Z
       
  • System dynamics of urban traffic based on its parking-related-states
    • Abstract: Publication date: Available online 14 August 2015
      Source:Transportation Research Part B: Methodological
      Author(s): Jin Cao, Monica Menendez
      The urban parking and the urban traffic systems are essential components of the overall urban transportation structure. The short-term interactions between these two systems can be highly significant and influential to their individual performance. The urban parking system, for example, can affect the searching-for-parking traffic, influencing not only overall travel speeds in the network (traffic performance), but also total driven distance (environmental conditions). In turn, the traffic performance can also affect the time drivers spend searching for parking, and ultimately, parking usage. In this study, we propose a methodology to model macroscopically such interactions and evaluate their effects on urban congestion. The model is built on a matrix describing how, over time, vehicles in an urban area transition from one parking-related state to another. With this model it is possible to estimate, based on the traffic and parking demand as well as the parking supply, the amount of vehicles searching for parking, the amount of vehicles driving on the network but not searching for parking, and the amount of vehicles parked at any given time. More importantly, it is also possible to estimate the total (or average) time spent and distance driven within each of these states. Based on that, the model can be used to design and evaluate different parking policies, to improve (or optimize) the performance of both systems. A simple numerical example is provided to show possible applications of this type. Parking policies such as increasing parking supply or shortening the maximum parking duration allowed (i.e., time controls) are tested, and their effects on traffic are estimated. The preliminary results show that time control policies can alleviate the parking-caused traffic issues without the need for providing additional parking facilities. Results also show that parking policies that intend to reduce traffic delay may, at the same time, increase the driven distance and cause negative externalities. Hence, caution must be exercised and multiple traffic metrics should be evaluated before selecting these policies. Overall, this paper shows how the system dynamics of urban traffic, based on its parking-related-states, can be used to efficiently evaluate the urban traffic and parking systems macroscopically. The proposed model can be used to estimate both, how parking availability can affect traffic performance (e.g., average time searching for parking, number of cars searching for parking); and how different traffic conditions (e.g., travel speed, density in the system) can affect drivers ability to find parking. Moreover, the proposed model can be used to study multiple strategies or scenarios for traffic operations and control, transportation planning, land use planning, or parking management and operations.


      PubDate: 2015-08-16T21:34:00Z
       
  • The corridor problem with discrete multiple bottlenecks
    • Abstract: Publication date: Available online 14 August 2015
      Source:Transportation Research Part B: Methodological
      Author(s): Takashi Akamatsu, Kentaro Wada, Shunsuke Hayashi
      This paper presents a transparent approach to the analysis of dynamic user equilibrium and clarifies the properties of a departure-time choice equilibrium of a corridor problem where discrete multiple bottlenecks exist along a freeway. The basis of our approach is the transformation of the formulation of equilibrium conditions in a conventional “Eulerian coordinate system” into one in a “Lagrangian-like coordinate system.” This enables us to evaluate dynamic travel times easily, and to achieve a deep understanding of the mathematical structure of the problem, in particular, about the properties of the demand and supply (queuing) sub-models, relations with dynamic system optimal assignment, and differences between the morning and evening rush problems. Building on these foundations, we establish rigorous results on the existence and uniqueness of equilibria.


      PubDate: 2015-08-16T21:34:00Z
       
  • Transportation network design for maximizing space–time
           accessibility
    • Abstract: Publication date: Available online 14 August 2015
      Source:Transportation Research Part B: Methodological
      Author(s): Lu Tong, Xuesong Zhou, Harvey J. Miller
      One of the goals of transportation system construction and management is to improve individuals’ accessibility or the ease of reaching desired activities, destinations and services. However, many transportation network design models instead focus on maximizing individuals’ mobility or the ease of movement within the network. By adapting a space–time prism analysis framework, this paper aims to address a new urban network design problem to maximize the system-wide transportation accessibility between major activity locations, subject to a given highway construction budget. By constructing a time-dependent space–time network, we formulate the problem as a linear integer programming model to maximize the number of accessible activity locations within travel time budget for road users. A Lagrangian relaxation solution framework effectively decomposes the original complex problem into classical subproblems such as knapsack and time-dependent least cost problems. Various examples and discussions are provided to consider the effectiveness of the proposed method in modeling accessibility-enhancement strategies such as congestion mitigation and land use policies.
      Graphical abstract image

      PubDate: 2015-08-16T21:34:00Z
       
  • Learning marginal-cost pricing via a trial-and-error procedure with
           day-to-day flow dynamics
    • Abstract: Publication date: Available online 14 August 2015
      Source:Transportation Research Part B: Methodological
      Author(s): Hongbo Ye, Hai Yang, Zhijia Tan
      This paper investigates the convergence of the trial-and-error procedure to achieve the system optimum by incorporating the day-to-day evolution of traffic flows. The path flows are assumed to follow an ‘excess travel cost dynamics’ and evolve from disequilibrium states to the equilibrium day by day. This implies that the observed link flow pattern during the trial-and-error procedure is in disequilibrium. By making certain assumptions on the flow evolution dynamics, we prove that the trial-and-error procedure is capable of learning the system optimum link tolls without requiring explicit knowledge of the demand functions and flow evolution mechanism. A methodology is developed for updating the toll charges and choosing the inter-trial periods to ensure convergence of the iterative approach towards the system optimum. Numerical examples are given in support of the theoretical findings.


      PubDate: 2015-08-16T21:34:00Z
       
  • Study on mean-standard deviation shortest path problem in stochastic and
           time-dependent networks: A stochastic dominance based approach
    • Abstract: Publication date: October 2015
      Source:Transportation Research Part B: Methodological, Volume 80
      Author(s): Xing Wu
      This paper studies a mean-standard deviation shortest path model, also called travel time budget (TTB) model. A route’s TTB is defined as this route’s mean travel time plus a travel time margin, which is the route travel time’s standard deviation multiplied with a factor. The TTB model violates the Bellman’s Principle of Optimality (BPO), making it difficult to solve it in any large stochastic and time-dependent network. Moreover, it is found that if path travel time distributions are skewed, the conventional TTB model cannot reflect travelers’ heterogeneous risk-taking behavior in route choice. This paper proposes to use the upper or lower semi-standard deviation to replace the standard deviation in the conventional TTB model (the new models are called derived TTB models), because these derived TTB models can well capture such heterogeneous risk-taking behavior when the path travel time distributions are skewed. More importantly, this paper shows that the optimal solutions of these two derived TTB models must be non-dominated paths under some specific stochastic dominance (SD) rules. These finding opens the door to solve these derived TTB models efficiently in large stochastic and time-dependent networks. Numerical examples are presented to illustrate these findings.


      PubDate: 2015-08-12T16:53:30Z
       
  • The impact on port competition of the integration of port and inland
           transport services
    • Abstract: Publication date: October 2015
      Source:Transportation Research Part B: Methodological, Volume 80
      Author(s): Óscar Álvarez-SanJaime, Pedro Cantos-Sánchez, Rafael Moner-Colonques, José J. Sempere-Monerris
      The performance of the transport chain is important for the efficiency and competitiveness of an economy. In the context of port competition, there has been an increasing cooperation between firms involved in the intermodal transport chain including seaport services. This paper examines the economic incentives and welfare implications to the integration of port activities with inland transport services under inter-ports competition. Although ports find it advantageous to engage in such integration process it may be detrimental to welfare, since shippers’ aggregate surplus decreases – noting that farther away users benefit at the expense of those closer to the ports. Several scenarios not leading to such welfare decrease are identified: asymmetries in port capacities, government regulation and efficiency gains. These latter results provide support to policies that favor integration processes of transport services.


      PubDate: 2015-08-12T16:53:30Z
       
  • Efficient transit network design and frequencies setting multi-objective
           optimization by alternating objective genetic algorithm
    • Abstract: Publication date: Available online 11 August 2015
      Source:Transportation Research Part B: Methodological
      Author(s): Renato Oliveira Arbex, Claudio Barbieri da Cunha
      The multi-objective transit network design and frequency setting problem (TNDFSP) involves finding a set of routes and their associated frequencies to operate in an urban area public transport system. The TNDFSP is a difficult combinatorial optimization problem, with a large search space and multiple constraints, leading to numerous infeasible solutions. We propose an Alternating Objective Genetic Algorithm (AOGA) to efficiently solve it, in which the objective to be searched is cyclically alternated along the generations. The two objectives are to minimize both passengers’ and operators’ costs. Transit users’ costs are related to the total number of transfers, waiting and in-vehicle travel times, while operator’s costs are related to the total required fleet to operate the set of routes. Our proposed GA also employs local search procedures to properly deal with infeasibility of newly generated individuals, as well as of those mutated. Extensive computational experiments results are reported using both Mandl’s original benchmark set and instances with different demands and travel times as well, in order to determine Pareto Frontiers of optimal solutions, given that users’ and operators’ costs are conflicting objectives. The results evidence that the AOGA is very efficient, leading to improved solutions when compared to previously published results.


      PubDate: 2015-08-12T16:53:30Z
       
  • Driver perception uncertainty in perceived relative speed and reaction
           time in car following – A quantum optical flow perspective
    • Abstract: Publication date: October 2015
      Source:Transportation Research Part B: Methodological, Volume 80
      Author(s): Jiuh-Biing Sheu, Hsi-Jen Wu
      Driver perception uncertainty characterized in perceived relatnd reaction time plays a key role in influencing car-following behavior; and however, is rarely investigated in related literature. Grounded on quantum optical flow theory, we propose a dynamic and stochastic driver perception model to investigate the relationship between the uncertainty of perceived relative speed and that of reaction time during car following. Specifically, the proposed model hypothesizes that driver perceived speed and reaction time are time-varying and uncertain, and correlate in a trade-off relationship mimicking the form of Heisenberg Uncertainty Principle. To test the assertion that a trade-off relationship of uncertainty in perceived relative speed and reaction time exists in car following, this study conducts qualitative analysis followed by a two-stage experiment rooted in quantum optical flow theory using data collected from a driver simulator. Analytical results further elucidate car-following phenomena under driver-perception uncertainty, potentially facilitating the development of new traffic flow theories.


      PubDate: 2015-08-08T03:40:37Z
       
  • A day-to-day dynamical model for the evolution of path flows under
           disequilibrium of traffic networks with fixed demand
    • Abstract: Publication date: October 2015
      Source:Transportation Research Part B: Methodological, Volume 80
      Author(s): Amit Kumar, Srinivas Peeta
      Transportation networks are often subjected to perturbed conditions leading to traffic disequilibrium. Under such conditions, the traffic evolution is typically modeled as a dynamical system that captures the aggregated effect of paths-shifts by drivers over time. This paper proposes a day-to-day (DTD) dynamical model that bridges two important gaps in the literature. First, existing DTD models generally consider current path flows and costs, but do not factor the sensitivity of path costs to flow. The proposed DTD model simultaneously captures all three factors in modeling the flow shift by drivers. As a driver can potentially perceive the sensitivity of path costs with the congestion level based on past experience, incorporating this factor can enhance real-world consistency. In addition, it smoothens the time trajectory of path flows, a desirable property for practice where the iterative solution procedure is typically terminated at an arbitrary point due to computational time constraints. Second, the study provides a criterion to classify paths for an origin–destination pair into two subsets under traffic disequilibrium: expensive paths and attractive paths. This facilitates flow shifts from the set of expensive paths to the set of attractive paths, enabling a higher degree of freedom in modeling flow shift compared to that of shifting flows only to the shortest path, which is behaviorally restrictive. In addition, consistent with the real-world driver behavior, it also helps to preclude flow shifts among expensive paths. Improved behavioral consistency can lead to more meaningful path/link time-dependent flow profiles for developing effective dynamic traffic management strategies for practice. The proposed DTD model is formulated as the dynamical system by drawing insights from micro-economic theory. The stability of the model and existence of its stationary point are theoretically proven. Results from computational experiments validate its modeling properties and illustrate its benefits relative to existing DTD dynamical models.


      PubDate: 2015-08-08T03:40:37Z
       
  • Path-differentiated pricing in congestion mitigation
    • Abstract: Publication date: October 2015
      Source:Transportation Research Part B: Methodological, Volume 80
      Author(s): Mahmood Zangui, Hedayat Z. Aashtiani, Siriphong Lawphongpanich, Yafeng Yin
      Instead of charging tolls on individual links, this paper considers doing the same on paths. Path and link tolls are “valid” if they encourage motorists to use routes that collectively lead to a target distribution, e.g., one that minimizes travel delay. Because the numbers of valid link and path tolls are typically infinite, an objective in pricing tolls is to find a set of valid tolls that yields the least revenue to lessen the financial burden on motorists. Path tolls are generally more flexible than link tolls and this paper shows that this flexibility can substantially reduce the financial burden on motorists. Additionally, valid path tolls yielding the least revenue possess characteristics with interesting policy implications. To determine these path tolls, it is natural to formulate the problem as a mathematical program with complementarity constraints. However, this paper also investigates alternative formulations that highlight the problem’s complexity and suggest ways to solve the problem efficiently.


      PubDate: 2015-07-31T10:58:59Z
       
  • Specification of the cross-nested logit model with sampling of
           alternatives for route choice models
    • Abstract: Publication date: October 2015
      Source:Transportation Research Part B: Methodological, Volume 80
      Author(s): Xinjun Lai, Michel Bierlaire
      We present an operational estimation procedure for the estimation of route choice multivariate extreme value (MEV) models based on sampling of alternatives. The procedure builds on the state-of-the-art literature, and in particular on recent methodological developments proposed by Flötteröd and Bierlaire (2013) and Guevara and Ben-Akiva (2013b). Case studies on both synthetic data and a real network demonstrate that the new method is valid and practical.


      PubDate: 2015-07-31T10:58:59Z
       
  • A simple nonparametric car-following model driven by field data
    • Abstract: Publication date: October 2015
      Source:Transportation Research Part B: Methodological, Volume 80
      Author(s): Zhengbing He, Liang Zheng, Wei Guan
      Car-following models are always of great interest of traffic engineers and researchers. In the age of mass data, this paper proposes a nonparametric car-following model driven by field data. Different from most of the existing car-following models, neither driver’s behaviour parameters nor fundamental diagrams are assumed in the data-driven model. The model is proposed based on the simple k-nearest neighbour, which outputs the average of the most similar cases, i.e., the most likely driving behaviour under the current circumstance. The inputs and outputs are selected, and the determination of the only parameter k is introduced. Three simulation scenarios are conducted to test the model. The first scenario is to simulate platoons following real leaders, where traffic waves with constant speed and the detailed trajectories are observed to be consistent with the empirical data. Driver’s rubbernecking behaviour and driving errors are simulated in the second and third scenarios, respectively. The time–space diagrams of the simulated trajectories are presented and explicitly analysed. It is demonstrated that the model is able to well replicate periodic traffic oscillations from the precursor stage to the decay stage. Without making any assumption, the fundamental diagrams for the simulated scenario coincide with the empirical fundamental diagrams. These all validate that the model can well reproduce the traffic characteristics contained by the field data. The nonparametric car-following model exhibits traffic dynamics in a simple and parsimonious manner.


      PubDate: 2015-07-27T13:31:47Z
       
  • Stochastic optimization approach for the car placement problem in
           ridesharing systems
    • Abstract: Publication date: October 2015
      Source:Transportation Research Part B: Methodological, Volume 80
      Author(s): Joe Naoum-Sawaya, Randy Cogill, Bissan Ghaddar, Shravan Sajja, Robert Shorten, Nicole Taheri, Pierpaolo Tommasi, Rudi Verago, Fabian Wirth
      With the increasing fuel prices and the pressure towards greener modes of transportation, ridesharing has emerged as an alternative to private car ownership and public transportation. In this paper, we focus on a common destination ridesharing system which is of interest in large organizations such as companies and government offices. Particularly, such organizations are looking at using company owned vehicles to offer a ridesharing service by which employees carpool to work thus leading to several benefits that include decreasing pressure on on-campus parking spaces, lowering localized on-campus congestion, in addition to offering a greener transportation mode while lowering transportation costs for employees. Based on discussions with our industry partners, optimizing the distribution of limited number of company vehicles while insuring robustness against unlikely vehicle unavailability is of critical importance. Thus in this paper, we present a stochastic mixed integer programming model to optimize the allocation of shared vehicles to employees while taking into account the unforeseen event of vehicle unavailability which would require some participants to take own vehicles or rerouting of existing vehicles. Since solving the proposed model to optimality is computationally challenging for problems of large sizes, we also propose a heuristic that is capable of finding good quality solutions in limited computational time. The proposed model and heuristic are tested on several instances of varying sizes showing the computational performance. Finally, a test case based on the city of Rome, Italy is presented and insights related to vehicle distribution and travel time savings are discussed.


      PubDate: 2015-07-27T13:31:47Z
       
  • Fine-grained OD estimation with automated zoning and sparsity
           regularisation
    • Abstract: Publication date: October 2015
      Source:Transportation Research Part B: Methodological, Volume 80
      Author(s): Aditya Krishna Menon, Chen Cai, Weihong Wang, Tao Wen, Fang Chen
      Given a road network, a fundamental object of interest is the matrix of origin destination (OD) flows. Estimation of this matrix involves at least three sub-problems: (i) determining a suitable set of traffic analysis zones, (ii) the formulation of an optimisation problem to determine the OD matrix, and (iii) a means of evaluating a candidate estimate of the OD matrix. This paper describes a means of addressing each of these concerns. We propose to automatically uncover a suitable set of traffic analysis zones based on observed link flows. We then employ regularisation to encourage the estimation of a sparse OD matrix. We finally propose to evaluate a candidate OD matrix based on its predictive power on held out link flows. Analysis of our approach on a real-world transport network reveals that it discovers automated zones that accurately capture regions of interest in the network, and a corresponding OD matrix that accurately predicts observed link flows.


      PubDate: 2015-07-27T13:31:47Z
       
  • Implicit choice set generation in discrete choice models: Application to
           household auto ownership decisions
    • Abstract: Publication date: October 2015
      Source:Transportation Research Part B: Methodological, Volume 80
      Author(s): Rajesh Paleti
      Latent choice set models that account for probabilistic consideration of choice alternatives during decision making have long existed. The Manski model that assumes a two-stage representation of decision making has served as the standard workhorse model for discrete choice modeling with latent choice sets. However, estimation of the Manski model is not always feasible because evaluation of the likelihood function in the Manski model requires enumeration of all possible choice sets leading to explosion for moderate and large choice sets. In this study, we propose a new group of implicit choice set generation models that can approximate the Manski model while retaining linear complexity with respect to the choice set size. We examined the performance of the models proposed in this study using synthetic data. The simulation results indicate that the approximations proposed in this study perform considerably well in terms of replicating the Manski model parameters. We subsequently used these implicit choice set models to understand latent choice set considerations in household auto ownership decisions of resident population in the Southern California region. The empirical results confirm our hypothesis that certain segments of households may only consider a subset of auto ownership levels while making decisions regarding the number of cars to own. The results not only underscore the importance of using latent choice models for modeling household auto ownership decisions but also demonstrate the applicability of the approximations proposed in this study to estimate these latent choice set models.


      PubDate: 2015-07-19T11:10:04Z
       
  • Decomposition of general facility disruption correlations via augmentation
           of virtual supporting stations
    • Abstract: Publication date: October 2015
      Source:Transportation Research Part B: Methodological, Volume 80
      Author(s): Siyang Xie , Xiaopeng Li , Yanfeng Ouyang
      Infrastructure facilities may be subject to probabilistic disruptions that compromise individual facility functionality as well as overall system performance. Disruptions of distributed facilities often exhibit complex spatial correlations, and thus it is difficult to describe them with succinct mathematical models. This paper proposes a new methodological framework for analyzing and modeling facility disruptions with general correlations. This framework first proposes pairwise transformations that unify three probabilistic representations (i.e., based on conditional, marginal, and scenario probabilities) of generally correlated disruption profile among multiple distributed facilities. Then facilities with any of these disruption profile representations can be augmented into an equivalent network structure consisting of additional supporting stations that experience only independent failures. This decomposition scheme largely reduces the complexity associated with system evaluation and optimization. We prove analytical properties of the transformations and the decomposition scheme, and illustrate the proposed methodological framework using a set of numerical case studies and sensitivity analyses. Managerial insights are also drawn.


      PubDate: 2015-07-15T08:25:00Z
       
  • An extended coordinate descent method for distributed anticipatory network
           traffic control
    • Abstract: Publication date: October 2015
      Source:Transportation Research Part B: Methodological, Volume 80
      Author(s): Marco Rinaldi , Chris M.J. Tampère
      Anticipatory optimal network control can be defined as the practice of determining the set of control actions that minimizes a network-wide objective function, so that the consequences of this action are taken in consideration not only locally, on the propagation of flows, but globally, taking into account the user’s routing behavior. Such an objective function is, in general, defined and optimized in a centralized setting, as knowledge regarding the whole network is needed in order to correctly compute it. This is a strong theoretical framework but, in practice, reaching a level of centralization sufficient to achieve said optimality is very challenging. Furthermore, even if centralization was possible, it would exhibit several shortcomings, with concerns such as computational speed (centralized optimization of a huge control set with a highly nonlinear objective function), reliability and communication overhead arising. The main aim of this work is to develop a decomposed heuristic descent algorithm that, demanding the different control entities to share the same information set, attains network-wide optimality through separate control actions.


      PubDate: 2015-07-15T08:25:00Z
       
  • Trajectory data reconstruction and simulation-based validation against
           macroscopic traffic patterns
    • Abstract: Publication date: October 2015
      Source:Transportation Research Part B: Methodological, Volume 80
      Author(s): Marcello Montanino , Vincenzo Punzo
      This paper shows that the behavior of driver models, either individually or entangled in stochastic traffic simulation, is affected by the accuracy of empirical vehicle trajectories. To this aim, a “traffic-informed” methodology is proposed to restore physical and platoon integrity of trajectories in a finite time–space domain, and it is applied to one NGSIM I80 dataset. However, as the actual trajectories are unknown, it is not possible to verify directly whether the reconstructed trajectories are really “nearer” to the actual unknowns than the original measurements. Therefore, a simulation-based validation framework is proposed, that is also able to verify indirectly the efficacy of the reconstruction methodology. The framework exploits the main feature of NGSIM-like data that is the concurrent view of individual driving behaviors and emerging macroscopic traffic patterns. It allows showing that, at the scale of individual models, the accuracy of trajectories affects the distribution and the correlation structure of lane-changing model parameters (i.e. drivers heterogeneity), while it has very little impact on car-following calibration. At the scale of traffic simulation, when models interact in trace-driven simulation of the I80 scenario (multi-lane heterogeneous traffic), their ability to reproduce the observed macroscopic congested patterns is sensibly higher when model parameters from reconstructed trajectories are applied. These results are mainly due to lane changing, and are also the sought indirect validation of the proposed data reconstruction methodology.


      PubDate: 2015-07-15T08:25:00Z
       
  • Compound Gamma representation for modeling travel time variability in a
           traffic network
    • Abstract: Publication date: October 2015
      Source:Transportation Research Part B: Methodological, Volume 80
      Author(s): Jiwon Kim , Hani S. Mahmassani
      This paper proposes a compound probability distribution approach for capturing both vehicle-to-vehicle and day-to-day variability in modeling travel time reliability in a network. Starting from the observation that standard deviation and mean of distance-normalized travel time in a network are highly positively correlated and their relationship is well characterized by a linear function, this study assumes multiplicative error structures to describe data with such characteristics and derives a compound distribution to model travel delay per unit distance as a surrogate for travel time. The proposed Gamma–Gamma model arises when (within-day) vehicle-to-vehicle travel delay per unit distance is distributed according to a Gamma distribution, with mean that itself fluctuates from day to day following another Gamma distribution. The study calibrates the model parameters and validates the underlying assumptions using both simulated and actual vehicle trajectory data. The Gamma–Gamma distribution shows good fits to travel delay observations when compared to the (simple) Gamma and Lognormal distributions. The main advantage of the Gamma–Gamma model is its ability to recognize different variability dimensions reflected in travel time data and clear physical meanings of its parameters in connection with vehicle-to-vehicle and day-to-day variability. Based on the linearity assumption for the relationship between mean and standard deviation, two shape parameters of the Gamma–Gamma model are linked to the coefficient of variation of travel delay in vehicle-to-vehicle and day-to-day distributions, respectively, and can be directly estimated from the slope of the associated mean-standard deviation plots. An extension of the basic model form was also introduced to address potential deviations from this linearity assumption. The extended Gamma–Gamma model can account for time-of-day variations in mean-standard deviation relationships—such as hysteresis patterns observed in mean and day-to-day variation in travel time—and incorporate such dynamics in travel time distribution modeling. In summary, the model provides a systematic way of quantifying, comparing, and assessing different types of variability, which is important in understanding travel time characteristics and evaluating various transportation measures that affect reliability.


      PubDate: 2015-07-09T20:49:54Z
       
  • Stochastic capacity expansion models for airport facilities
    • Abstract: Publication date: October 2015
      Source:Transportation Research Part B: Methodological, Volume 80
      Author(s): Yanshuo Sun , Paul Schonfeld
      It is important and also challenging to plan airport facilities to meet future traffic needs in a rapidly changing environment, which is characterized by various uncertainties. One key issue in airport facility development is that facility performance functions (delay levels as functions of capacity utilization rates) are nonlinear, which complicates the solution method design. Potential demand fluctuations in a deregulated aviation market add another dimension to the decision making process. To solve this problem, a deterministic total cost minimization model is proposed and then extended into stochastic programs, by including uncertainties in traffic forecasts. After the exploration of properties of the delay cost function, an Outer-Approximation (OA) technique which is superior to the existing discrete approximation is designed. After model enhancements, an efficient solution framework based on the OA technique is used to solve the model to its global optimality by interactively generating upper and lower bounds to the objective. Computational tests demonstrate the validity of developed models and efficiency of proposed algorithms. The total cost is reduced by 18.8% with the stochastic program in the numerical example.


      PubDate: 2015-07-05T12:59:12Z
       
  • A mixed integer programming model for optimizing multi-level operations
           process in railroad yards
    • Abstract: Publication date: October 2015
      Source:Transportation Research Part B: Methodological, Volume 80
      Author(s): Tie Shi , Xuesong Zhou
      A typical railroad hump yard contains multiple layers of complex operations. The railcars coming with inbound trains through the yard need to be humped into different classification tracks according to the destination, and then assembled to generate the desired outbound trains. During this complex procedure, the processing time of railcars and various resource constraints at different railroad yard facilities could significantly affect the overall performance of yard operations, individually and in combination. It is theoretically challenging to represent a large number of practical operation rules through tractable mathematical programming models. This paper first presents a time-expanded multi-layer network flow model to describe the connection between different layers of yard operations. A mixed integer programming model is developed to optimize the overall performance by jointly considering tightly interconnected facilities. We adopt a cumulative flow count representation to model the spatial capacity constraints in terms of the number of railcars in classification yards. A novel lot-sizing modeling framework and related valid inequality formulations are introduced to model the assembling jobs for outbound trains. We also develop an aggregated flow assignment model and earliest due date-based heuristic rules to determine the humping jobs sequence for reducing the search space. Numerical experiments are conducted to examine the solution quality and computational efficiency under different types of formulation strategies.


      PubDate: 2015-07-05T12:59:12Z
       
  • Reformulating the Hoogendoorn–Bovy predictive dynamic user-optimal
           model in continuum space with anisotropic condition
    • Abstract: Publication date: September 2015
      Source:Transportation Research Part B: Methodological, Volume 79
      Author(s): Jie Du , S.C. Wong , Chi-Wang Shu , Mengping Zhang
      Hoogendoorn and Bovy (2004) developed an approach for a pedestrian user-optimal dynamic assignment in continuous time and space. Although their model was proposed for pedestrian traffic, it can also be applied to urban cities. The model is very general, and consists of a conservation law (CL) and a Hamilton–Jacobi–Bellman (HJB) equation that contains a minimum value problem. However, only an isotropic application example was given in their paper. We claim that the HJB equation is difficult to compute numerically in an anisotropic case. To overcome this, we reformulate their model for a dense urban city that is arbitrary in shape and has multiple central business districts (CBDs). In our model, the minimum value problem is only used in the CL portion, and the HJB equation reduces to a Hamilton–Jacobi (HJ) equation for easier computation. The dynamic path equilibrium of our model is proven in a different way from theirs, and a numerical algorithm is also provided to solve the model. Finally, we show two numerical examples under the anisotropic case and compare the results with those of the isotropic case.


      PubDate: 2015-07-01T02:41:17Z
       
  • A comprehensive dwelling unit choice model accommodating psychological
           constructs within a search strategy for consideration set formation
    • Abstract: Publication date: September 2015
      Source:Transportation Research Part B: Methodological, Volume 79
      Author(s): Chandra R. Bhat
      This study adopts a dwelling unit level of analysis and considers a probabilistic choice set generation approach for residential choice modeling. In doing so, we accommodate the fact that housing choices involve both characteristics of the dwelling unit and its location, while also mimicking the search process that underlies housing decisions. In particular, we model a complete range of dwelling unit choices that include tenure type (rent or own), housing type (single family detached, single family attached, or apartment complex), number of bedrooms, number of bathrooms, number of storeys (one or multiple), square footage of the house, lot size, housing costs, density of residential neighborhood, and commute distance. Bhat’s (2015) generalized heterogeneous data model (GHDM) system is used to accommodate the different types of dependent outcomes associated with housing choices, while capturing jointness caused by unobserved factors. The proposed analytic framework is applied to study housing choices using data derived from the 2009 American Housing Survey (AHS), sponsored by the Department of Housing and Urban Development (HUD) and conducted by the U.S. Census Bureau. The results confirm the jointness in housing choices, and indicate the superiority of a choice set formation model relative to a model that assumes the availability of all dwelling unit alternatives in the choice set.


      PubDate: 2015-07-01T02:41:17Z
       
  • Traffic user equilibrium and proportionality
    • Abstract: Publication date: September 2015
      Source:Transportation Research Part B: Methodological, Volume 79
      Author(s): Marlies Borchers , Paul Breeuwsma , Walter Kern , Jaap Slootbeek , Georg Still , Wouter Tibben
      We discuss the problem of proportionality and uniqueness for route flows in the classical traffic user equilibrium model. It is well-known that under appropriate assumptions the user equilibrium ( f , x ) is unique in the link flow x but typically not in the route flow f. We consider the concept of proportionality in detail and re-discuss the well-known relation between the so-called bypass proportionality and entropy maximization. We exhibit special proportionality conditions which uniquely determine the route flow f. The results are illustrated with some simple example networks.


      PubDate: 2015-07-01T02:41:17Z
       
  • A set-covering model for a bidirectional multi-shift full truckload
           vehicle routing problem
    • Abstract: Publication date: September 2015
      Source:Transportation Research Part B: Methodological, Volume 79
      Author(s): Ruibin Bai , Ning Xue , Jianjun Chen , Gethin Wyn Roberts
      This paper introduces a bidirectional multi-shift full truckload transportation problem with operation dependent service times. The problem is different from the previous container transport problems and the existing approaches for container transport problems and vehicle routing pickup and delivery are either not suitable or inefficient. In this paper, a set covering model is developed for the problem based on a novel route representation and a container-flow mapping. It was demonstrated that the model can be applied to solve real-life, medium sized instances of the container transport problem at a large international port. A lower bound of the problem is also obtained by relaxing the time window constraints to the nearest shifts and transforming the problem into a service network design problem. Implications and managerial insights of the results by the lower bound results are also provided.


      PubDate: 2015-07-01T02:41:17Z
       
  • Coordinated online in-vehicle routing balancing user optimality and system
           optimality through information perturbation
    • Abstract: Publication date: September 2015
      Source:Transportation Research Part B: Methodological, Volume 79
      Author(s): Lili Du , Lanshan Han , Shuwei Chen
      The inconsistence between system optimality and user optimality represents one of the key difficulties on network traffic congestion control. The advanced connected vehicle systems, enabling smart vehicles to possess/exchange real-time information and conduct portable computation, provide new opportunities to address this challenge. Motivated by this view, this study proposes a coordinated online in-vehicle routing mechanism with intentional information provision perturbation (CRM-IP), which seeks to shape individual vehicles online routing decisions so that user optimality and system optimality are balanced, by exploiting bounded rationality of the users. The proposed CRM-IP is modeled as a pure strategy atomic routing game, and implemented by a sequentially updating distributed algorithm. The mathematical analysis is conducted to quantify the absolute gain of system optimality corresponding to the loss of user optimality resulting from a given level of the information perturbation in the worst case so that the efficiency of the information perturbation can be evaluated. Furthermore, numerical experiments conducted based on City of Sioux Falls network investigate the average effects of the CRM-IP on system optimality and user optimality under various network traffic conditions, comparing to the CRM developed by Du et al. (in press). The results indicate that the improvement of system optimality and the reduction of individual vehicles’ travel time from the CRM is more significant when the network traffic is under an mild congestion state, such as under the levels of service (LOS’s) C, D, and E, rather than under extremely sparse or congested states, such as under LOS’s A and B, or F. Moreover, higher level of information perturbation benefits system optimality more, but the marginal effect decreases after the perturbation reaching certain level, such as λ = 0.1 in this case study. In addition, a portion of vehicles may sacrifice user optimality due to the information perturbation, but the extent of the sacrifice is not significant, even though it increases with the information perturbation level. Hence, a small information perturbation is recommended to achieve an efficient network traffic control through the CRM-IP. Overall, this study proposes the CRM-IP as an efficient routing mechanism, which has a great potential to guide the routing decisions of individual vehicles so that their collective behavior improve network performance in both system optimality and user optimality.


      PubDate: 2015-07-01T02:41:17Z
       
  • Applying variational theory to travel time estimation on urban arterials
    • Abstract: Publication date: August 2015
      Source:Transportation Research Part B: Methodological, Volume 78
      Author(s): Etienne Hans , Nicolas Chiabaut , Ludovic Leclercq
      The Variational Theory (VT) expresses the LWR model as a least cost path problem. Recent researches have shown that this problem can be simply applied on a graph with a minimal number of nodes and edges when the fundamental diagram is triangular (sufficient variational graph – SVG). Such a graph accounts for traffic signal settings on an urban arterial and leads to mean traffic states for the total arterial in free-flow or congested stationary conditions. The Macroscopic Fundamental Diagram (MFD) can then be directly estimated. In this paper, we extend this method to provide the complete distribution of deterministic travel times observed on an arterial. First, we will show how to obtain a tight estimation of the arterial capacity by properly identifying the most constraining part of the SVG. Then, we will show that a modified version of the SVG allows the exact calculation of the cumulative count curves at the entry and exit of an arterial. It is finally possible to derive the full travel time distributions for any dynamic conditions.
      Graphical abstract image

      PubDate: 2015-06-25T02:29:12Z
       
  • A time-dependent freight tour synthesis model
    • Abstract: Publication date: August 2015
      Source:Transportation Research Part B: Methodological, Volume 78
      Author(s): Iván Sánchez-Díaz , José Holguín-Veras , Xuegang (Jeff) Ban
      This paper introduces a model of urban freight demand that seeks to estimate tour flows from secondary data sources e.g., traffic counts, to bypass the need for expensive surveys. The model discussed in this paper, referred as Freight Tour Synthesis (FTS), enhances current techniques by incorporating the time-dependent tour-based behavior of freight vehicles, and the decision maker’s (e.g., metropolitan planning agency planner) preferences for different sources of information. The model, based on entropy maximization theory, estimates the most likely set of tour flows, given a set of freight trip generation estimates, a set of traffic counts per time interval, and total freight transportation cost in the network. The type of inputs used allows the assessment of changes in infrastructure, policy and land use. The ability of the model to replicate actual values is assessed using the Denver Region (CO) as a case study.


      PubDate: 2015-06-25T02:29:12Z
       
  • A piecewise-constant congestion taxing policy for repeated routing games
    • Abstract: Publication date: August 2015
      Source:Transportation Research Part B: Methodological, Volume 78
      Author(s): Farhad Farokhi , Karl H. Johansson
      In this paper, we consider repeated routing games with piecewise-constant congestion taxing in which a central planner sets and announces the congestion taxes for fixed windows of time in advance. Specifically, congestion taxes are calculated using marginal congestion pricing based on the flow of the vehicles on each road prior to the beginning of the taxing window (and, hence, there is a time-varying delay in setting the congestion taxes). We motivate the piecewise-constant taxing policy by that users or drivers may dislike fast-changing prices and that they also prefer prior knowledge of the prices. We prove for this model that the multiplicative update rule and the discretized replicator dynamics converge to a socially optimal flow when using vanishing step sizes. Considering that the algorithm cannot adapt itself to a changing environment when using vanishing step sizes, we propose adopting constant step sizes in this case. Then, however, we can only prove the convergence of the dynamics to a neighborhood of the socially optimal flow (with the size of the neighbourhood being of the order of the selected step size). The results are illustrated on a nonlinear version of Pigou’s famous routing game.


      PubDate: 2015-06-25T02:29:12Z
       
  • Analysis of real-time control strategies in a corridor with multiple bus
           services
    • Abstract: Publication date: August 2015
      Source:Transportation Research Part B: Methodological, Volume 78
      Author(s): Daniel Hernández , Juan Carlos Muñoz , Ricardo Giesen , Felipe Delgado
      Control strategies have been widely used in the literature to counteract the effects of bus bunching in passenger‘s waiting times and its variability. These strategies have only been studied for the case of a single bus line in a corridor. However, in many real cases this assumption does not hold. Indeed, there are many transit corridors with multiple bus lines interacting, and this interaction affects the efficiency of the implemented control mechanism. This work develops an optimization model capable of executing a control scheme based on holding strategy for a corridor with multiple bus lines. We analyzed the benefits in the level of service of the public transport system when considering a central operator who wants to maximize the level of service for users of all the bus lines, versus scenarios where each bus line operates independently. A simulation was carried out considering two medium frequency bus lines that serve a set of stops and where these two bus lines coexist in a given subset of stops. In the simulation we compared the existence of a central operator, using the optimization model we developed, against the independent operation of each line. In the simulations the central operator showed a greater reduction in the overall waiting time of the passengers of 55% compared to a no control scenario. It also provided a balanced load of the buses along the corridor, and a lower variability of the bus headways in the subset of stops where the lines coexist, thus obtaining better reliability for all types of passengers present in the public transport system.


      PubDate: 2015-06-25T02:29:12Z
       
  • A joint bottom-up solution methodology for system-level pavement
           rehabilitation and reconstruction
    • Abstract: Publication date: August 2015
      Source:Transportation Research Part B: Methodological, Volume 78
      Author(s): Jinwoo Lee , Samer Madanat
      We present a methodology for the joint optimization of rehabilitation and reconstruction activities for heterogeneous pavement systems under multiple budget constraints. The proposed bottom-up approach adopts an augmented condition state to account for the history-dependent properties of pavement deterioration, and solves for steady-state policies for an infinite horizon. Genetic algorithms (GAs) are implemented in the system-level optimization based on segment-specific optimization results. The complexity of the proposed algorithm is polynomial in the size of the system and the policy-related parameters. We provide graphical presentations of the optimal solutions for various budget situations. As a case study, a subset of California’s highway system is analyzed. The case study results demonstrate the economic benefit of a combined rehabilitation and reconstruction budget compared to separate budgets.


      PubDate: 2015-06-25T02:29:12Z
       
  • Empirical flow-density and speed-spacing relationships: Evidence of
           vehicle length dependency
    • Abstract: Publication date: August 2015
      Source:Transportation Research Part B: Methodological, Volume 78
      Author(s): Benjamin Coifman
      Traffic flow theory has come to a point where conventional, fixed time averaged data are limiting our insight into critical behavior both at the macroscopic and microscopic scales. This paper develops a methodology to measure relationships of density and vehicle spacing on freeways. These relationships are central to most traffic flow theories but have historically been difficult to measure empirically. The work leads to macroscopic flow-density and microscopic speed-spacing relationships in the congested regime derived entirely from dual loop detector data and then verified against the NGSIM data set. The methodology eliminates the need to seek out stationary conditions and yields clean relationships that do not depend on prior assumptions of the curve shape before fitting the data. Upon review of the clean empirical relationships a key finding of this work is the fact that many of the critical parameters of the macroscopic flow-density and microscopic speed-spacing relationships depend on vehicle length, e.g., upstream moving waves should travel through long vehicles faster than through short vehicles. Thus, the commonly used assumption of a homogeneous vehicle fleet likely obscures these important phenomena. More broadly, if waves travel faster or slower depending on the length of the vehicles through which the waves pass, then the way traffic is modeled should be updated to explicitly account for inhomogeneous vehicle lengths.


      PubDate: 2015-06-25T02:29:12Z
       
  • A two-stage robustness approach to evacuation planning with buses
    • Abstract: Publication date: August 2015
      Source:Transportation Research Part B: Methodological, Volume 78
      Author(s): Marc Goerigk , Kaouthar Deghdak , Vincent T’Kindt
      We consider the problem of scheduling a bus fleet to evacuate persons from an endangered region. As most of the planning data is subject to uncertainty, we develop a two-stage bicriteria robust formulation, which considers both the evacuation time, and the vulnerability of the schedule to changing evacuation circumstances. As the resulting integer program is too large to be solved directly using an off-the-shelf solver, we develop a scenario-generation algorithm which iteratively adds new scenarios to the incumbent subproblem being solved. Computational experiments show that this approach is fast enough to solve a realistic instance corresponding to an evacuation case within the city of Kaiserslautern (Germany).


      PubDate: 2015-06-25T02:29:12Z
       
  • A tractable two-stage robust winner determination model for truckload
           service procurement via combinatorial auctions
    • Abstract: Publication date: August 2015
      Source:Transportation Research Part B: Methodological, Volume 78
      Author(s): Bo Zhang , Tao Yao , Terry L. Friesz , Yuqi Sun
      A combinatorial auction is one of the adopted mechanisms for truckload (TL) service procurement. In such an auction, the shipper faces a well-known winner determination problem (WDP): the shipper, as the auctioneer, is given bids submitted by a group of carriers. In most literature, WDP is modeled as a deterministic mixed-integer program (MIP) and is solved by standard MIP algorithms. However, in practice, the exact shipping demand is unavailable until after the auction. This shipment volume uncertainty has a significant impact on the solution to WDP. Therefore, a deterministic winner determination model with an estimate of shipment volume may not provide solutions that attain low procurement costs. This paper proposes a new tractable two-stage robust optimization (RO) approach to solve WDP for TL service procurement under shipment volume uncertainty. Assuming that only historical data is available, we propose a data-driven approach based on the central limit theorem (CLT) to construct polyhedral uncertainty sets. In particular, we consider two random cases: independent shipment volume and correlated shipment volume. A two-stage RO model with integer first-stage decision variables and continuous recourse variables is then formulated. We develop a reformulation solution method and use numerical tests to demonstrate that it is much more computationally efficient than the widely adopted Benders’ type constraint generation algorithm. We demonstrate by numerical tests that real-world sized instances of TL service procurement problems can be solved by our proposed robust method. Moreover, we compare our robust approach with benchmark and show that it is more tractable and robust to uncertainty.


      PubDate: 2015-06-25T02:29:12Z
       
  • From behavioral psychology to acceleration modeling: Calibration,
           validation, and exploration of drivers’ cognitive and safety
           parameters in a risk-taking environment
    • Abstract: Publication date: August 2015
      Source:Transportation Research Part B: Methodological, Volume 78
      Author(s): Samer H. Hamdar , Hani S. Mahmassani , Martin Treiber
      We investigate a utility-based approach for driver car-following behavioral modeling while analyzing different aspects of the model characteristics especially in terms of capturing different fundamental diagram regions and safety proxy indices. The adopted model came from an elementary thought where drivers associate subjective utilities for accelerations (i.e. gain in travel times) and subjective dis-utilities for decelerations (i.e. loss in travel time) with a perceived probability of being involved in rear-end collision crashes. Following the testing of the model general structure, the authors translate the corresponding behavioral psychology theory – prospect theory – into an efficient microscopic traffic modeling with more elaborate stochastic characteristics considered in a risk-taking environment. After model formulation, we explore different model disaggregate and aggregate characteristics making sure that fidelity is kept in terms of equilibrium properties. Significant effort is then dedicated to calibrating and validating the model using microscopic trajectory data. A modified genetic algorithm is adopted for this purpose while focusing on capturing inter-driver heterogeneity for each of the parameters. Using the calibration exercise as a starting point, simulation sensitivity analysis is performed to reproduce different fundamental diagram regions and to explore rear-end collisions related properties. In terms of fundamental diagram regions, the model in hand is able to capture traffic breakdowns and different instabilities in the congested region represented by flow-density data points scattering. In terms of incident related measures, the effect of heterogeneity in both psychological factors and execution/perception errors on the accidents number and their distribution is studied. Through sensitivity analysis, correlations between the crash-penalty, the negative coefficient associated with losses in speed, the positive coefficient associated with gains in speed, the driver’s uncertainty, the anticipation time and the reaction time are retrieved. The formulated model offers a better understanding of driving behavior, particularly under extreme/incident conditions.


      PubDate: 2015-06-25T02:29:12Z
       
  • Editorial Board
    • Abstract: Publication date: August 2015
      Source:Transportation Research Part B: Methodological, Volume 78




      PubDate: 2015-06-25T02:29:12Z
       
  • Infrastructure deployment under uncertainties and competition: The biofuel
           industry case
    • Abstract: Publication date: August 2015
      Source:Transportation Research Part B: Methodological, Volume 78
      Author(s): Xin Wang , Michael K. Lim , Yanfeng Ouyang
      Technological paradigm shifts often come with a newly emerging industry that seeks a viable infrastructure deployment plan to compete against established competitors. Such phenomenon has been repeatedly seen in the field of transportation systems, such as those related to the booming bioenergy production, among others. We develop a game-theoretic modeling framework using a continuum approximation scheme to address the impacts of competition on the optimal infrastructure deployment. Furthermore, we extend the model to incorporate uncertainties in supply/demand and the risk of facility disruptions. Analytical properties of the optimal infrastructure system are obtained, based on which fast numerical solution algorithms are developed. Several hypothetical problem instances are used to illustrate the effectiveness of the proposed algorithms and to quantify the impacts of various system parameters. A large-scale biofuel industry case study for the U.S. Midwest is conducted to obtain additional managerial insights.


      PubDate: 2015-06-25T02:29:12Z
       
  • The recoverable robust facility location problem
    • Abstract: Publication date: September 2015
      Source:Transportation Research Part B: Methodological, Volume 79
      Author(s): Eduardo Álvarez-Miranda , Elena Fernández , Ivana Ljubić
      This work deals with a facility location problem in which location and allocation (transportation) policy is defined in two stages such that a first-stage solution should be robust against the possible realizations (scenarios) of the input data that can only be revealed in a second stage. This solution should be robust enough so that it can be recovered promptly and at low cost in the second stage. In contrast to some related modeling approaches from the literature, this new recoverable robust model is more general in terms of the considered data uncertainty; it can address situations in which uncertainty may be present in any of the following four categories: provider-side uncertainty, receiver-side uncertainty, uncertainty in-between, and uncertainty with respect to the cost parameters. For this novel problem, a sophisticated branch-and-cut framework based on Benders decomposition is designed and complemented by several non-trivial enhancements, including scenario sorting, dual lifting, branching priorities, matheuristics and zero-half cuts. Two large sets of instances that incorporate spatial and demographic information of countries such as Germany and US (transportation) and Bangladesh and the Philippines (disaster management) are introduced. They are used to analyze in detail the characteristics of the proposed model and the obtained solutions as well as the effectiveness, behavior and limitations of the designed algorithm.


      PubDate: 2015-06-25T02:29:12Z
       
  • A generalized queuing model and its solution properties
    • Abstract: Publication date: September 2015
      Source:Transportation Research Part B: Methodological, Volume 79
      Author(s): Jia Li , H.M. Zhang
      Modeling queuing behavior is central to the analysis of transportation and other service systems. To date, several queuing models been developed, but analytical insights on their global properties are hard to obtain. This is because in most cases, queuing dynamics are formulated as differential or difference equations, with possible discontinuities in their solutions, making most conventional analytical tools inadequate. As a result, simulations are often used to study these models, and if not properly treated, negative flows could arise from the simulation near certain discontinuities. In this paper, we propose a continuous-time queuing model that captures generalized queuing dynamics, where bottleneck discharging capacity and demand can vary simultaneously. We provide insights on the global properties of this model, upon deriving its closed-form variational solutions. Rather than resorting to the usual Hamilton–Jacobi theory, our derivations are built on an intrinsic periodicity property of the general queuing dynamics combined with measure-theoretic analysis. This treatment allows us to obtain results with more complex boundary conditions and make further extensions. We demonstrate its applications and show its solution properties in queuing simulation and performance bounding. In particular, we provide graphical, iterative and linearized solution schemes, which are all devoid of the well-known negative flow issue associated with numerical solutions to the point queue model.


      PubDate: 2015-06-25T02:29:12Z
       
  • A new generalized heterogeneous data model (GHDM) to jointly model mixed
           types of dependent variables
    • Abstract: Publication date: September 2015
      Source:Transportation Research Part B: Methodological, Volume 79
      Author(s): Chandra R. Bhat
      This paper formulates a generalized heterogeneous data model (GHDM) that jointly handles mixed types of dependent variables—including multiple nominal outcomes, multiple ordinal variables, and multiple count variables, as well as multiple continuous variables—by representing the covariance relationships among them through a reduced number of latent factors. Sufficiency conditions for identification of the GHDM parameters are presented. The maximum approximate composite marginal likelihood (MACML) method is proposed to estimate this jointly mixed model system. This estimation method provides computational time advantages since the dimensionality of integration in the likelihood function is independent of the number of latent factors. The study undertakes a simulation experiment within the virtual context of integrating residential location choice and travel behavior to evaluate the ability of the MACML approach to recover parameters. The simulation results show that the MACML approach effectively recovers underlying parameters, and also that ignoring the multi-dimensional nature of the relationship among mixed types of dependent variables can lead not only to inconsistent parameter estimation, but also have important implications for policy analysis.


      PubDate: 2015-06-25T02:29:12Z
       
  • Formulation, existence, and computation of boundedly rational dynamic user
           equilibrium with fixed or endogenous user tolerance
    • Abstract: Publication date: September 2015
      Source:Transportation Research Part B: Methodological, Volume 79
      Author(s): Ke Han , W.Y. Szeto , Terry L. Friesz
      This paper analyzes dynamic user equilibrium (DUE) that incorporates the notion of boundedly rational (BR) user behavior in the selection of departure times and routes. Intrinsically, the boundedly rational dynamic user equilibrium (BR-DUE) model we present assumes that travelers do not always seek the least costly route-and-departure-time choice. Rather, their perception of travel cost is affected by an indifference band describing travelers’ tolerance of the difference between their experienced travel costs and the minimum travel cost. An extension of the BR-DUE problem is the so-called variable tolerance dynamic user equilibrium (VT-BR-DUE) wherein endogenously determined tolerances may depend not only on paths, but also on the established path departure rates. This paper presents a unified approach for modeling both BR-DUE and VT-BR-DUE, which makes significant contributions to the model formulation, analysis of existence, solution characterization, and numerical computation of such problems. The VT-BR-DUE problem, together with the BR-DUE problem as a special case, is formulated as a variational inequality. We provide a very general existence result for VT-BR-DUE and BR-DUE that relies on assumptions weaker than those required for normal DUE models. Moreover, a characterization of the solution set is provided based on rigorous topological analysis. Finally, three computational algorithms with convergence results are proposed based on the VI and DVI formulations. Numerical studies are conducted to assess the proposed algorithms in terms of solution quality, convergence, and computational efficiency.


      PubDate: 2015-06-25T02:29:12Z
       
  • Some insights into a sequential resource allocation mechanism for en route
           air traffic management
    • Abstract: Publication date: September 2015
      Source:Transportation Research Part B: Methodological, Volume 79
      Author(s): Amy Kim , Mark Hansen
      This paper presents a game theoretic model of a sequential capacity allocation process in a congestible transportation system. In this particular application, we investigate the governing principles at work in how airlines will time their requests for en route resources under capacity shortfalls and uncertain conditions, when flights are not able to take their preferred route at their preferred departure time slot due to the shortfalls. We examine a sequential “First Submitted First Assigned” (FSFA) capacity allocation process within an en route air traffic flow management (ATFM) program such as the Collaborative Trajectory Options Program (CTOP), which is a Federal Aviation Administration initiative that aims to manage en route capacity constraints brought on by inclement weather and capacity/demand imbalances. In the FSFA process, flights are assigned the best available routes and slots available at the time flight operators submit their preference requests during the planning period, in a sequential manner. Because flight operators compete with one another for resources, in such an allocation process they would be expected to make their requests as early as possible. However, because weather and traffic conditions – and therefore, the values of resources – can change significantly, flight operators may prefer to request resources later in the process rather than earlier. We use a game theoretic setup to understand how flight operators might tradeoff these conflicts and choose an optimal time to submit their preferences for their flights, as submission times are competitive responses by flight operators looking to maximize their benefits. We first develop a loss function that captures the expected utility of submitting preferences under uncertainty about operating conditions. Then, a conceptual model of the FSFA process is constructed using a simultaneous incomplete information game, where flight operators compete for the “prizes” of having submitted their inputs before others. A numerical study is performed in which it is demonstrated that preference submission times are heavily influenced by the general uncertainty surrounding weather and operational conditions of the ATFM program, and each flight operator’s internal ability to handle this uncertainty. A key finding is that, in many of the scenarios presented, an optimal strategy for a flight operator is to submit their preferences at the very beginning of the planning period. If air traffic managers could expect to receive more submissions at the beginning of the planning period, they could more easily coordinate the ATFM program with other ATFM programs taking place or scheduled to take place, and they would have more opportunity to call another FSFA allocation route before the ATFM program begins, should conditions change enough to warrant this. Outputs of the model may provide some general insights to flight operators in planning submission strategies within competitive allocation processes such as FSFA. Also, this work may have a broader application to other sequential resource allocation strategies within congestible and controlled transportation systems.


      PubDate: 2015-06-25T02:29:12Z
       
 
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2015