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.     

Increase of metro line capacity by optimisation of track circuit length and location: In a distance to go system

The signalling system affects the type of service that can be provided on any particular railway line. The aims set when it comes to designing these systems to operate a railway line are: to ensure safety of operation and to ensure flexible and efficient running. When building a line capacity optimisation algorithm, it must reach a compromise solution between two parameters: minimise the interval between trains and keep journey time as low as possible. This paper aims to describe the algorithm developed between METRO DE MADRID and CITEF (Railway Technology Research Centre of the Universidad Politécnica de Madrid – UPM) that allows the capacity of an underground line equipped with ATP Distance To Go systems to be studied and optimised. This algorithm facilitates the tasks of signalling design and optimisation. Copyright © 2010 John Wiley & Sons, Ltd.     

A Lagrangian relaxation based heuristic for the consolidation problem of airfreight forwarders

International air cargo is an operation-intensive industry, involving complex procedures and many players. As an important player, airfreight forwarders need to consolidate the collected goods skillfully in order to satisfy the requirements of the shippers and, at the same time minimize the expense charged by the airlines. However, the air cargo rate structure is very complicated, making the consolidation a difficult mixed-integer programming problem for the airfreight forwarder. In this paper, the consolidation problem is first transformed into a well-known set covering problem by treating a feasible consolidated shipment as a set. Lagrangian Relaxation is used as the backbone to develop a recursive heuristic algorithm. Based on the numerical experiment, the heuristic algorithm generates solutions very close to optimality. In particular, a sensitivity analysis is performed with respect to the degree of concavity. The results suggest that the solution algorithm can be used as a core module of the decision support system for air cargo consolidation.     

Weather impact on containership routing in closed seas: A chance-constraint optimization approach

Weather conditions have a strong effect on the operation of vessels and unavoidably influence total time at sea and associated transportation costs. The velocity and direction of the wind in particular may considerably affect travel speed of vessels and therefore the reliability of scheduled maritime services. This paper considers weather effects in containership routing; a stochastic model is developed for determining optimal routes for a homogeneous fleet performing pick-ups and deliveries of containers between a hub and several spoke ports, while incorporating travel time uncertainties attributed to the weather. The problem is originally formulated as a chance-constrained variant of the vehicle routing problem with simultaneous pick-ups and deliveries and time constraints and solved using a genetic algorithm. The model is implemented to a network of island ports of the Aegean Sea. Results on the application of algorithm reveal that a small fleet is sufficient enough to serve network’s islands, under the influence of minor delays. A sensitivity analysis based on alternative scenarios in the problem’s parameters, leads to encouraging conclusions with respect to the efficiency and robustness of the algorithm.     

Efficient solution algorithm for finding spatially dependent reliable shortest path in road networks

Travel times are generally stochastic and spatially correlated in congested road networks. However, very few existing route guidance systems (RGS) can provide reliable guidance services to aid travellers planning their trips with taking account explicitly travel time reliability constraint. This study aims to develop such a RGS with particular consideration of travellers' concern on travel time reliability in congested road networks with uncertainty. In this study, the spatially dependent reliable shortest path problem (SD‐RSPP) is formulated as a multi‐criteria shortest path‐finding problem in road networks with correlated link travel times. Three effective dominance conditions are established for links with different levels of travel time correlations. An efficient algorithm is proposed to solve SD‐RSPP by adaptively using three established dominance conditions. The complexities of road networks in reality are also explicitly considered. To demonstrate the applicability of proposed algorithm, a comprehensive case study is carried out in Hong Kong. The results of case study show that the proposed solution algorithm is robust to take account of travellers' multiple routing criteria. Computational results demonstrate that the proposed solution algorithm can determine the reliable shortest path on real‐time basis for large‐scale road networks. Copyright © 2016 John Wiley & Sons, Ltd.     

Adaptive data dissemination for time-constrained messages in dynamic vehicular networks

With the advent of emerging wireless communication technologies, tremendous efforts have been put on promoting the safety and efficiency of transportation services by developing innovative applications. In particular, there has been significant interest in accessing information stored at RSUs (Roadside Units). The unique characteristics in vehicular networks, such as dynamic traffic factors including vehicle arrival rate, dwell time and data access patterns, bring us new challenges on data dissemination. This work dedicates to the investigation of timely and adaptive data dissemination in the dynamically changing traffic environment. Firstly, we derive an analytical model to explore and examine the effects of the dynamic traffic factors. In light of the theoretical results, an on-line scheduling algorithm is proposed for adaptive data dissemination. Finally, we evaluate performance of the new algorithm in a variety of circumstances. The simulation results demonstrate satisfactory performance of the proposed algorithm.     

