Capacitated maximum covering location models: Formulations and solution procedures

This paper presents two formulations and two solution procedures for a capacitated maximum covering location problem. In the first formulation, the problem is presented as a mixed-interger linear programming model which maximizes covered demand. In the second model, the objective function maximizes the weighted covered demand while at the same time minimizing the average distance from the uncovered demands to the located facilities. The second formulation attempts to account for the assignment of the demand which is not “covered” to located facilities which have excess capacity. This assignment is very important, especially for locating emergency service facilities. Two heuristic procedures are proposed to solve these models. These are based on greedy adding technique and Lagrangian relaxation. At each iteration, the demands are allocated to the facilities using an out-of-kilter method. The performance of the solution techniques are compared to the optimal solutions in a variety of test problems.     

The effectiveness of a European speed limit versus an international bunker-levy to reduce CO2 emissions from container shipping

In the fight to reduce CO₂ emissions from international shipping, a bunker-levy is currently under consideration at the International Maritime Organization (IMO). Faced with the inability of the IMO to reach an agreement in the short term, the European Commission is now contemplating a unilateral measure of a speed limit for all ships entering European Union (EU) ports. This paper argues that this measure is counterproductive for two reasons. Firstly, because it may ultimately generate more emissions and incur a cost per ton of CO₂ which is more than society is willing to pay. Secondly, because it is sub-optimal compared to results obtained if an international bunker-levy was to be implemented. These elements are illustrated using two direct transatlantic services operated in 2010.     

Response spectrum method for extreme wave loading with higher order components of drag force

Response spectra of fixed offshore structures impacted by extreme waves are investigated based on the higher order components of the nonlinear drag force. In this way, steel jacket platforms are simplified as a mass attached to a light cantilever cylinder and their corresponding deformation response spectra are estimated by utilizing a generalized single degree of freedom system. Based on the wave data recorded in the Persian Gulf region, extreme wave loading conditions corresponding to different return periods are exerted on the offshore structures. Accordingly, the effect of the higher order components of the drag force is considered and compared to the linearized state for different sea surface levels. When the fundamental period of the offshore structure is about one third of the main period of wave loading, the results indicate the linearized drag term is not capable of achieving a reliable deformation response spectrum.     

Modeling adoption timing of autonomous vehicles: innovation diffusion approach

Autonomous vehicles (AVs) are expected to act as an economically-disruptive transportation technology offering several benefits to the society and causing significant changes in travel behavior and network performance. However, one of the critical issues that policymakers are facing is the absence of a sound estimation of their market penetration. This study is an effort to quantify the effect of different drivers on the adoption timing of AVs. To this end, we develop an innovation diffusion model in which individuals’ propensities to adopt a new technology such as AVs takes influence from a desire to innovate and a need to imitate the rest of the society. It also captures various sources of inter-personal heterogeneity. We found that conditional on our assumptions regarding the changes in market price of AVs over time, their market penetration in our study region (Chicago metropolitan area) will eventually reach 71.3%. Further, model estimation results show that a wide range of socio-demographic factors, travel pattern indicators, technology awareness, and perceptions of AVs are influential in people’s AV adoption timing decision. For instance, frequent long-distance travelers are found to make the adoption decision more innovatively while those who have experienced an accident in their lifetime are found to be more influenced by word of mouth.     

On the use of mathematical programming in the evaluation of transport policies

This paper focuses on the evaluation processes by which decisions regarding transportation alternatives can be assisted. A multidimensional approach usually called multiple criteria decision making is required to represent the complexity of transportation policy and systems.

The multiple criteria decision making techniques can be divided into two groups. The first is based on a ranking scheme approach and the second on a mathematical programming approach.

A multiple objective mathematical programming procedure known as Goal Programming is presented. The authors examined the use of that procedure in real transportation problems.

The results suggest that multiple objective mathematical programming techniques in general do not appear to be appropriate in transportation policy analysis involving mutually exclusive alternatives. Their use can be limited to special cases in the private sector.     

A time‐staged multi‐objective network‐design model

A multi‐objective, time‐staged network‐design problem is formulated. Through transformation, the problem is decomposed into a set of single‐period, single‐objective problems. Lexicographic ordering is instrumental in effecting this transformation; it also allows a backward‐recursion algorithm to be applied using strong pruning criteria. Furthermore, monotonicity properties enable us to solve the problem using the familiar tree‐search algorithms. The solution method has several desirable properties — as shown by an example and a case study of Tripoli Province, Libya. First, the algorithm ensures continuity of project implementation over the multi time‐periods and provides optimality in later computational stages irrespective of the decision at an interim stage. Second, the algorithm tends to provide accessibility to unconnected regions in the study area at low user‐cost without employing weights to the two objective functions of accessibility and user‐cost efficiency. Such a property is deemed advantageous for suggesting transportation investments based purely on purchasing the greatest benefit for each dollar, with political neutrality strictly maintained.     

An algorithm for finding reasonable paths in transit networks

In this paper, reasonable paths in transit networks are defined as possible paths that satisfy the acceptable time criterion and transfer‐walk criterion. A recursive algorithm for finding all of the reasonable paths in a transit network that does not involve a rapid increase in program run‐time with network size is presented. Realistic transit networks in Hong Kong and Guangzhou were selected as case studies of the different phases of the development of a trip planning system. Transport planning practitioners and potential users were invited to test the system to evaluate its performance. The results of the prototype evaluation were satisfactory, and the viability of the system as a useful tool for supporting decision‐making has been confirmed by the positive feedback that was obtained from survey questionnaires.     

Value of travel time: An activity‐based analysis with combined RP and SP data

Under certain assumptions, values of travel time (VOT) can be divided into two parts: one associated with travel (i.e., the value of reducing travel time disutility) and the other associated with activities (the shadow price of time). The empirical results of combining RP and SP data showed that the VOT of travel was greater than that of activity. The results also showed that SP experiments that did not take or only took part of activities into consideration would underestimate VOT.     

Automation of paratransit reservation,routing, and scheduling

Santa Clara County, California experienced a sharp growth in demand‐responsive paratransit ridership for individuals with disabilities, as a result of the passage of the 1990 Americans With Disabilities Act (ADA). This paper describes an automated paratransit system for the ADA‐type paratransit operation implemented in Santa Clara County. It automated paratransit reservation, scheduling, and routing functions. The key components of this system were a digital geographic database (DGD) and an automated trip scheduling system (ATSS). Empirical evidence after one year of operation indicates numerous benefits of this automation. There were significant reductions in the paratransit operating costs and an increase in the percent shared rides. The savings in operating costs far exceeded the annualized capital cost of automation. A user survey indicates that these improvements were achieved without degradation to service quality such as vehicle on‐time performance, invehicle travel times, vehicle response to open return, and ride comfort.     

The planning of aircraft routes and flight frequencies in an airline network operations

This research is aimed at developing a model that maximizes system profit when determining the aircraft routes and flight frequencies in a network. The model employs network flow techniques to effectively collect or deliver passenger flows from all origins to all destinations using non‐stop and multi‐stop flights in multi‐fleet operations. The model was formulated as a multi‐commodity network flow problem. A Lagrangian‐based algorithm was developed to solve the problem. To test the model in practice, a case study is presented.