A network model for gate assignment

In this research we developed a network model that will help the airport authorities assign flights to gates both efficiently and effectively. The model was formulated as a multi-commodity network flow problem. An algorithm based on the Lagrangian relaxation, with subgradient methods, accompanied by a shortest path algorithm and a Lagrangian heuristic was developed to solve the problem. The model was tested using data from Chiang Chiek-Shek Airport.     

Design and evaluation of an automated highway system with optimized lane assignment

Highway automation entails the application of control, sensing and communication technologies to road vehicles, with the objective of improving highway performance. It has been envisioned that automation could increase highway capacity by a factor of three. The purpose of this paper is to develop a methodology for predicting highway capacity and comparing alternative automation concepts. It extends earlier research on optimal lane assignment on an automated highway to dynamic networks. A path-based linear program is formulated and solved through a column generation method. The algorithm has been applied to networks with as many as 20 on and off ramps, 80 segments, 4 lanes and 12 time periods.     

Computer support for operator assignment and dispatching in an urban transit system

The St. Louis Metropolitan Transit Authority, as part of a systematic program to improve maintenance on its buses, is attempting to have operators drive the same vehicle each day. A simulation model was developed for testing the feasibility of the system and testing heuristic rules for parking buses to prevent blockages at scheduled departure times. A mathematical programming procedure is used for assigning buses to runs. An interactive computer system supports parking and dispatching. This article describes the three tools and relates experience with their use.     

Solving the gate assignment problem through the Fuzzy Bee Colony Optimization

In the field of Swarm Intelligence, the Bee Colony Optimization (BCO) has proven to be capable of solving high-level combinatorial problems, like the Flight-Gate Assignment Problem (FGAP), with fast convergence performances. However, given that the FGAP can be often affected by uncertainty or approximation in data, in this paper we develop a new metaheuristic algorithm, based on the Fuzzy Bee Colony Optimization (FBCO), which integrates the concepts of BCO with a Fuzzy Inference System. The proposed method assigns, through the multicriteria analysis, airport gates to scheduled flights based on both passengers’ total walking distance and use of remote gates, to find an optimal flight-to-gate assignment for a given schedule. Comparison of the results with the schedules of real airports has allowed us to show the characteristics of the proposed concepts and, at the same time, it stressed the effectiveness of the proposed method.     

Multi‐objective airport gate assignment problem in planning and operations

We consider the assignment of gates to arriving and departing flights at a large hub airport. This problem is highly complex even in planning stage when all flight arrivals and departures are assumed to be known precisely in advance. There are various considerations that are involved while assigning gates to incoming and outgoing flights (such a flight pair for the same aircraft is called a turn) at an airport. Different gates have restrictions, such as adjacency, last‐in first‐out gates and towing requirements, which are known from the structure and layout of the airport. Some of the cost components in the objective function of the basic assignment model include notional penalty for not being able to assign a gate to an aircraft, penalty for the cost of towing an aircraft with a long layover, and penalty for not assigning preferred gates to certain turns. One of the major contributions of this paper is to provide mathematical model for all these complex constraints that are observed at a real airport. Further, we study the problem in both planning and operations modes simultaneously, and such an attempt is, perhaps, unique and unprecedented. For planning mode, we sequentially introduce new additional objectives to our gate assignment problem that have not been studied in the literature so far—(i) maximization of passenger connection revenues, (ii) minimization of zone usage costs, and (iii) maximization of gate plan robustness—and include them to the model along with the relevant constraints. For operations mode, the main objectives studied in this paper are recovery of schedule by minimizing schedule variations and maintaining feasibility by minimal retiming in the event of major disruptions. Additionally, the operations mode models must have very, very short run times of the order of a few seconds. These models are then applied to a functional airline at one of its most congested hubs. Implementation is carried out using Optimization Programming Language, and computational results for actual data sets are reported. For the planning mode, analyst perception of weights for the different objectives in the multi‐objective model is used wherever actual dollar value of the objective coefficient is not available. The results are also reported for large, reasonable changes in objective function coefficients. For the operations mode, flight delays are simulated, and the performance of the model is studied. The final results indicate that it is possible to apply this model to even large real‐life problems instances to optimality within short run times with clever formulation of conventional continuous time assignment model. Copyright © 2013 John Wiley & Sons, Ltd.     

