Locating emergency vehicles with an approximate queuing model and a meta-heuristic solution approach

In this paper, the location of emergency service (ES) vehicles is studied on fully connected networks. Queuing theory is utilized to obtain the performance metrics of the system. An approximate queuing model the (AQM) is proposed. For the AQM, different service rate formulations are constructed. These formulations are tested with a simulation study for different approximation levels. A mathematical model is proposed to minimize the mean response time of ES systems based on AQM. In the model, multiple vehicles are allowed at a single location. The objective function of the model has no closed form expression. A genetic algorithm is constructed to solve the model. With the help of the genetic algorithm, the effect of assigning multiple vehicles on the mean response time is reported.     

Strategic considerations behind the network–regional airline tie ups – A theoretical and empirical study

The paper examines the strategic vertical relationship between network and regional airlines. We develop a model to illustrate how network airlines can use the contractual relationship with regional airlines as an efficient tool to simultaneously drive out inefficient network airlines and also accommodate other cost efficient network airlines in any specific market. The model is tested on U.S. data using simultaneous and sequential choice models. We find that market size, cost differences between network airlines, as well as cost differences between network and regional airlines, are the chief determinants of the network airlines’ decisions on whether or not to serve a market with their own fleet, as well as how many regional airlines to contract with.     

Compromising system and user interests in shelter location and evacuation planning

Traffic management during an evacuation and the decision of where to locate the shelters are of critical importance to the performance of an evacuation plan. From the evacuation management authority’s point of view, the desirable goal is to minimize the total evacuation time by computing a system optimum (SO). However, evacuees may not be willing to take long routes enforced on them by a SO solution; but they may consent to taking routes with lengths not longer than the shortest path to the nearest shelter site by more than a tolerable factor. We develop a model that optimally locates shelters and assigns evacuees to the nearest shelter sites by assigning them to shortest paths, shortest and nearest with a given degree of tolerance, so that the total evacuation time is minimized. As the travel time on a road segment is often modeled as a nonlinear function of the flow on the segment, the resulting model is a nonlinear mixed integer programming model. We develop a solution method that can handle practical size problems using second order cone programming techniques. Using our model, we investigate the importance of the number and locations of shelter sites and the trade-off between efficiency and fairness.     

Robust weekly aircraft maintenance routing problem and the extension to the tail assignment problem

In this paper, we study two closely related airline planning problems: the robust weekly aircraft maintenance routing problem (RWAMRP) and the tail assignment problem (TAP). In real life operations, the RWAMRP solution is used in tactical planning whereas the TAP solution is implemented in operational planning. The main objective of these two problems is to minimize the total expected propagated delay (EPD) of the aircraft routes. To formulate the RWAMRP, we propose a novel weekly line-of-flights (LOF) network model that can handle complex and nonlinear cost functions of EPD. Because the number of LOFs grows exponentially with the number of flights to be scheduled, we propose a two-stage column generation approach to efficiently solve large-scale real-life RWAMRPs. Because the EPD of an LOF is highly nonlinear and can be very time-consuming to accurately compute, we propose three lower bounds on the EPD to solve the pricing subproblem of the column generation. Our approach is tested on eight real-life test instances. The computational results show that the proposed approach provides very tight LP relaxation (within 0.6% of optimal solutions) and solves the test case with more than 6000 flights per week in less than three hours. We also investigate the solutions obtained by our approach over 500 simulated realizations. The simulation results demonstrate that, in all eight test instances, our solutions result in less EPDs than those obtained from traditional methods. We then extend our model and solution approach to solve realistically simulated TAP instances.     

Data dependent input control for origin–destination demand estimation using observability analysis

In this paper, we address the observability issue of static O–D estimation based on link counts. Unlike most classic observability analyses that relied only on network topological relationships, our analysis incorporates the actual values of input parameters, thus including network operational relations as well. We first analyze possible mathematical properties of an O–D estimation problem with different data input. We then propose a modeling approach based on mixed-integer program for selecting model input that ensures observability and estimation quality. Through establishing a stronger connection between observability analysis and the corresponding estimation problem, the proposed method aims to improve estimation quality while reducing reliance on erroneous data.     

