A dynamic shortest path algorithm using multi‐step ahead link travel time prediction

In this paper, a multi‐step ahead prediction algorithm of link travel speeds has been developed using a Kalman filtering technique in order to calculate a dynamic shortest path. The one‐step and the multi‐step ahead link travel time prediction models for the calculation of the dynamic shortest path have been applied to the directed test network that is composed of 16 nodes: 3 entrance nodes, 2 exit nodes and 11 internal nodes. Time‐varying traffic conditions such as flows and travel time data for the test network have been generated using the CORSIM model. The results show that the multi‐step ahead algorithm is compared more favorably for searching the dynamic shortest time path than the other algorithm.     

Sequential optimization approach for the multi‐class user equilibrium problem in a continuous transportation system

We consider a city region with several facilities that are competing for customers of different classes. Within the city region, the road network is dense, and can be represented as a continuum. Customers are continuously distributed over space, and they choose a facility by considering both the transportation cost and market externalities. More importantly, the model takes into account the different transportation cost functions and market externalities to which different customer classes are subjected. A logit‐type distribution of demand is specified to model the decision‐making process of users' facility choice. We develop a sequential optimization approach to decompose the complex multi‐class and multi‐facility problem into a series of smaller single‐class and single‐facility sub‐problems. An efficient solution algorithm is then proposed to solve the resultant problem. A numerical example is given to demonstrate the effectiveness and potential applicability of the proposed methodology.     

An integrated multi‐objective model to determine the optimal rescue path and traffic controlled arcs for disaster relief operations under uncertainty environments

This study proposes an integrated multi‐objective model to determine the optimal rescue path and traffic controlled arcs for disaster relief operations under uncertainty environments. The model consists of three sub‐models: rescue shortest path model, post‐disaster traffic assignment model, and traffic controlled arcs selection model to minimize four objectives: travel time of rescue path, total detour travel time, number of unconnected trips of non‐victims, and number of police officers required. Since these sub‐models are inter‐related with each other, they are solved simultaneously. This study employs genetic algorithms incorporated with traffic assignment and K‐shortest path methods to determine optimal rescue path and controlled arcs. To cope with uncertain information associated with the damaged network, fuzzy system reliability theory (weakest t‐norm method) is used to measure the access reliability of rescue path. To investigate the validity and applicability of the proposed model, studies on an exemplified case and a field case of Chi‐Chi earthquake in Taiwan are conducted. The performances of three rescue strategies: without traffic control, selective traffic control (i.e. the proposed model) and absolute traffic control are compared. The results show that the proposed model can maintain the efficiency of rescue activity with minimal impact to ordinary trips and number of police officers required.     

The multi‐actor,multi‐criteria analysis methodology (MAMCA) for the evaluation of transport projects: Theory and practice

In this paper the multi‐actor multi‐criteria analysis (MAMCA) method to evaluate transport projects is presented. This evaluation method specifically focuses on the inclusion of qualitative as well as quantitative criteria with their relative importance, defined by the multiple stakeholders, into one comprehensive evaluation process in order to facilitate the decision making process by the different stakeholders. The MAMCA methodology is introduced by an overview of other evaluation methods for transport projects in the past and is illustrated by means of two practical cases. The introduction will lead us to the theoretical conception of the MAMCA method where we draw the attention to the proven usefulness of the MAMCA for the evaluation of transport projects and the inclusion of different kinds of stakeholders, individuals as well as groups, into the evaluation process.     

A modified Frank-Wolfe algorithm for solving the traffic assignment problem

This paper presents a very simple modification of the Frank-Wolfe algorithm for the solution of the traffic assignment problem. It is shown that the modified algorithm can be implemented without much increase in computational effort over the original one. Convergence of the algorithm is proved and computational results are reported to demonstrate the validity of the modification.     

An algorithm for the combined distribution and assignment problem

Much interest has recently been shown in the combination of the distribution and assignment models. In this paper we adopt a generalized Benders' decomposition to solve this combined problem for a system optimized assignment with linear link costs and explicit capacity constraints on link flows. The master problem which is generated is used to show that the combined problem can be viewed as a modified distribution problem, of gravity form, with a minimax instead of a linear objective function. An algorithm for solving the master problem is discussed, and some computational results presented.     

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.     

Urban spatial location advantage: The dual of the transportation problem and its implications for land-use and transport planning

