Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil

In this paper, we consider a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries that occurs in a major Brazilian retail group. A single depot attends 519 stores of the group distributed in 11 Brazilian states. To find good solutions to this problem, we propose heuristics as initial solutions and a scatter search (SS) approach. Next, the produced solutions are compared with the routes actually covered by the company. Our results show that the total distribution cost can be reduced significantly when such methods are used. Experimental testing with benchmark instances is used to assess the merit of our proposed procedure. (C) 2008 Published by Elsevier B.V.

On the Filtering Problem for Continuous-Time Markov Jump Linear Systems with no Observation of the Markov Chain

We consider in this paper the optimal stationary dynamic linear filtering problem for continuous-time linear systems subject to Markovian jumps in the parameters (LSMJP) and additive noise (Wiener process). It is assumed that only an output of the system is available and therefore the values of the jump parameter are not accessible. It is a well known fact that in this setting the optimal nonlinear filter is infinite dimensional, which makes the linear filtering a natural numerically, treatable choice. The goal is to design a dynamic linear filter such that the closed loop system is mean square stable and minimizes the stationary expected value of the mean square estimation error. It is shown that an explicit analytical solution to this optimal filtering problem is obtained from the stationary solution associated to a certain Riccati equation. It is also shown that the problem can be formulated using a linear matrix inequalities (LMI) approach, which can be extended to consider convex polytopic uncertainties on the parameters of the possible modes of operation of the system and on the transition rate matrix of the Markov process. As far as the authors are aware of this is the first time that this stationary filtering problem (exact and robust versions) for LSMJP with no knowledge of the Markov jump parameters is considered in the literature. Finally, we illustrate the results with an example.

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.

QUADRANT-SEARCHING: A NEW TECHNIQUE TO REDUCE THE SEARCH SPACE OF THE INVERSE PROBLEM OF EIT USING BEM TO THE DIRECT PROBLEM

The image reconstruction using the EIT (Electrical Impedance Tomography) technique is a nonlinear and ill-posed inverse problem which demands a powerful direct or iterative method. A typical approach for solving the problem is to minimize an error functional using an iterative method. In this case, an initial solution close enough to the global minimum is mandatory to ensure the convergence to the correct minimum in an appropriate time interval. The aim of this paper is to present a new, simple and low cost technique (quadrant-searching) to reduce the search space and consequently to obtain an initial solution of the inverse problem of EIT. This technique calculates the error functional for four different contrast distributions placing a large prospective inclusion in the four quadrants of the domain. Comparing the four values of the error functional it is possible to get conclusions about the internal electric contrast. For this purpose, initially we performed tests to assess the accuracy of the BEM (Boundary Element Method) when applied to the direct problem of the EIT and to verify the behavior of error functional surface in the search space. Finally, numerical tests have been performed to verify the new technique.

Amaranth bars enriched with fructans: acceptability and nutritional value

Amaranth bars enriched with fructans: acceptability and nutritional value. There is an increasing appeal for convenience foods with potential health benefits to the consumer. Raw materials with high nutritional value and functional properties must be used on the development of these food products. Amaranth is a gluten-free grain with high nutrition value. Inulin and oligofructose are prebiotic ingredients presenting effects as the enhancement of calcium absorption. Amaranth bars enriched with inulin and oligofructose were developed in the flavors: banana, Brazilian nuts and dried grape, coconut, peach, strawberry and wall nut. The proximate composition were determined and compared to commercial cereal bars, available in traditional (n=59), light (n=60), diet (n=8), with soy (n=10) and quinoa (n=1) categories. Amaranth bars present mean global acceptance values from 6.3 to 7.6 on a 9-point hedonic scale, nutritional advantages as compared to commercial cereal bars (caloric reduction and higher levels of dietary fiber). Although amaranth is an unknown raw material in Brazil, it shows good potential to be used in the manufacturing of ready-to-eat products. As they are gluten free, these amaranth bars are also an alternative product for celiacs, also contributing to the enhancement of calcium absorption, a problem frequently observed in these patients.

The constrained compartmentalized knapsack problem: mathematical models and solution methods

