Intermodal Transit System Coordination

In urban areas where transit demand is widely spread, passengers may be served by an intermodal transit system, consisting of a rail transit line (or a bus rapid transit route) and a number of feeder routes connecting at different transfer stations. In such a system, passengers may need one or more transfers to complete their journey. Therefore, scheduling vehicles operating in the system with special attention to reduce transfer time can contribute significantly to service quality improvements. Schedule synchronization may significantly reduce transfer delays at transfer stations where various routes interconnect. Since vehicle arrivals are stochastic, slack time allowances in vehicle schedules may be desirable to reduce the probability of missed connections. An objective total cost function, including supplier and user costs, is formulated for optimizing the coordination of a general intermodal transit network. A four-stage procedure is developed for determining the optimal coordination status among routes at every transfer station. Considering stochastic feeder vehicle arrivals at transfer stations, the slack times of coordinated routes are optimized, by balancing the savings from transfer delays and additional cost from slack delays and operating costs. The model thus developed is used to optimize the coordination of an intermodal transit network, while the impact of a range of factors on coordination (e.g., demand, standard deviation of vehicle arrival times, etc) is examined.     

Flexible feeder transit route design to enhance service accessibility in urban area

To improve the accessibility of transit system in urban areas, this paper presents a flexible feeder transit routing model that can serve irregular‐shaped networks. By integrating the cost efficiency of fixed‐route transit system and the flexibility of demand responsive transit system, the proposed model is capable of letting operating feeder busses temporarily deviate from their current route so as to serve the reported demand locations. With an objective of minimizing total bus travel time, a new operational mode is then proposed to allow busses to serve passengers on both street sides. In addition, when multiple feeder busses are operating in the target service area, the proposed model can provide an optimal plan to locate the nearest one to response to the demands. A three‐stage solution algorithm is also developed to yield meta‐optimal solutions to the problem in a reasonable amount of time by transforming the problem into a traveling salesman problem. Numerical studies have demonstrated the effectiveness of the proposed model as well as the heuristic solution approach. Copyright © 2015 John Wiley & Sons, Ltd.     

Network equilibrium for congested multi‐mode networks with elastic demand

This paper proposes an elastic demand network equilibrium model for networks with transit and walking modes. In Hong Kong, the multi‐mode transit system services over 90% of the total journeys and the demand on it is continuously increasing. Transit and walking modes are related to each other as transit passengers have to walk to and from transit stops. In this paper, the multi‐mode elastic‐demand network equilibrium problem is formulated as a variational inequality problem where the combined mode and route choices are modeled in a hierarchical logit structures and the total travel demand for each origin‐destination pair is explicitly given by an elastic demand function. In addition, the capacity constraint for transit vehicles and the effects of bi‐directional flows on walkways are considered in the proposed model. All these congestion effects are taken into account for modeling the travel choices. A solution algorithm is developed to solve the multi‐mode elastic‐demand network equilibrium model. It is based on a Block Gauss‐Seidel decomposition approach coupled with the method of successive averages. A numerical example is used to illustrate the application of the proposed model and solution algorithm.     

A methodology for choosing between fixed‐route and flex‐route policies for transit services

Flex‐route transit brings together the low cost operability of fixed‐route transit with the flexibility of demand responsive transit, and in recent years, it has become the most popular type of flexible transit service. In this paper, a methodology is proposed to help planners make better decisions regarding the choice between a conventional fixed‐route and a flex‐route policy for a specific transit system with a varying passenger demand. A service quality function is developed to measure the performance of transit systems, and analytical modeling and simulations are used to reproduce transit operation under the two policies. To be closer to reality, two criteria are proposed depending on the processing of rejected requests in the assessment of the service quality function for flex‐route services. In various scenarios, critical demand densities, which represent the switching points between the two competing policies, are derived in a real‐world transit service according to the two criteria. Copyright © 2014 John Wiley & Sons, Ltd.     

Optimizing fare and headway to facilitate timed transfer considering demand elasticity

Fare and service frequency significantly affect transit users’ willingness to ride, as well as the supplier's revenue and operating costs. To stimulate demand and increase productivity, it is desirable to reduce the transfer time from one route to another via efficient service coordination, such as timed transfer. Since demand varies both temporally and spatially, it may not be cost-effective to synchronize vehicle arrivals on all connecting routes at a terminal. In this paper, we develop a schedule coordination model to optimize fare and headway considering demand elasticity. The headway of each route is treated as an integer-multiple of a base common headway. A discounted (reduced) fare is applied as an incentive to encourage ridership and, thus, stimulate public transit usage. The objective of the proposed coordination model is used to maximize the total profit subject to the service constraint. A numerical example is given to demonstrate the applicability of the proposed model. The results show that the optimized fare and headway may be carefully applied to yield the maximum profit. The relationship between the decision variables and model parameters is explored in the sensitivity analysis.     

