Transport planning with multiple criteria: The analytic hierarchy process applications and progress review

Five examples of applications of the Analytic Hierarchy Process (AHP) are made to illustrate the different uses of this ratio scale multicriteria decision method in transportation. They include a commuter route selection hierarchy, a best mix of routes to Pittsburgh's new International Airport, a benefits/costs hierarchy to choose the best mode to cross a river, a planning hierarchy for a transport system and a simple dependence with feedback cycle to choose a car when criteria depend on the alternatives. For a better appreciation of the use and power of the method, the examples are followed by a resume of developments in research on the (AHP) in the last few years.     

Motorway signals and the detection of incidents

A mathematical model of automobile trip tours is presented. Within a framework of eight common restrictions on automobile trip making, all travel behavior is assumed random and all of the ways in which tours can be arranged are assumed equally likely. Three probability distributions are derived from the model: (1) the probability that a household makes a given number of tours in a day; (2) the probability that a household makes a given number of trips in a day; and (3) the probability that a tour reaches a given number of destinations. It is shown that the model agrees with similar probability distributions generated from home‐interview data for Milwaukee.     

Evaluating the benefits of a combined route guidance and road pricing system in a traffic network with recurrent congestion

When drivers do not have complete information on road travel time and thus choose their routes in a stochastic manner or based on their previous experience, separate implementations of either route guidance or road pricing cannot drive a stochastic network flow pattern towards a system optimum in a Wardropian sense. It is thus of interest to consider a combined route guidance and road pricing system. A road guidance system could reduce drivers' uncertainty of travel time through provision of traffic information. A driver who is equipped with a guidance system could be assumed to receive complete information, and hence be able to find the minimum travel time routes in a user-optimal manner, while marginal-cost road pricing could drive a user-optimal flow pattern toward a system optimum. Therefore, a joint implementation of route guidance and road pricing in a network with recurrent congestion could drive a stochastic network flow pattern towards a system optimum, and thus achieve a higher reduction in system travel time. In this paper the interaction between route guidance and road pricing is modeled and the potential benefit of their joint implementation is evaluated based on a mixed equilibrium traffic assignment model. The private and system benefits under marginal-cost pricing and varied levels of market penetration of the information systems are investigated with a small and a large example. It is concluded that the two technologies complement each other and that their joint implementation can reduce travel time more efficiently in a network with recurrent congestion.     

A parallel algorithm for train rescheduling

One of the crucial factors in achieving a high punctuality in railway traffic systems, is the ability to effectively reschedule the trains when disturbances occur. The railway traffic rescheduling problem is a complex task to solve both from a practical and a computational perspective. Problems of practically relevant sizes have typically a very large search space, making them time-consuming to solve even for state-of-the-art optimization solvers. Though competitive algorithmic approaches are a widespread topic of research, not much research has been done to explore the opportunities and challenges in parallelizing them. This paper presents a parallel algorithm to efficiently solve the real-time railway rescheduling problem on a multi-core parallel architecture. We devised (1) an effective way to represent the solution space as a binary tree and (2) a novel sequential heuristic algorithm based on a depth-first search (DFS) strategy that quickly traverses the tree. Based on that, we designed a parallel algorithm for a multi-core architecture, which proved to be 10.5 times faster than the sequential algorithm even when run on a single processing core. When executed on a parallel machine with 8 cores, the speed further increased by a factor of 4.68 and every disturbance scenario in the considered case study was solved within 6 s. We conclude that for the problem under consideration, though a sequential DFS approach is fast in several disturbance scenarios, it is notably slower in many other disturbance scenarios. The parallel DFS approach that combines a DFS with simultaneous breadth-wise tree exploration, while being much faster on an average, is also consistently fast across all scenarios.     

Fine-grained OD estimation with automated zoning and sparsity regularisation

