A reliability‐based network design problem

This paper presents a reliability‐based network design problem. A network reliability concept is embedded into the continuous network design problem in which travelers' route choice behavior follows the stochastic user equilibrium assumption. A new capacity‐reliability index is introduced to measure the probability that all of the network links are operated below their capacities when serving different traffic patterns deviating from the average condition. The reliability‐based network design problem is formulated as a bi‐level program in which the lower level sub‐program is the probit‐based stochastic user equilibrium problem and the upper level sub‐program is the maximization of the new capacity reliability index. The lower level sub‐program is solved by a variant of the method of successive averages using the exponential average to represent the learning process of network users on a daily basis that results in the daily variation of traffic‐flow pattern, and Monte Carlo stochastic loading. The upper level sub‐program is tackled by means of genetic algorithms. A numerical example is used to demonstrate the concept of the proposed framework.     

Forecasting bunker prices; A nonstationary,multivariate methodology

This paper suggests a methodological approach for the forecasting of marine fuel prices. The prediction of the bunker prices is of outmost importance for operators, as bunker prices affect heavily the economic planning and financial viability of ventures and determine decisions related to compliance with regulations. A multivariate nonstationary stochastic model available in the literature is being retrieved, after appropriate adjustment and testing. The model belongs to the class of periodically correlated stochastic processes with annual periodic components. The time series are appropriately transformed to become Gaussian, and then are decomposed to deterministic seasonal characteristics (mean value and standard deviation) and a residual time series. The residual part is proved to be stationary and then is modeled as a Vector AutoRegressive Mooving Average (VARMA) process. Finally, using the methodology presented, forecasts of a tetra-variate and an octa-variate time series of bunker prices are produced and are in good agreement with actual values. The obtained results encourages further research and deeper investigation of the driving characters of the multivariate time series of bunker prices.     

A multi‐class mean‐excess traffic equilibrium model with elastic demand

Recent empirical studies have revealed that travel time variability plays an important role in travelers' route choice decisions. To simultaneously account for both reliability and unreliability aspects of travel time variability, the concept of mean‐excess travel time (METT) was recently proposed as a new risk‐averse route choice criterion. In this paper, we extend the mean‐excess traffic equilibrium model to include heterogeneous risk‐aversion attitudes and elastic demand. Specifically, this model explicitly considers (1) multiple user classes with different risk‐aversions toward travel time variability when making route choice decisions under uncertainty and (2) the elasticity of travel demand as a function of METT when making travel choice decisions under uncertainty. This model is thus capable of modeling travelers' heterogeneous risk‐averse behaviors with both travel choice and route choice considerations. The proposed model is formulated as a variational inequality problem and solved via a route‐based algorithm using the modified alternating direction method. Numerical analyses are also provided to illustrate the features of the proposed model and the applicability of the solution algorithm. Copyright © 2012 John Wiley & Sons, Ltd.     

A revised branch‐and‐price algorithm for dial‐a‐ride problems with the consideration of time‐dependent travel cost

Developing demand responsive transit systems are important with regard to meeting the travel needs for elderly people. Although Dial‐a‐ride Problems (DARP) have been discussed for several decades, most researchers have worked to develop algorithms with low computational cost under the minimal total travel costs, and fewer studies have considered how changes in travel time might affect the vehicle routes and service sequences. Ignoring such variations in travel time when design vehicle routes and schedules might lead to the production of inefficient vehicle routes, as well as incorrect actual vehicle arrival times at the related nodes. The purpose of this paper is to construct a DARP formulation with consideration of time‐dependent travel times and utilizes the traffic simulation software, DynaTAIWAN, to simulate the real traffic conditions in order to obtain the time‐dependent travel time matrices. The branch‐and‐price approach is introduced for the time‐dependent DARP and tested by examining the sub‐network of Kaohsiung City, Taiwan. The numerical results reveal that the length of the time window can significantly affect the vehicle routes and quantitative measurements. As the length of the time window increases, the objective value and the number of vehicles will reduce significantly. However, the CPU time, the average pickup delay time, the average delivery delay time and the average actual ride time (ART)/direct ride time (DRT) will increase significantly as the length of the time window increases. Designing the vehicle routes to reduce operating costs and satisfy the requirements of customers is a difficult task, and a trade‐off must be made between these goals. Copyright © 2014 John Wiley & Sons, Ltd.     

A model‐based demand‐balancing control for dynamically divided multiple urban subnetworks

