Traffic signal timing problems with environmental and equity considerations

Traffic signal timings in a road network can not only affect total user travel time and total amount of traffic emissions in the network but also create an inequity problem in terms of the change in travel costs of users traveling between different locations. This paper proposes a multi‐objective bi‐level programming model for design of sustainable and equitable traffic signal timings for a congested signal‐controlled road network. The upper level of the proposed model is a multi‐objective programming problem with an equity constraint that maximizes the reserve capacity of the network and minimizes the total amount of traffic emissions. The lower level is a deterministic network user equilibrium problem that considers the vehicle delays at signalized intersections of the network. To solve the proposed model, an approach for normalizing incommensurable objective functions is presented, and a heuristic solution algorithm that combines a penalty function approach and a simulated annealing method is developed. Two numerical examples are presented to show the effects of reserve capacity improvement and green time proportion on network flow distribution and transportation system performance and the importance of incorporating environmental and equity objectives in the traffic signal timing problems. Copyright © 2013 John Wiley & Sons, Ltd.     

Multicriteria evaluation on accessibility‐based transportation equity in road network design problem

This paper investigates the performance of accessibility‐based equity measurements in transportation and proposes a multiobjective optimization model to simulate the trade‐offs between equity maximization and cost minimization of network construction. The equity is defined as the spatial distribution of accessibilities across zone areas. Six representative indicators were formulated, including GINI coefficient, Theil index, mean log deviation, relative mean deviation, coefficient of variation, and Atkinson index, and incorporated into an equity maximization model to evaluate the performance sensitivity. A bilevel multiobjective optimization model was proposed to obtain the Pareto‐optimal solutions for link capacity enhancement in a stochastic road network design problem. A numerical analysis using the Sioux Falls data was implemented. Results verified that the equity indicators are quite sensitive to the pattern of network scenarios in the sense that the level of equity varies according to the amount of overall capacity enhancement as well as the assignment of improved link segments. The suggested multiobjective model that enables representing the Pareto‐optimal solutions can provide multiple options in the decision making of road network design. Copyright © 2012 John Wiley & Sons, Ltd.     

Trade-offs between mobility and equity maximization under environmental capacity constraints: A case study of an integrated multi-objective model

This paper investigates the performance of a policy decision tool proposed for multi-objective decision under different policy interventions. This tool deals with the trade-off between mobility and equity maximization under environmental capacity constraints. Two system objectives, maximization of mobility and equity, are formulated in terms of the sum of total car ownership and number of trips, and the differences in accessibility between zones. Environmental capacities are based on production efficiency theory in which the frontier emission under maximum system efficiency is taken as environmental capacity. To examine the performance of the proposed model, three types of hypothetical policies (network improvement, population increase and urban sprawl) are formulated. Effects are simulated using data pertaining to Dalian City, China. Results show that the proposed model is capable of representing the trade-offs between mobility and equity based on different policy interventions. Compared with two extreme cases with the single objective of mobility maximization or equity maximization, the Pareto-optimal solutions provide more interesting practical options for decision makers. Taking the solution based on the maximum equity as an example, the policy of urban sprawl yields the most significant improvement in both emission and accessibility of the three scenarios.     

A model for assessing the effects of dynamic travel time information via variable message signs

In view of the serious traffic congestion during peak hours in most metropolitan areas around the world and recent improvement of information technology, there is a growing aspiration to alleviate road congestion by applications of electronic information and communication technology. Providing drivers with dynamic travel time information such as estimated journey times on major routes should help drivers to select better routes and guide them to utilise existing expressway network. This can be regarded as one possible strategy for effective traffic management. This paper aims to investigate the effects and benefits of providing dynamic travel time information to drivers via variable message signs at the expressway network. In order to assess the effects of the dynamic driver information system with making use of the variable message signs, a time-dependent traffic assignment model is proposed. A numerical example is used to illustrate the effects of the dynamic travel time information via variable message signs. This revised version was published online in June 2006 with corrections to the Cover Date.     

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.     

Global optimization methods for the discrete network design problem

