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.

Least energy solutions of a critical Neumann problem with a weight

We investigate the effect of the coefficient of the critical nonlinearity for the Neumann problem on the existence of least energy solutions. As a by-product we establish a Sobolev inequality with interior norm.

What is the Problem of Ad Hoc Hypotheses?

The received view of an ad hoc hypothesis is that it accounts for only the observation(s) it was designed to account for, and so non-adhocness is generally held to be necessary or important for an introduced hypothesis or modification to a theory. Attempts by Popper and several others to convincingly explicate this view, however, prove to be unsuccessful or of doubtful value, and familiar and firmer criteria for evaluating the hypotheses or modified theories so classified are characteristically available. These points are obscured largely because the received view fails to adequately separate psychology from methodology or to recognise ambiguities in the use of 'ad hoc'.

Watkins and the Pragmatic Problem of Induction

Watkins proposes a neo-Popperian solution to the pragmatic problem of induction. He asserts that evidence can be used non-inductively to prefer the principle that corroboration is more successful over all human history than that, say, counter-corroboration is more successful either over this same period or in the future. Watkins's argument for rejecting the first counter-corroborationist alternative is beside the point. However, as whatever is the best strategy over all human history is irrelevant to the pragmatic problem of induction since we are not required to act in the past, and his argument for rejecting the second presupposes induction.

On the nonlinear Neumann problem with critical and supercritical nonlinearities

We investigate the solvability of the Neumann problem (1.1) involving a critical Sobolev exponent. In the first part of this work it is assumed that the coeffcients Q and h are at least continuous. Moreover Q is positive on overline Omega and lambda > 0 is a parameter. We examine the common effect of the mean curvature and the shape of the graphs of the coeffcients Q and h on the existence of low energy solutions. In the second part of this work we consider the same problem with Q replaced by - Q. In this case the problem can be supercritical and the existence results depend on integrability conditions on Q and h.

(FAB11_2_003) Authentic Japanese architecture after Bruno Taut: the problem of eclecticism

This paper will examine attitudes to eclectic stylistic borrowing in Japan in the twentieth century in light of the concept of authenticity. I am particularly interested in how an earlier claim correlating European modernist and traditional Japanese architecture continues to colour conceptions about what is an 'authentic' response for Japanese architects to make to contemporary conditions. Non-Western and vernacular architectures generally have been the repository for touristic desires for regional authenticity and difference. Yet Japan's unique role in the development of modernist architecture has given a peculiar intensity to the demand for its architecture to resist a perceived postmodern decadence.

Analysis of heat transfer and entropy generation for a thermally developing Brinkman–Brinkman forced convection problem in a rectangular duct with isoflux walls

Heat transfer and entropy generation analysis of the thermally developing forced convection in a porous-saturated duct of rectangular cross-section, with walls maintained at a constant and uniform heat flux, is investigated based on the Brinkman flow model. The classical Galerkin method is used to obtain the fully developed velocity distribution. To solve the thermal energy equation, with the effects of viscous dissipation being included, the Extended Weighted Residuals Method (EWRM) is applied. The local (three dimensional) temperature field is solved by utilizing the Green’s function solution based on the EWRM where symbolic algebra is being used for convenience in presentation. Following the computation of the temperature field, expressions are presented for the local Nusselt number and the bulk temperature as a function of the dimensionless longitudinal coordinate, the aspect ratio, the Darcy number, the viscosity ratio, and the Brinkman number. With the velocity and temperature field being determined, the Second Law (of Thermodynamics) aspect of the problem is also investigated. Approximate closed form solutions are also presented for two limiting cases of MDa values. It is observed that decreasing the aspect ratio and MDa values increases the entropy generation rate.

Reducing problem behavior during care-giving in families of preschool-aged children with developmental disabilities

This study evaluated two variants of a behavioral parent training program known as Stepping Stones Triple P (SSTP) using 74 preschool-aged children with developmental disabilities. Families were randomly allocated to an enhanced parent training intervention that combined parenting skills and care-giving coping skills (SSTP-E), standard parent training intervention alone (SSTP-S) or waitlist control (WL) condition. At post-intervention, both programs were associated with lower levels of observed negative child behavior, reductions in the number of care-giving settings where children displayed problem behavior, and improved parental competence and satisfaction in the parenting role as compared with the waitlist condition. Gains attained at post-intervention were maintained at 1-year follow-up. Both interventions produced significant reductions in child problem behavior, with 67% of children in the SSTP-E and 77% of children in the SSTPS showing clinically reliable change from pre-intervention to follow-up. Parents reported a high level of satisfaction with both interventions.

The intersection problem for star designs

We determine those triples (m, II, k) of integers for which there are two m-star designs on the same n-set having exactly k stars in common.

The meeting place problem: Salience and search.

The notion of salience was developed by Schelling in the context of the meeting-place problem of locating a partner in the absence of a pre-agreed meeting place. In this paper, we argue that a realistic specification of the meeting place problem involves allowing a strategy of active search over a range of possible meeting places. We solve this extended problem, allowing for extensions such as repeated play, search costs and asymmetric payoffs. The result is a considerably richer, but more complex, notion of salience. (C) 1998 Elsevier Science B.V.

Some new examples for nonuniqueness of the evolution problem of harmonic maps

We find some new examples to show nonuniquence for the heat flow of harmonic maps where weak solutions satisfy the same monotonicity property.

Protein sequence threading, the alignment problem, and a two-step strategy

Conventionally, protein structure prediction via threading relies on some nonoptimal method to align a protein sequence to each member of a library of known structures. We show how a score function (force field) can be modified so as to allow the direct application of a dynamic programming algorithm to the problem. This involves an approximation whose damage can be minimized by an optimization process during score function parameter determination. The method is compared to sequence to structure alignments using a more conventional pair-wise score function and the frozen approximation. The new method produces results comparable to the frozen approximation, but is faster and has fewer adjustable parameters. It is also free of memory of the template's original amino acid sequence, and does not suffer from a problem of nonconvergence, which can be shown to occur with the frozen approximation. Alignments generated by the simplified score function can then be ranked using a second score function with the approximations removed. (C) 1999 John Wiley & Sons, Inc.