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.     

Crossdocking—JIT scheduling with time windows

In this paper, we study a problem central to crossdocking that aims to eliminate or minimize storage and order picking activity using JIT scheduling. The problem is modelled naturally as a machine scheduling problem. As the problem is NP-hard, and for real-time applications, we designed and implemented two heuristics. The first uses Squeaky Wheel Optimization embedded in a Genetic Algorithm and the second uses Linear Programming within a Genetic Algorithm. Both heuristics offer good solutions in experiments where comparisons are made with the CPLEX solver.     

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.     

Some heteroclinic solutions of a model of skin pattern formation

In this paper we study travelling wave solutions to a system of four non‐linear partial differential equations, which arise in a tissue interaction model for skin morphogenesis. Under the ‘small‐stress’ assumption we prove the existence and uniqueness (up to a translation) of solutions with the dermis and epidermis cell densities being positive, which are a perturbation of a uniform epidermal cell density. We discuss the problem of the minimal wave‐speed. Copyright © 2004 John Wiley & Sons, Ltd.     

Parabolic Capacity and Soft Measures for Nonlinear Equations

We first introduce, using a functional approach, the notion of capacity related to the parabolic p-Laplace operator. Then we prove a decomposition theorem for measures (in space and time) that do not charge the sets of null capacity. We apply this result to prove existence and uniqueness of renormalized solutions for nonlinear parabolic initial boundary-value problems with such measures as right-hand side.     

Filter-radiometer-based realization of candela and establishment of photometric scale at UME

The luminous intensity unit of candela was realized based on filter-radiometer, which is traceable to detector-based primary standard electrical substitution cryogenic radiometer (ESCR). In that realization the traditional Osram Wi41/G-type incandescent lamp and filter-radiometer consisting of an aperture, a V(λ) filter and a silicon photodiode based trap detector were used as light source and detection element, respectively. Measurement techniques of effective aperture area, spectral transmittance of V(λ) filter and absolute responsivity of trap detector are also presented.