Skip to main content

9 Result(s)

within Yu (Marco) Nie Remove this filter

and

  1. No Access

    Article

    A Credit-Based Congestion Management Scheme in General Two-Mode Networks with Multiclass Users

    This paper examines the design of the credit-based congestion management schemes that achieve Pareto-improving outcome in general two-mode networks. It is assumed that transit is a slower but cheaper alternati...

    Yang Liu, Yu (Marco) Nie in Networks and Spatial Economics (2017)

  2. No Access

    Article

    A path-based greedy algorithm for multi-objective transit routes design with elastic demand

    This paper is concerned with the problem of finding optimal sub-routes from a set of predefined candidate transit routes with the objectives of maximizing transit ridership as well as minimizing operational co...

    Amirali Zarrinmehr, Mahmoud Saffarzadeh, Seyedehsan Seyedabrishami… in Public Transport (2016)

  3. No Access

    Article

    Finding Efficient and Environmentally Friendly Paths for Risk-Averse Freight Carriers

    This paper aims to incorporate two important measures into a freight shortest path problem, namely reliability and sustainability. Reliability measure deals with the uncertainty of link travel time while susta...

    Qianfei Li, Yu (Marco) Nie, Suriya Vallamsundar, Jane Lin… in Networks and Spatial Economics (2016)

  4. No Access

    Article

    A New Tradable Credit Scheme for the Morning Commute Problem

    This paper seeks to apply a new tradable credit scheme in the morning commute problem. When implementing such a scheme, the congestion management authority first delineates a peak-time window and then requires...

    Yu (Marco) Nie in Networks and Spatial Economics (2015)

  5. No Access

    Chapter

    Solving the Integrated Corridor Control Problem Using Simultaneous Perturbation Stochastic Approximation

    Integrating various control measures within a transportation corridor promises to improve the overall operational performance of the entire corridor. In this study, we formulate a corridor traffic control prob...

    **gtao Ma, Yu (Marco) Nie, H. Michael Zhang in Advances in Dynamic Network Modeling in Co… (2013)

  6. No Access

    Article

    Optimal Path Problems with Second-Order Stochastic Dominance Constraints

    This paper studies optimal path problems integrated with the concept of second order stochastic dominance. These problems arise from applications where travelers are concerned with the trade off between the ri...

    Yu (Marco) Nie, **ng Wu, Tito Homem-de-Mello in Networks and Spatial Economics (2012)

  7. No Access

    Article

    Solving the Dynamic User Optimal Assignment Problem Considering Queue Spillback

    This paper studies the dynamic user optimal (DUO) traffic assignment problem considering simultaneous route and departure time choice. The DUO problem is formulated as a discrete variational inequality (DVI), ...

    Yu (Marco) Nie, H. M. Zhang in Networks and Spatial Economics (2010)

  8. No Access

    Article

    A Relaxation Approach for Estimating Origin–Destination Trip Tables

    The problem of estimating origin-destination travel demands from partial observations of traffic conditions has often been formulated as a network design problem (NDP) with a bi-level structure. The upper leve...

    Yu Marco Nie, H. M. Zhang in Networks and Spatial Economics (2010)

  9. No Access

    Chapter

    Reliable a Priori Shortest Path Problem with Limited Spatial and Temporal Dependencies

    This paper studies the problem of finding most reliable a priori shortest paths (RASP) in a stochastic and time-dependent network. Correlations are modeled by assuming the probability density functions of link...

    Yu Marco Nie, **ng Wu in Transportation and Traffic Theory 2009: Golden Jubilee (2009)