An expert system for air traffic flow management

An expert system for the air traffic flow management (ATFM) problem is presented. Two main prototypes have been constructed, one for timetable rescheduling that attempts to modify airline timetables to smooth traffic peaks at airports during rush-hours and another for centralized flow control that works to forecast the place, time and magnitude of the congestion and to propose mitigative actions. Simulations for the Brazilian ATFM, including the principal 14 airports, show the potential usefulness of the expert system.     

Selection of expert system shells for traffic signal design

Although the use of expert systems (ESs) as a problem-solving tool is relatively new in the transportation profession, it has been recognized that a well-designed ES can contribute in areas where the knowledge domain requires an integration of expertise from various disciplines or is very complex and difficult to quantify. To minimize the effort involved in developing essential ES mechanisms, researchers often prefer to use ES shells which provide a standard inference procedure, knowledge representation, and a user-friendly design environment. However, commercial ES shells tend to be designed for only certain classes of problems, and are not as general and flexible as programming languages. More than 150 commercial ES shells are available in the microcomputer market. Most ES shells are usually claimed by their vendors to be usable for almost any conceivable applications, but such claims have often proved to be extravagant. Hence, the selection of an efficient yet costeffective commercial shell is one of the most critical tasks in ES development. In reviewing the vital task of ES shell selection, this paper presents our experience in evaluating more than 30 ES shells for developing an ES for signal design. The proposed ES includes signal settings, phasing plans, controllers, and detector locations.     

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.     

A dynamic traffic assignment model for a continuum transportation system

A predictive continuum dynamic user-optimal (PDUO-C) model is formulated in this study to investigate the dynamic characteristics of traffic flow and the corresponding route-choice behavior of travelers within a region with a dense urban road network. The modeled region is arbitrary in shape with a single central business district (CBD) and travelers continuously distributed over the region. Within this region, the road network is represented as a continuum and travelers patronize a two-dimensional continuum transportation system to travel to the CBD. The PDUO-C model is solved by a promising solution algorithm that includes elements of the finite volume method (FVM), the finite element method (FEM), and the explicit total variation diminishing Runge-Kutta (TVD-RK) time-stepping method. A numerical example is given to demonstrate the utility of the proposed model and the effectiveness of the solution algorithm in solving this PDUO-C problem.     

A cell-based Merchant-Nemhauser model for the system optimum dynamic traffic assignment problem

A cell-based variant of the Merchant-Nemhauser (M-N) model is proposed for the system optimum (SO) dynamic traffic assignment (DTA) problem. Once linearized and augmented with additional constraints to capture cross-cell interactions, the model becomes a linear program that embeds a relaxed cell transmission model (CTM) to propagate traffic. As a result, we show that CTM-type traffic dynamics can be derived from the original M-N model, when the exit-flow function is properly selected and discretized. The proposed cell-based M-N model has a simple constraint structure and cell network representation because all intersections and cells are treated uniformly. Path marginal costs are defined using a recursive formula that involves a subset of multipliers from the linear program. This definition is then employed to interpret the necessary condition, which is a dynamic extension of the Wardrop’s second principle. An algorithm is presented to solve the flow holding back problem that is known to exist in many discrete SO-DTA models. A numerical experiment is conducted to verify the proposed model and algorithm.     

Validating expert system prototypes using the turing test

