Solving a concrete sleepers production scheduling by genetic algorithms

PRECON S.A is a manufacturing company dedicated to produce prefabricatedconcrete parts to several industries as rail transportation andagricultural industries.Recently, PRECON signed a contract with RENFE,the Spanish Nnational Rail Transportation Company to manufacturepre-stressed concrete sleepers for siding of the new railways of the highspeed train AVE. The scheduling problem associated with the manufacturingprocess of the sleepers is very complex since it involves severalconstraints and objectives. The constraints are related with productioncapacity, the quantity of available moulds, satisfying demand and otheroperational constraints. The two main objectives are related withmaximizing the usage of the manufacturing resources and minimizing themoulds movements. We developed a deterministic crowding genetic algorithmfor this multiobjective problem. The algorithm has proved to be a powerfuland flexible tool to solve the large-scale instance of this complex realscheduling problem.

Comparing and validating hypothesis test procedures: Graphical and numerical tools

When the behaviour of a specific hypothesis test statistic is studied by aMonte Carlo experiment, the usual way to describe its quality is by givingthe empirical level of the test. As an alternative to this procedure, we usethe empirical distribution of the obtained \emph{p-}values and exploit itsinformation both graphically and numerically.

Comparing Random-based and k-Anonymity-Based Algorithms for Graph Anonymization

Recently, several anonymization algorithms have appeared for privacy preservation on graphs. Some of them are based on random-ization techniques and on k-anonymity concepts. We can use both of them to obtain an anonymized graph with a given k-anonymity value. In this paper we compare algorithms based on both techniques in orderto obtain an anonymized graph with a desired k-anonymity value. We want to analyze the complexity of these methods to generate anonymized graphs and the quality of the resulting graphs.

A numerical characterization of hypersurface singularities

In this note we give a numerical characterization of hypersurface singularities in terms of the normalized Hilbert-Samuel coefficients, and we interpret this result from the point of view of rigid polynomials.

A numerical model for the gamma-ray emission of the microquasar LS 5039

The possible association between the microquasar LS 5039 and the EGRET source 3EG J1824-1514 suggests that microquasars could also be sources of high energy gamma-rays. In this paper, we explore, with a detailed numerical model, if this system can produce the emission detected by EGRET (>100 MeV) through inverse Compton (IC) scattering. Our numerical approach considers a population of relativistic electrons entrained in a cylindrical inhomogeneous jet, interacting with both the radiation and the magnetic fields, taking into account the Thomson and Klein-Nishina regimes of interaction. The computed spectrum reproduces the observed spectral characteristics at very high energy.

Numerical algorithm for Ginzburg-Landau equations with multiplicative noise: Application to domain growth

We consider stochastic partial differential equations with multiplicative noise. We derive an algorithm for the computer simulation of these equations. The algorithm is applied to study domain growth of a model with a conserved order parameter. The numerical results corroborate previous analytical predictions obtained by linear analysis.

Effects of small surface tension in Hele-Shaw multifinger dynamics: an analytical and numerical study

We study the singular effects of vanishingly small surface tension on the dynamics of finger competition in the Saffman-Taylor problem, using the asymptotic techniques described by Tanveer [Philos. Trans. R. Soc. London, Ser. A 343, 155 (1993)] and Siegel and Tanveer [Phys. Rev. Lett. 76, 419 (1996)], as well as direct numerical computation, following the numerical scheme of Hou, Lowengrub, and Shelley [J. Comput. Phys. 114, 312 (1994)]. We demonstrate the dramatic effects of small surface tension on the late time evolution of two-finger configurations with respect to exact (nonsingular) zero-surface-tension solutions. The effect is present even when the relevant zero-surface-tension solution has asymptotic behavior consistent with selection theory. Such singular effects, therefore, cannot be traced back to steady state selection theory, and imply a drastic global change in the structure of phase-space flow. They can be interpreted in the framework of a recently introduced dynamical solvability scenario according to which surface tension unfolds the structurally unstable flow, restoring the hyperbolicity of multifinger fixed points.

Numerical signs fos a transition in the 2d Random Field Ising Model at T=0

Intensive numerical studies of exact ground states of the two-dimensional ferromagnetic random field Ising model at T=0, with a Gaussian distribution of fields, are presented. Standard finite size scaling analysis of the data suggests the existence of a transition at ¿c=0.64±0.08. Results are compared with existing theories and with the study of metastable avalanches in the same model.

Selection, shape and relaxation of fronts: A numerical study of the effects of inertia.

We study the problem of front propagation in the presence of inertia. We extend the analytical approach for the overdamped problem to this case, and present numerical results to support our theoretical predictions. Specifically, we conclude that the velocity and shape selection problem can still be described in terms of the metastable, nonlinear, and linear overdamped regimes. We study the characteristic relaxation dynamics of these three regimes, and the existence of degenerate (¿quenched¿) solutions.

Numerical investigation of iso-spectral cavities built from trinagles

We present computational approaches as alternatives to a recent microwave cavity experiment by S. Sridhar and A. Kudrolli [Phys. Rev. Lett. 72, 2175 (1994)] on isospectral cavities built from triangles. A straightforward proof of isospectrality is given, based on the mode-matching method. Our results show that the experiment is accurate to 0.3% for the first 25 states. The level statistics resemble those of a Gaussian orthogonal ensemble when the integrable part of the spectrum is removed.

Phase-field model for Hele-Shaw flows with arabitrary contrast II: numerical approach

We present a phase-field model for the dynamics of the interface between two inmiscible fluids with arbitrary viscosity contrast in a rectangular Hele-Shaw cell. With asymptotic matching techniques we check the model to yield the right Hele-Shaw equations in the sharp-interface limit, and compute the corrections to these equations to first order in the interface thickness. We also compute the effect of such corrections on the linear dispersion relation of the planar interface. We discuss in detail the conditions on the interface thickness to control the accuracy and convergence of the phase-field model to the limiting Hele-Shaw dynamics. In particular, the convergence appears to be slower for high viscosity contrasts.

Numerical algorithm for spectroscopic ellipsometry of thick transparent films

We present a numerical method for spectroscopic ellipsometry of thick transparent films. When an analytical expression for the dispersion of the refractive index (which contains several unknown coefficients) is assumed, the procedure is based on fitting the coefficients at a fixed thickness. Then the thickness is varied within a range (according to its approximate value). The final result given by our method is as follows: The sample thickness is considered to be the one that gives the best fitting. The refractive index is defined by the coefficients obtained for this thickness.

Fast Approximation of Nonlinearities for improving inversion algorithms of PNL mixtures and Wiener systems

This paper proposes a very fast method for blindly approximating a nonlinear mapping which transforms a sum of random variables. The estimation is surprisingly good even when the basic assumption is not satisfied.We use the method for providing a good initialization for inverting post-nonlinear mixtures and Wiener systems. Experiments show that the algorithm speed is strongly improved and the asymptotic performance is preserved with a very low extra computational cost.