Evaluation of an existing bus network using a transit network optimisation model: a case study of the Hiroshima City Bus network

This study evaluates an existing bus network from the perspectives of passengers, operators, and overall system efficiency using the output of a previously developed transportation network optimisation model. This model is formulated as a bi-level optimisation problem with a transit assignment model as the lower problem. The upper problem is also formulated as bi-level optimisation problem to minimise costs for both passengers and operators, making it possible to evaluate the effects of reducing operator cost against passenger cost. A case study based on demand data for Hiroshima City confirms that the current bus network is close to the Pareto front, if the total costs to both passengers and operators are adopted as objective functions. However, the sensitivity analysis with regard to the OD pattern fluctuation indicates that passenger and operator costs in the current network are not always close to the Pareto front. Finally, the results suggests that, regardless of OD pattern fluctuation, reducing operator costs will increase passenger cost and increase inequity in service levels among passengers.     

Technical characteristics and efficiency of urban bus companies: The case of Spain

The aim of the present study is twofold. First, to provide new information concerning the technical characteristics of urban bus companies on the basis of a sample of medium and large-size cities in Spain. Second, to analyze the degree of efficiency of those companies and to quantify the reasons for this efficiency. The results should be useful in evaluating possible changes in public policies relating to urban transport, specifically changes in the way the market is organized and in pricing.The analysis is carried out by estimating a cost function. The sample is made up of a panel data set consisting of observations of nine Spanish companies that operated during the period 1983–1995. The specified functional form is translogarithmic. The output unit of measure adopted is bus*kms run. The cost function includes the network length for each company, thus permitting evidence concerning economies of density and economies of scale.The use of panel data allows us to estimate the cost function, taking into account that each company is affected by the specific characteristics of each individual city, the different features of the network in question and by different levels of efficiency. The economies of scale have been calculated, taking into account that the features of the network and of the city – represented by their specific individual effect – will vary with the company's level of output.Finally, an analysis is made of the relative productive efficiency of the companies, as well as of the variables likely to influence that efficiency.     

The design of capacitated intermodal hub networks with different vehicle types

In this study, we allow using alternative transportation modes and different types of vehicles in the hub networks to be designed. The aim of the problem is to determine the locations and capacities of hubs, which transportation modes to serve at hubs, allocation of non-hub nodes to hubs, and the number of vehicles of each type to operate on the hub network to route the demand between origin-destination pairs with minimum total cost. Total cost includes fixed costs of establishing hubs with different capacities, purchasing and operational costs of vehicles, transportation costs, and material handling costs. A mixed-integer programming model is developed and a variable neighborhood search algorithm is proposed for the solution of this problem. The heuristic algorithm is tested on instances from the Turkish network and CAB data set. Extensive computational analyzes are conducted in order to observe the effects of changes in various problem parameters on the resulting hub networks.     

On some traffic equilibrium theory paradoxes

We consider the asymmetric equilibrium problem with fixed demands in a transportation network where the travel cost on each link may depend on the flow on this as well as other links of the network and we study how the travellers' cost is affected by changes in the travel demand or addition of new routes. Assuming that the travel cost functions are strongly monotone, we derive formulas which express, under certain conditions, how a change in travel demand associated with a particular origin-destination (O / D) pair will affect the travelers' cost for any O / D pair. We then use these formulas to show that an increase in the travel demand associated with a particular O / D pair (all other remaining fixed) always results in an increase in the travelers' cost on that O / D pair, however, the travelers' cost on other O / D pairs may decrease. We then derive formulas yielding, under certain conditions, the change in travelers' cost on every O / D pair induced by the addition of a new path. These can be used to determine, whether Braess' paradox occurs in the network. We then show that when a new path is added, the travelers' cost associated with the particular O / D pair joined by this path will decrease (hence Braess' paradox does not occur) if a test matrix is positive semidefinite.     

A new generalized travel cost based connectivity metric applied to Scandinavian airports