The constrained compartmentalized knapsack problem can be seen as an extension of the constrained knapsack problem. However, the items are grouped into different classes so that the overall knapsack has to be divided into compartments, and each compartment is loaded with items from the same class. Moreover, building a compartment incurs a fixed cost and a fixed loss of the capacity in the original knapsack, and the compartments are lower and upper bounded. The objective is to maximize the total value of the items loaded in the overall knapsack minus the cost of the compartments. This problem has been formulated as an integer non-linear program, and in this paper, we reformulate the non-linear model as an integer linear master problem with a large number of variables. Some heuristics based on the solution of the restricted master problem are investigated. A new and more compact integer linear model is also presented, which can be solved by a branch-and-bound commercial solver that found most of the optimal solutions for the constrained compartmentalized knapsack problem. On the other hand, heuristics provide good solutions with low computational effort. (C) 2011 Elsevier BM. All rights reserved.

On the cutting stock problem under stochastic demand

This paper addresses the one-dimensional cutting stock problem when demand is a random variable. The problem is formulated as a two-stage stochastic nonlinear program with recourse. The first stage decision variables are the number of objects to be cut according to a cutting pattern. The second stage decision variables are the number of holding or backordering items due to the decisions made in the first stage. The problem`s objective is to minimize the total expected cost incurred in both stages, due to waste and holding or backordering penalties. A Simplex-based method with column generation is proposed for solving a linear relaxation of the resulting optimization problem. The proposed method is evaluated by using two well-known measures of uncertainty effects in stochastic programming: the value of stochastic solution-VSS-and the expected value of perfect information-EVPI. The optimal two-stage solution is shown to be more effective than the alternative wait-and-see and expected value approaches, even under small variations in the parameters of the problem.

Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths

This paper deals with the classical one-dimensional integer cutting stock problem, which consists of cutting a set of available stock lengths in order to produce smaller ordered items. This process is carried out in order to optimize a given objective function (e.g., minimizing waste). Our study deals with a case in which there are several stock lengths available in limited quantities. Moreover, we have focused on problems of low demand. Some heuristic methods are proposed in order to obtain an integer solution and compared with others. The heuristic methods are empirically analyzed by solving a set of randomly generated instances and a set of instances from the literature. Concerning the latter. most of the optimal solutions of these instances are known, therefore it was possible to compare the solutions. The proposed methods presented very small objective function value gaps. (C) 2008 Elsevier Ltd. All rights reserved.

Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints

This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method which obtains good approximations in short computational times is proposed. This initial solution is then improved by means of a destroy-and-repair method or a tabu search algorithm. Computational results compare the three methods in terms of accuracy and speed. (C) 2007 Elsevier B.V. All rights reserved.

A general Trotter-Kato formula for a class of evolution operators

In this article we prove new results concerning the existence and various properties of an evolution system U(A+B)(t, s)0 <= s <= t <= T generated by the sum -(A(t) + B(t)) of two linear, time-dependent, and generally unbounded operators defined on time-dependent domains in a complex and separable Banach space B. In particular, writing L(B) for the algebra of all linear bounded operators on B, we can express U(A+B)(t, s)0 <= s <= t <= T as the strong limit in C(8) of a product of the holomorphic contraction semigroups generated by -A (t) and - B(t), respectively, thereby proving a product formula of the Trotter-Kato type under very general conditions which allow the domain D(A(t) + B(t)) to evolve with time provided there exists a fixed set D subset of boolean AND(t is an element of)[0,T] D(A(t) + B(t)) everywhere dense in B. We obtain a special case of our formula when B(t) = 0, which, in effect, allows us to reconstruct U(A)(t, s)0 <=(s)<=(t)<=(T) very simply in terms of the semigroup generated by -A(t). We then illustrate our results by considering various examples of nonautonomous parabolic initial-boundary value problems, including one related to the theory of timedependent singular perturbations of self-adjoint operators. We finally mention what we think remains an open problem for the corresponding equations of Schrodinger type in quantum mechanics.

A quasispecies approach to the evolution of sexual replication in unicellular organisms

This study develops a simplified model describing the evolutionary dynamics of a population composed of obligate sexually and asexually reproducing, unicellular organisms. The model assumes that the organisms have diploid genomes consisting of two chromosomes, and that the sexual organisms replicate by first dividing into haploid intermediates, which then combine with other haploids, followed by the normal mitotic division of the resulting diploid into two new daughter cells. We assume that the fitness landscape of the diploids is analogous to the single-fitness-peak approach often used in single-chromosome studies. That is, we assume a master chromosome that becomes defective with just one point mutation. The diploid fitness then depends on whether the genome has zero, one, or two copies of the master chromosome. We also assume that only pairs of haploids with a master chromosome are capable of combining so as to produce sexual diploid cells, and that this process is described by second-order kinetics. We find that, in a range of intermediate values of the replication fidelity, sexually reproducing cells can outcompete asexual ones, provided the initial abundance of sexual cells is above some threshold value. The range of values where sexual reproduction outcompetes asexual reproduction increases with decreasing replication rate and increasing population density. We critically evaluate a common approach, based on a group selection perspective, used to study the competition between populations and show its flaws in addressing the evolution of sex problem.

PACKMOL: A Package for Building Initial Configurations for Molecular Dynamics Simulations

Adequate initial configurations for molecular dynamics simulations consist of arrangements of molecules distributed in space in such a way to approximately represent the system`s overall structure. In order that the simulations are not disrupted by large van der Waals repulsive interactions, atoms from different molecules Must keep safe pairwise distances. Obtaining Such a molecular arrangement can be considered it packing problem: Each type molecule must satisfy spatial constraints related to the geometry of the system, and the distance between atoms of different molecules Must be greater than some specified tolerance. We have developed a code able to pack millions of atoms. grouped in arbitrarily complex molecules, inside a variety of three-dimensional regions. The regions may be intersections of spheres, ellipses, cylinders, planes, or boxes. The user must provide only the structure of one molecule of each type and the geometrical constraints that each type of molecule must satisfy. Building complex mixtures, interfaces, solvating biomolecules in water, other solvents, or mixtures of solvents, is straight forward. In addition. different atoms belonging to the same molecule may also be restricted to different spatial regions, in Such a way that more ordered molecular arrangements call be built, as micelles. lipid double-layers, etc. The packing time for state-of-the-art molecular dynamics systems varies front a few seconds to a few Minutes in a personal Computer. The input files are simple and Currently compatible with PDB, Tinker, Molden, or Moldy coordinate files. The package is distributed as free software and call be downloaded front http://www.ime.unicamp.br/similar to martinez/packmol/. (C) 2009 Wiley Periodicals. Inc. J Comput Chem 30: 2157-2164, 2009

