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.     

A flexible and generic approach to dynamic modelling of supply chains

In this paper, we present a new modelling approach for realistic supply chain simulation. The model provides an experimental environment for informed comparison between different supply chain policies. A basic simulation model for a generic node, from which a supply chain network can be built, has been developed using an object-oriented approach. This generic model allows the incorporation of the information and physical systems and decision-making policies used by each node. The object-oriented approach gives the flexibility in specifying the supply chain configuration and operation decisions, and policies. Stochastic simulations are achieved by applying Latin Supercube Sampling to the uncertain variables in descending order of importance, which reduces the number of simulations required. We also present a case study to show that the model is applicable to a real-life situation for dynamic stochastic studies.     

On the Essential Self-Adjointness of Wick Powers of Relativistic Fields and of Fields Unitary Equivalent to Random Fields

The essential self-adjointness on a natural domain of the sharp-time Wick powers of the relativistic free field in two space-time dimension is proven. Other results on Wick powers are reviewed and discussed.     

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.     

Three-dimensional structure of Saccharomyces cerevisiae inorganic pyrophosphatase complexed with cobalt and phosphate ions

Crystals of Saccharomyces cerevisiae inorganic pyrophosphatase suitable for X-ray diffraction study were grown by cocrystallization of the enzyme with cobalt chloride and imidodiphosphate. Saccharomyces cerevisiae is a metal-dependent enzyme which catalyzes hydrolysis of inorganic pyrophosphate to orthophosphate. The three-dimensional structure of this enzyme was solved by the molecular-replacement method and refined at 1.8 Å resolution to an R factor of 19.5%. Cobalt and phosphate ions were revealed in the active centers of both identical subunits (A and B) of the pyrophosphatase molecule. In subunit B, a water molecule was found between two cobalt ions. It is believed that this water molecule acts as an attacking nucleophile in the enzymatic cleavage of the pyrophosphate bond. It was demonstrated that cobalt ions and a phosphate group occupy only part of the potential binding sites (two chemically identical and crystallographically independent subunits have different binding sites). The arrangement of ligands and the structure of the nucleophile-binding site are discussed in relation to the mechanism of action of the enzyme and the nature of the metal activator.     

Krylov subspaces and the analytic grade

Typical behaviour of the solution of a linear system of equations obtained iteratively by Krylov methods can be characterized by three stages. Initially the residual diminishes steadily; this is followed by stagnation and finally rapid convergence near the algebraic grade. This study examines this behaviour in terms of the concepts of approximately invariant subspace and what we have called the analytic grade of a Krylov sequence. It is shown how the small Ritz values play a vital role in the convergence and how this knowledge helps in the construction of an effective preconditioner. Copyright © 2004 John Wiley & Sons, Ltd.