813 research outputs found

    Limited Stop Services Design Considering Variable Dwell Time and Operating Capacity Constraints

    Get PDF
    This article proposes an optimization model to set frequencies, vehicle capacities, required fleet and the stops serving each route along a transit corridor which minimize the total user and operating costs. The optimization problem is solved by applying the ?Black Hole? algorithm, which imitates the movement of stars (solutions), towards a black hole (Best solution). The main contributions of the model are based on incorporating variable dwell times depending on bus stop demand not only to the passenger perceived journey times but also to the bus cycle times and on considering capacity constraints in both vehicles and bus tops. This led to a more accurate and realistic operating times and user perceived journey times. The application of the model to two case studies and the sensitivity analysis carried out demonstrate that for low levels of demand, constant dwell times can be assumed but being these times different between the different stops of the corridor, considering their demand. However, with high level of demand the difference found in operating costs and travel times strongly recommend incorporating variable dwell times in the model in order to achieve a more realistic design of transit corridor strategies

    Optimized Skip-Stop Metro Line Operation Using Smart Card Data

    Get PDF

    Integrated Optimization of Bus Line Fare and Operational Strategies Using Elastic Demand

    Get PDF

    Designing robust schedule coordination scheme for transit networks with safety control margins

    Get PDF
    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

    Enhancing Capacity and Managing Demand to Increase Short-Term Throughput on the San Francisco-Oakland Bay Bridge

    Get PDF
    While there are many proposals for fixing congestion between San Francisco and Oakland in California by adding a new bridge or tube, these solutions will take decades to implement even though a solution is needed now. This thesis assesses sixteen different strategies for reducing congestion in the short-term in the four categories of improving transit, promoting carpooling, implementing intelligent transportation systems practices, and incentivizing alternatives to using the Bay Bridge. Top priorities include HOV improvements on the West Grand Avenue and Powell Street onramps, altering WestCAT Lynx and BART transit services, partnering with rideshare apps to increase transit station accessibility (last mile problem), partnering with vanpool/minibus apps, promoting carpooling and implementing a citizen report system for carpool violators, shifting corporate cultures away from requiring employees to drive and drive alone, and lastly, altering land-use planning practices. To reach this conclusion, an inventory of current proposals and relevant research was compiled. Ridership and capacity data for the various modes of transportation across the bay were assessed for shortfalls and opportunities. Through this research and its resultant conclusions, focus can be placed on the best strategies to pursue in the near-term, while the Bay Area waits on a second bridge or tube in the long-term

    Integrated Optimization of Bus Line Fare and Operational Strategies Using Elastic Demand

    Get PDF
    An optimization approach for designing a transit service system is proposed. Its objective would be the maximization of total social welfare, by providing a profitable fare structure and tailoring operational strategies to passenger demand. These operational strategies include full route operation (FRO), limited stop, short turn, and a mix of the latter two strategies. The demand function is formulated to reflect the attributes of these strategies, in-vehicle crowding, and fare effects on demand variation. The fare is either a flat fare or a differential fare structure; the latter is based on trip distance and achieved service levels. This proposed methodology is applied to a case study of Dalian, China. The optimal results indicate that an optimal combination of operational strategies integrated with a differential fare structure results in the highest potential for increasing total social welfare, if the value of parameter "mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1"""mml:mrow""mml:mi"ε"/mml:mi""/mml:mrow""/mml:math" related to additional service fee is low. When this value increases up to more than a threshold, strategies with a flat fare show greater benefits. If this value increases beyond yet another threshold, the use of skipped stop strategies is not recommended. Document type: Articl

    Content addressable memory project

    Get PDF
    A parameterized version of the tree processor was designed and tested (by simulation). The leaf processor design is 90 percent complete. We expect to complete and test a combination of tree and leaf cell designs in the next period. Work is proceeding on algorithms for the computer aided manufacturing (CAM), and once the design is complete we will begin simulating algorithms for large problems. The following topics are covered: (1) the practical implementation of content addressable memory; (2) design of a LEAF cell for the Rutgers CAM architecture; (3) a circuit design tool user's manual; and (4) design and analysis of efficient hierarchical interconnection networks

    Map-Based Driving Cycle Generation

    Get PDF
    corecore