Numerous recent studies have investigated the relationship between the location of jobs and housing in urban areas and how this relates to urban commuting patterns. Few have utilised the dual of the transportation problem of linear programming (TPLP) to provide insights into these relationships Accordingly, this analysis utilises the TPLP to determine dual variable values (shadow prices) for a study area in Dublin, Ireland. The approach determines the pattern of relative location advantage for the peak and off-peak travel periods and for public and private transport for 1991 and 2001. The results are set against the expected results for hypothetical urban structures. The results show that the pattern of relative location advantage has altered sharply over the study period for off-peak trip-making but has remained more or less the same for trip-making in the peak period. For the off-peak period, the pattern of relative location advantage has shifted from the central area to the periphery specifically for private transport trips; for public transport, the pattern has remained focused on the city centre. This indicates that private transport users can react more quickly to changes in the distribution of land-use activities than their public transport counterparts due to the relatively fixed nature of the latter mode. This implies that the public transport network needs to be reorganized to better reflect the revised pattern of trip-making specifically for the off-peak period. The results demonstrate the value of using the approach for providing information about the spatial organisation of land uses within cities and where future development may be targeted.     

A heuristic for the train pathing and timetabling problem

In a railroad system, train pathing is concerned with the assignment of trains to links and tracks, and train timetabling allocates time slots to trains. These important tasks were traditionally done manually, but there is an increasing move toward automated software based on mathematical models and algorithms. Most published models in the literature either focus on train timetabling only, or are too complicated to solve when facing large instances. In this paper, we present an optimization heuristic that includes both train pathing and train timetabling, and has the ability to solve real-sized instances. This heuristic allows the operation time of trains to depend on the assigned track, and also lets the minimum headway between the trains to depend on the trains’ relative status. It generates an initial solution with a simple rule, and then uses a four-step process to derive the solution iteratively. Each iteration starts by altering the order the trains travel between stations, then it assigns the services to the tracks in the stations with a binary integer program, determines the order they pass through the stations with a linear program, and uses another linear program to produce a timetable. After these four steps, the heuristic accepts or rejects the new solution according to a Threshold Accepting rule. By decomposing the original complex problem into four parts, and by attacking each part with simpler neighborhood-search processes or mathematical programs, the heuristic is able to solve realistic instances. When tested with two real-world examples, one from a 159.3 km, 29-station railroad that offers 44 daily services, and another from a 345 km, eight-station high-speed rail with 128 services, the heuristic obtained timetables that are at least as good as real schedules.     

A relationship between the gravity model for trip distribution and the transportation problem in linear programming

A gravity model for trip distribution describes the number of trips between two zones as a product of three factors; one is associated with the zone in which a trip begins, one with the zone in which it ends and the third with the separation between the zones. The separation or deterrence factor is usually a decreasing function of the generalized cost of travelling between the zones, where generalized cost is usually some combination of the time of travel, the distance travelled and the actual monetary costs.If the deterrence factor is of the exponential form exp (-αc) and if the total numbers of origins and destinations in each zone are known, then the resulting trip matrix depends solely on α. In this paper it is shown that as α tends to infinity, this trip matrix tends to a limit in which the total cost of trips is the least possible allowed by the given origin and destination totals. That is to say the limit is a cost-minimizing solution to the linear programming transportation problem having the same origin and destination totals. If this transportation problem has many cost-minimizing solutions then it is shown that the limit is one particular solution in which each non-zero flow from an origin i to a destination j is of the form r_is_j. A numerical example is given.     

A methodological framework for the study of residential location and travel-to-work mode choice under central and suburban employment destination patterns

The aim of this paper is to contribute to the methodological questions that arise from the study of the simultaneous choice of residential location and travel-to-work mode under central and non-central or suburban employment patterns. Geographic information system (GIS) visualisations and network analysis are used to generate a choice set based on the definition of spatially aggregated alternatives. Discrete choice models specified as cross-nested logit (CNL) are estimated for each of the two different types of employment patterns and direct and cross elasticities are presented. The analysis is carried out for the Greater Dublin Area, a metropolitan region that is a recent example of rapid employment suburbanisation and residential sprawl in a European context. A simulation exercise, tracing the extent of mode switching and location switching behaviour is undertaken using the framework developed.     

Evacuee behaviors and factors affecting the tsunami trip generation model: A case study in phang‐nga,Thailand

A significant amount of research has focused on various types of evacuations, but little attention has been given to tsunami evacuation in the past. The purpose of this study was to investigate evacuee behaviors and factors affecting tsunami evacuation. The intention was also to analyze tsunami trip generation models. A data set of evacuation behavior was collected in an affected area, Baan Namkhem, Phang‐Nga Province, Thailand, following the Indian Ocean tsunami of December 26, 2004. The study was undertaken to determine evacuee response patterns in different conditions. Tsunami trip generation models were employed, using a binary logistic regression technique, to estimate the likelihood of evacuees being involved in each response pattern. It was found that the patterns of evacuee response to an emergency are different among the three conditions. Six factors (education level, ownership of the residence, distance to nearest seashore, disaster knowledge, number of household members, and status of respondent — permanent or transient) were found to be statistically significant. The results of this study can be used to improve the efficiency and effectiveness of future evacuation systems in Thailand.