Search results for "Algorithm"

showing 10 items of 4887 documents

Team Theory and Person-by-Person Optimization with Binary Decisions

2012

In this paper, we extend the notion of person-by-person (pbp) optimization to binary decision spaces. The novelty of our approach is the adaptation to a dynamic team context of notions borrowed from the pseudo-boolean optimization field as completely local-global or unimodal functions and submodularity. We also generalize the concept of pbp optimization to the case where groups of $m$ decisions makers make joint decisions sequentially, which we refer to as $m$b$m$ optimization. The main contribution is a description of sufficient conditions, verifiable in polynomial time, under which a pbp or an $m$b$m$ optimization algorithm converges to the team-optimum. As a second contribution, we prese…

Mathematical optimizationControl and Optimizationcontrol optimizationBinary decision diagramApplied MathematicsTeam Theory; Person-by-Person Optimization; Pseudo-Boolean OptimizationApproximation algorithmState vectorTeam TheoryPerson-by-Person OptimizationSubmodular set functionVector optimizationPseudo-Boolean OptimizationComplete informationSettore MAT/09 - Ricerca OperativaGreedy algorithmTime complexityMathematicsSIAM Journal on Control and Optimization
researchProduct

How to simulate normal data sets with the desired correlation structure

2010

The Cholesky decomposition is a widely used method to draw samples from multivariate normal distribution with non-singular covariance matrices. In this work we introduce a simple method by using singular value decomposition (SVD) to simulate multivariate normal data even if the covariance matrix is singular, which is often the case in chemometric problems. The covariance matrix can be specified by the user or can be generated by specifying a subset of the eigenvalues. The latter can be an advantage for simulating data sets with a particular latent structure. This can be useful for testing the performance of chemometric methods with data sets matching the theoretical conditions for their app…

Mathematical optimizationCovariance functionCovariance matrixProcess Chemistry and TechnologyMathematicsofComputing_NUMERICALANALYSISMultivariate normal distributionCovarianceComputer Science ApplicationsAnalytical ChemistryEstimation of covariance matricesScatter matrixMatrix normal distributionCMA-ESAlgorithmComputer Science::DatabasesSpectroscopySoftwareMathematicsChemometrics and Intelligent Laboratory Systems
researchProduct

α-stable distributions for better performance of ACO in detecting damage on not well spaced frequency systems

2014

Abstract In this paper, the Ant Colony Optimization (ACO) algorithm is modified through α -stable Levy variables and applied to the identification of incipient damage in structural components. The main feature of the proposed optimization is an improved ability, which derives from the heavy tails of the stable random variable, to escape from local minima. This aspect is relevant since the objective function used for damage detection may have many local minima which render very challenging the search of the global minimum corresponding to the damage parameter. As the optimization is performed on the structural response and does not require the extraction of modal components, the method is pa…

Mathematical optimizationDamage detectionComputer scienceMechanical EngineeringAnt colony optimization algorithmsAnt Colony Optimization Damage identification Lévy α-stable distributions Not-well spaced frequency systemAerospace EngineeringOcean EngineeringStatistical and Nonlinear PhysicsCondensed Matter PhysicsMaxima and minimaModalNuclear Energy and EngineeringFeature (computer vision)Biological systemRandom variableCivil and Structural Engineering
researchProduct

The stacker crane problem and the directed general routing problem

2015

[EN] This article deals with the polyhedral description and the resolution of the directed general routing problem (DGRP) and the stacker crane problem (SCP). The DGRP contains a large number of important arc and node routing problems as special cases, including the SCP. Large families of facet-defining inequalities for the DGRP are described and a branch-and-cut algorithm for these problems is presented. Extensive computational experiments over different sets of DGRP and SCP instances are included.

Mathematical optimizationDirected general routing problemStacker crane problemComputer Networks and CommunicationsStackerNode (networking)Branch-and-cut algorithmDirected graphResolution (logic)Directed rural postman problemHardware and ArchitectureRouting (electronic design automation)MATEMATICA APLICADASoftwareInformation SystemsMathematics
researchProduct

Bayesian adaptive estimation: The next dimension

2006

Abstract We propose a new psychometric model for two-dimensional stimuli, such as color differences, based on parameterizing the threshold of a one-dimensional psychometric function as an ellipse. The Ψ Bayesian adaptive estimation method applied to this model yields trials that vary in multiple stimulus dimensions simultaneously. Simulations indicate that this new procedure can be much more efficient than the more conventional procedure of estimating the psychometric function on one-dimensional lines independently, requiring only one-fourth or less the number of trials for equivalent performance in typical situations. In a real psychophysical experiment with a yes–no task, as few as 22 tri…

Mathematical optimizationDiscretizationApplied MathematicsBayesian probabilityFast Fourier transformMonte Carlo methodMarkov chain Monte CarloEllipsesymbols.namesakePsychometric functionsymbolsAlgorithmScalingGeneral PsychologyMathematicsJournal of Mathematical Psychology
researchProduct