Airline network choice and market coverage under high-speed rail competition

While the existing literature has focused on the short-term impacts, this paper investigates the long-term impacts of high-speed rail (HSR) competition on airlines. An analytical model is developed to study how an airline may change its network and market coverage when facing HSR competition on trunk routes. We show that prior to HSR competition, an airline is more likely to adopt a fully-connected network and cover fewer fringe markets if the trunk market is large. Under HSR competition, the airline will, for a given network structure, have a greater incentive to cover more fringe (regional or foreign) markets if the trunk market is large, or the airline network is close to hub-and-spoke. Further, the airline will, for any given market coverage, move towards a hub-and-spoke network when the trunk market is large, or the number of fringe markets covered by the airline network is large. Both effects are more prominent when the decreasing rate of airline density economies is large. We further show that HSR competition can induce the airline to adopt network structure and market coverage that are closer to the socially optimal ones, thereby suggesting a new source of welfare gain from HSR based on its long-term impacts on airlines. Implications for operators, policy makers and specific countries (such as China) are also discussed.     

Optimal locations and travel time display for variable message signs

This paper first develops a network equilibrium model with the travel time information displayed via variable message signs (VMS). Specifically, the equilibrium considers the impact of the displayed travel time information on travelers’ route choices under the recurrent congestion, with the endogenous utilization rates of displayed information by travelers. The existence of the equilibrium is proved and an iterative solution procedure is provided. Then, we conduct the sensitivity analyses of the network equilibrium and further propose a paradox, i.e., providing travel time information via VMS to travelers may degrade the network performance under some poor designs. Therefore, we investigate the problem of designing the VMS locations and travel time display within a given budget, and formulate it as a mixed integer nonlinear program, solved by an active-set algorithm. Lastly, numerical examples are presented to offer insights on the equilibrium results and optimal designs of VMS.     

Path-constrained traffic assignment: A trip chain analysis under range anxiety

This paper proposes and analyzes a distance-constrained traffic assignment problem with trip chains embedded in equilibrium network flows. The purpose of studying this problem is to develop an appropriate modeling tool for characterizing traffic flow patterns in emerging transportation networks that serve a massive adoption of plug-in electric vehicles. This need arises from the facts that electric vehicles suffer from the “range anxiety” issue caused by the unavailability or insufficiency of public electricity-charging infrastructures and the far-below-expectation battery capacity. It is suggested that if range anxiety makes any impact on travel behaviors, it more likely occurs on the trip chain level rather than the trip level, where a trip chain here is defined as a series of trips between two possible charging opportunities (Tamor et al., 2013). The focus of this paper is thus given to the development of the modeling and solution methods for the proposed traffic assignment problem. In this modeling paradigm, given that trip chains are the basic modeling unit for individual decision making, any traveler’s combined travel route and activity location choices under the distance limit results in a distance-constrained, node-sequenced shortest path problem. A cascading labeling algorithm is developed for this shortest path problem and embedded into a linear approximation framework for equilibrium network solutions. The numerical result derived from an illustrative example clearly shows the mechanism and magnitude of the distance limit and trip chain settings in reshaping network flows from the simple case characterized merely by user equilibrium.     

Ordered median hub location problems with capacity constraints

The Single Allocation Ordered Median Hub Location problem is a recent hub model introduced in Puerto et al. (2011) that provides a unifying analysis of a wide class of hub location models. In this paper, we deal with the capacitated version of this problem, presenting two formulations as well as some preprocessing phases for fixing variables. In addition, a strengthening of one of these formulations is also studied through the use of some families of valid inequalities. A battery of test problems with data taken from the AP library are solved where it is shown that the running times have been significantly reduced with the improvements presented in the paper.