for Journals by Title or ISSN
for Articles by Keywords
  Subjects -> TRANSPORTATION (Total: 164 journals)
    - AIR TRANSPORT (7 journals)
    - AUTOMOBILES (21 journals)
    - RAILROADS (5 journals)
    - ROADS AND TRAFFIC (6 journals)
    - SHIPS AND SHIPPING (30 journals)
    - TRANSPORTATION (95 journals)

TRANSPORTATION (95 journals)

Showing 1 - 53 of 53 Journals sorted alphabetically
Accident Analysis & Prevention     Partially Free   (Followers: 75)
Analytic Methods in Accident Research     Hybrid Journal   (Followers: 2)
Archives of Transport     Open Access   (Followers: 15)
Botswana Journal of Technology     Full-text available via subscription  
Case Studies on Transport Policy     Hybrid Journal   (Followers: 6)
Cities in the 21st Century     Open Access   (Followers: 11)
Economics of Transportation     Partially Free   (Followers: 12)
Emission Control Science and Technology     Hybrid Journal   (Followers: 2)
EURO Journal of Transportation and Logistics     Hybrid Journal   (Followers: 8)
European Transport Research Review     Open Access   (Followers: 21)
Geosystem Engineering     Hybrid Journal   (Followers: 1)
IATSS Research     Open Access  
IEEE Vehicular Technology Magazine     Full-text available via subscription   (Followers: 8)
IET Electrical Systems in Transportation     Hybrid Journal   (Followers: 9)
IET Intelligent Transport Systems     Hybrid Journal   (Followers: 7)
IFAC-PapersOnLine     Open Access  
International Innovation - Transport     Open Access   (Followers: 8)
International Journal of Applied Logistics     Full-text available via subscription   (Followers: 7)
International Journal of Crashworthiness     Hybrid Journal   (Followers: 7)
International Journal of e-Navigation and Maritime Economy     Open Access   (Followers: 1)
International Journal of Electric and Hybrid Vehicles     Hybrid Journal   (Followers: 8)
International Journal of Heavy Vehicle Systems     Hybrid Journal   (Followers: 6)
International Journal of Intelligent Transportation Systems Research     Hybrid Journal   (Followers: 9)
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: 10)
International Journal of Services Technology and Management     Hybrid Journal  
International Journal of Sustainable Transportation     Hybrid Journal   (Followers: 9)
International Journal of Traffic and Transportation Engineering     Open Access   (Followers: 14)
International Journal of Transportation Science and Technology     Full-text available via subscription   (Followers: 9)
International Journal of Vehicle Systems Modelling and Testing     Hybrid Journal   (Followers: 3)
International Journal of Vehicular Technology     Open Access   (Followers: 4)
Journal of Advanced Transportation     Hybrid Journal   (Followers: 11)
Journal of Mechatronics, Electrical Power, and Vehicular Technology     Open Access   (Followers: 5)
Journal of Modern Transportation     Full-text available via subscription   (Followers: 6)
Journal of Navigation     Hybrid Journal   (Followers: 170)
Journal of Sport & Social Issues     Hybrid Journal   (Followers: 8)
Journal of Sustainable Mobility     Full-text available via subscription  
Journal of Traffic and Transportation Engineering (English Edition)     Open Access   (Followers: 5)
Journal of Transport & Health     Hybrid Journal   (Followers: 5)
Journal of Transport and Supply Chain Management     Open Access   (Followers: 10)
Journal of Transport Geography     Hybrid Journal   (Followers: 22)
Journal of Transport History     Full-text available via subscription   (Followers: 14)
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: 13)
Journal of Transportation Technologies     Open Access   (Followers: 14)
Journal of Waterway Port Coastal and Ocean Engineering     Full-text available via subscription   (Followers: 6)
Les Dossiers du Grihl     Open Access   (Followers: 1)
Logistics & Sustainable Transport     Open Access   (Followers: 2)
Logistique & Management     Full-text available via subscription  
Modern Transportation     Open Access   (Followers: 10)
Nonlinear Dynamics     Hybrid Journal   (Followers: 5)
Open Journal of Safety Science and Technology     Open Access   (Followers: 7)
Packaging, Transport, Storage & Security of Radioactive Material     Hybrid Journal   (Followers: 2)
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: 12)
Public Transport     Hybrid Journal   (Followers: 16)
Recherche Transports Sécurité     Hybrid Journal   (Followers: 1)
Research in Transportation Business and Management     Partially Free   (Followers: 4)
Revista Transporte y Territorio     Open Access   (Followers: 1)
Romanian Journal of Transport Infrastructure     Open Access   (Followers: 1)
SourceOCDE Transports     Full-text available via subscription   (Followers: 2)
Sport, Education and Society     Hybrid Journal   (Followers: 11)
Sport, Ethics and Philosophy     Hybrid Journal   (Followers: 1)
Streetnotes     Open Access   (Followers: 1)
Synthesis Lectures on Mobile and Pervasive Computing     Full-text available via subscription   (Followers: 2)
Tire Science and Technology     Full-text available via subscription   (Followers: 3)
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 Problems     Open Access   (Followers: 1)
Transport Reviews: A Transnational Transdisciplinary Journal     Hybrid Journal   (Followers: 9)
Transportation     Hybrid Journal   (Followers: 27)
Transportation Geotechnics     Full-text available via subscription   (Followers: 1)
Transportation Infrastructure Geotechnology     Hybrid Journal   (Followers: 8)
Transportation Journal     Full-text available via subscription   (Followers: 12)
Transportation Letters : The International Journal of Transportation Research     Hybrid Journal   (Followers: 3)
Transportation Research Part A: Policy and Practice     Hybrid Journal   (Followers: 31)
Transportation Research Part B: Methodological     Hybrid Journal   (Followers: 29)
Transportation Research Part C: Emerging Technologies     Hybrid Journal   (Followers: 20)
Transportation Research Procedia     Open Access   (Followers: 4)
Transportation Research Record : Journal of the Transportation Research Board     Full-text available via subscription   (Followers: 33)
Transportation Science     Full-text available via subscription   (Followers: 20)
TRANSPORTES     Open Access   (Followers: 5)
Transportmetrica A : Transport Science     Hybrid Journal   (Followers: 4)
Transportmetrica B : Transport Dynamics     Hybrid Journal   (Followers: 2)
Travel Behaviour and Society     Full-text available via subscription   (Followers: 5)
Travel Medicine and Infectious Disease     Hybrid Journal   (Followers: 2)
Urban, Planning and Transport Research     Open Access   (Followers: 26)
Vehicular Communications     Full-text available via subscription   (Followers: 2)
World Review of Intermodal Transportation Research     Hybrid Journal   (Followers: 5)
Транспортні системи та технології перевезень     Open Access  
Journal Cover Transportation Research Part B: Methodological
  [SJR: 3.905]   [H-I: 87]   [29 followers]  Follow
   Hybrid Journal Hybrid journal (It can contain Open Access articles)
   ISSN (Print) 0191-2615
   Published by Elsevier Homepage  [3038 journals]
  • Proactive route guidance to avoid congestion
    • Authors: E. Angelelli; I. Arsik; V. Morandi; M. Savelsbergh; M.G. Speranza
      Pages: 1 - 21
      Abstract: Publication date: December 2016
      Source:Transportation Research Part B: Methodological, Volume 94
      Author(s): E. Angelelli, I. Arsik, V. Morandi, M. Savelsbergh, M.G. Speranza
      We propose a proactive route guidance approach that integrates a system perspective: minimizing congestion, and a user perspective: minimizing travel inconvenience. The approach assigns paths to users so as to minimize congestion while not increasing their travel inconvenience too much. A maximum level of travel inconvenience is ensured and a certain level of fairness is maintained by limiting the set of considered paths for each Origin-Destination pair to those whose relative difference with respect to the shortest (least-duration) path, called travel inconvenience, is below a given threshold. The approach hierarchically minimizes the maximum arc utilization and the weighted average experienced travel inconvenience. Minimizing the maximum arc utilization in the network, i.e., the ratio of the number of vehicles entering an arc per time unit and the maximum number of vehicles per time unit at which vehicles can enter the arc and experience no slowdown due to congestion effects, is a system-oriented objective, while minimizing the weighted average experienced travel inconvenience, i.e., the average travel inconvenience over all eligible paths weighted by the number of vehicles per time unit that traverse the path, is a user-oriented objective. By design, to ensure computational efficiency, the approach only solves linear programming models. In a computational study using benchmark instances reflecting a road infrastructure encountered in many cities, we analyze, for different levels of maximum travel inconvenience and, the minimum maximum arc utilization and the weighted average experienced travel inconvenience. We find that accepting relatively small levels of maximum travel inconvenience can result in a significant reduction, or avoiding, of congestion.

      PubDate: 2016-09-17T12:17:20Z
      DOI: 10.1016/j.trb.2016.08.015
      Issue No: Vol. 94 (2016)
  • Envy-minimizing pareto efficient intersection control with brokered
           utility exchanges under user heterogeneity
    • Authors: Roger Lloret-Batlle; R. Jayakrishnan
      Pages: 22 - 42
      Abstract: Publication date: December 2016
      Source:Transportation Research Part B: Methodological, Volume 94
      Author(s): Roger Lloret-Batlle, R. Jayakrishnan
      We propose PEXIC (Priced EXchanges in Intersection Control), a new concept and algorithm for traffic signal control that incorporates user heterogeneity on value of delay savings. The algorithm assigns phases with associated delays, taking into account the vehicle travelers’ values for experienced delay. Applying principles of envy-freeness, we develop a pricing scheme that addresses fairness by minimizing user envy via compensatory monetary transfers among users. PEXIC is Pareto efficient and budget balanced, and thus financially self-sustainable without external subsidy. The optimization is solved sequentially on a rolling horizon basis: first the phasing, and next the pricing. PEXIC achieves significant cost reductions for a large range of volumes and users’ value heterogeneity levels. Inclusion of user heterogeneity also proved to be fairer than standard delay minimization that disregards individual vehicles’ values for delay savings. Furthermore, we show that arbitrage is not possible, thus there are no incentives to drive just to collect those payments. The method used has polynomial complexity and it is suitable for real-world implementation.

      PubDate: 2016-09-17T12:17:20Z
      DOI: 10.1016/j.trb.2016.08.014
      Issue No: Vol. 94 (2016)
  • Autonomous cars and dynamic bottleneck congestion: The effects on
           capacity, value of time and preference heterogeneity
    • Authors: Vincent A.C. van den Berg; Erik T. Verhoef
      Pages: 43 - 60
      Abstract: Publication date: December 2016
      Source:Transportation Research Part B: Methodological, Volume 94
      Author(s): Vincent A.C. van den Berg, Erik T. Verhoef
      ‘Autonomous cars’ are cars that can drive themselves without human control. Autonomous cars can safely drive closer together than cars driven by humans, thereby possibly increasing road capacity. By allowing drivers to perform other activities in the vehicle, they may reduce the value of travel time losses (VOT). We investigate the effects of autonomous cars using a dynamic equilibrium model of congestion that captures three main elements: the resulting increase in capacity, the decrease in the VOT for those who acquire one and the implications of the resulting changes in the heterogeneity of VOTs. We do so for three market organizations: private monopoly, perfect competition and public supply. Even though an increased share of autonomous cars raises average capacity, it may hurt existing autonomous car users as those who switch to an autonomous car will impose increased congestion externalities due to their altered departure time behaviour. Depending on which effect dominates, switching to an autonomous vehicle may impose a net negative or positive externality. Often public supply leads to 100% autonomous cars, but it may be optimal to have a mix of car types, especially when there is a net negative externality. With a positive (negative) externality, perfect competition leads to an undersupply (oversupply) of autonomous cars, and a public supplier needs to subsidise (tax) autonomous cars to maximise welfare. A monopolist supplier ignores the capacity effect and adds a mark-up to its price.

      PubDate: 2016-09-22T07:43:35Z
      DOI: 10.1016/j.trb.2016.08.018
      Issue No: Vol. 94 (2016)
  • A disjunctive convex programming approach to the pollution-routing problem
    • Authors: Ricardo Fukasawa; Qie He; Yongjia Song
      Pages: 61 - 79
      Abstract: Publication date: December 2016
      Source:Transportation Research Part B: Methodological, Volume 94
      Author(s): Ricardo Fukasawa, Qie He, Yongjia Song
      The pollution-routing problem (PRP) aims to determine a set of routes and speed over each leg of the routes simultaneously to minimize the total operational and environmental costs. A common approach to solve the PRP exactly is through speed discretization, i.e., assuming that speed over each arc is chosen from a prescribed set of values. In this paper, we keep speed as a continuous decision variable within an interval and propose new formulations for the PRP. In particular, we build two mixed-integer convex optimization models for the PRP, by employing tools from disjunctive convex programming. These are the first arc-based formulations for the PRP with continuous speed. We also derive several families of valid inequalities to further strengthen both models. We test the proposed formulations on benchmark instances. Some instances are solved to optimality for the first time.

      PubDate: 2016-09-28T07:54:13Z
      DOI: 10.1016/j.trb.2016.09.006
      Issue No: Vol. 94 (2016)
  • A new random utility model with flexible correlation pattern and
           closed-form covariance expression: The CoRUM
    • Authors: Andrea Papola
      Pages: 80 - 96
      Abstract: Publication date: December 2016
      Source:Transportation Research Part B: Methodological, Volume 94
      Author(s): Andrea Papola
      This paper proposes a new random utility model characterised by a cumulative distribution function (cdf) obtained as a finite mixture of different cdfs. This entails that choice probabilities, covariances and elasticities of this model are also a finite mixture of choice probabilities, covariances and elasticities of the mixing models. As a consequence, by mixing nested logit cdfs, a model is generated with closed-form expressions for choice probabilities, covariances and elasticities and with, potentially, a very flexible correlation pattern. Importantly, the closed-form covariance expression opens up interesting application possibilities in some special choice contexts, like route choice, where prior expectations in terms of the covariance matrix can be formulated.

      PubDate: 2016-09-28T07:54:13Z
      DOI: 10.1016/j.trb.2016.09.008
      Issue No: Vol. 94 (2016)
  • A branch-and-price approach for solving the train unit scheduling problem
    • Authors: Zhiyuan Lin; Raymond S.K. Kwan
      Pages: 97 - 120
      Abstract: Publication date: December 2016
      Source:Transportation Research Part B: Methodological, Volume 94
      Author(s): Zhiyuan Lin, Raymond S.K. Kwan
      We propose a branch-and-price approach for solving the integer multicommodity flow model for the network-level train unit scheduling problem (TUSP). Given a train operator’s fixed timetable and a fleet of train units of different types, the TUSP aims at determining an assignment plan such that each train trip in the timetable is appropriately covered by a single or coupled train units. The TUSP is challenging due to its complex nature. Our branch-and-price approach includes a branching system with multiple branching rules for satisfying real-world requirements that are difficult to realize by linear constraints, such as unit type coupling compatibility relations and locations banned for coupling/decoupling. The approach also benefits from an adaptive node selection method, a column inheritance strategy and a feature of estimated upper bounds with node reservation functions. The branch-and-price solver designed for TUSP is capable of handling instances of up to about 500 train trips. Computational experiments were conducted based on real-world problem instances from First ScotRail. The results are satisfied by rail practitioners and are generally competitive or better than the manual ones.

      PubDate: 2016-09-28T07:54:13Z
      DOI: 10.1016/j.trb.2016.09.007
      Issue No: Vol. 94 (2016)
  • Designing a supply chain resilient to major disruptions and supply/demand
    • Authors: Armin Jabbarzadeh; Behnam Fahimnia; Jiuh-Biing Sheu; Hani Shahmoradi Moghadam
      Pages: 121 - 149
      Abstract: Publication date: December 2016
      Source:Transportation Research Part B: Methodological, Volume 94
      Author(s): Armin Jabbarzadeh, Behnam Fahimnia, Jiuh-Biing Sheu, Hani Shahmoradi Moghadam
      Global supply chains are more than ever under threat of major disruptions caused by devastating natural and man-made disasters as well as recurrent interruptions caused by variations in supply and demand. This paper presents a hybrid robust-stochastic optimization model and a Lagrangian relaxation solution method for designing a supply chain resilient to (1) supply/demand interruptions and (2) facility disruptions whose risk of occurrence and magnitude of impact can be mitigated through fortification investments. We study a realistic problem where a disruption can cause either a complete facility shutdown or a reduced supply capacity. The probability of disruption occurrence is expressed as a function of facility fortification investment for hedging against potential disruptions in the presence of certain budgetary constraints. Computational experiments and thorough sensitivity analyses are completed using some of the existing widely-used datasets. The performance of the proposed model is also examined using a Monte Carlo simulation method. To explore the practical application of the proposed model and methodology, a real world case example is discussed which addresses mitigating the risk of facility fires in an actual oil production company. Our analysis and investigation focuses on exploring the extent to which supply chain design decisions are influenced by factors such as facility fortification strategies, a decision maker's conservatism degree, demand fluctuations, supply capacity variations, and budgetary constraints.

      PubDate: 2016-10-04T13:37:22Z
      DOI: 10.1016/j.trb.2016.09.004
      Issue No: Vol. 94 (2016)
  • Parametric search for the bi-attribute concave shortest path problem
    • Authors: Yuli Zhang; Zuo-Jun Max Shen; Shiji Song
      Pages: 150 - 168
      Abstract: Publication date: December 2016
      Source:Transportation Research Part B: Methodological, Volume 94
      Author(s): Yuli Zhang, Zuo-Jun Max Shen, Shiji Song
      A bi-attribute concave shortest path (BC-SP) problem seeks to find an optimal path in a bi-attribute network that minimizes a linear combination of two path costs, one of which is evaluated by a nondecreasing concave function. Due to the nonadditivity of its objective function, Bellman’s principle of optimality does not hold. This paper proposes a parametric search method to solve the BC-SP problem, which only needs to solve a series of shortest path problems, i.e., the parameterized subproblems (PSPs). Several techniques are developed to reduce both the number of PSPs and the computation time for these PSPs. Specifically, we first identify two properties of the BC-SP problem to guide the parametric search using the gradient and concavity of its objective function. Based on the properties, a monotonic descent search (MDS) and an intersection point search (IPS) are proposed. Second, we design a speedup label correcting (LC) algorithm, which uses optimal solutions of previously solved PSPs to reduce the number of labeling operations for subsequent PSPs. The MDS, IPS and speedup LC techniques are embedded into a branch-and-bound based interval search to guarantee optimality. The performance of the proposed method is tested on the mean-standard deviation shortest path problem and the route choice problem with a quadratic disutility function. Experiments on both real transportation networks and grid networks show that the proposed method reduces the computation time of existing algorithms by one to two orders of magnitude.

      PubDate: 2016-10-04T13:37:22Z
      DOI: 10.1016/j.trb.2016.09.009
      Issue No: Vol. 94 (2016)
  • The two-echelon time-constrained vehicle routing problem in
           linehaul-delivery systems
    • Authors: Hongqi Li; Lu Zhang; Tan Lv; Xinyu Chang
      Pages: 169 - 188
      Abstract: Publication date: December 2016
      Source:Transportation Research Part B: Methodological, Volume 94
      Author(s): Hongqi Li, Lu Zhang, Tan Lv, Xinyu Chang
      Most of the studies address issues relating to the delivery from satellites to customers, which is throughout the end part of the linehaul-delivery system. Differing from the long-term strategic problems including the two-echelon vehicle routing problem (2E-VRP), the two-echelon location routing problem (2E-LRP) and the truck and trailer routing problem (TTRP) which make location decisions in depots or satellites, the paper introduces a short-term tactical problem named the two-echelon time-constrained vehicle routing problem in linehaul-delivery systems (2E-TVRP) that does not involve location decisions. The linehaul level and the delivery level are linked through city distribution centers (CDCs) located on the outskirts of cities. The 2E-TVRP has inter-CDC linehaul on the first level and urban delivery from CDCs to satellites on the second level. Vehicle routes on different levels are interacted by time constraints. A mixed integer nonlinear programming model for the 2E-TVRP is put forward, and a mixed integer linear programming model is used as the benchmark model. The Clarke and Wright savings heuristic algorithm (CW) improved by a local search phase is adopted. The 2E-TVRP formulations and the heuristic algorithm are tested by using 140 randomly-generated instances with up to 10 CDCs and 500 satellites. The computational results indicate that the heuristic can effectively solve various instances of the 2E-TVRP.

      PubDate: 2016-10-12T02:54:40Z
      DOI: 10.1016/j.trb.2016.09.012
      Issue No: Vol. 94 (2016)
  • Finding the k reliable shortest paths under travel time uncertainty
    • Authors: Bi Yu Chen; Qingquan Li; William H.K. Lam
      Pages: 189 - 203
      Abstract: Publication date: December 2016
      Source:Transportation Research Part B: Methodological, Volume 94
      Author(s): Bi Yu Chen, Qingquan Li, William H.K. Lam
      This paper investigates the problem of finding the K reliable shortest paths (KRSP) in stochastic networks under travel time uncertainty. The KRSP problem extends the classical K loopless shortest paths problem to the stochastic networks by explicitly considering travel time reliability. In this study, a deviation path approach is established for finding K α-reliable paths in stochastic networks. A deviation path algorithm is proposed to exactly solve the KRSP problem in large-scale networks. The A* technique is introduced to further improve the KRSP finding performance. A case study using real traffic information is performed to validate the proposed algorithm. The results indicate that the proposed algorithm can determine KRSP under various travel time reliability values within reasonable computational times. The introduced A* technique can significantly improve KRSP finding performance.

      PubDate: 2016-10-12T02:54:40Z
      DOI: 10.1016/j.trb.2016.09.013
      Issue No: Vol. 94 (2016)
  • The impact of source terms in the variational representation of traffic
    • Authors: Jorge A. Laval; Guillaume Costeseque; Bargavarama Chilukuri
      Pages: 204 - 216
      Abstract: Publication date: December 2016
      Source:Transportation Research Part B: Methodological, Volume 94
      Author(s): Jorge A. Laval, Guillaume Costeseque, Bargavarama Chilukuri
      This paper revisits the variational theory of traffic flow, now under the presence of continuum lateral inflows and outflows to the freeway. It is found that a VT solution apply only in Eulerian coordinates when source terms are exogenous, but not when they are a function of traffic conditions, e.g. as per a merge model. In discrete time, however, these dependencies become exogenous, which allowed us to propose improved numerical solution methods. In space-Lagrangian and time-Lagrangian coordinates, VT solutions may not apply even if source terms are exogenous.

      PubDate: 2016-10-12T02:54:40Z
      DOI: 10.1016/j.trb.2016.09.011
      Issue No: Vol. 94 (2016)
  • Eco-system optimal time-dependent flow assignment in a congested network
    • Authors: Chung-Cheng Lu; Jiangtao Liu; Yunchao Qu; Srinivas Peeta; Nagui M. Rouphail; Xuesong Zhou
      Pages: 217 - 239
      Abstract: Publication date: December 2016
      Source:Transportation Research Part B: Methodological, Volume 94
      Author(s): Chung-Cheng Lu, Jiangtao Liu, Yunchao Qu, Srinivas Peeta, Nagui M. Rouphail, Xuesong Zhou
      This research addresses the eco-system optimal dynamic traffic assignment (ESODTA) problem which aims to find system optimal eco-routing or green routing flows that minimize total vehicular emission in a congested network. We propose a generic agent-based ESODTA model and a simplified queueing model (SQM) that is able to clearly distinguish vehicles’ speed in free-flow and congested conditions for multi-scale emission analysis, and facilitates analyzing the relationship between link emission and delay. Based on the SQM, an expanded space-time network is constructed to formulate the ESODTA with constant bottleneck discharge capacities. The resulting integer linear model of the ESODTA is solved by a Lagrangian relaxation-based algorithm. For the simulation-based ESODTA, we present the column-generation-based heuristic, which requires link and path marginal emissions in the embedded time-dependent least-cost path algorithm and the gradient-projection-based descent direction method. We derive a formula of marginal emission which encompasses the marginal travel time as a special case, and develop an algorithm for evaluating path marginal emissions in a congested network. Numerical experiments are conducted to demonstrate that the proposed algorithm is able to effectively obtain coordinated route flows that minimize the system-wide vehicular emission for large-scale networks.

      PubDate: 2016-10-12T02:54:40Z
      DOI: 10.1016/j.trb.2016.09.015
      Issue No: Vol. 94 (2016)
  • On accommodating spatial interactions in a Generalized Heterogeneous Data
           Model (GHDM) of mixed types of dependent variables
    • Authors: Chandra R. Bhat; Abdul R. Pinjari; Subodh K. Dubey; Amin S. Hamdi
      Pages: 240 - 263
      Abstract: Publication date: December 2016
      Source:Transportation Research Part B: Methodological, Volume 94
      Author(s): Chandra R. Bhat, Abdul R. Pinjari, Subodh K. Dubey, Amin S. Hamdi
      We develop an econometric framework for incorporating spatial dependence in integrated model systems of latent variables and multidimensional mixed data outcomes. The framework combines Bhat's Generalized Heterogeneous Data Model (GHDM) with a spatial (social) formulation to parsimoniously introduce spatial (social) dependencies through latent constructs. The applicability of the spatial GHDM framework is demonstrated through an empirical analysis of spatial dependencies in a multidimensional mixed data bundle comprising a variety of household choices – household commute distance, residential location (density) choice, vehicle ownership, parents’ commute mode choice, and children's school mode choice – along with other measurement variables for two latent constructs – parent's safety concerns about children walking/biking to school and active lifestyle propensity. The GHDM framework identifies an intricate web of causal relationships and endogeneity among the endogenous variables. Furthermore, the spatial (social) version of the GHDM model reveals a high level of spatial (social) dependency in the latent active lifestyle propensity of different households and moderate level of spatial dependency in parents’ safety concerns. Ignoring spatial (social) dependencies in the empirical model results in inferior data fit, potential bias and statistical insignificance of the parameters corresponding to nominal variables, and underestimation of policy impacts.

      PubDate: 2016-10-12T02:54:40Z
      DOI: 10.1016/j.trb.2016.09.002
      Issue No: Vol. 94 (2016)
  • Preferences for travel time under risk and ambiguity: Implications in path
           selection and network equilibrium
    • Authors: Jin Qi; Melvyn Sim; Defeng Sun; Xiaoming Yuan
      Pages: 264 - 284
      Abstract: Publication date: December 2016
      Source:Transportation Research Part B: Methodological, Volume 94
      Author(s): Jin Qi, Melvyn Sim, Defeng Sun, Xiaoming Yuan
      In this paper, we study the preferences for uncertain travel times in which probability distributions may not be fully characterized. In evaluating an uncertain travel time, we explicitly distinguish between risk, where the probability distribution is precisely known, and ambiguity, where it is not. In particular, we propose a new criterion called ambiguity-aware CARA travel time (ACT) for evaluating uncertain travel times under various attitudes of risk and ambiguity, which is a preference based on blending the Hurwicz criterion and Constant Absolute Risk Aversion (CARA). More importantly, we show that when the uncertain link travel times are independently distributed, finding the path that minimizes travel time under the ACT criterion is essentially a shortest path problem. We also study the implications on Network Equilibrium (NE) model where travelers on the traffic network are characterized by their knowledge of the network uncertainty as well as their risk and ambiguity attitudes under the ACT. We derive and analyze the existence and uniqueness of solutions under NE. Finally, we obtain the Price of Anarchy that characterizes the inefficiency of this new equilibrium. The computational study suggests that as uncertainty increases, the influence of selfishness on inefficiency diminishes.

      PubDate: 2016-10-16T15:47:55Z
      DOI: 10.1016/j.trb.2016.09.014
      Issue No: Vol. 94 (2016)
  • Carrier collaboration with endogenous fleets and load factors when
           networks are complementary
    • Authors: Achim I. Czerny; Vincent A.C. van den Berg; Erik T. Verhoef
      Pages: 285 - 297
      Abstract: Publication date: December 2016
      Source:Transportation Research Part B: Methodological, Volume 94
      Author(s): Achim I. Czerny, Vincent A.C. van den Berg, Erik T. Verhoef
      This paper analyzes the effect of carrier collaboration on fleet capacity, fleet structures in terms of the number and the size of vehicles, and load factors. The model features complementary networks, scheduling, price elastic demands, and demand uncertainty. For the case of a given number of vehicles, the analysis shows that carrier collaboration increases vehicle sizes (thus, fleet capacity) if marginal seat costs are low while fleet capacity remains unchanged if marginal seat costs are high. If both vehicle sizes and vehicle numbers can be varied, then collaboration will always increase vehicle numbers and fleet capacity, while the effects on vehicle sizes and, thus, also load factors, are ambiguous and therewith hard to predict. Numerical simulations indicate that collaboration increases expected load factors also when the number of vehicles is endogenous.

      PubDate: 2016-10-16T15:47:55Z
      DOI: 10.1016/j.trb.2016.09.005
      Issue No: Vol. 94 (2016)
  • Optimal public transport networks for a general urban structure
    • Authors: Andrés Fielbaum; Sergio Jara-Diaz; Antonio Gschwender
      Pages: 298 - 313
      Abstract: Publication date: December 2016
      Source:Transportation Research Part B: Methodological, Volume 94
      Author(s): Andrés Fielbaum, Sergio Jara-Diaz, Antonio Gschwender
      Using a quite general parametric description of an urban setting in terms of its network, centers structure and demand pattern, we find the optimal spatial arrangement of transit lines out of four basic strategic competing options: direct, exclusive, hub-and-spoke and feeder-trunk. We identify clearly the relation between the characteristics of both the urban setting (mostly monocentric, polycentric or dispersed) and the users (transfer penalty, patronage) with the line structure that shows the best response.

      PubDate: 2016-10-16T15:47:55Z
      DOI: 10.1016/j.trb.2016.10.003
      Issue No: Vol. 94 (2016)
  • Constrained optimization and distributed computation based car following
           control of a connected and autonomous vehicle platoon
    • Authors: Siyuan Gong; Jinglai Shen; Lili Du
      Pages: 314 - 334
      Abstract: Publication date: December 2016
      Source:Transportation Research Part B: Methodological, Volume 94
      Author(s): Siyuan Gong, Jinglai Shen, Lili Du
      Motivated by the advancement in connected and autonomous vehicle technologies, this paper develops a novel car-following control scheme for a platoon of connected and autonomous vehicles on a straight highway. The platoon is modeled as an interconnected multi-agent dynamical system subject to physical and safety constraints, and it uses the global information structure such that each vehicle shares information with all the other vehicles. A constrained optimization based control scheme is proposed to ensure an entire platoon’s transient traffic smoothness and asymptotic dynamic performance. By exploiting the solution properties of the underlying optimization problem and using primal-dual formulation, this paper develops dual based distributed algorithms to compute optimal solutions with proven convergence. Furthermore, the asymptotic stability of the unconstrained linear closed-loop system is established. These stability analysis results provide a principle to select penalty weights in the underlying optimization problem to achieve the desired closed-loop performance for both the transient and the asymptotic dynamics. Extensive numerical simulations are conducted to validate the efficiency of the proposed algorithms.

      PubDate: 2016-10-16T15:47:55Z
      DOI: 10.1016/j.trb.2016.09.016
      Issue No: Vol. 94 (2016)
  • Day-to-day traffic dynamics considering social interaction: From
           individual route choice behavior to a network flow model
    • Authors: Fangfang Wei; Ning Jia; Shoufeng Ma
      Pages: 335 - 354
      Abstract: Publication date: December 2016
      Source:Transportation Research Part B: Methodological, Volume 94
      Author(s): Fangfang Wei, Ning Jia, Shoufeng Ma
      Social interaction is increasingly recognized as an important factor that influences travelers’ behaviors. It remains challenging to incorporate its effect into travel choice behaviors, although there has been some research into this area. Considering random interaction among travelers, we model travelers’ day-to-day route choice under the uncertain traffic condition. We further explore the evolution of network flow based on the individual-level route choice model, though that travelers are heterogeneous in decision-making under the random-interaction scheme. We analyze and prove the existence of equilibrium and the stability of equilibrium. We also analyzed and described the specific properties of the network flow evolution and travelers’ behaviors. Two interesting phenomena are found in this study. First, the number of travelers that an individual interacts with can affect his route choice strategy. However, the interaction count exerts no influence on the evolution of network flow at the aggregate-level. Second, when the network flow reaches equilibrium, the route choice strategy at the individual-level is not necessarily invariable. Finally, two networks are used as numerical examples to show model properties and to demonstrate the two study phenomena. This study improves the understanding of travelers’ route choice dynamics and informs how the network flow evolves under the influence of social interaction.

      PubDate: 2016-10-16T15:47:55Z
      DOI: 10.1016/j.trb.2016.10.002
      Issue No: Vol. 94 (2016)
  • Gap-based transit assignment algorithm with vehicle capacity constraints:
           Simulation-based implementation and large-scale application
    • Authors: Ömer Verbas; Hani S. Mahmassani; Michael F. Hyland
      Pages: 1 - 16
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Ömer Verbas, Hani S. Mahmassani, Michael F. Hyland
      This paper presents a gap-based solution method for the time-dependent transit assignment problem with vehicle capacity constraints. A two-level, simulation-based methodology is proposed, which finds the least cost hyperpaths at the upper level and performs the assignment of transit travelers on the hyperpaths at the lower level. The detailed simulation of travelers and vehicles at the lower level allows modelers to capture transit network complexities such as transfers/missed connections, receiving a seat/standing and boarding/being rejected to board. This ‘hard’ implementation of vehicle capacity constraints at the lower level is aggregated into ‘soft constraints’ at the upper level for the least cost hyperpath calculation. Using a gap-based assignment procedure, user equilibrium is reached on large-scale networks in a computationally efficient manner. The algorithm is tested on the large-scale Chicago Transit Authority network. The gap-based approach outperforms the commonly used method of successive averages approach in terms of rate of convergence and quality of results. Furthermore, sensitivity analyses with respect to network parameters illustrate the robustness of the proposed two-level solution procedure.

      PubDate: 2016-07-30T00:45:26Z
      DOI: 10.1016/j.trb.2016.07.002
      Issue No: Vol. 93 (2016)
  • Modeling the first train timetabling problem with minimal missed trains
           and synchronization time differences in subway networks
    • Authors: Liujiang Kang; Xiaoning Zhu; Huijun Sun; Jakob Puchinger; Mario Ruthmair; Bin Hu
      Pages: 17 - 36
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Liujiang Kang, Xiaoning Zhu, Huijun Sun, Jakob Puchinger, Mario Ruthmair, Bin Hu
      Urban railway transportation organization is a systematic activity that is usually composed of several stages, including network design, line planning, timetabling, rolling stock and staffing. In this paper, we study the optimization of first train timetables for an urban railway network that focuses on designing convenient and smooth timetables for morning passengers. We propose a mixed integer programming (MIP) model for minimizing train arrival time differences and the number of missed trains, i.e., the number of trains without transfers within a reasonable time at interchange stations as an alternative to minimize passenger transfer waiting times. This is interesting from the operator's point of view, and we show that both criteria are equivalent. Starting from an intuitive model for the first train transfer problem, we then linearize the non-linear constraints by utilizing problem specific knowledge. In addition, a local search algorithm is developed to solve the timetabling problem. Through computational experiments involving the Beijing subway system, we demonstrate the computational efficiency of the exact model and the heuristic approach. Finally, three practical suggestions are proposed for the operation and management of the urban railway transit system.

      PubDate: 2016-07-30T00:45:26Z
      DOI: 10.1016/j.trb.2016.07.006
      Issue No: Vol. 93 (2016)
  • Bus network structure and mobility pattern: A monocentric analytical
           approach on a grid street layout
    • Authors: Hugo Badia; Miquel Estrada; Francesc Robusté
      Pages: 37 - 56
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Hugo Badia, Miquel Estrada, Francesc Robusté
      This study discusses which transit network structure is the best option to serve urban mobility. As a consequence of the evolution of urban form, cities have undergone a process of dispersion of their activities that has caused a change in mobility needs in the last few decades. Mobility networks and services should progressively adapt to the new demand patterns, especially the bus transit network, which has more flexibility to absorb the changes. We compare four base transit network structures: a radial scheme, a direct trip-based network, and a transfer-based system by means of either a complete grid or a hybrid structure. An analytical model is used to estimate the behavior of these structures for idealized monocentric mobility patterns with several degrees of concentration. The purpose is to determine the right range of situations for the applicability of each bus transit structure, and to determine guidelines about the transit network planning process. It turns out that the best structure is not always the same, and depends on the mobility spatial pattern. A radial network is the best alternative in very concentrated cities; however, a direct trip-based system is more suitable for intermediate degrees of dispersion. A transfer-based structure is the best option when the activities are more decentralized. Nevertheless, the decentralization degree that justifies a specific transit structure is not constant. This degree depends on the characteristics of the city, transport technology and users.

      PubDate: 2016-07-30T00:45:26Z
      DOI: 10.1016/j.trb.2016.07.004
      Issue No: Vol. 93 (2016)
  • A two-step linear programming model for energy-efficient timetables in
           metro railway networks
    • Authors: Shuvomoy Das Gupta; J. Kevin Tobin; Lacra Pavel
      Pages: 57 - 74
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Shuvomoy Das Gupta, J. Kevin Tobin, Lacra Pavel
      In this paper we propose a novel two-step linear optimization model to calculate energy-efficient timetables in metro railway networks. The resultant timetable minimizes the total energy consumed by all trains and maximizes the utilization of regenerative energy produced by braking trains, subject to the constraints in the railway network. In contrast to other existing models, which are NP -hard, our model is computationally the most tractable one being a linear program. We apply our optimization model to different instances of service PES2-SFM2 of line 8 of Shanghai Metro network spanning a full service period of one day (18 h) with thousands of active trains. For every instance, our model finds an optimal timetable very quickly (largest runtime being less than 13 s) with significant reduction in effective energy consumption (the worst case being 19.27%). Code based on the model has been integrated with Thales Timetable Compiler - the industrial timetable compiler of Thales Inc that has the largest installed base of communication-based train control systems worldwide.

      PubDate: 2016-07-30T00:45:26Z
      DOI: 10.1016/j.trb.2016.07.003
      Issue No: Vol. 93 (2016)
  • An indirect latent informational conformity social influence choice model:
           Formulation and case study
    • Authors: Michael Maness; Cinzia Cirillo
      Pages: 75 - 101
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Michael Maness, Cinzia Cirillo
      The current state-of-the-art in social influence models of travel behavior is conformity models with direct benefit social influence effects; indirect effects have seen limited development. This paper presents a latent class discrete choice model of an indirect informational conformity hypothesis. Class membership depends on the proportion of group members who adopt a behavior. Membership into the “more informed” class causes taste variation in those individuals thus making adoption more attractive. Equilibrium properties are derived for the informational conformity model showing the possibility of multiple equilibria but under different conditions than the direct-benefit formulations. Social influence elasticity is computed for both models types and non-linear elasticity behavior is represented. Additionally, a two-stage control function is developed to obtain consistent parameter estimates in the presence of an endogenous class membership model covariate that is correlated with choice utility unobservables. The modeling framework is applied in a case study on social influence for bicycle ownership in the United States. Results showed that “more informed” households had a greater chance of owning a bike due to taste variation. These households were less sensitive to smaller home footprints and limited incomes. The behavioral hypothesis of positive preference change due to information transfer was confirmed. Observed ownership share closely matched predicted local-level equilibrium in some metropolitan areas, but the model was unable to fully achieve the expected prediction rates within confidence intervals. The elasticity of social influence was found to range locally from about 0.5% to 1.0%.
      Graphical abstract image

      PubDate: 2016-07-30T00:45:26Z
      DOI: 10.1016/j.trb.2016.07.008
      Issue No: Vol. 93 (2016)
  • Strategic investments in accessibility under port competition and
           inter-regional coordination
    • Authors: Yulai Wan; Leonardo J. Basso; Anming Zhang
      Pages: 102 - 125
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Yulai Wan, Leonardo J. Basso, Anming Zhang
      This paper analyzes the incentives for and welfare implications of collaboration among local governments in landside port accessibility investment. In particular, we consider two seaports with their respective captive markets and a common inland market for which the ports compete. The ports and the inland belong to three independent regional governments, each making investment decisions on accessibility for its own region. We find that there is a conflict of interest between the port governments and inland government in terms of their jointly making accessibility investment decisions, and that each region's preference over various coalitions is highly affected by ownership type of the competing ports. For public ports, the inland may compensate the port regions to achieve the grand coalition that maximizes total welfare but requires a sizable investment in the port regions. For private ports, however, the port regions benefit from coordinating with the inland and hence may be able to compensate the inland to form the grand coalition.

      PubDate: 2016-07-30T00:45:26Z
      DOI: 10.1016/j.trb.2016.07.011
      Issue No: Vol. 93 (2016)
  • Exploring alternative service schemes for busy transit corridors
    • Authors: Weihua Gu; Zahra Amini; Michael J. Cassidy
      Pages: 126 - 145
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Weihua Gu, Zahra Amini, Michael J. Cassidy
      Transit systems in which buses or trains always visit each and every stop along corridors are compared against those that feature two alternative vehicle-dispatching schemes. The alternatives entail so-called skip-stop and express/local services. Continuous models found in the literature are expanded so that the alternatives could be compared under a wider array of options. Comparisons are separately drawn for systems that feature buses, BRT and metro-rail trains, both for cities that are wealthy and for those that are not. Idealizations in regard to travel demand and route symmetry are assumed in pursuit of insights useful for high-level planning. Two rounds of parametric comparisons are conducted. In the first round, optimally-designed all-stop systems are presumably converted to furnish instead the alternative strategies without altering the original stop locations. In the second round, alternative schemes are designed in fully-optimized fashion from scratch. In both rounds, alternative dispatching schemes often bring lower generalized costs than do their optimally-designed all-stop counterparts. Estimated savings can reach 10% even in the first round where the alternative schemes are hampered by sub-optimal stop locations. If designed from scratch, the savings can reach 30%. Skip-stop service is found most often to be the lowest-cost option of the three.

      PubDate: 2016-07-30T00:45:26Z
      DOI: 10.1016/j.trb.2016.07.010
      Issue No: Vol. 93 (2016)
  • Introducing relations between activities and goods consumption in
           microeconomic time use models
    • Authors: Sergio R. Jara-Díaz; Sebastian Astroza; Chandra R. Bhat; Marisol Castro
      Pages: 162 - 180
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Sergio R. Jara-Díaz, Sebastian Astroza, Chandra R. Bhat, Marisol Castro
      We present a microeconomic model for time use and consumption for workers with an improved treatment of the (technical) relations between goods and time. In addition to the traditional time and income constraints, an improved set of restrictions involving explicit relations between consumption of goods and time assigned to activities is included in two versions. In each version, a system of equations involving a subset of the consumer's decision variables is obtained, including (1) work time, (2) activities that are assigned more time than the minimum, and (3) goods that are consumed above the minimum. The system cannot be solved explicitly in the endogenous decision variables but is used to set a stochastic system for econometric estimation through maximum likelihood. The models are applied to analyze weekly time use and consumption data from Netherlands for year 2012. The results obtained by this new ``goods and time'' framework are compared with previous research in terms of the value of leisure and the value of work, showing substantial differences in the valuation of time.

      PubDate: 2016-08-04T02:50:45Z
      DOI: 10.1016/j.trb.2016.07.014
      Issue No: Vol. 93 (2016)
  • Reliability-based stochastic transit assignment: Formulations and capacity
    • Authors: Y. Jiang; W.Y. Szeto
      Pages: 181 - 206
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Y. Jiang, W.Y. Szeto
      This study develops link-based and approach-based variational inequality (VI) formulations for the frequency-based transit assignment with supply uncertainty, where link flows and flow on each outgoing link from each node are decision variables, respectively. Both the mean and variance of travel cost, including the covariance of in-vehicle travel costs, are captured in both formulations. To address the covariance of in-vehicle travel costs between different links on the same transit line, an augmented route-section network representation is developed, allowing us to apply the dynamic programming method to compute the value of the mapping function of the VI. The approach-based formulation can be solved by an extragradient method that only requires mild assumptions for convergence. It is found that the number of links carrying flow and equilibrium cost can be underestimated if supply uncertainty is not considered. The study also introduces and examines the capacity paradox, a phenomenon in which the network maximum throughput may be reduced after new transit lines are added to a transit network or after the frequency of an existing line is increased. It is found that the capacity paradox may or may not occur simultaneously with the Braess-like paradox, a phenomenon in which providing new transit lines to a network may deteriorate the network performance in terms of the total weighted sum of the mean and variance of travel cost of all of the passengers. The demand level and the degree of risk aversion of passengers are the key factors that determine the occurrence of the capacity paradox.

      PubDate: 2016-08-04T02:50:45Z
      DOI: 10.1016/j.trb.2016.06.008
      Issue No: Vol. 93 (2016)
  • The impact of travel time variability and travelers’ risk attitudes on
           the values of time and reliability
    • Authors: Mickael Beaud; Thierry Blayac; Maïté Stéphan
      Pages: 207 - 224
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Mickael Beaud, Thierry Blayac, Maïté Stéphan
      In this paper, we derive implementable measures of travelers’ willingness to pay to save travel time (vot) and to improve the reliability ( vor) of a given trip. We set out a simple microeconomic model of transport mode choice in which each trip is fully characterized by its price and the statistical distribution of its random travel time, assuming that travelers have expected utility preferences over the latter. We then explore how the vot and vor are affected by the statistical distribution of travel time and by travelers’ preferences towards travel time variability.

      PubDate: 2016-08-04T02:50:45Z
      DOI: 10.1016/j.trb.2016.07.007
      Issue No: Vol. 93 (2016)
  • Capacitated transit service network design with boundedly rational agents
    • Authors: Jiangtao Liu; Xuesong Zhou
      Pages: 225 - 250
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Jiangtao Liu, Xuesong Zhou
      This paper proposes a new alternative modeling framework to systemically account for boundedly rational decision rules of travelers in a dynamic transit service network with tight capacity constraints. Within a time-discretized space-time network, the time-dependent transit services are characterized by traveling arcs and waiting arcs with constant travel times. Instead of using traditional flow-based formulations, an agent-based integer linear formulation is proposed to represent boundedly rational decisions under strictly imposed capacity constraints, due to vehicle carrying capacity and station storage capacity. Focusing on a viable and limited sets of space-time path alternatives, the proposed single-level optimization model can be effectively decomposed to a time-dependent routing sub-problem for individual agents and a knapsack sub-problem for service arc selections through the Lagrangian decomposition. In addition, several practically important modeling issues are discussed, such as dynamic and personalized transit pricing, passenger inflow control as part of network restraint strategies, and penalty for early/late arrival. Finally, numerical experiments are performed to demonstrate the methodology and computational efficiency of our proposed model and algorithm.

      PubDate: 2016-08-04T02:50:45Z
      DOI: 10.1016/j.trb.2016.07.015
      Issue No: Vol. 93 (2016)
  • Setting lines frequency and capacity in dense railway rapid transit
           networks with simultaneous passenger assignment
    • Authors: David Canca; Eva Barrena; Alicia De-Los-Santos; José Luis Andrade-Pineda
      Pages: 251 - 267
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): David Canca, Eva Barrena, Alicia De-Los-Santos, José Luis Andrade-Pineda
      We propose a Mixed Integer Non-Linear Programming (MINLP) model in order to determine optimal line frequencies and capacities in dense railway rapid transit (RRT) networks in which typically several lines can run over the same open tracks. Given a certain demand matrix, the model determines the most appropriate frequency and train capacity for each line taking into account infrastructure capacity constraints, allocating lines to tracks while assigning passengers to lines. The service provider and the user points of view are simultaneously taken into account. The first one is considered by selecting the most convenient set of frequencies and capacities and routing passengers from their origins to their destinations while minimizing the average trip time. The second one by minimizing operation, maintenance and fleet acquisition costs. Due to the huge number of variables and constraints appearing in real size instances, a preprocessing phase determining the best k-paths linking origin and destination stations is followed. Then, the best paths are used to define sparse index sets in order to drastically reduce the size of the problem. As illustration, the model is applied to a simplified version of the Madrid Metropolitan Railway network.

      PubDate: 2016-08-04T02:50:45Z
      DOI: 10.1016/j.trb.2016.07.020
      Issue No: Vol. 93 (2016)
  • Bus bunching along a corridor served by two lines
    • Authors: Jan-Dirk Schmöcker; Wenzhe Sun; Achille Fonzone; Ronghui Liu
      Pages: 300 - 317
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Jan-Dirk Schmöcker, Wenzhe Sun, Achille Fonzone, Ronghui Liu
      Headway fluctuations and “bus bunching” are well known phenomena on many bus routes where an initial delay to one service can disturb the whole schedule due to resulting differences in dwell times of subsequent buses at stops. This paper deals with the influence of a frequent but so far largely neglected characteristic of bus networks on bus bunching, that is the presence of overtaking and common lines. A set of discrete state equations is implemented to obtain the departure times of a group of buses following the occurrence of an exogenous delay to one bus at a bus stop. Two models are distinguished depending on whether overtaking at stops is possible or not. If two buses board simultaneously and overtaking is not possible, passengers will board the front bus. If overtaking is possible, passengers form equilibrium queues in order to minimise their waiting times. Conditions for equilibrium queues among passengers with different choice sets are formulated. With a case study we then illustrate that, if overtaking is not allowed, the presence of common lines worsens the service regularity along the corridor. Conversely, common lines have positive effects when overtaking is possible. We suggest hence that appropriate network design is important to reduce the negative effects of delay-prone lines on the overall network performance.

      PubDate: 2016-08-09T04:42:34Z
      DOI: 10.1016/j.trb.2016.07.005
      Issue No: Vol. 93 (2016)
  • Modeling the decoy effect with context-RUM Models: Diagrammatic analysis
           and empirical evidence from route choice SP and mode choice RP case
    • Authors: C. Angelo Guevara; Mitsuyoshi Fukushi
      Pages: 318 - 337
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): C. Angelo Guevara, Mitsuyoshi Fukushi
      Evidence outside transportation has suggested that the introduction of a decoy to the choice-set could increase the share of other alternatives. This evidence breaks the regularity assumption, which is at the root of the classical Random Utility Maximization (RUM) model with utilities that ignore the choice context. This article assesses the suitability of various context-RUM choice models that could overcome this limitation. For this we use a diagrammatic analysis, as well as Stated Preference (SP) and Revealed Preference (RP) transportation choice evidence. We begin confirming that the reported decoy outcomes cannot be replicated with the classical RUM models and that such a goal could be achieved instead using a set of five context-RUM models. We then show, for the first time, that the Asymmetrically Dominated (AD) and Compromise (CP) decoy effects were present in an SP route choice setting. We also show that, for a subset of individuals, the relative strength of the different decoy types was coherent with a Data Generation Process (DGP) defined by the Random Regret Minimization (RRM) or by the Regret by Aspects (RBA) parsimonious models. Then, we use cross-validation analysis where we found that RRM and RBA were superior to a classical Logit for all decoy types. Nevertheless, the ad-hoc Emergent Value (EV) model was consistently superior to all models suggesting that, although the parsimonious models may in theory replicate all decoy types, they seem to still make an incomplete representation of the DGP behind the overall decoy effect. We finally consider an RP mode choice experiment with which we detect, for the first time, an AD decoy effect in this choice setting. We also use this experiment to illustrate how to handle the decoy phenomena in a real context with various alternatives and variables. The article concludes summarizing the main contributions of this research and suggesting future lines of investigation for it.

      PubDate: 2016-08-14T19:54:20Z
      DOI: 10.1016/j.trb.2016.07.012
      Issue No: Vol. 93 (2016)
  • Empirical analysis and simulation of the concave growth pattern of traffic
    • Authors: Junfang Tian; Rui Jiang; Bin Jia; Ziyou Gao; Shoufeng Ma
      Pages: 338 - 354
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Junfang Tian, Rui Jiang, Bin Jia, Ziyou Gao, Shoufeng Ma
      This paper has investigated the growth pattern of traffic oscillations in the NGSIM vehicle trajectories data, via measuring the standard deviation of vehicle velocity involved in oscillations. We found that the standard deviation of the velocity increases in a concave way along vehicles in the oscillations. Moreover, all datasets collapse into a single concave curve, which indicates a universal evolution law of oscillations. A comparison with traffic experiment shows that the empirical and the experimental results are highly compatible and can be fitted by a single concave curve, which demonstrates that qualitatively the growth pattern of oscillations is not affected by type of bottleneck and lane changing behavior. We have shown theoretically that small disturbance with an angular frequency ω increases in a convex way in the initial stage in the traditional models presuming a unique relationship between speed and density, which obviously deviates from our findings. Simulations show that stochastic models in which the traffic state dynamically spans a 2D region in the speed-spacing plane can qualitatively or even quantitatively reproduce the concave growth pattern of traffic oscillations.

      PubDate: 2016-08-14T19:54:20Z
      DOI: 10.1016/j.trb.2016.08.001
      Issue No: Vol. 93 (2016)
  • Testing for regularity and stochastic transitivity using the structural
           parameter of nested logit
    • Authors: Richard Batley; Stephane Hess
      Pages: 355 - 376
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Richard Batley, Stephane Hess
      We introduce regularity and stochastic transitivity as necessary and well-behaved conditions respectively, for the consistency of discrete choice preferences with the Random Utility Model (RUM). For the specific case of a three-alternative nested logit (NL) model, we synthesise these conditions in the form of a simple two-part test, and reconcile this test with the conventional zero-one bounds on the structural (‘log sum’) parameter within this model, i.e. 0 < θ ≤ 1, where θ denotes the structural parameter. We show that, whilst regularity supports the lower bound of zero, moderate and strong stochastic transitivity may, for some preference orderings, give rise to a lower bound greater than zero, i.e. impose a constraint l ≤ θ, where l > 0. On the other hand, we show that neither regularity nor stochastic transitivity constrain the upper bound at one. Therefore, if the conventional zero-one bounds are imposed in model estimation, preferences which violate regularity and/or stochastic transitivity may either go undetected (if the ‘true’ structural parameter is less than zero) and/or be unknowingly admitted (if the ‘true’ lower bound is greater than zero), and preferences which comply with regularity and stochastic transitivity may be excluded (if the ‘true’ upper bound is greater than one). Against this background, we show that imposition of the zero-one bounds may compromise model fit, inferences of willingness-to-pay, and forecasts of choice behaviour. Finally, we show that where the ‘true’ structural parameter is negative (thereby violating RUM – at least when choosing the ‘best’ alternative), positive starting values for the structural parameter in estimation may prevent the exposure of regularity and stochastic transitivity failures.

      PubDate: 2016-08-14T19:54:20Z
      DOI: 10.1016/j.trb.2016.07.018
      Issue No: Vol. 93 (2016)
  • A multiphase optimal control method for multi-train control and scheduling
           on railway lines
    • Authors: Hongbo Ye; Ronghui Liu
      Pages: 377 - 393
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Hongbo Ye, Ronghui Liu
      We consider a combined train control and scheduling problem involving multiple trains in a railway line with a predetermined departure/arrival sequence of the trains at stations and meeting points along the line. The problem is formulated as a multiphase optimal control problem while incorporating complex train running conditions (including undulating track, variable speed restrictions, running resistances, speed-dependent maximum tractive/braking forces) and practical train operation constraints on departure/arrival/running/dwell times. Two case studies are conducted. The first case illustrates the control and scheduling problem of two trains in a small artificial network with three nodes, where one train follows and overtakes the other. The second case optimises the control and timetable of a single train in a subway line. The case studies demonstrate that the proposed framework can provide an effective approach in solving the combined train scheduling and control problem for reducing energy consumption in railway operations.

      PubDate: 2016-08-14T19:54:20Z
      DOI: 10.1016/j.trb.2016.08.002
      Issue No: Vol. 93 (2016)
  • A polynomial-time algorithm for sailing speed optimization with
           containership resource sharing
    • Authors: Shuaian Wang; Xinchang Wang
      Pages: 394 - 405
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Shuaian Wang, Xinchang Wang
      The sailing speed optimization problem aims to determine the optimal cruising speeds of ships by balancing the number of ships required on services, the fuel consumption, and the level of service provided for customers. The level of service can be incorporated into a sailing speed optimization model from the perspective of supply chain management or from the perspective of shipping lines. We design a polynomial-time algorithm workable to solve the two models based on bi-section search methods. The novelties of the algorithm include constructing a new parameter on which the bi-section search will be executed and deriving a near-optimal solution by taking advantage of the problem structure. We also provide theoretical results that guarantee the validity of the polynomial-time algorithm.

      PubDate: 2016-09-03T15:00:26Z
      DOI: 10.1016/j.trb.2016.08.003
      Issue No: Vol. 93 (2016)
  • New insights and improvements of using paired alternative segments for
           traffic assignment
    • Authors: Jun Xie; Chi Xie
      Pages: 406 - 424
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Jun Xie, Chi Xie
      The recent literature observes that the development of advanced algorithms for the traffic assignment problem (TAP) heavily relies on the proper use of some specific topological structures. This paper focuses on discussing a particular topological structure named paired alternative segment (PAS), which consists of two path segments sharing the same starting and ending nodes but no other common nodes. We first present two alternative conditions that establish an equivalency relationship between user equilibrium (UE) flows and PAS structures. Starting from the traffic assignment method by paired alternative segments (TAPAS), we then examine the utilization of PASs for TAP and explored some algorithmic and implementation issues, which leads to the birth of an improved TAPAS procedure (termed iTAPAS in this paper). Compared to the original TAPAS, iTAPAS enhances the algorithmic efficiency in two aspects: (1) a more effective PAS identification method is used; (2) each PAS is set as being associated with only one origin in the UE-finding process. Some analytical results based on the new PAS identification method are presented to justify the convergence and efficiency of iTAPAS. A simplified post-process procedure is also presented to achieve the proportionality for iTAPAS. Numerical results obtained from applying the new and original algorithms for several large networks reveal that iTAPAS is nearly two times faster than TAPAS in achieving highly precise link flow solutions while it is practically identical to TAPAS in finding stable path flow solutions that meet consistency and proportionality.

      PubDate: 2016-09-03T15:00:26Z
      DOI: 10.1016/j.trb.2016.08.009
      Issue No: Vol. 93 (2016)
  • Rescheduling a metro line in an over-crowded situation after disruptions
    • Authors: Yuan Gao; Leo Kroon; Marie Schmidt; Lixing Yang
      Pages: 425 - 449
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Yuan Gao, Leo Kroon, Marie Schmidt, Lixing Yang
      In the case of a metro disruption, the planned timetable cannot be operated and a large number of passengers are left stranded in the stations. When the disruption is over, some stations may be skipped in the recovery period, which speeds up the circulation of trains and makes the number of stranded passengers reduce faster. Considering an over-crowded and time-dependent passenger flow, this paper proposes an optimization model to reschedule a metro line. To achieve a balance between theoretical validity and computational convenience, the optimization model is decomposed, and an iterative algorithm is proposed to solve the model. Numerical experiments based on the Beijing Metro are carried out, the results of which verify the effectiveness and efficiency of our method.

      PubDate: 2016-09-03T15:00:26Z
      DOI: 10.1016/j.trb.2016.08.011
      Issue No: Vol. 93 (2016)
  • Dynamic collective routing using crowdsourcing data
    • Authors: Siyuan Liu; Qiang Qu
      Pages: 450 - 469
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Siyuan Liu, Qiang Qu
      With the development of information technology, crowdsourcing data from a crowd of cooperative vehicles and online social platforms have been becoming available. The crowdsourcing data, reflecting real-time context of road segments in transportation systems, enable vehicles to be routed adaptively in uncertain and dynamic traffic environments. We consider the problem of adaptively routing a fleet of cooperative vehicles within a road network. To tackle this problem, we first propose a Crowdsourcing Dynamic Congestion Model. The model is based on topic-aware Gaussian Process considering the crowdsourced data collected from social platforms and probing vehicle traces that can effectively characterize both the dynamics and the uncertainty of road conditions. Our model is efficient and thus facilitates real-time adaptive routing in the face of uncertainty. Using this congestion model, we develop efficient algorithms for non-myopic adaptive routing to minimize the collective travel time of all vehicles in the entire transportation system. A key property of our approach is the ability to efficiently reason about the long-term value of exploration, which enables collectively balancing the exploration/exploitation trade-off for entire fleets of vehicles. Our approach is validated by real-life traffic and geo-tagged social network data from two large cities. Our congestion model is shown to be effective in modeling dynamic congestion conditions. Our routing algorithms also generate significantly faster routes compared to standard baselines, and approximate optimal performance compared to an omniscient routing algorithm. We also present the results from a preliminary field study, which showcases the efficacy of our approach.

      PubDate: 2016-09-03T15:00:26Z
      DOI: 10.1016/j.trb.2016.08.005
      Issue No: Vol. 93 (2016)
  • Modeling the morning commute for urban networks with cruising-for-parking:
           An MFD approach
    • Authors: Wei Liu; Nikolas Geroliminis
      Pages: 470 - 494
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Wei Liu, Nikolas Geroliminis
      This study focuses on the morning commute problem with explicit consideration of cruising-for-parking, and its adverse impacts on traffic congestion. The cruising-for-parking is modeled through a dynamic aggregated traffic model for networks: the Macroscopic Fundamental Diagram (MFD). Firstly, we formulate the commuting equilibrium in a congested downtown network where travelers have to cruise for curbside parking spaces. The cruising-for-parking would yield longer trip distance and smaller network outflow, and thus can induce severe congestion and lengthen the morning peak. We then develop a dynamic model of pricing for the network to reduce total social cost, which includes cruising time cost, moving time cost (moving or in-transit time, which is the duration during which vehicles move close to the destination but do not cruise for parking yet), and schedule delay cost. We show that under specific assumptions, at the system optimum, the downtown network should be operating at the maximum production of its MFD. However, the cruising effect is not fully eliminated. We also show that the time-dependent toll to support the system optimum has a different shape than the classical fine toll in Vickrey's bottleneck model. In the end, analytical results are illustrated and verified with numerical experiments.

      PubDate: 2016-09-03T15:00:26Z
      DOI: 10.1016/j.trb.2016.08.004
      Issue No: Vol. 93 (2016)
  • Designing robust schedule coordination scheme for transit networks with
           safety control margins
    • Authors: Weitiao Wu; Ronghui Liu; Wenzhou Jin
      Pages: 495 - 519
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Weitiao Wu, Ronghui Liu, Wenzhou Jin
      We propose a robust schedule coordination scheme which combines timetable planning with a semi-flexible departure delayed control strategy in case of disruptions. The flexibility is provided by allowing holding for the late incoming bus within a safety control margin (SCM). In this way, the stochastic travel time is addressed by the integration of real-time control and slacks at the planning phase. The schedule coordination problem then jointly optimises the planning headways and slack times in the timetable subject to SCM. Analytical formulations of cost functions are derived for three types of operating modes: uncoordinated operation, departure punctual control and departure delayed control. The problem is formulated as a stochastic mixed integer programming model and solved by a branch-and-bound algorithm. Numerical results provide an insight into the interaction between SCM and slack times, and demonstrate that the proposed model leads to cost saving and higher efficiency when SCM is considered. Compared to the conventional operating modes, the proposed method also presents advantages in transfer reliability and robustness to delay and demand variation.

      PubDate: 2016-09-03T15:00:26Z
      DOI: 10.1016/j.trb.2016.07.009
      Issue No: Vol. 93 (2016)
  • Modeling flight delay propagation: A new analytical-econometric approach
    • Authors: Nabin Kafle; Bo Zou
      Pages: 520 - 542
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Nabin Kafle, Bo Zou
      Flight delay presents a widespread phenomenon in the air transportation system, costing billions of dollars every year. Some delay originating from an upstream flight spreads to downstream flights. This phenomenon is defined as delay propagation. To understand the delay propagation patterns and associated mitigation measures, this study proposes a novel analytical-econometric approach. Considering that airlines deliberately insert buffer into flight schedules and ground turnaround operations, an analytical model is developed to quantify propagated and newly formed delays that occur to each sequence of flights that an aircraft flies in a day, from three perspectives on the ways that delays are absorbed by the buffer. With delays computed from the analytical model, we further develop a joint discrete-continuous econometric model and use the Heckman's two-step procedure to reveal the effects of various influencing factors on the initiation and progression of propagated delays. Results from the econometric analysis provide estimates on how much propagated delay will be generated out of each minute of newly formed delay, for the US domestic aviation system as well as for individual major airports and airlines. The impacts of various factors on the initiation and progression of propagated delay are quantified. These results may help aviation system planners gain additional insights into flight delay propagation patterns and consequently prioritize resource allocation while improving system overall performance. Airlines can also be better informed to assign buffer to their flight schedules to mitigate delay propagation.

      PubDate: 2016-09-03T15:00:26Z
      DOI: 10.1016/j.trb.2016.08.012
      Issue No: Vol. 93 (2016)
  • On the equivalence between continuum and car-following models of traffic
    • Authors: Wen-Long Jin
      Pages: 543 - 559
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Wen-Long Jin
      Recently different formulations of the first-order Lighthill-Whitham-Richards (LWR) model have been identified in different coordinates and state variables. However, relationships between higher-order continuum and car-following traffic flow models are still not well understood. In this study, we first categorize traffic flow models according to their coordinates, state variables, and orders in the three-dimensional representation of traffic flow and propose a unified approach to convert higher-order car-following models into continuum models and vice versa. The conversion method consists of two steps: equivalent transformations between the secondary Eulerian (E-S) formulations and the primary Lagrangian (L-P) formulations, and approximations of L-P derivatives with anisotropic (upwind) finite differences. We use the method to derive continuum models from general second- and third-order car-following models and derive car-following models from second-order continuum models. Furthermore, we demonstrate that corresponding higher-order continuum and car-following models have the same fundamental diagrams, and that the string stability conditions for vehicle-continuous car-following models are the same as the linear stability conditions for the corresponding continuum models. A numerical example verifies the analytical results. In a sense, we establish a weak equivalence between continuum and car-following models, subject to errors introduced by the finite difference approximation. Such an equivalence relation can help us to pick out anisotropic solutions of higher-order models with non-concave fundamental diagrams.

      PubDate: 2016-09-03T15:00:26Z
      DOI: 10.1016/j.trb.2016.08.007
      Issue No: Vol. 93 (2016)
  • Cellular automaton model simulating spatiotemporal patterns, phase
           transitions and concave growth pattern of oscillations in traffic flow
    • Authors: Junfang Tian; Guangyu Li; Martin Treiber; Rui Jiang; Ning Jia; Shoufeng Ma
      Pages: 560 - 575
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Junfang Tian, Guangyu Li, Martin Treiber, Rui Jiang, Ning Jia, Shoufeng Ma
      This paper firstly shows that a recent model (Tian et al., Transpn. Res. B 71, 138–157, 2015) is not able to replicate well the concave growth pattern of traffic oscillations (i.e., the standard deviation of speed is a concave function of the vehicle number in the platoon) observed from car following experiments. We propose an improved model by introducing a safe speed and the logistic function for the randomization probability. Simulations show that the improved model can reproduce well the metastable state, the spatiotemporal patterns, and the phase transitions of traffic flow. Calibration and validation results show that the concave growth pattern of oscillations and the empirical detector data can be simulated with a quantitative agreement.

      PubDate: 2016-09-03T15:00:26Z
      DOI: 10.1016/j.trb.2016.08.008
      Issue No: Vol. 93 (2016)
  • Discrete choice models with q-product random utilities
    • Authors: Makoto Chikaraishi; Shoichiro Nakayama
      Pages: 576 - 595
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Makoto Chikaraishi, Shoichiro Nakayama
      While most existing closed-form discrete choice models can be regarded as special cases of McFadden's generalized extreme value model, recently, alternative frameworks of McFadden's generalized extreme value model, which maintain closed-form expressions, have been proposed; these include the weibit model, which uses the Weibull distribution for its random component. In this paper, we develop a generalized closed-form discrete choice model which include both logit and weibit models as special cases, by introducing the q-product random utility, in which the relationship between the systematic component and the random component can be either additive, multiplicative, or in-between, depending on the value of the parameter q. We show that, when imposing the Gumbel distribution on its error component (instead of assuming the additive case as the logit model), the parameter q depicts decision maker's risk attitude in the sense of the Arrow–Pratt measure of relative risk aversion, which would be a behavioral foundation of the model. We also show that the model can be straightforwardly extended to incorporate statistical dependence across alternatives. The performance of the proposed model is examined by using two case studies; one on travel-route choices and the other on transport-mode choices.

      PubDate: 2016-09-09T15:06:48Z
      DOI: 10.1016/j.trb.2016.08.013
      Issue No: Vol. 93 (2016)
  • Private parking slot sharing
    • Authors: Su Xiu Xu; Meng Cheng; Xiang T.R. Kong; Hai Yang; George Q. Huang
      Pages: 596 - 617
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Su Xiu Xu, Meng Cheng, Xiang T.R. Kong, Hai Yang, George Q. Huang
      This paper addresses the private parking slot sharing problem during regular working hours in a big city. Our results extend the existing market design theory so that money flow is allowed in the matching mechanisms. We consider two cases of money flow: (i) one agent who fails to exchange his parking slot can join the leasing mechanism as a lessor; and (ii) one agent who fails in parking slot exchange can always “transfer” (rent) his parking slots to the platform. Each agent is self-interested. We propose the (price-compatible) top trading cycles and deals (TTCD) mechanism for case (i) and the price-compatible top trading cycles and chains (PC-TTCC) mechanism for case (ii). Both mechanisms are effective in terms of the compatibility with money flow, agents’ welfare, and strategy-proofness. Our experimental results further show that the proposed mechanisms would result in remarkable social welfare, and (ex post) budget balance for the platform in a big city with large population. In some realistic settings, our proposed mechanisms can almost realize cost saving of 60% and make more than 50% of agents strictly better off. There is no private parking slot sharing in the benchmark case. Overall, this paper opens the door to the solutions of a host of price-compatible matching problems.

      PubDate: 2016-09-09T15:06:48Z
      DOI: 10.1016/j.trb.2016.08.017
      Issue No: Vol. 93 (2016)
  • Pavement systems reconstruction and resurfacing policies for minimization
           of life‐cycle costs under greenhouse gas emissions constraints
    • Authors: Jinwoo Lee; Samer Madanat; Darren Reger
      Pages: 618 - 630
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Jinwoo Lee, Samer Madanat, Darren Reger
      Pavement management systems, designed to minimize total lifecycle costs, will need to evolve to meet the needs of the future. Environmental concerns are likely to add an additional consideration for the state DOTs when allocating their financial resources. Transportation agencies will be concerned with determining maintenance, resurfacing and reconstruction policies for pavement segments in their systems while also addressing the environmental impact of these activities. In this paper, we propose an efficient solution to solve for pavement resurfacing and reconstruction policies that minimize societal (agency and user) costs under a Greenhouse Gas (GHG) emissions constraint. The main methodological contribution of this work relative to the state of the art is that we formulate the problem to include multi-dimensional pavement segment states and heterogeneous management activities. It allows for a more realistic representation of the majority of current pavements in the world. For example, the assumption that pavements are perpetual, i.e., do not need reconstruction during their lifetime, can be relaxed. A case study using California roads is performed; we find that, for that specific group of pavement segments, the optimal policies to minimize societal costs do not vary greatly from the policies that minimize GHG emissions. An agency can use these results to determine what GHG emission budgets are feasible for the highway system that it manages.

      PubDate: 2016-09-17T12:17:20Z
      DOI: 10.1016/j.trb.2016.08.016
      Issue No: Vol. 93 (2016)
  • A comparison of three idling options in long-haul truck scheduling
    • Authors: Çağrı Koç; Tolga Bektaş; Ola Jabali; Gilbert Laporte
      Pages: 631 - 647
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Çağrı Koç, Tolga Bektaş, Ola Jabali, Gilbert Laporte
      This paper studies the Truck Driver Scheduling Problem with Idling Options (TDSP-IO), an extension of the long-haul truck driver scheduling problem with a more comprehensive objective function that accounts for driving cost, fuel cost, and idling cost. The best-known idling option is the widespread practice of keeping the vehicle engine running while the vehicle is not moving, which primarily stems from the drivers’desire to keep their vehicle at an adequate comfort level during breaks. Here, we explore two additional cleaner idling options: resting at an Electrified Parking Space (EPS) or using an Auxiliary Power Unit (APU) while idling. We also account for the initial investments associated with the equipment required for the use of these technologies. We formulate a mathematical model for the TDSP-IO under these three idling options, and we perform extensive computational experiments on realistic benchmark instances. The paper sheds light on the trade-offs between various performance indicators and offers several managerial and policy insights. Our analyses quantify the advantages of using EPSs and APUs, and show that they yield both economical and environmental benefits.

      PubDate: 2016-09-17T12:17:20Z
      DOI: 10.1016/j.trb.2016.08.006
      Issue No: Vol. 93 (2016)
  • Joint design of parking capacities and fleet size for one-way
           station-based carsharing systems with road congestion constraints
    • Authors: Yang Liu
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Lu Hu, Yang Liu
      This paper formulates one-way station-based carsharing systems as a mixed queuing network model and proposes a profit-maximization model for the joint design of fleet size and station capacities. We explicitly model the road congestion by formulating each route as a queue where the travel time is an increasing function of the state. The booking process is also modeled in the rental station queue so that the efficiency loss caused by the reservation policy can be captured. The mixed queuing network falls into Baskett, Chandy, Muntz and Palacios (BCMP) networks with unique product-form equilibrium distribution. We derive the asymptotic behavior as the parking capacities and fleet size grows, and show that the performance of carsharing systems will be proportionally bounded by that of the bottleneck route. The exact mean value analysis (MVA) algorithm and the approximate Schweitzer-Bard mean value analysis (SB-MVA) algorithm are extended here to solve networks with different sizes. The numerical experiments reveal some interesting findings: (1) The higher customer service rate (the smaller pick-up time window) will generate the optimal design with lower parking capacities and lower fleet size; (2) Neglecting the efficiency loss due to reservation will lead to an overestimate of the profit and other system performances as well; and (3) Given different levels of congestion on the existing road network (the non-shared car traffic), the net revenue is maximized when the existing traffic congestion is moderate.

      PubDate: 2016-08-04T02:50:45Z
  • A method of integrating correlation structures for a generalized recursive
           route choice model
    • Authors: Tien Mai
      Abstract: Publication date: November 2016
      Source:Transportation Research Part B: Methodological, Volume 93, Part A
      Author(s): Tien Mai
      We propose a way to estimate a generalized recursive route choice model. The model generalizes other existing recursive models in the literature, i.e., (Fosgerau et al., 2013b; Mai et al., 2015c), while being more flexible since it allows the choice at each stage to be any member of the network multivariate extreme value (network MEV) model (Daly and Bierlaire, 2006). The estimation of the generalized model requires defining a contraction mapping and performing contraction iterations to solve the Bellman’s equation. Given the fact that the contraction mapping is defined based on the choice probability generating functions (CPGF) (Fosgerau et al., 2013b) generated by the network MEV models, and these CPGFs are complicated, the generalized model becomes difficult to estimate. We deal with this challenge by proposing a novel method where the network of correlation structures and the structure parameters given by the network MEV models are integrated into the transport network. The approach allows to simplify the contraction mapping and to make the estimation practical on real data. We apply the new method on real data by proposing a recursive cross-nested logit (RCNL) model, a member of the generalized model, where the choice model at each stage is a cross-nested logit. We report estimation results and a prediction study based on a real network. The results show that the RCNL model performs significantly better than the other recursive models in fit and prediction.

      PubDate: 2016-08-04T02:50:45Z
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
Home (Search)
Subjects A-Z
Publishers A-Z
Your IP address:
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2016