Joint optimization of a rail transit line and its feeder bus system

A model is developed for jointly optimizing the characteristics of a rail transit route and its associated feeder bus routes in an urban corridor. The corridor demand characteristics are specified with irregular discrete distributions which can realistically represent geographic variations. The total cost (supplier plus user cost) of the integrated bus and rail network is minimized with an efficient iterative method that successively substitutes variable values obtained through classical analytic optimization. The optimized variables include rail line length, rail station spacings, bus headways, bus stop spacings, and bus route spacing. Computer programs are designed for optimization and sensitivity analysis. The sensitivity of the transit service characteristics to various travel time and cost parameters is discussed. Numerical examples are presented for integrated transit systems in which the rail and bus schedules may be coordinated.     

Long-term planning for ring-radial urban rail transit networks

Extensive work exists on regular rail network planning. However, few studies exist on the planning and design of ring-radial rail transit systems. With more ring transit lines being planned and built in Asia, Europe and the America's, a detailed study on ring transit lines is timely. An analytical model to find the optimal number of radial lines in a city for any demand distribution is first introduced. Secondly, passenger route choice for different rail networks is analyzed, for a many-to-many Origin-Destination (OD) demand distribution, based on a total travel time cost per passenger basis. The routes considered are: (1) radial lines only; (2) ring line only or radial lines and ring line combined; or (3) direct access to a destination without using the rail system. Mathematica and Matlab are used to code the route choice model. A cost-benefit optimization model to identify the feasibility and optimality of a ring line is proposed. Unlike simulations and agent-based models, this model is shown to be easily transferable to many ring-radial transit networks. The City of Calgary is used as an example to illustrate the applicability of each model. The existing urban rail network and trip distribution are major influencing factors in judging the feasibility and optimal location of the ring line. This study shows the potential net benefit of introducing a ring line by assessing changes in passengers’ costs. The changes in passenger cost parameters, such as ride cost and access cost, are shown to greatly influence the feasibility of a ring line.     

Optimal stop spacing and headway of congested transit system considering realistic wait times

Abstract

This paper revisits the classical transit scheduling problem and investigates the relationship between stop spacing and headway, considering realistic wait time and operable transit capacity. Headway and stop spacing are important determinants for planning a transit system, which influence the service level as well as the cost of operation. A mathematical model is developed, and the objective function is user travel time which is minimized by the optimized stop spacing and headway, subject to the constraints of operable fleet size and route capacity. Optimal stop spacing and headway solutions are obtained in a numerical example. Sensitivity analysis is conducted, and the effect of model parameters on user travel time is explored.     

Dynamic green bike repositioning problem – A hybrid rolling horizon artificial bee colony algorithm approach

This paper introduces a new dynamic green bike repositioning problem (DGBRP) that simultaneously minimizes the total unmet demand of the bike-sharing system and the fuel and CO₂ emission cost of the repositioning vehicle over an operational period. The problem determines the route and the number of bikes loaded and unloaded at each visited node over a multi-period operational horizon during which the cycling demand at each node varies from time to time. To handle the dynamic nature of the problem, this study adopts a rolling horizon approach to break down the proposed problem into a set of stages, in which a static bike repositioning sub-problem is solved in each stage. An enhanced artificial bee colony (EABC) algorithm and a route truncation heuristic are jointly used to optimize the route design in each stage, and the loading and unloading heuristic is used to tackle the loading and unloading sub-problem along the route in a given stage. Numerical results show that the EABC algorithm outperforms Genetic Algorithm in solving the routing sub-problem. Computation experiments are performed to illustrate the effect of the stage duration on the two objective values, and the results show that longer stage duration leads to higher total unmet demand and total fuel and CO₂ emission cost. Numerical studies are also performed to illustrate the effects of the weight and the loading and unloading times on the two objective values and the tradeoff between the two objectives.     

Modeling a rail transit alignment considering different objectives