Traffic control is an effective and efficient method for the problem of traffic congestion. It is necessary to design a high‐level controller to regulate the network traffic demands, because traffic congestion is not only caused by the improper management of the traffic network but also to a great extent caused by excessive network traffic demands. Therefore, we design a demand‐balance model predictive controller based on the macroscopic fundamental diagram‐based multi‐subnetwork model, which can optimize the network traffic mobility and the network traffic throughput by regulating the input traffic flows of the subnetworks. Because the transferring traffic flows among subnetworks are indirectly controlled and coordinated by the demand‐balance model predictive controller, the subnetwork division can variate dynamically according to real traffic states, and a global optimality can be achieved for the entire traffic network. The simulation results show the effectiveness of the proposed controller in improving the network traffic throughput. Copyright © 2016 John Wiley & Sons, Ltd.     

A genetic algorithm‐optimized fuzzy logic controller to avoid rear‐end collisions

In this paper, a rear‐end collision control model is proposed using the fuzzy logic control scheme. Through detailed analysis of car‐following cases, our fuzzy control system is established with reasonable control rules. Furthermore, a genetic algorithm is introduced into the fuzzy rules refining process to reduce the computational complexity while maintaining accuracy. Numerical results indicate that our genetic algorithm‐optimized fuzzy logic controller outperforms the traditional fuzzy logic controller in terms of better safety guarantee and higher traffic efficiency. Copyright © 2016 John Wiley & Sons, Ltd.     

A multiple correspondence analysis of at‐fault motorcycle‐involved crashes in Alabama

According to the U.S. National Highway Traffic Safety Administration, in 2012, more than 4950 motorcyclists were killed in traffic accidents. Compared to passenger car occupants, mile for mile, motorcyclists are more than 26 times more at risk to dying in crashes. Due to the high fatality rate associated with motorcycle crashes, factors contributing to this type of crash must be identified in order to implement effective safety countermeasures. Given that the available datasets are large and complex, identifying the key factors contributing to crashes is a challenging task. Using multiple correspondence analysis, as an exploratory data analysis technique to determine the dataset structure, we identified the roadway/environmental, motorcycle, and motorcyclist‐related variables influencing at‐fault motorcycle‐involved crashes. This study used the latest available dataset (2009 to 2013) from the Critical Analysis Reporting Environment database to study motorcycle crashes in the state of Alabama. The most significant contributors to the frequency and severity of at‐fault motorcycle‐involved crashes were found to be light conditions, time of day, driver condition, and weather conditions. Copyright © 2017 John Wiley & Sons, Ltd.     

A fuzzy logic‐based variable speed limit controller

Variable speed limit (VSL) is an emerging intelligent transportation system (ITS) measure to improve operational and safety performance of motorway systems. Rule‐based algorithms have been widely used in VSL applications because of their comprehensibility and ease of application. However, most of the algorithms proposed in the literature under this category are rather rough for the speed control. Pre‐specified rules show some difficulties in appropriately activating/deactivating control actions in real time because of non‐stationary and nonlinear nature of the traffic system. This paper proposes a fuzzy logic‐based VSL control algorithm as an alternative to the existing VSL control algorithms. The proposed algorithm uses fuzzy sets instead of crisp sets to allow the separation of attribute domains into several overlapping intervals. The discretization using fuzzy sets can help to overcome the sensitivity problem caused by crisp discretization used in the existing VSL algorithms. The proposed algorithm is assessed for a test bed in Auckland using AIMSUN micro‐simulator and verified against a well‐known VSL algorithm. The simulation results show that the proposed algorithm outperforms the existing one to improve the efficiency performance of the motorway system with the critical bottleneck capacity increased by 6.42% and total travel time reduced by 12.39% when compared to a no‐control scenario. Copyright © 2015 John Wiley & Sons, Ltd.     

A Pareto‐improving hybrid policy for transportation networks

This paper investigates an innovative Pareto‐improving hybrid policy that combines two policy instruments, that is, congestion pricing and road space rationing, and takes advantage of the synergistic effects between these instruments. Mathematical formulations for developing Pareto‐improving pure road space rationing schemes and hybrid policies are presented. Numerical examples demonstrate that the proposed hybrid policy offers greater flexibility and is more prominent in leading to Pareto improvement than both pure congestion pricing and road space rationing schemes. Copyright © 2013 John Wiley & Sons, Ltd.     

A bi‐level programming approach — Optimal transit fare under line capacity constraints