STUDY OF VOLUME VARIATION OF IMPLICIT OBJECTS

2006

We propose studying the variations of volume of implicit objects during an animation according to several points of view: choice of the function of density, variations of parameters such as the iso-value and the radius of influence for a given function, variations of the parameters inherent in a particular function. Modification of parameters of the function of density must be carried out with care. There are no rules concerning these variations. To avoid the non-monotonous variations, it is necessary to choose a function of density beforehand and study the intervals of variation of its parameters. A new discretization makes it possible to locate these variations for a later use in a proce…

Mathematical optimizationDiscretizationComputer scienceVolume variationProcess (computing)Volume (computing)Function (mathematics)AnimationVariation (game tree)Computer Graphics and Computer-Aided DesignComputer Science ApplicationsRadius of influenceComputer Vision and Pattern RecognitionAlgorithmInternational Journal of Image and Graphics
researchProduct

A multi-parametric evolution strategies algorithm for vehicle routing problems

2007

Vehicle routing problems are at the heart of most decision support systems for real-life distribution problems. In vehicle routing problem a set of routes must be determined at lowest total cost for a number of resources (i.e. fleet of vehicles) located at one or several points (e.g. depots, warehouses) in order to efficiently service a number of demand or supply points. In this paper an efficient evolution strategies algorithm is developed for both capacitated vehicle routing problem and for vehicle routing problem with time window constraints. The algorithm is based on a new multi-parametric mutation procedure that is applied within the 1 + 1 evolution strategies algorithm. Computational …

Mathematical optimizationDynamic Source RoutingSDG 16 - PeaceComputer scienceEqual-cost multi-path routingEvolution strategiesArtificial IntelligenceVehicle routing problemVehicle routing problemHeuristicsDestination-Sequenced Distance Vector routingTriangular routingStatic routingDistribution managementPolicy-based routingSDG 16 - Peace Justice and Strong InstitutionsGeneral EngineeringPath vector protocol/dk/atira/pure/sustainabledevelopmentgoals/peace_justice_and_strong_institutionsJustice and Strong InstitutionsComputer Science ApplicationsDistance-vector routing protocolLink-state routing protocolMultipath routingHeuristicsAlgorithmExpert systems with applications
researchProduct

Alignment of Noisy and Uniformly Scaled Time Series

2009

The alignment of noisy and uniformly scaled time series is an important but difficult task. Given two time series, one of which is a uniformly stretched subsequence of the other, we want to determine the stretching factor and the offset of the second time series within the first one. We adapted and enhanced different methods to address this problem: classical FFT-based approaches to determine the offset combined with a naive search for the stretching factor or its direct computation in the frequency domain, bounded dynamic time warping and a new approach called shotgun analysis, which is inspired by sequencing and reassembling of genomes in bioinformatics. We thoroughly examined the strengt…

Mathematical optimizationDynamic time warpingComputer scienceFrequency domainOutlierFast Fourier transformAlgorithm
researchProduct

Smart multi-carrier energy system: Optimised energy management and investment analysis

2016

This paper proposes an optimised Energy Management System for a multi-carrier hub, which integrates two energy distribution networks, for hydrogen and electricity. The economic sustainability of a real-life instantiation of such a system has been analysed as well. The Energy Management System has been developed by means of a multi-objective optimisation algorithm, the Non-dominated Sorting Genetic Algorithm II, implemented using MATLAB®. The achieved results consist in a series of set-points defining the working conditions of the plant for a chosen time horizon. Data provided by this process also show the effectiveness of the adopted optimisation approach. The financial analysis is performe…

Mathematical optimizationEnergy managementSortingTime horizon02 engineering and technology010402 general chemistry021001 nanoscience & nanotechnology01 natural sciencesNet present valueEnergy accounting0104 chemical sciencesSettore ING-IND/33 - Sistemi Elettrici Per L'EnergiaEnergy management systemenergy management system hydrogen storageinvestment analysis multi-objective optimisationGenetic algorithmEconomicsCash flow0210 nano-technology2016 IEEE International Energy Conference (ENERGYCON)
researchProduct

Stochastic Approach for Optimal Positioning of Pumps As Turbines (PATs)

2021

A generic water system consists of a series of works that allow the collection, conveyance, storage and finally the distribution of water in quantities and qualities such as to satisfy the needs of end users. In places characterized by high altitude differences between the intake works and inhabited centres, the potential energy of the water is very high. This energy is attributable to high pressures, which could compromise the functionality of the pipelines

Mathematical optimizationEnergy recoveryOptimization problemEnvironmental effects of industries and plantsRenewable Energy Sustainability and the Environmentbusiness.industryComputer scienceenergy recoveryGeography Planning and DevelopmentMonte Carlo methodSortingTJ807-830Management Monitoring Policy and LawTD194-195Renewable energy sourcesEnvironmental sciencesPipeline transportSoftwareGenetic algorithmGE1-350pump as turbinebusinesswater distribution systemEnergy (signal processing)Bayesian Monte Carlo methodSustainability
researchProduct