This article proposes a new, generalized travel cost based method to operationalize network accessibility provided by airports. The approach is novel as it integrates features of network topology with multiple quality aspects of scheduled air transport services into one metric. The method estimates generalized travel costs for the full set of feasible travel paths between an airport and all network destinations. Rooftop modeling accounts for schedule delay and isolates the most cost-efficient travel paths per O-D relation. Respecting the assumed arrival time preference of passengers and adjusting for destination importance, connectivity scores are derived. The method is then applied to explore changes in the global connectivity pattern of Scandinavian airports from 2004 to 2018. The results suggest distinct spatial differences throughout the network, but less pronounced in size than suggested by popularly applied connectivity measures. Findings also highlight the importance of the geographical location as a determinate of an airport’s connectivity.     

Disruption risk management in railroad networks: An optimization-based methodology and a case study

We propose an optimization-based methodology for recovery from random disruptions in service legs and train services in a railroad network. A network optimization model is solved for each service leg to evaluate a number of what-if scenarios. The solutions of these optimization problems are then used in a predictive model to identify the critical disruption factors and accordingly design a suitable mitigation strategy. A mitigation strategy, such as adding flexible or redundant capacity in the network, is an action that is deliberately taken by management in order to hedge against the cost and impact of disruption if it occurs. It is important that managers consider the trade-offs between the cost of mitigation strategy and the expected cost of disruption. The proposed methodology is applied to a case study built using the realistic infrastructure of a railroad network in the mid-west United States. The resulting analysis underscores the importance of accepting a slight increase in pre-disruption transportation costs, which in turn will enhance network resiliency by building dis-similar paths for train services, and by installing alternative links around critical service legs.     

Truck capacity analysis in a cross‐dock transportation network considering direct shipment

In a transportation network, decision making parameters may change and may cause the optimum value of objective function to vary in a specific range. Therefore, managers try to identify the effects of these changes by sensitive analysis to find appropriate solutions. In this paper, first, a model for cross‐dock transportation network considering direct shipment is presented, and then an algorithm based on branch and bound algorithm and dual price concept for sensitive analysis is developed. When managers encounter problems such as budget limit, they may decide to change the capacity of trucks as a procedure to reduce the transportation costs of the network. The algorithm provides a useful lower bound on the solutions of the problems and makes it easy for the managers to eliminate inappropriate options of truck capacities, which cannot lead to cost reduction. To verify the algorithm, an example will be given at the end of the paper. Copyright © 2013 John Wiley & Sons, Ltd.     

An analysis of instability in a departure time choice problem

This study performs a theoretical analysis of instability in a departure time choice problem. Stability of equilibrium is an important factor for reliability of travel time. If equilibrium is not stable, travel time changes over a period of days even if demand and network performance are stable. This study examines the stability of a dynamic user equilibrium problem by using the departure time choice problem. The mechanism of day‐to‐day changes in a traveller's behaviour is determined first, and then a function that indicates dissimilarity to equilibrium is defined. The day‐to‐day changes in the dissimilarity function are mathematically examined using approximations. A numerical test is also carried out to verify the result. Results of these analyses show that there can be a case where the system does not converge to equilibrium. It is also indicated that this instability should be caused by the non‐monotonicity of the schedule cost.     

Segment-based alteration for container liner shipping network design

Container liner shipping companies only partially alter their shipping networks to cope with the changing demand, rather than entirely redesign and change the network. In view of the practice, this paper proposes an optimal container liner shipping network alteration problem based on an interesting idea of segment, which is a sequence of legs from a head port to a tail port that are visited by the same type of ship more than once in the existing shipping network. In segment-based network alteration, the segments are intact and each port is visited by the same type of ship and from the same previous ports. As a result, the designed network needs minimum modification before implementation. A mixed-integer linear programming model with a polynomial number of variables is developed for the proposed segmented-based liner shipping network alternation problem. The developed model is applied to an Asia–Europe–Oceania liner shipping network with a total of 46 ports and 11 ship routes. Results demonstrate that the problem could be solved efficiently and the optimized network reduces the total cost of the initial network considerably.     

An actuary method for the estimation and comparison of urban bus transit cost of services