Given a road network, a fundamental object of interest is the matrix of origin destination (OD) flows. Estimation of this matrix involves at least three sub-problems: (i) determining a suitable set of traffic analysis zones, (ii) the formulation of an optimisation problem to determine the OD matrix, and (iii) a means of evaluating a candidate estimate of the OD matrix. This paper describes a means of addressing each of these concerns. We propose to automatically uncover a suitable set of traffic analysis zones based on observed link flows. We then employ regularisation to encourage the estimation of a sparse OD matrix. We finally propose to evaluate a candidate OD matrix based on its predictive power on held out link flows. Analysis of our approach on a real-world transport network reveals that it discovers automated zones that accurately capture regions of interest in the network, and a corresponding OD matrix that accurately predicts observed link flows.     

Modelling major traffic incident impacts and estimation of their associated costs

Network area-wide impacts due to major traffic incidents can be assessed using a microsimulation approach. A VISSIM microsimulation model for a motorway network has been developed and is used to quantify impacts of a major incident in terms of associated costs. The modelled results reveal that a 65% capacity reduction results in 36% more incident-induced delay when compared with the application of a 50% capacity reduction assumption for a two-hour incident clearance duration that blocked one lane of a two-lane motorway. Additionally, an incident which caused a full blockage incurred 40 times more associated impact costs when compared with a major incident which caused a one lane blockage. A 23% cost saving can be achieved by clearing one lane of a fully blocked two-hour major traffic incident after 90 minutes, while a 37% cost saving can be achieved by clearing all blockages after 90 minutes.     

Estimating the value of risk reductions for car drivers when pedestrians are involved: a case study in Spain

We estimated the benefits associated with reducing fatal and severe injuries from traffic accidents using a stated choice experiment where choice situations were generated through a statistically efficient design. Specifically, the risk variables were defined as the expected annual number of vehicle car-users that suffered their death or were severely injured in a traffic accident. In addition, and differing from previous research, the number of pedestrians that died or were severely injured in traffic accidents per year was also included as a risk attribute in the choice experiment, to attempt at measuring drivers’ willingness to pay to reduce the risk of hitting pedestrians in a crash. The empirical setting was a choice of route for a particular trip that a sample of car drivers periodically undertakes in Tenerife, Spain. Models were estimated accounting for random taste heterogeneity and pseudo-panel data correlation. The median of the distribution of simulated parameters was used to obtain a representative measure for the monetary valuation of risk reductions. We found that the ratio between the values of reducing the risk of suffering a serious injury and that of reducing a fatality was approximately 18 %. Further, and quite novel, we also found that the value of reducing a pedestrian fatality was 39 % of the value of reducing a car occupant fatality.     

The impacts of E-retail on the choice of shopping trips and delivery: Some preliminary findings

E-retail, like many other information technology-based activities (telecommuting, telemedicine etc.) offers a potential substitution of travel by telecommunications. Traditional shopping activities typically consist of a visit to a store in which product information is sought, and a decision on purchase is made. Pending that decision, the product is obtained and most often self-delivered by the consumer. Certain types of products are store-delivered to the consumer premises. In the face of E-retail, consumers can acquire information, make a purchase transaction and choose a delivery arrangement from a remote location. These options may result in a reduction of transport activity, as a delivery by the supplier is potentially more efficient than the traditional process. The current study presents a conceptual model of the decisions households make with regard to information gathering, purchase transactions and delivery mode. Data on revealed behavior and various socio-demographic and economic characteristics of shoppers was collected in the Tel-Aviv Metropolitan area in the summer of 2004.     

A multinomial logit car use model for a megacity of the developing world: Istanbul

The increase in motor vehicle use is one of the important factors that cause traffic congestion, especially in megacities. Thus, the reasons behind this increase require serious attention. This paper offers an analysis of this kind, for a megacity from the developing world, Istanbul. A stratified multinomial logit model accounting for the availability of a second vehicle in the household is estimated for a sample drawn from a questionnaire to gather information of actual car use in Istanbul. This estimation is only possible through a unique data generation process that converts actual preferences into a choice study setting. In addition, a simulation study, generally utilized in the analyses of discrimination between certain layers of society, and a scenario analysis related to changes in income are also included in the paper for a better understanding of the nature of the topic. The results show that the behavior of households with a second vehicle available and not available varies significantly due to household, individual and professional-related characteristics.     

