Search results for "algorithm"
showing 10 items of 4887 documents
Combined dynamic response of primary and multiply connected cascaded secondary subsystems
1991
A method is proposed for the deterministic and stochastic non-stationary analysis of linear composite systems with cascaded secondary subsystems subjected to a seismic input. This method makes it possible to evaluate, by means of a unitary formulation, the deterministic and non-stationary stochastic response of both classically and non-classically damped subsystems and of secondary subsystems multiply supported on the primary one, as well as the ground. The proposed procedure is very efficient from a computational point of view, because of the Kronecker algebra systematically employed. Indeed, by using this algebra, it is possible to obtain in a very compact and elegant form the eigenproper…
Memetic algorithms and memetic computing optimization: A literature review
2012
Abstract Memetic computing is a subject in computer science which considers complex structures such as the combination of simple agents and memes, whose evolutionary interactions lead to intelligent complexes capable of problem-solving. The founding cornerstone of this subject has been the concept of memetic algorithms, that is a class of optimization algorithms whose structure is characterized by an evolutionary framework and a list of local search components. This article presents a broad literature review on this subject focused on optimization problems. Several classes of optimization problems, such as discrete, continuous, constrained, multi-objective and characterized by uncertainties…
Firefly algorithm based upon slicing structure encoding for unequal facility layout problem
2019
Finding the locations of departments or machines in a workspace is classified as a Facility Layout Problem. Good placement of departments has a relevant influence on manufacturing costs, work in process, lead times and production efficiency. This paper analyses the problem of allocating departments with restrictions in terms of unequal area and rectangular shape within a facility, in order to minimize the sum of material handling costs taking into account the satisfaction of the aspect ratio requested. In particular, we propose for the first time a Firefly Algorithm based on the slicing structure encoding. The proposed method was tested comparing the results obtained from other authors on t…
Reflections towards a generative theory of musical parallelism
2010
Parallelism plays a core role in Lerdahl and Jackendoff's (1983) GTTM, as it rules the emergence of motivic, metrical, grouping and even formal structures. Due to the high amount of detail and complexity characterising associational structures, neither explicit model nor systematic methodology of parallelism-based structural inference has been included into the GTTM. This paper develops a methodological and computational answer to this problem founded on a computational modelling of pattern extraction operations. The paper focuses in particular on the methodological interest of the pattern mining formalism, and in particular its application to the formalisation of grouping and metrical str…
The Principle of Stasis: Why drift is not a Zero-Cause Law
2016
This paper analyses the structure of evolutionary theory as a quasi-Newtonian theory and the need to establish a Zero-Cause Law. Several authors have postulated that the special character of drift is because it is the default behaviour or Zero-Cause Law of evolutionary systems, where change and not stasis is the normal state of them. For these authors, drift would be a Zero-Cause Law, the default behaviour and therefore a constituent assumption impossible to change without changing the system. I defend that drift's causal and explanatory power prevents it from being considered as a Zero-Cause Law. Instead, I propose that the default behaviour of evolutionary systems is what I call the Princ…
A multi objective genetic algorithm for the facility layout problem based upon slicing structure encoding
2012
This paper proposes a new multi objective genetic algorithm (MOGA) for solving unequal area facility layout problems (UA-FLPs). The genetic algorithm suggested is based upon the slicing structure where the relative locations of the facilities on the floor are represented by a location matrix encoded in two chromosomes. A block layout is constructed by partitioning the floor into a set of rectangular blocks using guillotine cuts satisfying the areas requirements of the departments. The procedure takes into account four objective functions (material handling costs, aspect ratio, closeness and distance requests) by means of a Pareto based evolutionary approach. The main advantage of the propos…
A geometrical approach for inverting display color-characterization models
2008
— Some display color-characterization models are not easily inverted. This work proposes ways to build geometrical inverse models given any forward color-characterization model. The main contribution is to propose and analyze several methods to optimize the 3-D geometrical structure of an inverse color-characterization model directly based on the forward model. Both the amount of data and their distribution in color space is especially focused on. Several optimization criteria, related either to an evaluation data set or to the geometrical structure itself, are considered. A practical case with several display devices, combining the different methods proposed in the article, are considered …
A multi-objective approach to facility layout problem by genetic search algorithm and Electre method
2006
Abstract Classical approaches to layout design problem tend to maximise the efficiency of layout, measured by the handling cost related to the interdepartmental flow and to the distance among the departments. However, the actual problem involves several conflicting objectives hence requiring a multi-objective formulation. Multi-objective approaches, recently proposed, in most cases lead to the maximisation of a weighted sum of score functions. The poor practicability of such an approach is due to the difficulty of normalising these functions and of quantifying the weights. In this paper, this difficulty is overcome by approaching the problem in two subsequent steps: in the first step, the P…
Multiple Hypotheses Testing
1993
The paper is mainly concerned with multiple testing procedures which control a given multiple level α. General concepts for this purpose are the closure test and a modification which is independent of the special structure of hypotheses and tests. We consider improvements of this modification using information about the logical dependences (redundancies) within the system of hypotheses and present an efficient algorithm. Finally, we discuss some problems which are specific for hierarchical systems of hypotheses, e.g. in model search.
A Differential Evolution Framework with Ensemble of Parameters and Strategies and Pool of Local Search Algorithms
2014
The file attached to this record is the author's final peer reviewed version. The publisher's final version can be found by following the DOI link. The ensemble structure is a computational intelligence supervised strategy consisting of a pool of multiple operators that compete among each other for being selected, and an adaptation mechanism that tends to reward the most successful operators. In this paper we extend the idea of the ensemble to multiple local search logics. In a memetic fashion, the search structure of an ensemble framework cooperatively/competitively optimizes the problem jointly with a pool of diverse local search algorithms. In this way, the algorithm progressively adapts…