An optimization model for station locations for an on-ground rail transit line is developed using different objective functions of demand and cost as both influence the planning of a rail transit alignment. A microscopic analysis is performed to develop a rail transit alignment in a given corridor considering a many-to-one travel demand pattern. A variable demand case is considered as it replicates a realistic scenario for planning a rail transit line. A Genetic Algorithm (GA) based on a Geographical Information System (GIS) database is developed to optimize the station locations for a rail transit alignment. The first objective is to minimize the total system cost per person, which is a function of user cost, operator cost, and location cost. The second objective is to maximize the ridership or the service coverage of the rail transit alignment. The user cost per person is minimized separately as the third objective because the user cost is one of the most important decision-making factors for planning a transit system from the users’ perspective. A transit planner can make an informed decision between various alternatives based on the results obtained using different objective functions. The model is applied in a case study in the Washington, DC area. The optimal locations and sequence of stations obtained using the three objective functions are presented and a comparative study between the results obtained is shown in the paper. In future works we will develop a combinatorial optimization problem using the aforementioned objectives for the rail transit alignment planning and design problem.     

A simulation model of reliable schedule design for a fixed transit route

This paper describes a simulation model of schedule design for a fixed transit route adopting the holding control strategy. The model is capable of determining the locations of time points and the amount of slack time allocated to each time point by minimizing the total cost associated with the schedule. The optimization is carried out through a process, which combines a heuristic search, enumeration, and population ranking and selection techniques. Examples showing applications and potential savings of the proposed model are given. It is shown that the model can serve as a practical tool for designing reliable, economical as well as operational transit schedules.     

A fuzzy-stochastic optimization model for the intermodal fleet management problem of an international transportation company

ABSTRACT

In this paper, a fuzzy-stochastic optimization model is developed for an intermodal fleet management system of a large international transportation company. The proposed model integrates various strategic, tactical and operational level decisions simultaneously. Since real-life fleet planning problems may involve different types of uncertainty jointly such as randomness and fuzziness, a hybrid chance-constrained programming and fuzzy interactive resolution-based approach is employed. Therefore, stochastic import/export freight demand and fuzzy transit times, truck/trailer availabilities, the transport capacity of Ro-Ro vessels, bounds on block train services, etc. can also be taken into account concurrently. In addition to minimize overall transportation costs, optimization of total transit times and CO₂ emission values are also incorporated in order to provide sustainable fleet plans by maximizing customer satisfaction and environmental considerations. Computational results show that effective and efficient fleet plans can be produced by making use of the proposed optimization model.     

A structured flexible transit system for low demand areas

Public transit structure is traditionally designed to contain fixed bus routes and predetermined bus stations. This paper presents an alternative flexible-route transit system, in which each bus is allowed to travel across a predetermined area to serve passengers, while these bus service areas collectively form a hybrid “grand” structure that resembles hub-and-spoke and grid networks. We analyze the agency and user cost components of this proposed system in idealized square cities and seek the optimum network layout, service area of each bus, and bus headway, to minimize the total system cost. We compare the performance of the proposed transit system with those of comparable systems (e.g., fixed-route transit network and taxi service), and show how each system is advantageous under certain passenger demand levels. It is found out that under low-to-moderate demand levels, the proposed flexible-route system tends to have the lowest system cost.     

Containership scheduling with transit-time-sensitive container shipment demand

This paper examines the optimal containership schedule with transit-time-sensitive demand that is assumed to be a decreasing continuous function of transit time. A mixed-integer nonlinear non-convex optimization model is first formulated to maximize the total profit of a ship route. In view of the problem structure, a branch-and-bound based holistic solution method is developed. It is rigorously demonstrated that this solution method can obtain an ε-optimal solution in a finite number of iterations for general forms of transit-time-sensitive demand. Computational results based on a trans-Pacific liner ship route demonstrate the applicability and efficiency of the solution method.     

Optimal feeder bus routes on irregular street networks

The methodology presented here seeks to optimize bus routes feeding a major intermodal transit transfer station while considering intersection delays and realistic street networks. A model is developed for finding the optimal bus route location and its operating headway in a heterogeneous service area. The criterion for optimality is the minimum total cost, including supplier and user costs. Irregular and discrete demand distributions, which realistically represent geographic variations in demand, are considered in the proposed model. The optimal headway is derived analytically for an irregularly shaped service area without demand elasticity, with non‐uniformly distributed demand density, and with a many‐to‐one travel pattern. Computer programs are designed to analyze numerical examples, which show that the combinatory type routing problem can be globally optimized. The improved computational efficiency of the near‐optimal algorithm is demonstrated through numerical comparisons to an optimal solution obtained by the exhaustive search (ES) algorithm. The CPU time spent by each algorithm is also compared to demonstrate that the near‐optimal algorithm converges to an acceptable solution significantly faster than the ES algorithm.     

Optimal transit fare in a bimodal network under demand uncertainty and bounded rationality