On the modeling and solution algorithm for the reverse logistics recycling flow equilibrium problem

This paper presents a study that characterizes, formulates, and solves the reverse logistic recycling flow equilibrium (RLRFE) problem. The RLRFE problem is concerned with the recycling channel in which recyclable collectors, processors, landfills, and demand markets form a multi-tiered network to process the recycled material flows from sources destined either for landfills or demand markets. Motivated by a government policy making or enterprise conglomerate recycling system design and operation needs, the RLRFE problem is elaborated from a system-optimal perspective using the variational inequality (VI) approach. For each origin–destination (OD) pair, the corresponding equilibrium conditions are established as a variation of the Wardrop second principle. In light of demand and cost function interactions, a nested diagonalization solution (ND) algorithm is proposed that gradually transforms the RLRFE problem into a traffic assignment model. To address multiple landfills in the recycling network and to understand how a variable-demand problem can be analyzed as a fixed-demand problem, we propose a supernetwork representation of the RLRFE problem. A numerical analysis on a test case illustrates the model formulation and the proposed algorithm.     

Optimization of horizontal alignment geometry in road design and reconstruction

This paper presents a general formulation for optimization of horizontal road alignment, composed of tangential segments and circular curves suitably connected with transition curves (clothoids). It consists of a constrained optimization problem where the objective function is given by a line integral along the layout. The integrand is a function representing the cost of the road going through each point and, by considering different costs, a wide range of problems can be included in this formulation. To show it, we apply this methodology to three different situations. The two first cases are related with the design of a new road layout and used to solve a pair of academic examples. The third problem deals with the improvement of a road adapting the old path to current legislation, and it is solved taking as case study the reconstruction project for a regional road (NA-601) in the north of Spain.     

Exploring the relationship between perceived acceptability and referendum voting support for alternative road pricing schemes

A dominant theme in the debate on road pricing (RP) reform is securing buy in from all key stakeholders as a pre-condition for gaining support from politicians. This paper explores the key influences and the extent to which particular RP schemes are acceptable to the community at large, and how this translates into support if a scheme were subject to a vote in a referendum. Using data collected in Sydney in 2012 from a sample of car users, we estimate a recursive simultaneous bivariate probit model that recognises the endogeneity effect of scheme acceptability on voting plans. We find that there is a very strong link between voting intentions and scheme acceptability, and provide a series of direct elasticity estimates of the influence that the cost elements of RP reform schemes have on the joint probability of accepting and voting for a scheme.     

Modeling the bilateral micro‐searching behavior for urban taxi services using the absorbing markov chain approach

This paper develops a mathematical model that is based on the absorbing Markov chain approach to describe taxi movements, taking into account the stochastic searching processes of taxis in a network. The local searching behavior of taxis is specified by a logit form, and the O‐D demand of passengers is estimated as a logit model with a choice of taxi meeting point. The relationship between customer and taxi waiting times is modeled by a double‐ended queuing system. The problem is solved with a set of non‐linear equations, and some interesting results are presented. The research provides a novel and potentially useful formulation for describing the urban taxi services in a network.     

成品油管道穿越滑坡地段应力分析

成品油管道穿越山区滑坡地段时,受到滑坡推力的作用,易使管道产生过大变形而破坏。为探究此类管道安全问题并提出解决方案,使用应力分析软件CAESAR Ⅱ对某穿越滑坡地段的成品油管道进行应力及位移分析,得出其应力、位移分布,并分析纵向滑坡和横向滑坡对输油管道的影响。通过分析得出常规地段与滑坡地段的交界位置为输油管道的危险截面,且纵向滑坡对输油管道的应力及横向位移、纵向位移影响较大。     

Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries

This paper proposes neighborhood search heuristics to optimize the planned routes of vehicles in a context where new requests, with a pick-up and a delivery location, occur in real-time. Within this framework, new solutions are explored through a neighborhood structure based on ejection chains. Numerical results show the benefits of these procedures in a real-time context. The impact of a master–slave parallelization scheme, using an increasing number of processors, is also investigated.     

