New heuristics for over-constrained flight to gate assignments

We consider the over-constrained Airport Gate Assignment Problem where the number of flights exceed the number of gates available, and where the objectives are to minimize the number of ungated flights and the total walking distances. The problem is formulated as a binary quadratic programming problem. We design a greedy algorithm and use a Tabu Search meta-heuristic to solve the problem. The greedy algorithm minimizes ungated flights while we devise a new neighbourhood search technique, the Interval Exchange Move, which allows us flexibility in seeking good solutions, especially when flight schedules are dense in time. Experiments conducted give good results.     

Constructions of economic functions and calculations of marginal rates in DEA using parametric optimization methods

The aim of the paper is to present and substantiate a technique to visualize DEA modelling results without any loss of mathematical rigour. The proposed family of parametric optimization methods allows one to construct an intersection of the multidimensional frontier with a two-dimensional plane determined by any pair of given directions. This approach reduces the efficiency analysis of production units to the investigation of well-known functions in economics. We also propose constructive methods to calculate marginal rates of substitution, marginal rates of transformation and so on.     

Analysing the effect of technical change on individual outputs using modified quasi-Malmquist indexes

Malmquist indexes can be used to estimate technical change over time. The index generally represents the average effect of technical change on all outputs in a multi-output firm. However, changes in technology do not necessarily affect all outputs involved in the analysis equally. In this paper, a method for estimating the effect of technical change on each of the different outputs is proposed. This estimation is done by a modification of quasi-Malmquist indexes. An artificial data set has been used to validate the method proposed in this paper.     

Universal spaces for asymptotic dimension

We construct a universal space for the class of proper metric spaces of bounded geometry and of given asymptotic dimension. As a consequence of this result, we establish coincidence of asymptotic dimension with asymptotic inductive dimension.     

Allocating electricity transmission costs through tracing: a game-theoretic rationale

Tracing is a method of assigning flows in an electricity network to particular generators and loads, assuming perfect mixing at each node. It can be used to assign costs to transmission users. We show that the resulting allocation is equal to the Shapley value of an equivalent co-operative game.     

On the Integrability Conditions for Some Structures Related to Evolution Differential Equations

Using the result by D. Gessler, we show that any invariant variational bivector (resp., variational 2-form) on an evolution equation with nondegenerate right-hand side is Hamiltonian (resp., symplectic).     

On a class of preconditioners for solving the Helmholtz equation

In 1983, a preconditioner was proposed [J. Comput. Phys. 49 (1983) 443] based on the Laplace operator for solving the discrete Helmholtz equation efficiently with CGNR. The preconditioner is especially effective for low wavenumber cases where the linear system is slightly indefinite. Laird [Preconditioned iterative solution of the 2D Helmholtz equation, First Year's Report, St. Hugh's College, Oxford, 2001] proposed a preconditioner where an extra term is added to the Laplace operator. This term is similar to the zeroth order term in the Helmholtz equation but with reversed sign. In this paper, both approaches are further generalized to a new class of preconditioners, the so-called “shifted Laplace” preconditioners of the form Δφ−k²φ with . Numerical experiments for various wavenumbers indicate the effectiveness of the preconditioner. The preconditioner is evaluated in combination with GMRES, Bi-CGSTAB, and CGNR.     

Artificial boundary conditions for Petrovsky systems of second order in exterior domains and in other domains of conical type

The approximation of solutions to boundary value problems on unbounded domains by those on bounded domains is one of the main applications for artificial boundary conditions. Based on asymptotic analysis, here a new method is presented to construct local artificial boundary conditions for a very general class of elliptic problems where the main asymptotic term is not known explicitly. Existence and uniqueness of approximating solutions are proved together with asymptotically precise error estimates. One class of important examples includes boundary value problems for anisotropic elasticity and piezoelectricity. Copyright © 2004 John Wiley & Sons, Ltd.