Search results for " optimization."

showing 10 items of 2333 documents

Agent assisted interactive algorithm for computationally demanding multiobjective optimization problems

2015

We generalize the applicability of interactive methods for solving computationally demanding, that is, time-consuming, multiobjective optimization problems. For this purpose we propose a new agent assisted interactive algorithm. It employs a computationally inexpensive surrogate problem and four different agents that intelligently update the surrogate based on the preferences specified by a decision maker. In this way, we decrease the waiting times imposed on the decision maker during the interactive solution process and at the same time decrease the amount of preference information expected from the decision maker. The agent assisted algorithm is not specific to any interactive method or s…

surrogate problem NIMBUS PAINTmultiple objective programmingagent-based optimizationinteractive methods
researchProduct

A Fixed Domain Approach in Shape Optimization Problems with Neumann Boundary Conditions

2008

Fixed domain methods have well-known advantages in the solution of variable domain problems, but are mainly applied in the case of Dirichlet boundary conditions. This paper examines a way to extend this class of methods to the more difficult case of Neumann boundary conditions.

symbols.namesakeFictitious domain methodDirichlet boundary conditionMathematical analysissymbolsNeumann boundary conditionShape optimizationBoundary value problemMixed boundary conditionDomain (mathematical analysis)Robin boundary condition
researchProduct

Arm Space Decomposition as a Strategy for Tackling Large Scale Multi-armed Bandit Problems

2013

Recent multi-armed bandit based optimization schemes provide near-optimal balancing of arm exploration against arm exploitation, allowing the optimal arm to be identified with probability arbitrarily close to unity. However, the convergence speed drops dramatically as the number of bandit arms grows large, simply because singling out the optimal arm requires experimentation with all of the available arms. Furthermore, effective exploration and exploitation typically demands computational resources that grow linearly with the number of arms. Although the former problem can be remedied to some degree when prior knowledge about arm correlation is available, the latter problem persists. In this…

symbols.namesakeMathematical optimizationComputer scienceNash equilibriumMulti-agent systemsymbolsSampling (statistics)Game theoryThompson samplingMulti-armed bandit2013 12th International Conference on Machine Learning and Applications
researchProduct

An Improved Method for Estimating the Time ACF of a Sum of Complex Plane Waves

2010

Time averaging is a well-known technique for evaluating the temporal autocorrelation function (ACF) from a sample function of a stochastic process. For stochastic processes that can be modelled as a sum of plane waves, it is shown that the ACF obtained by time averaging can be expressed as a sum of auto-terms (ATs) and cross-terms (CTs). The ATs result from the autocorrelation of the individual plane waves, while the CTs are due to the cross-correlation between different plane wave components. The CTs cause an estimation error of the ACF. This estimation error increases as the observation time decreases. For the practically important case that the observation time interval is limited, we pr…

symbols.namesakeMathematical optimizationFourier transformStochastic processKernel (statistics)AutocorrelationMathematical analysisPlane wavesymbolsInterval (mathematics)Frequency modulationComplex planeMathematics2010 IEEE Global Telecommunications Conference GLOBECOM 2010
researchProduct

Parallel Genetic Solution for Multiobjective MDO

1997

Publisher Summary This chapter reviews a multiobjective, multidisciplinary design optimization of two-dimensional airfoil designs. The control points on leading and trailing edges remain fixed, and the y-coordinates of the other control points are allowed to change during the optimization process. The grid for the Euler solver depends continuously and smoothly on the design parameters. The number of nodes and elements in the mesh might vary according to design because the meshes for the Helmholtz solver are done using the local fitting. The computations are made on an IBM SP2 parallel computer using high-performance switch and the MPICH message-passing library. As gradients are not required…

symbols.namesakeMathematical optimizationMPICHMultidisciplinary design optimizationHelmholtz free energyConvergence (routing)symbolsPolygon meshShape optimizationSolverGridMathematics
researchProduct

Surrogate-assisted evolutionary multiobjective shape optimization of an air intake ventilation system

2017

We tackle three different challenges in solving a real-world industrial problem: formulating the optimization problem, connecting different simulation tools and dealing with computationally expensive objective functions. The problem to be optimized is an air intake ventilation system of a tractor and consists of three computationally expensive objective functions. We describe the modeling of the system and its numerical evaluation with a commercial software. To obtain solutions in few function evaluations, a recently proposed surrogate-assisted evolutionary algorithm K-RVEA is applied. The diameters of four different outlets of the ventilation system are considered as decision variables. Fr…