This paper addresses the discrete network design problem (DNDP) with multiple capacity levels, or multi-capacity DNDP for short, which determines the optimal number of lanes to add to each candidate link in a road network. We formulate the problem as a bi-level programming model, where the upper level aims to minimize the total travel time via adding new lanes to candidate links and the lower level is a traditional Wardrop user equilibrium (UE) problem. We propose two global optimization methods by taking advantage of the relationship between UE and system optimal (SO) traffic assignment principles. The first method, termed as SO-relaxation, exploits the property that an optimal network design solution under SO principle can be a good approximate solution under UE principle, and successively sorts the solutions in the order of increasing total travel time under SO principle. Optimality is guaranteed when the lower bound of the total travel time of the unexplored solutions under UE principle is not less than the total travel time of a known solution under UE principle. The second method, termed as UE-reduction, adds the objective function of the Beckmann-McGuire-Winsten transformation of UE traffic assignment to the constraints of the SO-relaxation formulation of the multi-capacity DNDP. This constraint is convex and strengthens the SO-relaxation formulation. We also develop a dynamic outer-approximation scheme to make use of the state-of-the-art mixed-integer linear programming solvers to solve the SO-relaxation formulation. Numerical experiments based on a two-link network and the Sioux-Falls network are conducted.     

Measuring the sustainability of marine fuels: A fuzzy group multi-criteria decision making approach

The use of alternative energy sources instead of HFO has been recognized as a promising way for reducing emissions from shipping and promoting the development of green shipping. However, it is usually difficult for the decision-making to select the best choice among multiple alternative marine fuels. In order to address this, a complete criteria system for sustainability assessment of alternative marine fuels was firstly established, and a fuzzy group multi-criteria decision making method has been developed to rank the alternative marine fuels by combining fuzzy logarithmic least squares and fuzzy TOPSIS (Technique for Order Performance by Similarity to Ideal Solution). Fuzzy logarithmic least squares method has been employed to determine the weights of the criteria for sustainability assessment, and fuzzy TOPSIS was employed to determine the sustainability order of the alternatives. An illustrative case with three alternative marine fuels including methanol, LNG and hydrogen has been studied by the proposed method, and hydrogen has been recognized as the most sustainable scenario, follows by LNG, and methanol in the descending order. The results show that the proposed method is feasible for prioritizing the alternative marine fuels; it also has the ability to help the decision-makers to select the most sustainable option among multiple marine fuels.     

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.     

Analytic hierarchy process application in selecting the mode of transport for a logistics company

As a multi‐criteria decision‐making (MCDM) method, the analytic hierarchy process (AHP) has been used considerably to solve hierarchical or network‐based decision problems in socio‐economic fields. Following an in‐depth explanation of the transport function in logistics and an overview of the MCDM methods, the AHP model is employed in the paper for a logistics company in selecting the most suitable way of transportation between two given locations in Turkey. The criteria used in the selection of transportation modes are identified as the cost, speed, safety, accessibility, reliability, environmental friendliness, and flexibility. Several cost parameters (transportation, storage, handling, bosphorus crossover) are incorporated into the decision‐making process. The application is carried out in instructional character. The results of the study indicate that the railway transportation, which is not widely used in Turkey, is also an alternative and suitable means of transportation. Copyright © 2013 John Wiley & Sons, Ltd.     

Multiple objective optimization of the fleet sizing problem for road freight transportation

A fleet sizing problem (FSP) in a road freight transportation company with heterogeneous fleet and its own technical back‐up facilities is considered in the paper. The mathematical model of the decision problem is formulated in terms of multiple objective mathematical programming based on queuing theory. Technical and economical criteria as well as interests of different stakeholders are taken into account in the problem formulation. The solution procedure is composed of two steps. In the first one a sample of Pareto‐optimal solutions is generated by an original program called MEGROS. In the second step this set is reviewed and evaluated, according to the Decision Maker's (DM's) model of preferences. The evaluation of solutions is carried out with an application of an interactive multiple criteria analysis method, called Light Beam Search (LBS). Finally, the DM selects the most desirable, compromise solution.     

Predicting travel time reliability using mobile phone GPS data

Estimates of road speeds have become commonplace and central to route planning, but few systems in production provide information about the reliability of the prediction. Probabilistic forecasts of travel time capture reliability and can be used for risk-averse routing, for reporting travel time reliability to a user, or as a component of fleet vehicle decision-support systems. Many of these uses (such as those for mapping services like Bing or Google Maps) require predictions for routes in the road network, at arbitrary times; the highest-volume source of data for this purpose is GPS data from mobile phones. We introduce a method (TRIP) to predict the probability distribution of travel time on an arbitrary route in a road network at an arbitrary time, using GPS data from mobile phones or other probe vehicles. TRIP captures weekly cycles in congestion levels, gives informed predictions for parts of the road network with little data, and is computationally efficient, even for very large road networks and datasets. We apply TRIP to predict travel time on the road network of the Seattle metropolitan region, based on large volumes of GPS data from Windows phones. TRIP provides improved interval predictions (forecast ranges for travel time) relative to Microsoft’s engine for travel time prediction as used in Bing Maps. It also provides deterministic predictions that are as accurate as Bing Maps predictions, despite using fewer explanatory variables, and differing from the observed travel times by only 10.1% on average over 35,190 test trips. To our knowledge TRIP is the first method to provide accurate predictions of travel time reliability for complete, large-scale road networks.     

