Search results for "Genetic algorithm"
showing 10 items of 834 documents
Speciation of Substituted Benzoic Acids in Solution: Evaluation of Spectroscopic and Computational Methods for the Identification of Associates and T…
2021
Comment on “Infrared and Raman selection rules for elastic vibrations of spherical nanoparticles”
2006
This Comment demonstrates again that selection rules established several years ago for the infrared absorption and the Raman scattering by vibrations of a spherical nanoparticle are correct and that the claimed errors about them are wrong.
Analysis of Rectangular Orthotropic Membranes for Mechanical Properties Identification through Load-Displacement Data
2021
In this paper, an innovative procedure is introduced for the identification of the mechanical properties of orthotropic membranes based on load-displacement data. To this end, novel functional forms of the displacement components for rectangular membranes are appropriately introduced. Unknown coefficients of these displacement functions are determined, minimizing the total potential energy of the membrane. The energy method is then combined with an optimization procedure to estimate the elastic constants of the membranes in a straightforward manner. Specifically, a genetic algorithm is used to minimize a properly defined objective function directly related to the sought mechanical propertie…
Reconstruction Problem of Reinforced Concrete Beams under Harmonic Excitations
2007
A damage detection method based on harmonic structural vibrations has been applied to reconstruct realistic damage patterns of reinforced concrete beams. It was shown that the application of a hybrid method (genetic algorithm and Levenberg-Marquardt minimization technique) makes it possible to effectively reconstruct the flexural stiffness drops as small as 10-20% with the maximum error of 4%. The error increases to about 7 to 9% with the presence of 1% measurement noise.
A genetic algorithm for the minimum generating set problem
2016
Graphical abstractDisplay Omitted HighlightsWe propose a novel formulation for the MGS problem based on multiple knapsack.The so-conceived MGS problem is solved by a novel GA.The GA embeds an intelligent construction method and specialized crossover operators.We perform a thorough comparison with regards to state-of-the-art algorithms.The proposal proves to be very competitive, specially for large and hard instances. Given a set of positive integers S, the minimum generating set problem consists in finding a set of positive integers T with a minimum cardinality such that every element of S can be expressed as the sum of a subset of elements in T. It constitutes a natural problem in combinat…
Multi-objective memetic optimization for the bi-objective obnoxious p -median problem
2018
Abstract Location problems have been studied extensively in the optimization literature, the p-median being probably one of the most tackled models. The obnoxious p-median is an interesting variant that appears in the context of hazardous location. The aim of this paper is to formally introduce a bi-objective optimization model for this problem, in which a solution consists of a set of p locations, and two conflicting objectives arise. On the one hand, the sum of the minimum distance between each client and their nearest open facility and, on the other hand, the dispersion among facilities. Both objective values should be kept as large as possible for a convenient location of dangerous faci…
A biased random-key genetic algorithm for the time-invariant berth allocation and quay crane assignment problem
2017
We address Berth Allocation and Quay Crane Assignment Problems in a heuristic wayWe propose a Biased Random-Key Genetic Algorithm for BACAP and its extension BACASPSolutions of the Genetic Algorithm are improved by a Local SearchThe complete procedure obtains high-quality solutions for large instances Maritime transportation plays a crucial role in the international economy. Port container terminals around the world compete to attract more traffic and are forced to offer better quality of service. This entails reducing operating costs and vessel service times. In doing so, one of the most important problems they face is the Berth Allocation and quay Crane Assignment Problem (BACAP). This pr…
Heuristics for the Bi-Objective Diversity Problem
2018
Abstract The Max-Sum diversity and the Max-Min diversity are two well-known optimization models to capture the notion of selecting a subset of diverse points from a given set. The resolution of their associated optimization problems provides solutions of different structures, in both cases with desirable characteristics. They have been extensively studied and we can find many metaheuristic methodologies, such as Greedy Randomized Adaptive Search Procedure, Tabu Search, Iterated Greedy, Variable Neighborhood Search, and Genetic algorithms applied to them to obtain high quality solutions. In this paper we solve the bi-objective problem in which both models are simultaneously optimized. No pre…
Portfolio optimization using a credibility mean-absolute semi-deviation model
2015
We present a cardinality constrained credibility mean-absolute semi-deviation model.We prove relationships for possibility and credibility moments for LR-fuzzy variables.The return on a given portfolio is modeled by means of LR-type fuzzy variables.We solve the portfolio selection problem using an evolutionary procedure with a DSS.We select best portfolio from Pareto-front with a ranking strategy based on Fuzzy VaR. We introduce a cardinality constrained multi-objective optimization problem for generating efficient portfolios within a fuzzy mean-absolute deviation framework. We assume that the return on a given portfolio is modeled by means of LR-type fuzzy variables, whose credibility dist…
The facility layout problem approached using a fuzzy model and a genetic search
2005
The problem of facility layout design is discussed, taking into account the uncertainty of production scenarios and the finite production capacity of the departments. The uncertain production demand is modelled by a fuzzy number, and constrained arithmetic operators are used in order to calculate the fuzzy material handling costs. By using a ranking criterion, the layout that represents the minimum fuzzy cost is selected. A flexible bay structure is adopted as a physical model of the system while an effective genetic algorithm is implemented to search for a near optimal solution in a fuzzy contest. Constraints on the aspect ratio of the departments are taken into account using a penalty fun…