New simple and efficient heuristics for the uncapacitated single allocation hub location problem

Hub-and-spoke networks are widely studied in the area of location theory. They arise in several contexts, including passenger airlines, postal and parcel delivery, and computer and telecommunication networks. Hub location problems usually involve three simultaneous decisions to be made: the optimal number of hub nodes, their locations and the allocation of the non-hub nodes to the hubs. In the uncapacitated single allocation hub location problem (USAHLP) hub nodes have no capacity constraints and non-hub nodes must be assigned to only one hub. In this paper, we propose three variants of a simple and efficient multi-start tabu search heuristic as well as a two-stage integrated tabu search heuristic to solve this problem. With multi-start heuristics, several different initial solutions are constructed and then improved by tabu search, while in the two-stage integrated heuristic tabu search is applied to improve both the locational and allocational part of the problem. Computational experiments using typical benchmark problems (Civil Aeronautics Board (CAB) and Australian Post (AP) data sets) as well as new and modified instances show that our approaches consistently return the optimal or best-known results in very short CPU times, thus allowing the possibility of efficiently solving larger instances of the USAHLP than those found in the literature. We also report the integer optimal solutions for all 80 CAB data set instances and the 12 AP instances up to 100 nodes, as well as for the corresponding new generated AP instances with reduced fixed costs. Published by Elsevier Ltd.

The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm

This paper addresses the single machine scheduling problem with a common due date aiming to minimize earliness and tardiness penalties. Due to its complexity, most of the previous studies in the literature deal with this problem using heuristics and metaheuristics approaches. With the intention of contributing to the study of this problem, a branch-and-bound algorithm is proposed. Lower bounds and pruning rules that exploit properties of the problem are introduced. The proposed approach is examined through a computational comparative study with 280 problems involving different due date scenarios. In addition, the values of optimal solutions for small problems from a known benchmark are provided.

Some heuristic algorithms for total tardiness minimization in a flowshop with blocking

The flowshop scheduling problem with blocking in-process is addressed in this paper. In this environment, there are no buffers between successive machines: therefore intermediate queues of jobs waiting in the system for their next operations are not allowed. Heuristic approaches are proposed to minimize the total tardiness criterion. A constructive heuristic that explores specific characteristics of the problem is presented. Moreover, a GRASP-based heuristic is proposed and Coupled with a path relinking strategy to search for better outcomes. Computational tests are presented and the comparisons made with an adaptation of the NEH algorithm and with a branch-and-bound algorithm indicate that the new approaches are promising. (c) 2007 Elsevier Ltd. All rights reserved.

A wavelet-based adaptive technique for adsorption problems involving steep gradients

A general, fast wavelet-based adaptive collocation method is formulated for heat and mass transfer problems involving a steep moving profile of the dependent variable. The technique of grid adaptation is based on sparse point representation (SPR). The method is applied and tested for the case of a gas–solid non-catalytic reaction in a porous solid at high Thiele modulus. Accurate and convergent steep profiles are obtained for Thiele modulus as large as 100 for the case of slab and found to match the analytical solution.

Computationally efficient solution techniques for adsorption problems involving steep gradients in bidisperse particles

A piecewise uniform fitted mesh method turns out to be sufficient for the solution of a surprisingly wide variety of singularly perturbed problems involving steep gradients. The technique is applied to a model of adsorption in bidisperse solids for which two fitted mesh techniques, a fitted-mesh finite difference method (FMFDM) and fitted mesh collocation method (FMCM) are presented. A combination (FMCMD) of FMCM and the DASSL integration package is found to be most effective in solving the problems. Numerical solutions (FMFDM and FMCMD) were found to match the analytical solution when the adsorption isotherm is linear, even under conditions involving steep gradients for which global collocation fails. In particular, FMCMD is highly efficient for macropore diffusion control or micropore diffusion control. These techniques are simple and there is no limit on the range of the parameters. The techniques can be applied to a variety of adsorption and desorption problems in bidisperse solids with non-linear isotherm and for arbitrary particle geometry.

Gauge P-representations for quantum-dynamical problems: Removal of boundary terms

P-representation techniques, which have been very successful in quantum optics and in other fields, are also useful for general bosonic quantum-dynamical many-body calculations such as Bose-Einstein condensation. We introduce a representation called the gauge P representation, which greatly widens the range of tractable problems. Our treatment results in an infinite set of possible time evolution equations, depending on arbitrary gauge functions that can be optimized for a given quantum system. In some cases, previous methods can give erroneous results, due to the usual assumption of vanishing boundary conditions being invalid for those particular systems. Solutions are given to this boundary-term problem for all the cases where it is known to occur: two-photon absorption and the single-mode laser. We also provide some brief guidelines on how to apply the stochastic gauge method to other systems in general, quantify the freedom of choice in the resulting equations, and make a comparison to related recent developments.