Energy impact evaluation for eco-routing and charging of autonomous electric vehicle fleet: Ambient temperature consideration

This paper studies the heterogeneous energy cost and charging demand impact of autonomous electric vehicle (EV) fleet under different ambient temperature. A data-driven method is introduced to formulate a two-dimensional grid stochastic energy consumption model for electric vehicles. The energy consumption model aids in analyzing EV energy cost and describing uncertainties under variable average vehicle trip speed and ambient temperature conditions. An integrated eco-routing and optimal charging decision making framework is designed to improve the capability of autonomous EV’s trip level energy management in a shared fleet. The decision making process helps to find minimum energy cost routes with consideration of charging strategies and travel time requirements. By taking advantage of derived models and technologies, comprehensive case studies are performed on a data-driven simulated transportation network in New York City. Detailed results show us the heterogeneous energy impact and charging demand under different ambient temperature. By giving the same travel demand and charging station information, under the low and high ambient temperature within each month, there exist more than 20% difference of overall energy cost and 60% difference of charging demand. All studies will help to construct sustainable infrastructure for autonomous EV fleet trip level energy management in real world applications.     

Network reliability‐based optimal toll design

Optimal toll design from a network reliability point of view is addressed in this paper. Improving network reliability is proposed as a policy objective of road pricing. A reliability‐based optimal toll design model, where on the upper level network performance including travel time reliability is optimized, while on the lower level a dynamic user‐equilibrium is achieved, is presented. Road authorities aim to optimize network travel time reliability by setting tolls in a network design problem. Travelers are influenced by these tolls and make route and trip decisions by considering travel times and tolls. Network performance reliability is analyzed for a degradable network with elastic and fluctuated travel demand, which integrates reliability and uncertainty, dynamic network equilibrium models, and Monte Carlo methods. The proposed model is applied to a small hypothesized network for which optimal tolls are derived. The network travel time reliability is indeed improved after implementing optimal tolling system. Trips may have a somewhat higher, but more reliable, travel time.     

Transportation serviceability analysis for metropolitan commuting corridors based on modal choice modeling

Major commuting corridors in metropolitan areas generally comprise multiple transportation modes for commuters, such as transit (subways or buses), private vehicles, or park-and-ride combinations. During the morning peak hour, the commuters would choose one of the available transportation modes to travel through the corridors from rural/suburban living areas to urban working areas. This paper introduces a concept of transportation serviceability to evaluate a transportation mode’s service status in a specific link, route, road, or network during a certain period. The serviceability can be measured by the possibility that travelers choose a specific type of transportation service at a certain travel cost. The commuters’ modal-choice possibilities are calculated using a stochastic equilibrium model based on general travel cost. The modeling results illustrate how transportation serviceability is influenced by background traffic flow in a corridor, value of comfort for railway mode, and parking fee distribution.     

New technology and the modeling of risk-taking behavior in congested road networks

Intelligent transport systems provide various means to improve traffic congestion in road networks. Evaluation of the benefits of these improvements requires consideration of commuters’ response to reliability and/or uncertainty of travel time under various circumstances. Various disruptions cause recurrent or non-recurrent congestion on road networks, which make road travel times intrinsically fluctuating and unpredictable. Confronted with such uncertain traffic conditions, commuters are known to develop some simple decision-making process to adjust their travel choices. This paper represents the decision-making process involved in departure-time and route choices as risk-taking behavior under uncertainty. An expected travel disutility function associated with commuters’ departure-time and route choices is formulated with taking into account the travel delay (due the recurrent congestion), the uncertainty of travel times (due to incident-induced congestion) and the consequent early or late arrival penalty. Commuters are assumed to make decision on the departure-time and route choices on the basis of the minimal expected travel disutility. Thus the network will achieve a simultaneous route and departure-time user equilibrium, in which no commuter can decrease his or her expected disutility by unilaterally changing the route or departure-time. The equilibrium is further formulated as an equivalent nonlinear complementarity problem and is then converted into an unconstrained minimization problem with the use of a gap function suggested recently. Two algorithms based on the Nelder–Mead multidimensional simplex method and the heuristic route/time-swapping approach, are adapted to solve the problem. Finally, numerical example is given to illustrate the application of the proposed model and algorithms.     