The fare of a transit line is one of the important decision variables for transit network design. It has been advocated as an efficient means of coordinating the transit passenger flows and of alleviating congestion in the transit network. This paper shows how transit fare can be optimized so as to balance the passenger flow on the transit network and to reduce the overload delays of passengers at transit stops. A bi‐level programming method is developed to optimize the transit fare under line capacity constraints. The upper‐level problem seeks to minimize the total network travel time, while the lower‐level problem is a stochastic user equilibrium transit assignment model with line capacity constraints. A heuristic solution algorithm based on sensitivity analysis is proposed. Numerical example is used to illustrate the application of the proposed model and solution algorithm.     

A Cooperative Intelligent Transport Systems (C‐ITS)‐based lane‐changing advisory for weaving sections

Weaving sections, a common design of motorways, require extensive lane‐change manoeuvres. Numerous studies have found that drivers tend to make their lane changes as soon as they enter the weaving section, as the traffic volume increases. Congestion builds up as a result of this high lane‐changing concentration. Importantly, such congestion also limits the use of existing infrastructure, the weaving section downstream. This behaviour thus affects both safety and operational aspects. The potential tool for managing motorways effectively and efficiently is cooperative intelligent transport systems (C‐ITS). This research investigates a lane‐change distribution advisory application based on C‐ITS for weaving vehicles in weaving sections. The objective of this research is to alleviate the lane‐changing concentration problem by coordinating weaving vehicles to ensure that such lane‐changing activities are evenly distributed over the existing weaving length. This is achieved by sending individual messages to drivers based on their location to advise them when to start their lane change. The research applied a microscopic simulation in aimsun to evaluate the proposed strategy's effectiveness in a one‐sided ramp weave. The proposed strategy was evaluated using different weaving advisory proportions, traffic demands and penetration rates. The evaluation revealed that the proposed lane‐changing advisory has the potential to significantly improve delay. Copyright © 2016 John Wiley & Sons, Ltd.     

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.     

A reliability‐based traffic assignment model for multi‐modal transport network under demand uncertainty

In densely populated and congested urban areas, the travel times in congested multi‐modal transport networks are generally varied and stochastic in practice. These stochastic travel times may be raised from day‐to‐day demand fluctuations and would affect travelers' route and mode choice behaviors according to their different expectations of on‐time arrival. In view of these, this paper presents a reliability‐based user equilibrium traffic assignment model for congested multi‐modal transport networks under demand uncertainty. The stochastic bus frequency due to the unstable travel time of bus route is explicitly considered. By the proposed model, travelers' route and mode choice behaviors are intensively explored. In addition, a stochastic state‐augmented multi‐modal transport network is adopted in this paper to effectively model probable transfers and non‐linear fare structures. A numerical example is given to illustrate the merits of the proposed model. Copyright © 2012 John Wiley & Sons, Ltd.     

A schedule‐based dynamic transit network model — Recent advances and prospective future research

Using the schedule‐based approach, in which scheduled timetables are used to describe the movement of vehicles, a dynamic transit assignment model is formulated. Passengers are assumed to travel on a path with minimum generalized cost that consists of four components: in‐vehicle time; waiting time; walking time; and a time penalty for each line change. A specially developed branch and bound algorithm is used to generate the time‐dependent minimum path. The assignment procedure is conducted over a period in which both passenger demand and train headway are varying. This paper presents an overview of the research that has been carried out by the authors to develop the schedule‐based transit assignment model, and offers perspectives for future research.     

Rewarding rush-hour avoidance: A study of commuters’ travel behavior

Spitsmijden, peak avoidance in Dutch, is the largest systematic effort to date to study, in the field, the potential of rewards as a policy mean for changing commuter behavior. A 13 week field study was organized in The Netherlands with the purpose of longitudinally investigating the impacts of rewards on commuter behavior. Different levels and types of rewards were applied and behavior was tracked with state-of-the art detection equipment. Based on the collected data, which included also pre and post-test measurements, a mixed discrete choice model was estimated. The results suggest that rewards can be effective tools in changing commuting behavior. Specifically rewards reduce the shares of rush-hour driving, shift driving to off-peak times and increase the shares of public transport, cycling and working from home. Mediating factors include socio-demographic characteristics, scheduling constraints and work time flexibility, habitual behavior, attitudes to commuting alternatives, the availability of travel information and even the weather. The success of this study has encouraged adoption of rewards, as additional policy tools, to alleviate congestion, especially during temporary road closures.     

A GIS‐based method to identify cost‐effective routes for rural deviated fixed route transit