Optimal control of headway variation on transit routes

Headway control strategies have been proposed as methods for correcting transit service irregularities and thereby reducing passenger wait times at stops. This paper addresses a particular strategy which can be implemented on high frequency routes (headways under 10–12 minutes), in which buses are held at a control stop to a threshold headway. An algorithm is developed which yields the optimal control stop location and optimal threshold headway with respect to a system wait function. The specification of the wait function is based on the development of several empirical models, including a headway variation model and an average delay time model at control stops. A conclusion is reached that the headway variation does not increase linearly along a route, a common assumption made in many previous studies. Furthermore, the location of the optimal control stop and threshold value are sensitive to the passenger boarding profile, as expected. The algorithm itself appears to have practical application to conventional transit operations.     

Privacy-preserving MaaS fleet management

On-demand traffic fleet optimization requires operating Mobility as a Service (MaaS) companies such as Uber, Lyft to locally match the offer of available vehicles with their expected number of requests referred to as demand (as well as to take into account other constraints such as driver’s schedules and preferences). In the present article, we show that this problem can be encoded into a Constrained Integer Quadratic Program (CIQP) with block independent constraints that can then be relaxed in the form of a convex optimization program. We leverage this particular structure to yield a scalable distributed optimization algorithm corresponding to computing a gradient ascent in a dual space. This new framework does not require the drivers to share their availabilities with the operating company (as opposed to standard practice in today’s mobility as a service companies). The resulting parallel algorithm can run on a distributed smartphone based platform.     

Transportation service procurement problem with transit time

In this work, we investigate transit time in transportation service procurement, which is conducted by shippers using auctions to purchase transportation service from carriers in the planning stage. Besides cost, we find that many shippers are most concerned with transit time in practice; shorter transit time indicates better transportation service. To minimize both the total cost and transit time, the problem faced by shippers is the biobjective transportation service procurement problem with transit time. To solve the problem, we introduce a biobjective integer programming model that can also accommodate some important business constraints. A biobjective branch-and-bound algorithm that finds all extreme supported nondominated solutions is developed. To speed up the algorithm, two fast feasibility checks, a network flow model for particular subproblems, and lower bounds from relaxation are proposed. In addition, a sophisticated heuristic is introduced to meet shipper’s requirements in some situations. Computational experiments on evaluating the performance of the algorithms are conducted on a set of test instances that are generated from practical data.     

A model of optimal transport maintenance with demand responsiveness

Maintenance activities can be performed throughout the lifetime of a particular facility or piece of equipment, thereby affecting its quality in a continuous fashion. It is assumed in this paper that quality of a facility is determined by natural factors, rate of use and maintenance investments while demand for the facility is assumed to be a function of its quality. A dynamic optimization model in the form of a simple linear optimal control problem is then developed in order to determine optimal maintenance policies under these circumstances. Bang-bang and singular policies are derived and given economic interpretations. An algorithm is presented for numerical solution of the Pontryagin necessary conditions. Finally, sufficiency conditions are obtained for the model structure considered.     

Combinatorial programming,statistical optimization and the optimal transportation network problem

This paper presents and evaluates a branch and bound algorithm and two heuristic hill-climbing techniques to solve a discrete formulation of the optimal transportation network design problem. For practical applications it is proposed to combine a hill-climbing algorithm with a uniform random generation of the initial solutions, thereby inducing a statistical distribution of local optima. In order to determine when to stop sampling local optima and in order to provide an estimate of the exact optimum based on the whole distribution of local optima, we follow previous work and fit a Weibull distribution to the empirical distribution of local optima. Several extensions are made over previous work: in particular, a new confidence interval and a new stopping rule are proposed. The numerical application of the statistical optimization methodology to the network design algorithms consolidates the empirical validity of fitting a Weibull distribution to the empirical distribution of local optima. Numerical experiments with hill-climbing techniques of varying power suggest that the method is best applied with heuristics of intermediate quality: such heuristics provide many distinct sample points for statistical estimation while keeping the confidence intervals sufficiently narrow.     

