Multi-objective optimization of a road diet network design

The present study focuses on the development of a model for the optimal design of a road diet plan within a transportation network, and is based on rigorous mathematical models. In most metropolitan areas, there is insufficient road space to dedicate a portion exclusively for cyclists without negatively affecting existing motorists. Thus, it is crucial to find an efficient way to implement a road diet plan that both maximizes the utility for cyclists and minimizes the negative effect on motorists. A network design problem (NDP), which is usually used to find the best option for providing extra road capacity, is adapted here to derive the best solution for limiting road capacity. The resultant NDP for a road diet (NDPRD) takes a bi-level form. The upper-level problem of the NDPRD is established as one of multi-objective optimization. The lower-level problem accommodates user equilibrium (UE) trip assignment with fixed and variable mode-shares. For the fixed mode-share model, the upper-level problem minimizes the total travel time of both cyclists and motorists. For the variable mode-share model, the upper-level problem includes minimization of both the automobile travel share and the average travel time per unit distance for motorists who keep using automobiles after the implementation of a road diet. A multi-objective genetic algorithm (MOGA) is mobilized to solve the proposed problem. The results of a case study, based on a test network, guarantee a robust approximate Pareto optimal front. The possibility that the proposed methodology could be adopted in the design of a road diet plan in a real transportation network is confirmed.     

Anti-seismic reinforcement strategy for an urban road network

This paper provides a novel practical method for analyzing an anti-seismic reinforcement (ASR) problem involving hundreds of transportation facilities on an urban road network subject to multiple earthquake risks. The relevant properties of the present method are: (i) it evaluates the performance of an ASR strategy, taking into account traffic congestion and travelers’ trip-making or route-choice behavior; (ii) it estimates the realistic damage patterns on the road network and their occurrence probabilities on the basis of recent advances in structural and earthquake engineering; (iii) it has clear, sensible logic and includes neither a black-box nor a “lottery” in the necessary procedures. We examine the computational efficiency and whether the present method is reasonable by applying it to a test scenario of the Kobe urban and suburban area.     

Joint road toll pricing and capacity development in discrete transport network design problem

The paper demonstrates a method to determine road network improvements that also involve the use of a road toll charge, taking the perspective of the government or authority. A general discrete network design problem with a road toll pricing scheme, to minimize the total travel time under a budget constraint, is proposed. This approach is taken in order to determine the appropriate level of road toll pricing whilst simultaneously addressing the need for capacity. The proposed approach is formulated as a bi-level programming problem. The optimal road capacity improvement and toll level scheme is investigated with respect to the available budget levels and toll revenues.     

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.     

Global optimization method for mixed transportation network design problem: A mixed-integer linear programming approach

This paper proposes a global optimization algorithm for solving a mixed (continuous/discrete) transportation network design problem (MNDP), which is generally expressed as a mathematical programming with equilibrium constraint (MPEC). The upper level of the MNDP aims to optimize the network performance via both expansion of existing links and addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium (UE) problem. In this paper, we first formulate the UE condition as a variational inequality (VI) problem, which is defined from a finite number of extreme points of a link-flow feasible region. The MNDP is approximated as a piecewise-linear programming (P-LP) problem, which is then transformed into a mixed-integer linear programming (MILP) problem. A global optimization algorithm based on a cutting constraint method is developed for solving the MILP problem. Numerical examples are given to demonstrate the efficiency of the proposed method and to compare the results with alternative algorithms reported in the literature.     

Modeling urban taxi services in road networks: Progress,problem and prospect

Traditionally, many economists have examined the models and economics of urban taxi services under various types of regulation such as entry restriction and price control in an aggregate way. Only recently have we modeled urban taxi services in a network context. A realistic method has been proposed to describe vacant and occupied taxi movements in a road network and taxi drivers' search behavior for customers. A few extensions have been made to deal with demand elasticity and congestion effects together with development of efficient solution algorithms. Calibration and validation of the network taxi service models have been conducted towards their practical applications. This paper presents an overview of the research that has been carried out by the authors to develop network equilibrium models and solution algorithms for urban taxi services, and offers perspectives for future researches.     

Modeling residential location choice in relation to housing location and road tolls on congested urban highway networks

We present a reformulation of the residential location submodel of the Integrated Model of Residential and Employment Location as a network equilibrium problem, thereby making travel costs by auto endogenous. The location of housing supply is examined as a welfare maximization problem for both user-optimal and system-optimal travel costs using concepts of bilevel programming. Finally, we briefly discuss how the employment submodel can be reformulated, and the entire model solved as a variational inequality problem.     

The road network management system in Slovakia