This paper investigates the optimal transit fare in a simple bimodal transportation system that comprises public transport and private car. We consider two new factors: demand uncertainty and bounded rationality. With demand uncertainty, travelers are assumed to consider both the mean travel cost and travel cost variability in their mode choice decision. Under bounded rationality, travelers do not necessarily choose the travel mode of which perceived travel cost is absolutely lower than the one of the other mode. To determine the optimal transit fare, a bi‐level programming is proposed. The upper‐level objective function is to minimize the mean of total travel cost, whereas the lower‐level programming adopts the logit‐based model to describe users' mode choice behaviors. Then a heuristic algorithm based on a sensitivity analysis approach is designed to solve the bi‐level programming. Numerical examples are presented to illustrate the effect of demand uncertainty and bounded rationality on the modal share, optimal transit fare and system performance. Copyright © 2013 John Wiley & Sons, Ltd.     

Hierarchical network-based equilibrium model and algorithm for a mixed-traffic urban transport system

Abstract

Many equilibrium models and algorithms based on homogeneous motorized traffic have been devised to model urban transport systems in developed countries, but they are inadequate when it comes to represent mixed-traffic urban transport systems, including automobiles, transit, bicycles, and pedestrians, in developing countries such as China or India. In these cases, traffic flow on a road segment is an aggregated result of travellers' combined mode/route choices and corresponding interactions. Therefore, a special assignment model and algorithm are needed for modeling these distinct behaviors. In this article, the structure of a mixed-traffic urban transport system is analyzed and then expanded and represented using a hierarchical network model based on graph theory. Based on the analysis of travelers' combined mode/route choices, generalized travel cost functions and link impedance functions for different modes are formulated, where the interferences between different modes on the same road segments are taken into account. Due to the ‘asymmetric’ nature of these functions, a variational inequality model is proposed to represent the equilibrium assignment problem in a mixed-traffic urban transport system. The corresponding solution algorithm is also presented. Finally, a numerical example is provided to illustrate the practicality of the proposed model and algorithm.     

Stochastic dynamic switching in fixed and flexible transit services as market entry-exit real options

The first analytical stochastic and dynamic model for optimizing transit service switching is proposed for “smart transit” applications and for operating shared autonomous transit fleets. The model assumes a region that requires many-to-one last mile transit service either with fixed-route buses or flexible-route, on-demand buses. The demand density evolves continuously over time as an Ornstein-Uhlenbeck process. The optimal policy is determined by solving the switching problem as a market entry and exit real options model. Analysis using the model on a benchmark computational example illustrates the presence of a hysteresis effect, an indifference band that is sensitive to transportation system state and demand parameters, as well as the presence of switching thresholds that exhibit asymmetric sensitivities to transportation system conditions. The proposed policy is computationally compared in a 24-hour simulation to a “perfect information” set of decisions and a myopic policy that has been dominant in the flexible transit literature, with results that suggest the proposed policy can reduce by up to 72% of the excess cost in the myopic policy. Computational experiments of the “modular vehicle” policy demonstrate the existence of an option premium for having flexibility to switch between two vehicle sizes.     

Internalization of Transportation External Costs: Impact Analysis of Logistics Company Mode and Route Choices

Abstract

This study focuses on the mode and route choices of a logistics company in a situation involving intercity transportation with networks of surface roads, highways and a railway. A method of transportation network analysis is applied to construct a logistics company mode and route choice models with the objective of minimizing total distribution and external costs. This study also assumes that the fleet number and vehicle capacities are given. Freight distributed from a distribution center to given retailers or consumers via surface road/highway links or via intermodal transportation involving surface road/highway links and a railway. In terms of model construction, this study first explores the routing and sequence of the retailers and consumers served by each vehicle. Second, the study internalizes the external cost of air pollution into the total distribution cost, to analyze the influences of external cost burdens on a logistics company mode and route choices from a user charge perspective. Finally, the study designs a heuristic algorithm for solving the above models, and illuminates the modeling process using a numerical example.     

Reducing the cost of peak hour transit service through contracting out service

Transit service contracting has responded to fiscal and financial woes of public transit agencies as the most uniquely attractive cost‐saving strategy at present. Most transit service contracting, however, has been in the traditional provision of entire fixed route bus service or commuter express bus service, and exclusive demand responsive service for the general public or for special disadvantaged population groups such as the elderly and/or the handicapped. This paper presents a new module in transit service contracting whereby the public and private operators jointly provide the peak service on the same route and at the same time. While the public agency provides the base demand of the service, the private provider provides the excess demand, both following the same schedules and similar service arrangements. In this paper, proposed service arrangements, costing and contracting procedures are discussed. It is also reported that substantial cost savings ranging from 32 to 57% with an average savings of 48% can be achieved if the excess peak hour bus transit service on highly peaked routes in public transit agencies is contracted to competing private operator(s).