Costs and benefits of a bicycle helmet law for Germany

This study presents a cost–benefit analysis of a law requiring cyclists to wear a helmet when riding a bicycle in Germany. The cost benefit-analysis takes into account the benefit of increased security when cyclists wear a helmet or use a transport mode that is less risky than cycling. The analysis also considers the cost of purchasing helmets, reduced fitness when cycling is replaced by a motorized transport mode, the discomfort of wearing helmets and environmental externalities. The benefits of a helmet law are estimated at about 0.7 of the costs. A bicycle helmet law for Germany is found to be a waste of resources.     

The dynamic shortest path problem with time-dependent stochastic disruptions

The dynamic shortest path problem with time-dependent stochastic disruptions consists of finding a route with a minimum expected travel time from an origin to a destination using both historical and real-time information. The problem is formulated as a discrete time finite horizon Markov decision process and it is solved by a hybrid Approximate Dynamic Programming (ADP) algorithm with a clustering approach using a deterministic lookahead policy and value function approximation. The algorithm is tested on a number of network configurations which represent different network sizes and disruption levels. Computational results reveal that the proposed hybrid ADP algorithm provides high quality solutions with a reduced computational effort.     

Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem

Using a sample-based representation scheme to capture spatial and temporal travel time correlations, this article constructs an integer programming model for finding the a priori least expected time paths. We explicitly consider the non-anticipativity constraint associated with the a priori path in a time-dependent and stochastic network, and propose a number of reformulations to establish linear inequalities that can be easily dualized by a Lagrangian relaxation solution approach. The relaxed model is further decomposed into two sub-problems, which can be solved directly by using a modified label-correcting algorithm and a simple single-value linear programming method. Several solution algorithms, including a sub-gradient method, a branch and bound method, and heuristics with additional constraints on Lagrangian multipliers, are proposed to improve solution quality and find approximate optimal solutions. The numerical experiments investigate the quality and computational efficiency of the proposed solution approach.     

Parameter transfer of common-metric attributes in choice analysis: implications for willingness to pay

There is a growing literature that promotes the presence of a mix of compensatory and semi-compensatory processing strategies in the way that individuals evaluate packages of attributes in real or hypothetical markets, and make choices. This paper proposes a specification for the utility form in a choice model to test if, given a pair of attributes with a common-metric (e.g., components of travel time or cost), the attribute with the dominating level defines the marginal (dis)utility that is assigned to both attributes. We refer to this processing strategy as a parameter transfer rule. We use a stated choice data set, in the context of car driving individuals choosing between tolled and non-tolled routes, to estimate a mixed logit model which incorporates the presence of the parameter transfer rule and the conventional fully compensatory rule, both existing up to a probability. We find that if this parameter transfer heuristic is part of the mix, the WTP is more than 30% higher, on average, than when only a fully compensatory rule is imposed. We also contrast the parameter transfer rule with other semi-compensatory heuristics which have been investigated in other papers, and show that the finding adds further support to the accumulating evidence that a semi-compensatory attribute processing rules tend to result in higher mean WTP estimates compared to the fully compensatory attribute processing rule.     

A query resolution engine to handle a path operator with multiple paths

An end-user query of a Geographical Information System (GIS) can formally be defined as the application of a set of operators (spatial or not). Geographical Information Systems used for Transportation (GIS-T) must provide a path evaluation operator. For example, an end-user query may involve a selection based on alphanumeric criteria, an evaluation of path, and a spatial intersection. This composition of operators and the fact that the evaluation of a path may not provide a unique result impose the definition of a query resolution model or a database query language able to support this composition. In this paper we present a query resolution model. The use of multi-criteria analysis and the definition of aggregates in a query (nearly mandatory) may involve ambiguities in the final presentation of the results to an end-user. The formal modeling of query results must take into account this risk. The philosophies of a query definition and the presentation of the results may be different (e.g., formular vs visual). The management of query results must take into account the data model associated with the query results, the results themselves (metabase/database), and the interpretation. The interpretation avoids errors due to visual ambiguities of an operator with an aggregate function.