This paper presents a new cost allocation method developed for estimating the fully-allocated costs of the excess peak hour bus transit service provided by two public transit systems. The estimates were produced for the explicit purpose of carrying out a realistic comparison of these costs and the costs of the potential provision of the same service by private operators. The method utilizes the same service data for the analysis. The pragmatic estimation of the fully allocated costs of service by the public and private sectors enables a more accurate estimation of potential cost savings. Sensitivity analysis was also performed using the same costing procedure to determine the range of cost savings that are feasible in a competitive contract arrangement of private sector providers. The new method separates costs of the direct provision of service from other indirect costs and thus facilitates the identification of each cost item and its significance in comparative cost estimates.     

Assessing potential likelihood and impacts of landslides on transportation network vulnerability

As one of the devastating natural disasters, landslide may induce significant losses of properties and lives area-wide, and generate dramatic damages to transportation network infrastructure. Accessing the impacts of landslide-induced disruptions to roadway infrastructure can be extremely difficult due to the complexity of involved impact factors and uncertainties of vulnerability related events. In this study, a data-driven approach is developed to assess landslide-induced transportation roadway network vulnerability and accessibility. The vulnerability analysis is conducted by integrating a series of static and dynamic factors to reflect the landslide likelihood and the consequences of network accessibility disruptions. The analytical hierarchy process (AHP) model was developed to assess and map the landslide likelihood. A generic vulnerability index (VI) was calculated for each roadway link in the network to identify critical links. Spatial distributions of landslide likelihood, consequences of network disruptions, and network vulnerability degrees were fused and analyzed. The roadway network on Oahu Island in Hawaii is utilized to demonstrate the effectiveness of the proposed approach with all the geo-coded information for its network vulnerability analysis induced by area-wide landslides. Specifically, the study area was classified into five categories of landslide likelihood: very high, high, moderate, low, and stable. About 34% of the study area was assigned as the high or very high categories. The results of network vulnerability analyses highlighted the importance of three highway segments tunnel through the Ko‘olau Range from leeward to windward, connecting Honolulu to the windward coast including the Pali highway segment, Likelike highway segment, and Interstate H-3 highway segment. The proposed network vulnerability analysis method provides a new perspective to examine the vulnerability and accessibility of the roadway network impacted by landslides.     

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.     

Network design for personal rapid transit under transit-oriented development

This study addresses guideway network design for personal rapid transit (PRT) favoring transit-oriented development. The guideway network design problem seeks to minimize both the guideway construction cost and users’ travel time. In particular, a set of optional points, known as Steiner points, are introduced in the graph to reduce the guideway length. The model is formulated as a combined Steiner and assignment problem, and a Lagrangian relaxation based solution algorithm is developed to solve the optimal solution. Numerical studies are carried on a real-sized network, and illustrate that the proposed model and solution algorithm can solve the PRT guideway network design problem effectively.     

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.     

An applicatoin of an optimal traffic control during lane closure periods of a two‐lane road

On two‐lane roadways, when provision should be made for alternative one‐way movement (for construction or maintenance), the traffic characteristics differ from normal operation in which no lane is closed. The purpose of this study is to derive optimal strategies for controlling, by means of traffic signals, the one lane operation (in two‐way roadways). In this study, strategies to determine the optimal length of the closed one‐lane section during construction and maintenance work are established. This length minimizes the objective function representing the tradeoff between delay cost and operational cost. Using the length value obtained by the proposed model, plus a timing methodology, the overall cost of operating the closed highway section can be minimized. The sensitivity analysis of the optimal solution for the section length is examined with respect to the input variables. This analysis shows that for very low traffic flow values (less than 100 vph per direction), the solution is very sensitive to fuel price changes, while for greater flow values, the solution is insensitive to this change. Similar results are obtained for changes in the worker's wage which is part of both the operational and the delay cost. That is, the section's length is sensitive to wage changes at low traffic flow and insensitive otherwise. Based on the results presented in this study, it is possible to establish a guideline for the section's length determination. The control measure can emerge from a pair of traffic signals that can be installed at both ends of the closed highway segment. This traffic control system is also described in the study in terms of its components and operational features and advantages.     

Network design: selection and design of links and facility location