A threshold model of social contagion process for evacuation decision making

Individual evacuation decisions are often characterized by the influence of one’s social network. In this paper a threshold model of social contagion, originally proposed in the network science literature, is presented to characterize this social influence in the evacuation decision making process. Initiated by a single agent, the condition of a cascade when a portion of the population decides to evacuate has been derived from the model. Simulation models are also developed to investigate the effects of community mixing patterns and the initial seed on cascade propagation and the effect of previous time-steps considered by the agents and the strength of ties on average cascade size. Insights related to social influence include the significant role of mixing patterns among communities in the network and the role of the initial seed on cascade propagation. Specifically, faster propagation of warning is observed in community networks with greater inter-community connections.     

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.     

Network-oriented household activity pattern problem for system optimization

The recently emerging trend of self-driving vehicles and information sharing technologies, made available by private technology vendors, starts creating a revolutionary paradigm shift in the coming years for traveler mobility applications. By considering a deterministic traveler decision making framework at the household level in congested transportation networks, this paper aims to address the challenges of how to optimally schedule individuals’ daily travel patterns under the complex activity constraints and interactions. We reformulate two special cases of household activity pattern problem (HAPP) through a high-dimensional network construct, and offer a systematic comparison with the classical mathematical programming models proposed by Recker (1995). Furthermore, we consider the tight road capacity constraint as another special case of HAPP to model complex interactions between multiple household activity scheduling decisions, and this attempt offers another household-based framework for linking activity-based model (ABM) and dynamic traffic assignment (DTA) tools. Through embedding temporal and spatial relations among household members, vehicles and mandatory/optional activities in an integrated space-time-state network, we develop two 0–1 integer linear programming models that can seamlessly incorporate constraints for a number of key decisions related to vehicle selection, activity performing and ridesharing patterns under congested networks. The well-structured network models can be directly solved by standard optimization solvers, and further converted to a set of time-dependent state-dependent least cost path-finding problems through Lagrangian relaxation, which permit the use of computationally efficient algorithms on large-scale high-fidelity transportation networks.     

Pareto-improving transportation network design and ownership regimes

Private provision of public roads signifies co-existence of free, public-tolled and private-tolled roads. This paper investigates the Pareto-improving transportation network design problem under various ownership regimes by allowing joint choice of road pricing and capacity enhancement on free links. The problem of interest is formulated as a bi-objective mathematical programming model that considers the travel cost of road users in each origin-destination pair and the investment return of the whole network. The non-dominated Pareto-improving solutions of toll and/or capacity enhancement schemes are sought for achieving a win-win situation. A sufficient condition is provided for the existence of the non-dominated Pareto-improving schemes and then the properties of those schemes are analyzed. It is found that, under some mild assumptions, the optimal capacity enhancement is uniquely determined by the link flow under any non-dominated Pareto-improving scheme. As a result, the joint road pricing and capacity enhancement problem reduces to a bi-objective second-best road pricing problem. A revenue distribution mechanism with return rate guarantee is proposed to implement the non-dominated Pareto-improving schemes.     

A comparison of user-optimum versus system-optimum traffic assignment in transportation network design

In this report, we compare the computational efficiency and results of solving two alternative models for the problem of determining improvements to an urban road network. Using a 1462 link, 584 node test network of the north Dallas area, we compare a model which assumes user-optimum behavior of travelers with a model which assumes system-optimum flows. Both of these models allow improvements to the road network to take on any nonnegative value, rather than requiring discrete improvement values. Investment costs are modeled by functions with decreasing marginal costs. Unfortunately, the user-optimum model, which is much more realistic than the system-optimum one, normally cannot be solved optimally. However, the simpler system-optimum model can be optimally solved, provided that investment costs are approximated by linear functions. Thus, for this network design problem we compare an accurate representation which can be solved only approximately with an approximate representation which can be solved optimally. Our computational testing showed that the system-optimum model produces solutions as good as those from the user-optimum model, and thus seems justified when favored by other considerations, such as ease of coding, availability of “canned” programs, etc.