Deviated fixed route transit (DFRT) service connecting rural and urban areas is a growing transportation mode in the USA. Little research has been done to develop frameworks for route design. A methodology to explore the most cost‐effective DFRT route is presented in this paper. The inputs include potential DFRT demand distribution and a road network. A heuristic is used to build possible routes by starting at urban cores and extending in all network directions in certain length increments. All the DFRT routes falling in the length range desired by the users are selected. The cost effectiveness of those routes, defined by operating cost per passenger trip, is compared. The most cost‐effective route is selected and presented in a GIS map. A case study illustrates the methodology in several Tennessee metropolitan regions. The most cost‐effective route length is case specific; some routes (e.g. those out of our Nashville case) are most cost effective when short, while others (e.g. those out of Memphis) are most cost effective when long. Government agencies could use the method to identify routes with the lowest operating cost per passenger given a route length or an operating cost budget. Copyright © 2016 John Wiley & Sons, Ltd.     

A two‐leveled multi‐objective symbiotic evolutionary algorithm for the hub and spoke location problem

We consider a hub and spoke location problem (HSLP) with multiple scenarios. The HSLP consists of four subproblems: hub location, spoke location, spoke allocation, and customer allocation Under multiple scenarios, we aim to provide a set of well‐distributed solutions, close to the true Pareto optimal solutions, for decision makers. We present a novel multi‐objective symbiotic evolutionary algorithm to solve the HSLP under multiple scenarios. The algorithm is modeled as a two‐leveled structure, which we call the two‐leveled multi‐objective symbiotic evolutionary algorithm (TMSEA). In TMSEA, two main processes imitating symbiotic evolution and endosymbiotic evolution are introduced to promote the diversity and convergence of solutions. The evolutionary components suitable for each sub‐problem are defined. TMSEA is tested on a variety of test‐bed problems and compared with existing multi‐objective evolutionary algorithms. The experimental results show that TMSEA is promising in solution convergence and diversity.     

A network‐based dynamic air traffic flow model for short‐term en route traffic prediction

This paper presents a dynamic network‐based approach for short‐term air traffic flow prediction in en route airspace. A dynamic network characterizing both the topological structure of airspace and the dynamics of air traffic flow is developed, based on which the continuity equation in fluid mechanics is adopted to describe the continuous behaviour of the en route traffic. Building on the network‐based continuity equation, the space division concept in cell transmission model is introduced to discretize the proposed model both in space and time. The model parameters are sequentially updated based on the statistical properties of the recent radar data and the new predicting results. The proposed method is applied to a real data set from Shanghai Area Control Center for the short‐term air traffic flow prediction both at flight path and en route sector level. The analysis of the case study shows that the developed method can characterize well the dynamics of the en route traffic flow, thereby providing satisfactory prediction results with appropriate uncertainty limits. The mean relative prediction errors are less than 0.10 and 0.14, and the absolute errors fall in the range of 0 to 1 and 0 to 3 in more than 95% time intervals respectively, for the flight path and en route sector level. Copyright © 2017 John Wiley & Sons, Ltd.     

A traffic flow simulator for short‐term travel time forecasting

This paper presents an off‐line forecasting system for short‐term travel time forecasting. These forecasts are based on the historical traffic count data provided by detectors installed on Annual Traffic Census (ATC) stations in Hong Kong. A traffic flow simulator (TFS) is developed for short‐term travel time forecasting (in terms of offline forecasting), in which the variation of perceived travel time error and the fluctuations of origin‐destination (O‐D) demand are considered explicitly. On the basis of prior O‐D demand and partial updated detector data, the TFS can estimate the link travel times and flows for the whole network together with their variances and covariances. The short‐term travel time forecasting by O‐D pair can also be assessed and the O‐D matrix can be updated simultaneously. The application of the proposed off‐line forecasting system is illustrated by a numerical example in Hong Kong.     

A note on using Davidson's function in equilibrium assignment

This paper describes the use of the Davidson congestion function in modelling network flows using equilibrium assignment. A modification to the function is given, which defines the function over all flows values, and consequently removes computational difficulties noted in earlier studies. The modification requires the inclusion of an additional model parameter, and the selection of a suitable value for this parameter is studied for two sets of data. The modified Davidson function is also compared to two alternative functions; a step-wise linear function and a quartic polynomial function, which have both been proposed as congestion functions. Comparisons are made between observed link volumes and the assigned volumes from these models. It is concluded that the modified Davidson function is useful for inclusion in an equilibrium assignment model, given its ability to reflect differences in network link type (e.g. capacity and speed) and environment through its parameters, the conceptual advantage of the function through its derivation from queueing theory, and the previous discovery of reliable methods for estimating its parameters. A value of about 0.8–0.9 is suggested for the parameter (μ, 0 < μ < 1) introduced in the modification.