In this paper we introduce new network design problems. A network of potential links is given. Each link can be either constructed or not at a given cost. Also, each constructed link can be constructed either as a one-way or two-way link. The objective is to minimize the total construction and transportation costs. Two different transportation costs are considered: (i) traffic is generated between any pair of nodes and the transportation cost is the total cost for the users and (ii) demand for service is generated at each node and a facility is to be located on a node to satisfy the demand. The transportation cost in this case is the total cost for a round trip from the facility to each node and back. We will consider two options in regard to the links between nodes. They can either be two-way only, or mixed, with both two-way and one-way (in either direction) allowed. When these options are combined with the two objective functions, four basic problems are created. These problems are solved by a descent algorithm, simulated annealing, tabu search, and a genetic algorithm. Extensive computational results are presented.     

Integrating robust timetabling in line plan optimization for railway systems

We propose a heuristic algorithm to build a railway line plan from scratch that minimizes passenger travel time and operator cost and for which a feasible and robust timetable exists. A line planning module and a timetabling module work iteratively and interactively. The line planning module creates an initial line plan. The timetabling module evaluates the line plan and identifies a critical line based on minimum buffer times between train pairs. The line planning module proposes a new line plan in which the time length of the critical line is modified in order to provide more flexibility in the schedule. This flexibility is used during timetabling to improve the robustness of the railway system. The algorithm is validated on the DSB S-tog network of Copenhagen, which is a high frequency railway system, where overtakings are not allowed. This network has a rather simple structure, but is constrained by limited shunt capacity. While the operator and passenger cost remain close to those of the initially and (for these costs) optimally built line plan, the timetable corresponding to the finally developed robust line plan significantly improves the minimum buffer time, and thus the robustness, in eight out of ten studied cases.     

Development of realistic shortest path algorithm considering lane changes

Lane changes occur as many times as turning movements are needed while following a designated path. The cost of a route with many lane changes is likely to be more expensive than that with less lane changes, and unrealistic paths with impractical lane changes should be avoided for drivers' safety. In this regard, a new algorithm is developed in this study to find the realistic shortest path considering lane changing. The proposed algorithm is a modified link‐labeling Dijkstra algorithm considering the effective lane‐changing time that is a parametric function of the prevailing travel speed and traffic density. The parameters were estimated using microscopic traffic simulation data, and the numerical test demonstrated the performance of the proposed algorithm. It was found that the magnitude of the effect of the effective lane‐changing time on determining the realistic shortest path is nontrivial, and the proposed algorithm has capability to exclude links successfully where the required lane changes are practically impossible. Copyright © 2015 John Wiley & Sons, Ltd.     

Analysis of subway station capacity with the use of queueing theory

A new concept of subway station capacity (SSC) is defined according to the gathering and scattering process. A queuing network analytical model of station is created for calculating SSC, which is built by M/G/C/C state dependent queuing network and discrete time Markov chain (DTMC). Based on the definition and the analytical queuing network, a SSC optimization model is developed, whose objective function is to optimize SSC with a satisfactory rate of remaining passengers. Besides, a solution to the model is proposed integrating response surface methodology with iterative generalized expansion method (IGEM) and DTMC. A case study of Beijing Station in Beijing subway line 2 is implemented to verify the validity and practicability of the proposed methods by comparison with simulation model in different experiments. Finally, some sensitivity analysis results are provided to identify the nodes that have the greatest impact on SSC.     

New routes on old railways: increasing rail’s mode share within the constraints of the existing railway network

This paper describes an integrated methodology for identifying potential ‘quick wins’ for mode shift from road to passenger rail transport. Firstly, a procedure for analysing rail’s relative competitiveness in the market for passenger transport between large urban areas is developed and then applied to a UK case study. The purpose of such analysis is to allow the identification of flows where rail is currently relatively uncompetitive (in terms of journey time in particular) and to assess the reasons for this poor performance, so that the issues which suppress rail use may be addressed. In parallel, a framework, methodology and tool for the assessment of existing and potential capacity (trains, seats, TEUs, etc.) is developed for both passenger and freight traffic, to identify and address network constraints. An illustrative example of the use of these demand and capacity assessment tools is then presented, with the tools used to identify and evaluate flows where rail demand is suppressed by poor service quality and where spare capacity exists which would allow the passenger rail service to be improved without requiring significant investments in infrastructure. The effects of such improvements on demand are predicted, and the cost implications of operating such additional services are discussed. The analysis suggests that there may be significant potential for increasing rail’s mode share by providing additional inter-urban services where rail currently offers an inferior service.