ON THE SUPERCRITICALITY OF THE FIRST HOPF BIFURCATION IN A DELAY BOUNDARY PROBLEM

The goal of this paper is to analyze the character of the first Hopf bifurcation (subcritical versus supercritical) that appears in a one-dimensional reaction-diffusion equation with nonlinear boundary conditions of logistic type with delay. We showed in the previous work [Arrieta et al., 2010] that if the delay is small, the unique non-negative equilibrium solution is asymptotically stable. We also showed that, as the delay increases and crosses certain critical value, this equilibrium becomes unstable and undergoes a Hopf bifurcation. This bifurcation is the first one of a cascade occurring as the delay goes to infinity. The structure of this cascade will depend on the parameters appearing in the equation. In this paper, we show that the first bifurcation that occurs is supercritical, that is, when the parameter is bigger than the delay bifurcation value, stable periodic orbits branch off from the constant equilibrium.

An eigenvalue problem for the biharmonic operator on Z(2)-symmetric regions

In this work we show that the eigenvalues of the Dirichlet problem for the biharmonic operator are generically simple in the set Of Z(2)-symmetric regions of R-n, n >= 2, with a suitable topology. To accomplish this, we combine Baire`s lemma, a generalised version of the transversality theorem, due to Henry [Perturbation of the boundary in boundary value problems of PDEs, London Mathematical Society Lecture Note Series 318 (Cambridge University Press, 2005)], and the method of rapidly oscillating functions developed in [A. L. Pereira and M. C. Pereira, Mat. Contemp. 27 (2004) 225-241].

Relation between implant/abutment vertical misfit and torque loss of abutment screws

This study investigated whether there is a direct correlation between the level of vertical misfit at the abutment/implant interface and torque losses (detorque) in abutment screws. A work model was obtained from a metal matrix with five 3.75 x 9 mm external hex implants with standard platform (4.1 mm). Four frameworks were waxed using UCLA type abutments and one-piece cast in commercially pure titanium. The misfit was analyzed with a comparator microscope after 20 Ncm torque. The highest value of misfit observed per abutment was used. The torque required to loose the screw was evaluated using a digital torque meter. The torque loss values, measured by the torque meter, were assumed as percentage of initial torque (100%) given to abutment screws. Pearson's correlation (α=0.05) between the misfit values (29.08 ± 8.78 µm) and the percentage of detorque (50.71 ± 11.37%) showed no statistically significant correlation (p=0.295). Within the limitations of this study, it may be concluded that great vertical misfits dot not necessarily implies in higher detorque values.