Search results for "Computer Science Applications"
showing 10 items of 3993 documents
Fixed domain approaches in shape optimization problems
2012
This work is a review of results in the approximation of optimal design problems, defined in variable/unknown domains, based on associated optimization problems defined in a fixed ?hold-all? domain, including the family of all admissible open sets. The literature in this respect is very rich and we concentrate on three main approaches: penalization?regularization, finite element discretization on a fixed grid, controllability and control properties of elliptic systems. Comparison with other fixed domain approaches or, in general, with other methods in shape optimization is performed as well and several numerical examples are included.
A non dominated ranking Multi Objective Genetic Algorithm and electre method for unequal area facility layout problems
2013
The unequal area facility layout problem (UA-FLP) comprises a class of extremely difficult and widely applicable optimization problems arising in diverse areas and meeting the requirements for real-world applications. Genetic Algorithms (GAs) have recently proven their effectiveness in finding (sub) optimal solutions to many NP-hard problems such as UA-FLP. A main issue in such approach is related to the genetic encoding and to the evolutionary mechanism implemented, which must allow the efficient exploration of a wide solution space, preserving the feasibility of the solutions and ensuring the convergence towards the optimum. In addition, in realistic situations where several design issues…
Optimal positioning of irregular shapes in stamping die strip
2010
The nesting of two-dimensional shapes is a common problem, where raw material has to be economically cut. As for the single-pass single-row strip layout, several algorithms, based on established methods, have been proposed. Moreover, it should be noticed that the optimum layout should also consider a few constraints, like grain orientation for subsequent forming operation, correct bridge width, and the commercial roll of metal width in order to make solutions applicable in real industrial environments. Most of the procedures until now shown in literature are quite complex and often ignore these real constraints. They usually make use of sliding techniques and are not able to effectively wor…
Boundary Element Crystal Plasticity Method
2017
A three-dimensional (3D) boundary element method for small strains crystal plasticity is described. The method, developed for polycrystalline aggregates, makes use of a set of boundary integral equations for modeling the individual grains, which are represented as anisotropic elasto-plastic domains. Crystal plasticity is modeled using an initial strains boundary integral approach. The integration of strongly singular volume integrals in the anisotropic elasto-plastic grain-boundary equations are discussed. Voronoi-tessellation micro-morphologies are discretized using nonstructured boundary and volume meshes. A grain-boundary incremental/iterative algorithm, with rate-dependent flow and har…
A genetic algorithm for discrete tomography reconstruction
2007
The aim of this paper is the description of an experiment carried out to verify the robustness of two different approaches for the reconstruction of convex polyominoes in discrete tomography. This is a new field of research, because it differs from classic computerized tomography, and several problems are still open. In particular, the stability problem is tackled by using both a modified version of a known algorithm and a new genetic approach. The effect of both, instrumental and quantization noises has been considered too. © 2007 Springer Science+Business Media, LLC.
Handling precedence constraints in scheduling problems by the sequence pair representation
2015
In this paper, we show that sequence pair (SP) representation, primarily applied to the rectangle packing problems appearing in the VLSI industry, can be a solution representation of precedence constrained scheduling. We present three interpretations of sequence pair, which differ in complexity of schedule evaluation and size of a corresponding solution space. For each interpretation we construct an incremental precedence constrained SP neighborhood evaluation algorithm, computing feasibility of each solution in the insert neighborhood in an amortized constant time per examined solution, and prove the connectivity property of the considered neighborhoods. To compare proposed interpretations…
MCR-ALS on metabolic networks: Obtaining more meaningful pathways
2015
[EN] With the aim of understanding the flux distributions across a metabolic network, i.e. within living cells, Principal Component Analysis (PCA) has been proposed to obtain a set of orthogonal components (pathways) capturing most of the variance in the flux data. The problems with this method are (i) that no additional information can be included in the model, and (ii) that orthogonality imposes a hard constraint, not always reasonably. To overcome these drawbacks, here we propose to use a more flexible approach such as Multivariate Curve Resolution-Alternating Least Squares (MCR-ALS) to obtain this set of biological pathways through the network. By using this method, different constraint…
Bayesian prediction inM/M/1 queues
1994
Simple queues with Poisson input and exponential service times are considered to illustrate how well-suited Bayesian methods are used to handle the common inferential aims that appear when dealing with queue problems. The emphasis will mainly be placed on prediction; in particular, we study the predictive distribution of usual measures of effectiveness in anM/M/1 queue system, such as the number of customers in the queue and in the system, the waiting time in the queue and in the system, the length of an idle period and the length of a busy period.
Scatter Search and Path Relinking
2011
Scatter search (SS) and path relinking (PR) are evolutionary methods that have been successfully applied to a wide range of hard optimization problems. The fundamental concepts and principles of the methods were first proposed in the 1970s and 1980s, and were based on formulations, dating back to the 1960s, for combining decision rules and problem constraints. The methods use strategies for search diversification and intensification that have proved effective in a variety of optimization problems and that have sometimes been embedded in other evolutionary methods to yield improved performance. This paper examines the scatter search and path relinking methodologies from both conceptual and p…
Adjoint-based sampling methods for electromagnetic scattering
2010
In this paper we investigate the efficient realization of sampling methods based on solutions of certain adjoint problems. This adjoint approach does not require the explicit knowledge of the Green's function for the background medium, and allows us to sample for all points and all dipole directions simultaneously; thus, several limitations of standard sampling methods are relieved. A detailed derivation of the adjoint approach is presented for two electromagnetic model problems, but the framework can be applied to a much wider class of problems. We also discuss a relation of the adjoint sampling method to standard backprojection algorithms, and present numerical tests that illustrate the e…