High-performance, expert-level computer systems require that the expert system prototype be continously evaluated during its development. Expert system validation—that is, testing systems to ascertain whether they achieve acceptable performance levels—has with few exceptions been ad hoc, informal, and of dubious value. This paper describes a variant of the Turing Test technique that may be used to formalize the validation process. A microcomputer-based prototype expert system, the Hazardous Location Analyst (HLA), in the accident location analysis domain was used as a case study of the technique. Turing tests provide a blind method for multiple experts to assess expert system performance qualitatively, and provide a means of determining reasonable performance levels for the particular domain. The HLA has been modified based upon findings from the case study work done previously. The improved prototype was implemented in the City of Greensboro, North Carolina, and a set of 10 case studies are analyzed using the HLA, and by a Greensboro traffic engineer. The results were summarized in identical form and mailed to four traffic engineers outside of Greensboro. Their ratings of case study findings were summarized, and the results used to find a reasonable performance level for this application and to assess the performance of the HLA. The consistency of the expert ratings was also assessed. It was concluded that there exists excellent consistency among experts with regard to human performance, but not with regard to the HLA. This paper demonstrates that the Turing Test as a validation methodology provides an objective, quantitative way to assess system performance.     

Design and shared use of a terminal departure lounge for new large aircraft operations

New Large Aircraft (NLA) are new aircraft developments larger than any existing aircraft. The NLA's higher seat capacity will significantly impact passenger terminal design and operations. This paper focuses on the issues regarding the departure lounge. Deterministic queuing theory is used to determine the size and seating configuration of the lounge, as well as to decide whether a second level should be built to accommodate the increase in the number of passengers. The paper also discusses the use of the satellite section of a pier‐satellite terminal as a single lounge for the NLA. Spreadsheets are used to implement the analyses.     

A fuzzy stochastic approach to the multicriteria selection of an aircraft for regional chartering

This article deals with the problem of decision support for the selection of an aircraft. This is a problem faced by an airline company that is investing in regional charter flights in Brazil. The company belongs to an economic group whose core business is logistics. The problem has eight alternatives to be evaluated under 11 different criteria, whose measurements can be exact, stochastic, or fuzzy. The technique chosen for analyzing and then finding a solution to the problem is the multicriteria decision aiding method named NAIADE (Novel Approach to Imprecise Assessment and Decision Environments). The method used allows tackling the problems by working with quantitative as well as qualitative criteria under uncertainty and imprecision. Another considerable advantage of NAIADE over other multicriteria methods relies in its characteristics of not requiring a prior definition of the weights by the decision maker. As a conclusion, it can be said that the use of NAIADE provided for consistent results to that aircraft selection problem. Copyright © 2012 John Wiley & Sons, Ltd.     

Optimal assignment for check-in counters based on passenger arrival behaviour at an airport

Establishing how to utilize check-in counters at airport passenger terminals efficiently is a major concern facing airport operators and airlines. Inadequate terminal capacity and the inefficient utilization of facilities such as check-in counters are major factors causing congestion and delays at airport passenger terminals. However, such delays and congestion can be reduced by increasing the efficiency of check-in counter operations, based on an understanding of passengers' airport access behaviour. This paper presents an assignment model for check-in counter operations, based on passengers' airport arrival patterns. In setting up the model, passenger surveys are used to determine when passengers arrive at the airport terminals relative to their flight departure times. The model then uses passenger arrival distribution patterns to calculate the most appropriate number of check-in counters and the duration of time that each counter should be operated. This assignment model has been applied at the Seoul Gimpo International Airport in Korea. The model provides not only a practical system for the efficient operations of time-to-time check-in counter assignments, but also a valuable means of developing effective longer-term solutions to the problem of passenger terminal congestion and delays. It also offers airlines a means of operating check-in counters with greater cost effectiveness, thus leading to enhanced customer service.     

A microeconomic interpretation for the system optimal traffic assignment problem with nonadditive path cost

Using a Bergson–Samuelson welfare function, we outline a microeconomic interpretation of the effects of the non-linearity in the time/cost relationship for travellers in a congested transport network. It is demonstrated that a marginal cost traffic flow assignment following Wardrop's second principle, although it minimizes the total cost of a transport network, may reduce social welfare compared to the market equilibrium assignment based on Wardrop's first principle. A welfare-maximizing assignment model is presented and used to show that if the travellers' utility functions are linear, the assignment that maximizes social welfare will be the same as the assignment that minimizes total network cost, but if users' utility functions are non-linear (reflecting the traditional non-satiation and diminishing marginal utility axioms), the two assignments will be different. It is further shown that the effects of this non-linearity are such that a welfare-maximizing assignment will meet with less user resistance than a minimum total network cost assignment.     