ta1130209 industrial biotechnologyMathematical optimizationnumerical modelsOptimization problemlineaarinen optimointiLinear programmingComputer sciencesoftwarehydraulijärjestelmätventilationEvolutionary algorithmlinear programming02 engineering and technologyFunction (mathematics)Set (abstract data type)resistance020901 industrial engineering & automationhydraulic systemsilmanvaihto0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingShape optimizationoptimization
researchProduct

Simultaneous optimization of harvest schedule and measurement strategy

2013

In many recent studies, the value of forest inventory information in the harvest scheduling has been examined. Usually only the profitability of measuring simultaneously all the stands in the area is examined. Yet, it may be more profitable to concentrate the measurement efforts to some subset of them. In this paper, the authors demonstrate that stochastic optimization can be used for defining the optimal measurement strategy simultaneously with the harvest decisions. The results show that without end-inventory constraints, it was most profitable to measure the stands that were just below the medium age. Measuring the oldest stands was not profitable at all. It turned out to be profitable t…

ta113040101 forestryForest inventory010504 meteorology & atmospheric sciencesOperations researchpäätöksentekota111Scheduling (production processes)ForestryTime horizon04 agricultural and veterinary sciencesstochastic optimization15. Life on landta411201 natural sciencesInformation economicsinformation economics0401 agriculture forestry and fisheriesProfitability indexStochastic optimizationforest inventorySimultaneous optimizationconstraints0105 earth and related environmental sciencesMathematicsScandinavian Journal of Forest Research
researchProduct

Exact extension of the DIRECT algorithm to multiple objectives

2019

The direct algorithm has been recognized as an efficient global optimization method which has few requirements of regularity and has proven to be globally convergent in general cases. direct has been an inspiration or has been used as a component for many multiobjective optimization algorithms. We propose an exact and as genuine as possible extension of the direct method for multiple objectives, providing a proof of global convergence (i.e., a guarantee that in an infinite time the algorithm becomes everywhere dense). We test the efficiency of the algorithm on a nonlinear and nonconvex vector function. peerReviewed

ta113Computer scienceDirect methodta111multi-objective optimisationExtension (predicate logic)algorithmsMulti-objective optimizationmonitavoiteoptimointiNonlinear systemComponent (UML)Convergence (routing)algoritmitGlobal optimizationVector-valued functionAlgorithm
researchProduct

Wastewater treatment: New insight provided by interactive multiobjective optimization

2011

In this paper, we describe a new interactive tool developed for wastewater treatment plant design. The tool is aimed at supporting the designer in designing new wastewater treatment plants as well as optimizing the performance of already available plants. The idea is to utilize interactive multiobjective optimization which enables the designer to consider the design with respect to several conflicting evaluation criteria simultaneously. This is more important than ever because the requirements for wastewater treatment plants are getting tighter and tighter from both environmental and economical reasons. By combining a process simulator to simulate wastewater treatment and an interactive mul…

ta113Decision support systemInformation Systems and ManagementOperations researchProcess (engineering)business.industrySoftware developmentMulti-objective optimizationManufacturing engineeringManagement Information SystemsSimulation-based optimizationArts and Humanities (miscellaneous)WastewaterDevelopmental and Educational PsychologyDesign processbusinessEngineering design processInformation SystemsDecision Support Systems
researchProduct

E-NAUTILUS: A decision support system for complex multiobjective optimization problems based on the NAUTILUS method

2015

Interactive multiobjective optimization methods cannot necessarily be easily used when (industrial) multiobjective optimization problems are involved. There are at least two important factors to be considered with any interactive method: computationally expensive functions and aspects of human behavior. In this paper, we propose a method based on the existing NAUTILUS method and call it the Enhanced NAUTILUS (E-NAUTILUS) method. This method borrows the motivation of NAUTILUS along with the human aspects related to avoiding trading-off and anchoring bias and extends its applicability for computationally expensive multiobjective optimization problems. In the E-NAUTILUS method, a set of Pareto…

ta113Decision support systemMathematical optimizationInformation Systems and ManagementOptimization problemMultiple criteria optimizationGeneral Computer ScienceComputer sciencePareto principleTrading-offManagement Science and Operations ResearchSpace (commercial competition)Multiple objective programmingMulti-objective optimizationIndustrial and Manufacturing EngineeringSet (abstract data type)Modeling and SimulationPoint (geometry)Computational costInteractive methodsEuropean Journal of Operational Research
researchProduct