A heuristic model for frequency planning and aircraft routing in small size airlines

The flight schedule of an airline is the primary factor in finding the most effective and efficient deployment of the airline's resources. The flight schedule process aims at finding a set of routes with associated aircraft type, frequency of service and times of departures and arrivals in order to satisfy a specific objective such as profit maximization. In this paper, we develop a two‐phase heuristic model for airline frequency planning and aircraft routing for small size airlines. The first phase develops a frequency plan using an economic equilibrium model between passenger demand for flying a particular route and aircraft operating characteristics. The second phase uses a time‐of‐day model to develop an assignment algorithm for aircraft routing.     

Automatic calibration of fundamental diagram for first‐order macroscopic freeway traffic models

Despite its importance in macroscopic traffic flow modeling, comprehensive method for the calibration of fundamental diagram is very limited. Conventional empirical methods adopt a steady state analysis of the aggregate traffic data collected from measurement devices installed on a particular site without considering the traffic dynamics, which renders the simulation may not be adaptive to the variability of data. Nonetheless, determining the fundamental diagram for each detection site is often infeasible. To remedy these, this study presents an automatic calibration method to estimate the parameters of a fundamental diagram through a dynamic approach. Simulated flow from the cell transmission model is compared against the measured flow wherein an optimization merit is conducted to minimize the discrepancy between model‐generated data and real data. The empirical results prove that the proposed automatic calibration algorithm can significantly improve the accuracy of traffic state estimation by adapting to the variability of traffic data when compared with several existing methods under both recurrent and abnormal traffic conditions. Results also highlight the robustness of the proposed algorithm. The automatic calibration algorithm provides a powerful tool for model calibration when freeways are equipped with sparse detectors, new traffic surveillance systems lack of comprehensive traffic data, or the case that lots of detectors lose their effectiveness for aging systems. Furthermore, the proposed method is useful for off‐line model calibration under abnormal traffic conditions, for example, incident scenarios. Copyright © 2015 John Wiley & Sons, Ltd.     

Detection Algorithms of Intentional Car Following on Smart Networks: A Primary Methodology

Abstract

This paper explores the possibility of detecting certain movements of vehicles that might provide useful information for crime investigations. It is known that existing car following models are interested in microscopic interactions between vehicles in randomly formed pairs. The present work, however, introduces the concept of macroscopic analysis of vehicle positions on a network and the idea of seeking if these movements exhibit any meaningful relationships. First of all detection algorithms are produced for two possible types of detection: (a) was a particular vehicle followed by any vehicle? and (b) did a particular vehicle follow any vehicle? These algorithms assume that every link in the network is equipped with some sort of vehicle identification or tracking device and the identities of all vehicles, such as their number plates, are fed into the program. Then a simulation program is developed to implement the first algorithm (Type (a)), as an example, to visualise the concept. Since the present paper is a preliminary and basic approach to the problem, a number of issues and details requiring further research, together with the directions which could be taken, are also identified and discussed.     

Speed limits,speed selection and network equilibrium

This paper investigates the local and global impact of speed limits by considering road users’ non-obedient behavior in speed selection. Given a link-specific speed limit scheme, road users will take into account the subjective travel time cost, the perceived crash risk and the perceived ticket risk as determinant factors for their actual speed choice on each link. Homogeneous travelers’ perceived crash risk is positively related to their driving speed. When travelers are heterogeneous, the perceived crash risk is class-specific: different user classes interact with each other and choose their own optimal speed, resulting in a Nash equilibrium speed pattern. With the speed choices on particular roads, travelers make route choices, resulting in user equilibrium in a general network. An algorithm is proposed to solve the user equilibrium problem with heterogeneous users under link-specific speed limits. The models and algorithms are illustrated with numerical examples.     

Collecting ambient vehicle trajectories from an instrumented probe vehicle: High quality data for microscopic traffic flow studies

