Line haul interstation spacing for low cost feeder modes

The choice behaviour of low cost travel (LCT) modes is very sensitive to travel distance. A line haul system designed on the basis of current planning practice of locating widely spaced stations to cater auto and bus feeder modes with the primary objective of gaining travel speed is hostile to non‐motorized and low cost feeder modes. With the revival of interest in promoting the use of walk'n ride and bike'n ride modes, there is a need to develop an appropriate tool to examine the effect of their specific characteristics in establishing the number and location of stations.

A generic normative behavioural hybrid model for locating the cost minimizing number and location of stations is developed for an LCT‐fed line haul system. The model considers the system with many to many two dimensional line haul demand density function in which the density varies in both x‐ and y‐directions. The feeder mode choice behaviour is incorporated in the model by integrating probability‐access/egress distance function with the objective function. Explicit functional relationships among the parameters of these feeder modes such as modal share as a function of access/egress distance with the parameters of line haul systems are developed. Dynamic programming is used to minimize the system cost. The generic model is shown to collapse into several simplified models capable of yielding approximate solutions for several well known special cases. It has been shown that location of stations is sensitive to the through load on board as well as users’ cost that defines the choice behaviour at large. Numerical examples are presented to demonstrate the applicability of the model.     

A case study on the coordination of last trains for the Beijing subway network

Passengers may make several transfers between different lines to reach their destinations in urban railway transit networks. Coordination of last trains in feeding lines and connecting lines at transfer stations is especially important because it is the last chance for many travellers to transfer. In this paper, a mathematical method is used to reveal the relationships between passenger transfer connection time (PTCT) and passenger transfer waiting time (PTWT). A last-train network transfer model (LNTM) is established to maximize passenger transfer connection headways (PTCH), which reflect last-train connections and transfer waiting time. Additionally, a genetic algorithm (GA) is developed based upon this LNTM model and used to test a numerical example to verify its effectiveness. Finally, the Beijing subway network is taken as a case study. The results of the numerical example show that the model improves five connections and reduces to zero the number of cases when a feeder train arrives within one headway’s time after the connecting train departed.     

Hybrid simulated annealing and genetic algorithm for optimizing arterial signal timings under oversaturated traffic conditions

The implementation of system‐wide signal optimization models requires efficient solution algorithms that can quickly generate optimal or near‐optimal signal timings. This paper presents a hybrid algorithm based on simulated annealing (SA) and a genetic algorithm (GA) for arterial signal timing optimization. A decoding scheme is proposed that exploits our prior expectations about efficient solutions, namely, that the optimal green time distribution should reflect the proportion of the critical lane volumes of each phase. An SA algorithm, a GA algorithm and a hybrid SA‐GA algorithm are developed here using the proposed decoding scheme. These algorithms can be adapted to a wide range of signal optimization models and are especially suitable for those optimizing phase sequences with oversaturated intersections. To comparatively evaluate the performance of the proposed algorithms, we apply them to a signal optimization model for oversaturated arterial intersections based on an enhanced cell transmission model. The numerical results indicate that the SA‐GA algorithm outperforms both SA and GA in terms of solution quality and convergence rate. Copyright © 2014 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.     

A quantum evolutionary algorithm for the second-best congestion pricing problem in urban traffic networks

This paper investigates the congestion pricing problem in urban traffic networks. A first-best strategy, a second-best strategy for toll leveling in closed cordons and a second-best strategy for determining both toll levels and toll points are considered. The problem is known to be a mixed integer programming model and formulated as a bi-level optimization problem, with an objective of maximizing the social welfare. A method is presented to solve the problem, based on a novel metaheuristic algorithm, namely quantum evolutionary algorithm (QEA). To verify the proposed method, the widely used genetic algorithm (GA) is also applied to solve the problem. The problem is solved for a medium-size urban traffic network and the results of the QEA are compared against the conventional GA. Computational results show that the QEA outperforms the GA in solution quality.     

A statistical model for estimating oxides of nitrogen emissions from light duty motor vehicles

