Search results for "Algorithm"

showing 10 items of 4887 documents

A GRASP ALGORITHM FOR THE CONTAINER LOADING PROBLEM WITH MULTI-DROP CONSTRAINTS

2015

This paper studies a variant of the container loading problem in which to the classical geometric constraints of packing problems we add other conditions appearing in practical problems, the multi-drop constraints. When adding multi-drop constraints, we demand that the relevant boxes must be available, without rearranging others, when each drop-off point is reached. We present first a review of the different types of multi-drop constraints that appear in literature. Then we propose a GRASP algorithm that solves the different types of multi-drop constraints and also includes other types of realistic constraints such as full support of the boxes and load bearing strength. The computational re…

Mathematical optimizationcontainer loadingmulti-dropComputer sciencelcsh:MathematicsDrop (liquid)GRASPheuristicsManagement Science and Operations Researchlcsh:QA1-939Load bearingPacking problemsGRASPHeuristicsload-bearing strengthAlgorithmPesquisa Operacional
researchProduct

A Preference-Based Evolutionary Algorithm for Multi-Objective Optimization

2009

In this paper, we discuss the idea of incorporating preference information into evolutionary multi-objective optimization and propose a preference-based evolutionary approach that can be used as an integral part of an interactive algorithm. One algorithm is proposed in the paper. At each iteration, the decision maker is asked to give preference information in terms of his or her reference point consisting of desirable aspiration levels for objective functions. The information is used in an evolutionary algorithm to generate a new population by combining the fitness function and an achievement scalarizing function. In multi-objective optimization, achievement scalarizing functions are widel…

Mathematical optimizationeducation.field_of_studyFitness functionDecision MakingPopulationEvolutionary algorithmInteractive evolutionary computationFunction (mathematics)Multi-objective optimizationPreferenceSet (abstract data type)Computational MathematicsData Interpretation StatisticalHumanseducationAlgorithmsMathematicsEvolutionary Computation
researchProduct

Explicit recursivity into reproducing kernel Hilbert spaces

2011

This paper presents a methodology to develop recursive filters in reproducing kernel Hilbert spaces (RKHS). Unlike previous approaches that exploit the kernel trick on filtered and then mapped samples, we explicitly define model recursivity in the Hilbert space. The method exploits some properties of functional analysis and recursive computation of dot products without the need of pre-imaging. We illustrate the feasibility of the methodology in the particular case of the gamma-filter, an infinite impulse response (IIR) filter with controlled stability and memory depth. Different algorithmic formulations emerge from the signal model. Experiments in chaotic and electroencephalographic time se…

Mathematical optimizationgamma filterHilbert spaceDot productFilter (signal processing)pre-imagefunctional analysissymbols.namesakekernel methodsKernel methodKernel (statistics)symbolsRecursive filterInfinite impulse responseAlgorithmMathematicsReproducing kernel Hilbert spaceRecursive filter
researchProduct

Statistical methods for determining components non-liniarities, from thermoluminescent devices

2016

Thermoluminescent (TLD) dosimeters enjoy wide usage due to low cost and simplicity of use. They have however large errors at high doses in mixed-radiation fields, where non-linear effects occur. Algorithms based on the Akaike criterion [1] are presented for determining the maximal (physically meaningful) polynomial order with which the non-linearities are modeled. This depends on the number of points existing on a curve and on the points' errors.

Mathematical optimizationmedia_common.quotation_subjectPhysics::Medical PhysicsPolynomial order02 engineering and technology021001 nanoscience & nanotechnology01 natural sciencesThermoluminescence0103 physical sciencesAkaike criterionHigh dosesThermoluminescent dosimeterSimplicity010306 general physics0210 nano-technologyAlgorithmmedia_commonMathematics2016 IEEE 22nd International Symposium for Design and Technology in Electronic Packaging (SIITME)
researchProduct

An advanced pavement management system based on a genetic algorithm for a motorway network

2013

Maintenance and improvement, through the rehabilitation, of the road infrastructure is a strategic and priority objective for road agencies, nevertheless the economic resources required are often inadequate. Within road management, the pavement management system (PMS) plays an essential role because of both the money needed and the performance that should be provided in terms of safety, ride quality and transport cost. The PMS is based on searching for a balanced solution between the lowest cost and the increased level of performance (i.e. pavement condition). In this paper a PMS multi-objective optimization method, was proposed, using a genetic algorithm (GA) to identify the best solution …