This paper presents the methodology and results from a study to extract empirical microscopic vehicular interactions from a probe vehicle instrumented with sensors to monitor the ambient vehicles as it traverses a 28 mi long freeway corridor. The contributions of this paper are two fold: first, the general method and approach to seek a cost-effective balance between automation and manual data reduction that transcends the specific application. Second, the resulting empirical data set is intended to help advance traffic flow theory in general and car following models in particular. Generally the collection of empirical microscopic vehicle interaction data is either too computationally intensive or labor intensive. Historically automatic data extraction does not provide the precision necessary to advance traffic flow theory, while the labor demands of manual data extraction have limited past efforts to small scales. Key to the present study is striking the right balance between automatic and manual processing. Recognizing that any empirical microscopic data for traffic flow theory has to be manually validated anyway, the present study uses a “pretty good” automated processing algorithm followed by detailed manual cleanup using an efficient user interface to rapidly process the data. The study spans roughly two hours of data collected on a freeway during the afternoon peak of a typical weekday that includes recurring congestion. The corresponding data are being made available to the research community to help advance traffic flow theory in general and car following models in particular.     

Designing heterogeneous sensor networks for estimating and predicting path travel time dynamics: An information-theoretic modeling approach

With a particular emphasis on the end-to-end travel time prediction problem, this paper proposes an information-theoretic sensor location model that aims to minimize total travel time uncertainties from a set of point, point-to-point and probe sensors in a traffic network. Based on a Kalman filtering structure, the proposed measurement and uncertainty quantification models explicitly take into account several important sources of errors in the travel time estimation/prediction process, such as the uncertainty associated with prior travel time estimates, measurement errors and sampling errors. By considering only critical paths and limited time intervals, this paper selects a path travel time uncertainty criterion to construct a joint sensor location and travel time estimation/prediction framework with a unified modeling of both recurring and non-recurring traffic conditions. An analytical determinant maximization model and heuristic beam-search algorithm are used to find an effective lower bound and solve the combinatorial sensor selection problem. A number of illustrative examples and one case study are used to demonstrate the effectiveness of the proposed methodology.     

Regimes in social–cultural events-driven activity sequences: Modelling approach and empirical application

In this study we propose and apply a Bayesian-network model to predict and analyse the factors that influence activity-travel sequences that are triggered by social–cultural events. The study is motivated by the intention to examine the wider context in which activity-travel decisions are made and to model such decisions under longitudinal time horizons. We assume that social events trigger a series of interrelated activities and corresponding trips. Data about events and related activities are collected using a month-diary and involving a large sample of households in the Eindhoven region, The Netherlands. A learning algorithm is applied to derive a Bayesian-network model from the event diary. The results show that indeed many travel choices are influenced by particular events, that these influences vary by socio-demographic variables and that the learned Bayesian-network model is able to represent these interdependencies among all these variables. We demonstrate how the model can be used to predict event-driven activity-travel sequences in a micro-simulation.     

Exploring the impact of connected and autonomous vehicles on freeway capacity using a revised Intelligent Driver Model

ABSTRACT

Connected and autonomous vehicle (CAV) technologies are expected to change driving/vehicle behavior on freeways. This study investigates the impact of CAVs on freeway capacity using a microsimulation tool. A four-lane basic freeway segment is selected as the case study through the Caltrans Performance Measurement System (PeMS). To obtain valid results, various driving behavior parameters are calibrated to the real traffic conditions for human-driven vehicles. In particular, the calibration is conducted using genetic algorithm. A revised Intelligent Driver Model (IDM) is developed and used as the car-following model for CAVs. The simulation is conducted on the basic freeway segment under different penetration rates of CAVs and different freeway speed limits. The results show that with an increase in the market penetration rate, freeway capacity increases, and will increase significantly as the speed limit increases.     

A semi-analytical approach for solving the bottleneck model with general user heterogeneity

This paper proposes a novel semi-analytical approach for solving the dynamic user equilibrium (DUE) of a bottleneck model with general heterogeneous users. The proposed approach makes use of the analytical solutions from the bottleneck analysis to create an equivalent assignment problem that admits closed-form commute cost functions. The equivalent problem is a static and asymmetric traffic assignment problem, which can be formulated as a variational inequality problem (VIP). This approach provides a new tool to analyze the properties of the bottleneck model with general heterogeneity, and to design efficient solution methods. In particular, the existence and uniqueness of the DUE solution can be established using the P-property of the Jacobian matrix. Our numerical experiments show that a simple decomposition algorithm is able to quickly solve the equivalent VIP to high precision. The proposed VIP formation is also extended to address simultaneous departure time and route choice in a single O–D origin-destination network with multiple parallel routes.