Search results for "construct"
showing 10 items of 3723 documents
Stochastic analysis of external and parametric dynamical systems under sub-Gaussian Levy white-noise
2008
In this study stochastic analysis of non-linear dynamical systems under α-stable, multiplicative white noise has been conducted. The analysis has dealt with a special class of α-stable stochastic processes namely sub-Gaussian white noises. In this setting the governing equation either of the probability density function or of the characteristic function of the dynamical response may be obtained considering the dynamical system forced by a Gaussian white noise with an uncertain factor with α/2- stable distribution. This consideration yields the probability density function or the characteristic function of the response by means of a simple integral involving the probability density function …
Non-linear optimization of track layouts in loop-sorting-systems
2013
Optimization used for enhancing geometric structures iswell known. Applying obstacles to the shape optimization problemis on the other hand not very common. It requires a fast contact search algorithmand an exact continuous formulation to solve the problem robustly. This paper focuses on combining shape optimization problemswith collision avoidance constraints by which a collision detection algorithmis presented. The presentedmethod is tested against the commercial loop-sorting-system used for sorting of medium sized items. The objective is to minimize price and footprint of the system whilemaintaining its functionality. Contact constraints are in this context important to include as variou…
Load match optimisation of a residential building case study: A cross-entropy based electricity storage sizing algorithm
2015
Abstract The EU EPBD recast regulation marked the application of the net zero energy building (Net ZEB) concept in all fields of building construction in Europe as a building able to generate as much energy as it consumes over a selected time frame. A more detailed insight is however needed, as even if a building achieves a long-term energy balance between energy generated and consumed, smaller time scales must also be considered. For example, from the utility’s point of view, if a Net ZEB is a heavy consumer in the winter, it will appear to be quite similar to a conventional building, requiring the use of additional generation. The increase in the generation-load match means reducing the s…
A reactive GRASP algorithm for the container loading problem with load-bearing constraints
2014
The container loading problem consists in packing a set of boxes of different dimensions into a large container of fixed dimensions, usually with the objective of maximising the container load. In practical problems, besides the geometric constraints of not exceeding the container dimensions and ensuring the non-overlapping of boxes, other requirements may appear, such as total weight, weight balance or support. In this paper we address the problem of maximising container volume utilisation while respecting a set of practical constraints: full support of boxes, allowed orientations and load-bearing capacity. We have developed different heuristics for solving the problem and we have combined…
Genetic algorithms for 3d reconstruction with supershapes
2009
Supershape model is a recent primitive that represents numerous 3D shapes with several symmetry axes. The main interest of this model is its capability to reconstruct more complex shape than superquadric model with only one implicit equation. In this paper we propose a genetic algorithms to re-construct a point cloud using those primitives. We used the pseudo-Euclidean distance to introduce a threshold to handle real data imperfection and speed up the process. Simulations using our proposed fitness functions and a fitness function based on inside-outside function show that our fitness function based on the pseudo-Euclidean distance performs better.
A GRASP/Path Relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
2013
The three-dimensional multiple bin-size bin packing problem, MBSBPP, is the problem of packing a set of boxes into a set of bins when several types of bins of different sizes and costs are available and the objective is to minimize the total cost of bins used for packing the boxes. First we propose a GRASP algorithm, including a constructive procedure, a postprocessing phase and some improvement moves. The best solutions obtained are then combined into a Path Relinking procedure for which we have developed three versions: static, dynamic and evolutionary. An extensive computational study, using two- and three-dimensional instances, shows the relative efficiency of the alternatives considere…
A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
2002
Abstract In this paper we develop several heuristic algorithms for the two-dimensional cutting problem (TDC) in which a single stock sheet has to be cut into a set of small pieces, while maximising the value of the pieces cut. They can be considered to be general purpose algorithms because they solve the four versions of the TDC: weighted and unweighted, constrained and unconstrained. We begin by proposing two constructive procedures based on simple bounds obtained by solving one-dimensional knapsack problems. We then use these constructive algorithms as building blocks for more complex procedures. We have developed a greedy randomised adaptive search procedure (GRASP) which is very fast an…
Constructive procedures to solve 2-dimensional bin packing problems with irregular pieces and guillotine cuts
2015
Abstract This paper presents an approach for solving a new real problem in cutting and packing. At its core is an innovative mixed integer programme model that places irregular pieces and defines guillotine cuts. The two-dimensional irregular shape bin packing problem with guillotine constraints arises in the glass cutting industry, for example, the cutting of glass for conservatories. Almost all cutting and packing problems that include guillotine cuts deal with rectangles only, where all cuts are orthogonal to the edges of the stock sheet and a maximum of two angles of rotation are permitted. The literature tackling packing problems with irregular shapes largely focuses on strip packing i…
An Island Strategy for Memetic Discrete Tomography Reconstruction
2014
In this paper we present a parallel island model memetic algorithm for binary discrete tomography reconstruction that uses only four projections without any further a priori information. The underlying combination strategy consists in separated populations of agents that evolve by means of different processes. Agents progress towards a possible solution by using genetic operators, switch and a particular compactness operator. A guided migration scheme is applied to select suitable migrants by considering both their own and their sub-population fitness. That is, from time to time, we allow some individuals to transfer to different subpopulations. The benefits of this paradigm were tested in …
On properties of the iterative maximum likelihood reconstruction method
1989
In this paper, we continue our investigations6 on the iterative maximum likelihood reconstruction method applied to a special class of integral equations of the first kind, where one of the essential assumptions is the positivity of the kernel and the given right-hand side. Equations of this type often occur in connection with the determination of density functions from measured data. There are certain relations between the directed Kullback–Leibler divergence and the iterative maximum likelihood reconstruction method some of which were already observed by other authors. Using these relations, further properties of the iterative scheme are shown and, in particular, a new short and elementar…