Mathematical optimizationmulti-objective optimizationComputer sciencepavement management systemGenetic algorithmPavement managementgenetic algorithmSettore ICAR/04 - Strade Ferrovie Ed Aeroportipavement management system genetic algorithm multi-objective optimization.Multi-objective optimization
researchProduct

A Study of Nash-Evolutionary Algorithms for Reconstruction Inverse Problems in Structural Engineering

2014

In this paper we deal with solving inverse problems in structural engineering (both the reconstruction inverse problem and the fully stressed design problem are considered). We apply a game-theory based Nash-evolutionary algorithm and compare it with the standard panmictic evolutionary algorithm. The procedure performance is analyzed on a ten bar sized test case of discrete real cross-section types structural frame, where a significant increase of performance is achieved using the Nash approach, even achieving super-linear speed-up.

Mathematical optimizationsymbols.namesakeBar (music)business.industryComputer scienceNash equilibriumStructural systemEvolutionary algorithmsymbolsStructural engineeringInverse problembusiness
researchProduct

A Domain Decomposition/Nash Equilibrium Methodology for the Solution of Direct and Inverse Problems in Fluid Dynamics with Evolutionary Algorithms

2008

Mathematical optimizationsymbols.namesakeNash equilibriumGenetic algorithmFluid dynamicsEvolutionary algorithmA domainsymbolsDecomposition (computer science)Inverse problemMathematics
researchProduct

Atmospheric Turbulence Effects Removal on Infrared Sequences Degraded by Local Isoplanatism

2007

When observing an object horizontally at a long distance, degradations due to atmospheric turbulence often occur. Different methods have already been tested to get rid of this kind of degradation, especially on infrared sequences. It has been shown that the Wiener filter applied locally on each frame of a sequence allows to obtain good results in terms of edges, while the regularization by the Laplacian operator applied in the same way provides good results in terms of noise removal in uniform areas. In this article, we present hybrid methods which take advantages of both Wiener filter and Laplacian regularization.

Mathematical optimizationsymbols.namesakeSequenceInfraredFrame (networking)Wiener filtersymbolsAtmospheric turbulenceRegularization (mathematics)Laplace operatorAlgorithmMathematicsDegradation (telecommunications)
researchProduct

Deflation-Based FastICA With Adaptive Choices of Nonlinearities

2014

Deflation-based FastICA is a popular method for independent component analysis. In the standard deflation-base d approach the row vectors of the unmixing matrix are extracted one after another always using the same nonlinearities. In prac- tice the user has to choose the nonlinearities and the efficiency and robustness of the estimation procedure then strongly depends on this choice as well as on the order in which the components are extracted. In this paper we propose a novel adaptive two- stage deflation-based FastICA algorithm that (i) allows one to use different nonlinearities for different components and (ii) optimizes the order in which the components are extracted. Based on a consist…

Mathematical optimizationta112Asymptotic distribution020206 networking & telecommunications02 engineering and technology01 natural sciencesIndependent component analysis010104 statistics & probabilityNonlinear systemRobustness (computer science)Signal Processing0202 electrical engineering electronic engineering information engineeringFastICAEquivariant mapAffine transformation0101 mathematicsElectrical and Electronic EngineeringAlgorithmFinite setMathematicsIEEE Transactions on Signal Processing
researchProduct

Obtaining the best value for money in adaptive sequential estimation

2010

Abstract In [Kujala, J. V., Richardson, U., & Lyytinen, H. (2010). A Bayesian-optimal principle for learner-friendly adaptation in learning games. Journal of Mathematical Psychology , 54(2), 247–255], we considered an extension of the conventional Bayesian adaptive estimation framework to situations where each observable variable is associated with a certain random cost of observation. We proposed an algorithm that chooses each placement by maximizing the expected gain in utility divided by the expected cost. In this paper, we formally justify this placement rule as an asymptotically optimal solution to the problem of maximizing the expected utility of an experiment that terminates when the…

Mathematical psychologySequential estimationMathematical optimizationTotal costActive learning (machine learning)Computer scienceApplied MathematicsDecision theory05 social sciencesBayesian probability050105 experimental psychology03 medical and health sciences0302 clinical medicineAsymptotically optimal algorithm0501 psychology and cognitive sciences030217 neurology & neurosurgeryGeneral PsychologyExpected utility hypothesisJournal of Mathematical Psychology
researchProduct