Motor vehicle emission rate models for predicting oxides of nitrogen (NOx) emissions are insensitive to vehicle modes of operation such as cruise, acceleration, deceleration, and idle, because they are based on average trip speed. Research has shown that NOx emissions are sensitive to engine load; hence, load-based variables need to be included in emissions models. Ongoing studies attempting to incorporate these `modal' variables have experienced difficulties with: (1) incomplete and/or non-representative data sets of emissions test data vis-a-vis the modal operating profiles of the tested vehicles; (2) lack of information for predicting on-road operating parameters of vehicles; and (3) non-representative vehicles recruited for emissions tests.The objective of this research was to develop a statistical model for predicting NOx emissions from light-duty gasoline motor vehicles. The primary end use of this model is forecasting, rather than explanation of the factors that affect NOx emissions, which brings to bear different requirements from the statistical model. The three challenges noted above are addressed by: (1) analyzing a data set of more than 13 000 hot-stabilized laboratory treadmill tests on 19 driving cycles (specific speed versus time testing conditions), and 114 variables describing vehicle, engine and test cycle characteristics; (2) making the models compatible with empirical data on how vehicles are being operated in-use; and (3) developing statistical weights to account for the differences in model year distributions between the emissions testing database and the current national on-road fleets.The NOx emissions model is estimated using ordinary least-squares regression techniques, with transformed response variable and regression weights. Tree regression is employed as a tool for mining relationships among variables in the data, with particular focus on identifying useful interactions among discrete variables. Details of the model development process are presented, as well as results for the final model showing the predicted emissions algorithm for the current motor vehicle fleet in Atlanta, GA metropolitan region.     

Train scheduling simulation that minimises operational conflicts due to service constraints

This paper presents an attempt made to facilitate re‐scheduling of trains to minimize operational delays and accommodate uniform headways for off peak sub urban services subject to resource constraints such as locomotive availability, poor track conditions and stations without siding facilities. The paper describes the computer simulation model designed to optimize train schedules on single‐track rail lines. Using this simulation program it is possible to plan and optimize timetables for railway networks with train runs within short time periods for both single track and double track conditions. The paper describes the capabilities of presenting the results of the simulation runs. These include the time‐distance graph, the network with train movements, dialog boxes with information about selected trains. The programme is capable of changing the starting point, departure time, train destinations and adding or deleting a stop etc. from the user interface. Four objects of array variables are used in the simulation process to keep train and station data. Two object arrays are used for the train movements in up and down directions. The stations' data are stored in the other two object arrays. One of these arrays of stations contains all the stations of the line while the other one contains only the stations with siding facilities. A case study that covers a 61 km long single‐track line with 14 stations is presented to highlight the model capabilities.     

A two-stage stochastic optimization model for the transfer activity choice in metro networks

This research focuses on finding the best transfer schemes in metro networks. Using sample-based time-invariant link travel times to capture the uncertainty of a realistic network, a two-stage stochastic integer programming model with the minimized expected travel time and penalty value incurred by transfer activities is formulated. The first stage aims to find a sequence of potential transfer nodes (stations) that can compose a feasible path from origins to destinations in the transfer activity network, and the second stage provides the least time paths passing by the generated transfer stations in the first stage for evaluating the given transfer schemes and then outputs the best routing information. To solve our proposed model, an efficient hybrid algorithm, in which the label correcting algorithm is embedded into a branch and bound searching framework, is presented to find the optimal solutions of the considered problem. Finally, the numerical experiments are implemented in different scales of metro networks. The computational results demonstrate the effectiveness and performance of the proposed approaches even for the large-scale Beijing metro network.     

A model for the layout of bike stations in public bike‐sharing systems

The problem of designing a layout of bike stations for public bike‐sharing systems entails selecting a number of stations and then constructing them within a planning area having many bike traffic zones and candidate bike stations. In this paper, we proposed a mathematical model to formulate the layout of public bike stations with the objective of minimizing users' total travel time and investment budget constraints. The model can guarantee that the needs for picking up and dropping off bikes amidst all bike travel demands are satisfied. Using this model, the number and locations of bike stations and the number of bikes and parking lockers at each bike station can be simultaneously determined. A typical example solved by lingo solver is created to illustrate the proposed model. Copyright © 2015 John Wiley & Sons, Ltd.     

Designing an integrated distribution system for catering services for high-speed railways: A three-echelon location routing model with tight time windows and time deadlines

An emerging task in catering services for high-speed railways (CSHR) is to design a distribution system for the delivery of high-quality perishable food products to trains in need. This paper proposes a novel model for integrating location decision making with daily rail catering operations, which are affected by various aspects of rail planning, to meet time-sensitive passenger demands. A three-echelon location routing problem with time windows and time budget constraints (3E-LRPTWTBC) is thus proposed toward formulating this integrated distribution system design problem. This model attempts to determine the capacities/locations of distribution centers and to optimize the number of meals delivered to stations. The model also attempts to generate a schedule for refrigerated cars traveling from distribution centers to rail stations for train loading whereby meals can be catered to trains within tight time windows and sold before a specified time deadline. By relaxing the time-window constraints, a relaxation model that can be solved using an off-the-shelf mixed integer programming (MIP) solver is obtained to provide a lower bound on the 3E-LRPTWTBC. A hybrid cross entropy algorithm (HCEA) is proposed to solve the 3E-LRPTWTBC. A small-scale case study is implemented, which reveals a 9.3% gap between the solution obtained using the HCEA and that obtained using the relaxation model (RM). A comparative analysis of the HCEA and an exhaustive enumeration algorithm indicates that the HCEA shows good performance in terms of computation time. Finally, a case study considering 156 trains on the Beijing-Shanghai high-speed corridor and a large-scale case study considering 1130 trains on the Chinese railway network are addressed in a comprehensive study to demonstrate the applicability of the proposed models and algorithm.     

Stochastic dynamic itinerary interception refueling location problem with queue delay for electric taxi charging stations

A new facility location model and a solution algorithm are proposed that feature (1) itinerary-interception instead of flow-interception; (2) stochastic demand as dynamic service requests; and (3) queueing delay. These features are essential to analyze battery-powered electric shared-ride taxis operating in a connected, centralized dispatch manner. The model and solution method are based on a bi-level, simulation–optimization framework that combines an upper level multiple-server allocation model with queueing delay and a lower level dispatch simulation based on earlier work by Jung and Jayakrishnan. The solution algorithm is tested on a fleet of 600 shared-taxis in Seoul, Korea, spanning 603 km², a budget of 100 charging stations, and up to 22 candidate charging locations, against a benchmark “naïve” genetic algorithm that does not consider cyclic interactions between the taxi charging demand and the charger allocations with queue delay. Results show not only that the proposed model is capable of locating charging stations with stochastic dynamic itinerary-interception and queue delay, but that the bi-level solution method improves upon the benchmark algorithm in terms of realized queue delay, total time of operation of taxi service, and service request rejections. Furthermore, we show how much additional benefit in level of service is possible in the upper-bound scenario when the number of charging stations is unbounded.     

Optimal scheduling of public transport fleet at network level

This paper deals with the development of a strategic approach for optimizing the operation of public transport system that considers both user's objective and operator's objective. Passengers of public transport are assumed to seek a minimum wait time to conduct the trips, while on the other hand, operators are concerned with the efficient operation such as minimum fleet size. The average minimum wait time is to be achieved by creating an optimal despatching policy for each vehicle from the terminal. As for efficient operation the utilisation of vehicle should be maximised by having a minimum number of vehicles in operation. User's and operator's objectives are optimized within certain operational constraints such as vehicle capacity to maintain acceptable level of service. The i‐model is contructed in a bi‐level programming form in which the user's objective is minimized by dynamic programming and the operator's objective is minimized by various routing strategies. Furthermore, an algorithm and a contrived example are developed to solve and see the performance of the approach.     

Assessing carbon reduction effects toward the mode shift of green transportation system

Plans are underway to introduce green transportation systems at Taiwan's famous scenic spot, Sun Moon Lake, to reduce carbon emissions. Carbon reduction effects after changing the current lake tour modes are assessed using a nested logit model with a stated preference survey, which investigated tourists' choice preferences. The empirical results reveal that the modes of electric bus, electric vehicle sharing, and bike are clustered in the same competitive group. Travel cost, in‐vehicle travel time, and out‐vehicle travel time are found to be statistically significant with the expected negative effects. In particular, the attribute of carbon reduction is only significant for green tourists, who are willing to pay US$ 3.5/kg of carbon saved. The result indicates that more efficient carbon reduction is possible by restricting the usage of gasoline vehicles rather than improving the service levels of low‐carbon modes. Notably, the effect of parking charges on emission reduction is equal to the amount of carbon dioxide absorbed by 4511 trees per day. Copyright © 2016 John Wiley & Sons, Ltd.     

A practical model for transfer optimization in a transit network: Model formulations and solutions

This paper studies the transit network scheduling problem and aims to minimize the waiting time at transfer stations. First, the problem is formulated as a mixed integer programming model that gives the departure times of vehicles in lines so that passengers can transfer between lines at transfer stations with minimum waiting times. Then, the model is expanded to a second model by considering the extra stopping time of vehicles at transfer stations as a new variable set. By calculating the optimal values for these variables, transfers can be better performed. The sizes of the models, compared with the existing models, are small enough that the models can be solved for small- and medium-sized networks using regular MIP solvers, such as CPLEX. Moreover, a genetic algorithm approach is represented to more easily solve larger networks. A simple network is used to describe the models, and a medium-sized, real-life network is used to compare the proposed models with another existing model in the literature. The results demonstrate significant improvement. Finally, a large-scale, real-life network is used as a case study to evaluate the proposed models and the genetic algorithm approach.     

Vehicle reidentification and travel time measurement on congested freeways

The paper presents an algorithm for matching individual vehicles measured at a freeway detector with the vehicles’ corresponding measurements taken earlier at another detector located upstream. Although this algorithm is potentially compatible with many vehicle detector technologies, the paper illustrates the method using existing dual-loop detectors to measure vehicle lengths. This detector technology has seen widespread deployment for velocity measurement. Since the detectors were not developed to measure vehicle length, these measurements can include significant errors. To overcome this problem, the algorithm exploits drivers’ tendencies to retain their positions within dense platoons. The otherwise complicated task of vehicle reidentification is carried out by matching these platoons rather than individual vehicles. Of course once a vehicle has been matched across neighboring detector stations, the difference in its arrival time at each station defines the vehicle’s travel time on the intervening segment.Findings from an application of the algorithm over a 1/3 mile long segment are presented herein and they indicate that a sufficient number of vehicles can be matched for the purpose of traffic surveillance. As such, the algorithm extracts travel time data without requiring the deployment of new detector technologies. In addition to the immediate impacts on traffic monitoring, the work provides a means to quantify the potential benefits of emerging detector technologies that promise to extract more detailed information from individual vehicles.     

Impact analysis of cordon-based congestion pricing on mode-split for a bimodal transportation network

This paper investigates the impact of cordon-based congestion pricing scheme on the mode-split of a bimodal transportation network with auto and rail travel modes. For any given toll-charge pattern, its impact on the mode-split can be estimated by solving a combined mode-split and traffic-assignment problem. Using a binary logit model for the mode-split, the combined problem is converted into a traffic-assignment problem with elastic demand. Probit-based stochastic user equilibrium (SUE) principle is adopted for this traffic-assignment problem, and a continuously distributed value of time (VOT) is assumed to convert the toll charges and transit fares into time-units. This combined mode-split and traffic-assignment problem is then formulated as a fixed-point model, which can be solved by a convergent Cost Averaging method. The combined mode-split and traffic-assignment problem is then used to analyze a multimodal toll design problem for cordon-based congestion pricing scheme, with the aim of increasing the mode-share of public transport system to a targeted level. Taking the fixed-point model as a constraint, the multimodal toll design problem is thus formulated as a mathematical programming with equilibrium constraints (MPEC) model. A genetic algorithm (GA) is employed to solve this MPEC model, which is then numerical validated by a network example.     

A multiobjective planning model for intercity train seat allocation

This paper presents a multiobjective planning model for generating optimal train seat allocation plans on an intercity rail line serving passengers with many‐to‐many origin‐destination pairs. Two planning objectives of the model are to maximise the operator's total passenger revenue and to minimise the passenger's total discomfort level. For a given set of travel demand, train capacity, and train stop‐schedules, the model is solved by fuzzy mathematical programming to generate a best‐compromise train seat allocation plan. The plan determines how many reserved and non‐reserved seats are to be allocated at each origin station for all subsequent destination stations on each train run operated within a specified operating period. An empirical study on the to‐be‐built Taiwan's high‐speed rail system is conducted to demonstrate the effectiveness of the model. The model can be used for any setting of travel demand and stop‐schedules with various train seating capacities.     

A geometry-based algorithm to provide guidance for electric vehicle charging

Electric vehicles (EVs) have been regarded as effective options for solving the environmental and energy problems in the field of transportation. However, given the limited driving range and insufficient charging stations, searching and selecting charging stations is an important issue for EV drivers during trips. A smart charging service should be developed to help address the charging issue of EV drivers, and a practical algorithm for charging guidance is required to realise it. This study aims to design a geometry-based algorithm for charging guidance that can be effectively applied in the smart charging service. Geographic research findings and geometric approaches are applied to design the algorithm. The algorithm is practical because it is based on the information from drivers’ charging requests, and its total number of calculations is significantly less than that of the conventional shortest-first algorithm. The algorithm is effective because it considers the consistency of direction trend between the charging route and the destination in addition to the travel distance, which conforms to the travel demands of EV drivers. Moreover, simulation examples are presented to demonstrate the proposed algorithm. Results of the proposed algorithm are compared with those of the other two algorithms, which show that the proposed algorithm can obtain a better selection of charging stations for EV drivers from the perspective of entire travel chains and take a shorter computational time.     

An efficient iterative link transmission model

In this paper a novel iterative algorithm is presented for the link transmission model, a fast macroscopic dynamic network loading scheme. The algorithm's solutions are defined on a space–time discretized grid. Unlike previous numerical schemes there is no hard upper limit on the time step size for the algorithm to be numerically stable, leaving only the trade-off between accuracy and interpolation errors. This is a major benefit because mandatory small time steps in existing algorithm (required for numerical tractability) are undesirable in most strategic analyses. They lead to highly increased memory costs on larger network instances and unnecessary complex behaviour. In practice results are often aggregated for storage or analysis, which leads to the loss of computationally expensive detailed information and to the introduction of inconsistencies. The novel iterative scheme is consistent with the modelling assumptions independent of the numerical time step. A second contribution of the iterative procedure is the smart handling of repeated runs, which can be initialized (or warm started) by an earlier solution. For applications, repeatedly loading a network is often needed when evaluating traffic states under changing variables or adjusted parameter settings, or in optimization and equilibration procedures. In these cases the iterative algorithm is initialized with the solution of a previous run and iterations are performed to find a new consistent solution. Pseudo-code is provided for both a basic upwind iterative scheme and an extended algorithm that significantly accelerates convergence. The most important computational gains are achieved by ordering and reducing calculations to that part of the network which has changed (most). The properties of the algorithm are demonstrated on a theoretical network as well as on some real-world networks.     

A range-restricted recharging station coverage model for drone delivery service planning

Unmanned Aerial Vehicles (UAVs) are attracting significant interest for delivery service of small packages in urban areas. The limited flight range of electric drones powered by batteries or fuel cells requires refueling or recharging stations for extending coverage to a wider area. To develop such service, optimization methods are needed for designing a network of station locations and delivery routes. Unlike ground-transportation modes, however, UAVs do not follow a fixed network but rather can fly directly through continuous space. But, paths must avoid barriers and other obstacles. In this paper, we propose a new location model to support spatially configuring a system of recharging stations for commercial drone delivery service, drawing on literature from planar-space routing, range-restricted flow-refueling location, and maximal coverage location. We present a mixed-integer programming formulation and an efficient heuristic algorithm, along with results for a large case study of Phoenix, AZ to demonstrate the effectiveness and efficiency of the model.