Traffic on the road network in Slovakia is increasing greatly, as a result of the country's location in central Europe. In recent years, transit truck traffic has exceeded the network's capacity causing many accidents, low vehicle speed and rapid degradation of the pavement. To deal with this situation a Road Network Management System (RNMS) has been developed. This system is based on national standards that evaluate road parameters, characteristics, and traffic levels and on new methods that consider the environmental impact and methods based on international standards (HDM III). Using these, the RNMS was developed as one homogeneous unit, not only in terms of its capacity, traffic level and economic efficiency, but also to evaluate individual sections, to optimize action, and prepare a rehabilitation budget. It took only five years to develop the RNMS because Slovakia has much relevant experience based on high level research in highway design, structural pavement design and material engineering.     

Design of public transit network in urban area with elastic demand

This research focuses on an efficient design of transit network in urban areas. The system developed is used to create, analyze and optimize routes and frequencies of transit system in the network level. The analysis is based on elastic demand, so the shift of demand between modes in network due to different service level is of prime consideration. The developed system creates all feasible routes connecting all pairs of terminals in the network. Out of this vast pool of routes, a set of optimal routes is generated for a certain predetermined number that maintains connectivity of significant demand. Based on these generated routes, the system fulfils transportation demand by assigning demand that considers path and route choices for non-transit users and transit users. Together with the assignment of demand, transit frequencies are optimized and the related fleet-size is calculated. Having an optimal setting of solution, the system is continued by reconnecting the routes to find some other better solutions in the periphery of the optimal setting. A set of mathematical programming modules is developed. Real data from Sioux Falls city network is used to evaluate the performance of the model and compare with other heuristic methods.     

Towards a standardized European road network database

Many Driver Information Systems, especially those that provide location information and route guidance instruction, rely on some form of digital map data, i.e. data that represent the location and other properties of earth-bound objects. A deeperinformation analysis of the data needs of the systems reveals that many needs are very close to the demands that a human navigator makes on a classical paper map. But it also reveals some hidden needs, which relate to the fact that the current Driver Information Systems have only a very poor or no general knowledge. Gathering all these data, putting them into a database and keeping them up to date is an enormous task. Therefore it is very important to know whatsurveying and digitizing techniques are the most suitable for such data. This question is currently being investigated by two DRIVE projects, PANDORA and Task Force EDRM.To guarantee the efficiency of a road network database and to guarantee the exchangeability of traffic messages, a certainstandardization will be inevitable. One possibility is to standardize the finished article, i.e. the map data in the form in which they are represented on the medium used by the system itself (e.g. CD, coded beacon message). This is the solution that has been chosen in Japan, where a CD-ROM based standard has been defined. It is also the solution chosen by the European manufacturers of beacon-supported systems such as Autoguide and LISB, who have defined a standard for the road-vehicle communication link. Another possibility is to standardize the semi-manufactured article, i.e. the map data as they occur in a general purpose road database or in the datafiles produced by data suppliers. This solution has been chosen by Bosch and Philips and had led to their GDF, in which they define a standard data content, a data model and an exhange format for these files. If the systems are going to combine data coming from different sources, the need arises for standard reference numbers. This means that an organizational infrastructure will have to be set up to create and maintain such a reference numbering system. A road database that is kept up to date, represents a lot of money. It will be vitally important for such databases to be legally protected against copying activities.     

Application of Ant System to network design problem

Network design problem (NDP) is the problem of choosing from among a set of alternative projects which optimizes an objective (e.g., minimizes total travel time), while keeping consumption of resources (e.g., budget) within their limits. This problem is difficult to solve, because of its combinatorial nature and nonconvexity of the objective function. Many algorithms are presented to solve the problem more efficiently, while trading-off accuracy with computational speed. This increase in speed stems from certain approximations in the formulation of the problem, decomposition, or heuristics. This study adapts a meta – heuristic approach to solve NDP, namely Ant System (AS). The algorithm is first designed, and then calibrated to solve NDP for the Sioux Falls test network. The behavior of the algorithm is then investigated. The result seems encouraging.     

Solving a discrete multimodal transportation network design problem

This paper investigates the multimodal network design problem (MMNDP) that optimizes the auto network expansion scheme and bus network design scheme in an integrated manner. The problem is formulated as a single-level mathematical program with complementarity constraints (MPCC). The decision variables, including the expanded capacity of auto links, the layout of bus routes, the fare levels and the route frequencies, are transformed into multiple sets of binary variables. The layout of transit routes is explicitly modeled using an alternative approach by introducing a set of complementarity constraints. The congestion interaction among different travel modes is captured by an asymmetric multimodal user equilibrium problem (MUE). An active-set algorithm is employed to deal with the MPCC, by sequentially solving a relaxed MMNDP and a scheme updating problem. Numerical tests on nine-node and Sioux Falls networks are performed to demonstrate the proposed model and algorithm.     

Store-and-forward based methods for the signal control problem in large-scale congested urban road networks