Design and evaluation of an integrated inventory and transportation system

This paper proposes the adoption of an integrated inventory and transportation system (IITS) to minimize the total costs of inventory and transportation. A non-linear programing is developed by analyzing transportation and inventory costs with one supplier and many retailers in the distribution environment. The paper compares the proposed model with the traditional approach in computing total costs with numerical data. The results indicate that the total costs can be optimized by adopting integrated programing rather than the traditional approach, along with achieving improved customer service levels. In particular, sensitivity analysis is applied to determine the performance of the IITS under various transportation costs, holding costs and shortage costs. It shows that the transportation cost per unit is most sensitive in the proposed model. In this situation, the IITS is more effective for cost saving when set-up cost, holding and shortage costs are high, but is less effective for situations involving high per-unit transportation costs.     

Algorithms for logit-based stochastic user equilibrium assignment

The paper proposes an efficient algorithm for determining the stochastic user equilibrium solution for logit-based loading. The commonly used Method of Successive Averages typically has a very slow convergence rate. The new algorithm described here uses Williams’ result [ Williams, (1977) On the formation of travel demand models and economic evaluation measures of user benefit. Environment and Planning 9A(3), 285–344] which enables the expected value of the perceived travel costs S_rs to be readily calculated for any flow vector x. This enables the value of the Sheffi and Powell, 1982 objective function [Sheffi, Y. and Powell, W. B. (1982) An algorithm for the equilibrium assignment problem with random link times. Networks 12(2), 191–207], and its gradient in any specified search direction, to be calculated. It is then shown how, at each iteration, an optimal step length along the search direction can be easily estimated, rather than using the pre-set step lengths, thus giving much faster convergence. The basic algorithm uses the standard search direction (towards the auxiliary solution). In addition the performance of two further versions of the algorithm are investigated, both of which use an optimal step length but alternative search directions, based on the Davidon–Fletcher–Powell function minimisation method. The first is an unconstrained and the second a constrained version. Comparisons are made of all three versions of the algorithm, using a number of test networks ranging from a simple three-link network to one with almost 3000 links. It is found that for all but the smallest network the version using the standard search direction gives the fastest rate of convergence. Extensions to allow for multiple user classes and elastic demand are also possible.     

Estimation of rail passenger flow and system utilization with ticket transaction and gate data

Capturing the dynamics in passenger flow and system utilization over time and space is extremely important for railway operators. Previous studies usually estimated passenger flow using automatic fare collection data, and their applications are limited to a single stopping pattern and/or a single type of ticket. However, the conventional railway in Taiwan provides four types of ticket and five types of train service with a number of stopping patterns. This study develops a comprehensive framework and corresponding algorithms to map passenger flow and evaluate system utilization. A multinomial logit model is constructed and incorporated in the algorithms to estimate passenger train selection behavior. Results from the empirical studies demonstrate that the developed framework and algorithms can successfully match passengers with train services. With this tool, operators can efficiently examine passenger flow and service utilization, thereby quickly adjusting their service strategies accordingly to improve system performance.     

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.     

A simulation framework for evaluating airport gate assignments

There are many factors that affect gate assignments in an airport's operations. These factors include static gate assignments, stochastic flight delays and real-time gate assignments. Most research on gate assignments in the past has laid stress on improving the performance of static gate assignments. None has analyzed the interrelationship between static gate assignments and real-time gate assignments as affected by the stochastic flight delays that occur in real operations. In addition, none has designed flexible buffer times for static gate assignments to effectively absorb stochastic delays in real-time gate assignments. This research proposes a simulation framework, that is not only able to analyze the effects of stochastic flight delays on static gate assignments, but can also evaluate flexible buffer times and real-time gate assignment rules. Finally, a simulation based on Chiang Kai-Shek airport operations is performed to evaluate the simulation framework.