Impact of Commercial Search Engines and International Databases on Engineering Teaching and Research

For the last three decades, the engineering higher education and professional environments have been completely transformed by the "electronic/digital information revolution" that has included the introduction of personal computer, the development of email and world wide web, and broadband Internet connections at home. Herein the writer compares the performances of several digital tools with traditional library resources. While new specialised search engines and open access digital repositories may fill a gap between conventional search engines and traditional references, these should be not be confused with real libraries and international scientific databases that encompass textbooks and peer-reviewed scholarly works. An absence of listing in some Internet search listings, databases and repositories is not an indication of standing. Researchers, engineers and academics should remember these key differences in assessing the quality of bibliographic "research" based solely upon Internet searches.

Existence of Multiple Solutions for Second Order Boundary Value Problems

We give conditions on f involving pairs of lower and upper solutions which lead to the existence of at least three solutions of the two point boundary value problem y" + f(x, y, y') = 0, x epsilon [0, 1], y(0) = 0 = y(1). In the special case f(x, y, y') = f(y) greater than or equal to 0 we give growth conditions on f and apply our general result to show the existence of three positive solutions. We give an example showing this latter result is sharp. Our results extend those of Avery and of Lakshmikantham et al.

Nodal solutions for nonlinear eigenvalue problems

We are concerned with determining values of, for which there exist nodal solutions of the boundary value problems u" + ra(t) f(u) = 0, 0 < t < 1, u(O) = u(1) = 0. The proof of our main result is based upon bifurcation techniques.

Useful representations of series solutions for transport problems

Simple techniques are presented for rearrangement of an infinite series in a systematic way such that the convergence of the resulting expression is accelerated. These procedures also allow calculation of required boundary derivatives. Several examples of conduction and diffusion-reaction problems illustrate the methods.

An improved novel method for solving nonlinear boundary value problems

A modified formula for the integral transform of a nonlinear function is proposed for a class of nonlinear boundary value problems. The technique presented in this paper results in analytical solutions. Iterations and initial guess, which are needed in other techniques, are not required in this novel technique. The analytical solutions are found to agree surprisingly well with the numerically exact solutions for two examples of power law reaction and Langmuir-Hinshelwood reaction in a catalyst pellet.

(FAB12_1_002) 'Would you know the new, you must search the old': William Lethaby's 'Architecture, Mysticism and Myth' (1891) and the 'Hypnerotomachia Poliphili' (1499)

Published in the final months of 1891, Architecture, Mysticism and Myth was the first architectural treatise written by the late nineteenth-century English architect and theorist William Richard Lethaby (1857-1931).' Documenting the characteristic attributes of the architectural myth of the "temple idea", and its presence amongst architectures of multiple ancient cultures, the text was endowed with a distinctly historical tone. In examining the motives behind myth, which Lethaby defined as the interaction and reaction between the natural universe and the built environment, Lethaby also injected a series of theoretical considerations into the text. It is clear that Lethaby's interest in the temple idea was not limited to its curious, prolific presence in past architectures, hut also embraced a consideration of what lessons the temple idea may contribute to the struggle of the late nineteenth-century English architect to define an "art of the future".

Prevention of child behavior problems through universal implementation of a group behavioral family intervention.

The aim of this mental health promotion initiative was to evaluate the effectiveness of a universally delivered group behavioral family intervention (BFI) in preventing behavior problems in children. This study investigates the transferability of an efficacious clinical program to a universal prevention intervention delivered through child and community health services targeting parents of preschoolers within a metropolitan health region. A quasiexperimental two-group (BFI, n=804 vs. Comparison group, n=806) longitudinal design followed preschool aged children and their parents over a 2-year period. BFI was associated with significant reductions in parent-reported levels of dysfunctional parenting and parent-reported levels of child behavior problems. Effect sizes on child behavior problems ranged from large (.83) to moderate (.47). Positive and significant effects were also observed in parent mental health, marital adjustment, and levels of child rearing conflict. Findings are discussed with respect to their implication for significant population reductions in child behavior problems as well as the pragmatic challenges for prevention science in encouraging both the evaluation and uptake of preventive initiatives in real world settings.

How to unravel and solve soil fertility problems

This book provides a way for farmers in developing countries to benefit from scientific knowledge on plant nutrition and soil fertility. Specifically, it will help farmers recognise and deal with shortages or excesses of chemical elements.