The problem of designing network-wide traffic signal control strategies for large-scale congested urban road networks is considered. One known and two novel methodologies, all based on the store-and-forward modeling paradigm, are presented and compared. The known methodology is a linear multivariable feedback regulator derived through the formulation of a linear-quadratic optimal control problem. An alternative, novel methodology consists of an open-loop constrained quadratic optimal control problem, whose numerical solution is achieved via quadratic programming. Yet a different formulation leads to an open-loop constrained nonlinear optimal control problem, whose numerical solution is achieved by use of a feasible-direction algorithm. A preliminary simulation-based investigation of the signal control problem for a large-scale urban road network using these methodologies demonstrates the comparative efficiency and real-time feasibility of the developed signal control methods.     

The existence, uniqueness and computation of an arc-based dynamic network user equilibrium formulation

In this paper, a dynamic user equilibrium traffic assignment model with simultaneous departure time/route choices and elastic demands is formulated as an arc-based nonlinear complementarity problem on congested traffic networks. The four objectives of this paper are (1) to develop an arc-based formulation which obviates the use of path-specific variables, (2) to establish existence of a dynamic user equilibrium solution to the model using Brouwer's fixed-point theorem, (3) to show that the vectors of total arc inflows and associated minimum unit travel costs are unique by imposing strict monotonicity conditions on the arc travel cost and demand functions along with a smoothness condition on the equilibria, and (4) to develop a heuristic algorithm that requires neither a path enumeration nor a storage of path-specific flow and cost information. Computational results are presented for a simple test network with 4 arcs, 3 nodes, and 2 origin–destination pairs over the time interval of 120 periods.     

Transit network design with allocation of green vehicles: A genetic algorithm approach

The use of fossil fuels in transportation generates harmful emissions that accounts for nearly half of the total pollutants in urban areas. Dealing with this issue, local authorities are dedicating specific efforts to seize the opportunity offered by new fuels and technological innovations in achieving a cleaner urban mobility. In fact, authorities are improving environmental performances of their public transport fleet by procuring cleaner vehicles, usually called low and zero emission vehicles (LEV and ZEV, respectively). Nevertheless there seems to be a lack of methodologies for supporting stakeholders in decisions related to the introduction of green vehicles, whose allocation should be performed since the network design process in order to optimize their available green capacity.In this paper, the problem of clean vehicle allocation in an existing public fleet is faced by introducing a method for solving the transit network design problem in a multimodal, demand elastic urban context dealing with the impacts deriving from transportation emissions.The solving procedure consists of a set of heuristics which includes a routine for route generation and a genetic algorithm for finding a sub-optimal set of routes with the associated frequencies.     

Decision support for simulating the car park activity in an urban area

Complexity of car park activity is reproduced from a concurrent execution of behaviour of various drivers. This paper presents a step in the development of a multimodal traffic simulator based on multi‐agent paradigm and designed as a decision aid tool as well as a video game. The user‐player has the opportunity to test different scenarios. We propose an approach for designing the decision‐making rules and the learning mechanism for a car driver agent. For that, a panel of methods such as stated preference modelling, Design Of Experiments and data fusion is used. Initial behavioural models, based on similar preferences, are developed for specified categories. Each agent will adapt its behaviour after executing its learning process. Our approach can be used in order to optimize needs of road network users and those of people in charge of traffic regulation. A demonstrator has been developed to test parking policies in an urban area as well as changes of car park characteristics.     

Distinguishing the land use effects of road pricing based on the urban form attributes

This paper studies the effects of road pricing on land use under different development scenarios (business as usual scenario and transit oriented development scenario) by a quantitative method, which combines the integrated land use and transport interaction model (TRANUS model) with the scenario-planning techniques. Moreover, in order to further analyze the differences of the land use effects of road pricing on traffic analysis zones (TAZs) with different urban form attributes, a quantitative classification method combining factor analysis and cluster analysis is then used to quantitatively classify TAZs. The results demonstrate that the effects of road pricing on the land use of a specific region depend on the urban form attributes of the region. The higher the densities of employments and population, and better street design (high densities of street and intersections) and public transportation condition, the less the region is negatively affected by road pricing, and vice versa. More importantly, rail transit can alleviate the negative impact of road pricing on commercial development and population concentration of the region. Therefore, before introducing a road pricing policy, it is necessary to develop public transport system, especially rail transit.     

“Local background” levels of carbon monoxide in an urban area

The objective of this study was to obtain a better understanding of carbon monoxide (CO) concentrations immediately upwind of urban roadways, the “local background” values, and how these concentrations depend upon the surrounding traffic and the general meteorology. Measurements were made at seven sites in Seattle, WA during the winter of 1993. Local background CO concentrations were characterized by an absence of short term fluctuations, a steady buildup during the 3 p.m. to 11 p.m. period, and a lack of spatial gradients in the 8-h average values. Distinctly different log-normal distributions of the 8-h averages were observed for “trafficked” sites versus “urban park” sites, with mean values of 1.6 and 1.0 ppm respectively. A simple regression model was developed to predict the local background CO that includes distance from roadway, average daily traffic of nearby roadways, and the frequency of occurrence of low wind speeds (R² = 0.74; F = 170).