Search results for " optimization."

showing 10 items of 2333 documents

Data-Driven Interactive Multiobjective Optimization Using a Cluster-Based Surrogate in a Discrete Decision Space

2019

In this paper, a clustering based surrogate is proposed to be used in offline data-driven multiobjective optimization to reduce the size of the optimization problem in the decision space. The surrogate is combined with an interactive multiobjective optimization approach and it is applied to forest management planning with promising results. peerReviewed

data-driven optimizationMathematical optimizationOptimization problemComputer scienceboreal forest managementComputer Science::Neural and Evolutionary Computationpäätöksenteko0211 other engineering and technologiesMathematicsofComputing_NUMERICALANALYSISdecision maker02 engineering and technologypreference informationSpace (commercial competition)Multi-objective optimizationComputingMethodologies_ARTIFICIALINTELLIGENCEData-drivenklusteritoptimointi0202 electrical engineering electronic engineering information engineeringCluster analysis021103 operations researchsurrogatesComputingMethodologies_PATTERNRECOGNITIONboreaalinen vyöhyke020201 artificial intelligence & image processingmetsänhoitoCluster basedclustering
researchProduct

Data-Driven Evolutionary Optimization: An Overview and Case Studies

2019

Most evolutionary optimization algorithms assume that the evaluation of the objective and constraint functions is straightforward. In solving many real-world optimization problems, however, such objective functions may not exist, instead computationally expensive numerical simulations or costly physical experiments must be performed for fitness evaluations. In more extreme cases, only historical data are available for performing optimization and no new data can be generated during optimization. Solving evolutionary optimization problems driven by data collected in simulations, physical experiments, production processes, or daily life are termed data-driven evolutionary optimization. In this…

data-driven optimizationMathematical optimizationOptimization problemmodel managementevoluutiolaskenta02 engineering and technologymatemaattinen optimointiEvolutionary computationTheoretical Computer ScienceData modelingData-drivenModel managementkoneoppiminenComputational Theory and MathematicsdatatiedeoptimointiTaxonomy (general)Constraint functionsalgoritmit0202 electrical engineering electronic engineering information engineeringProduction (economics)020201 artificial intelligence & image processingsurrogateevolutionary algorithmsSoftware
researchProduct

A data-driven surrogate-assisted evolutionary algorithm applied to a many-objective blast furnace optimization problem

2017

A new data-driven reference vector-guided evolutionary algorithm has been successfully implemented to construct surrogate models for various objectives pertinent to an industrial blast furnace. A total of eight objectives have been modeled using the operational data of the furnace using 12 process variables identified through a principal component analysis and optimized simultaneously. The capability of this algorithm to handle a large number of objectives, which has been lacking earlier, results in a more efficient setting of the operational parameters of the furnace, leading to a precisely optimized hot metal production process. peerReviewed

data-driven optimizationPareto optimalityEngineeringBlast furnaceMathematical optimizationOptimization problemmodel managementblast furnaceEvolutionary algorithm02 engineering and technologyMulti-objective optimizationIndustrial and Manufacturing Engineering020501 mining & metallurgyData-drivenironmakingoptimointi0202 electrical engineering electronic engineering information engineeringGeneral Materials Scienceta113business.industrypareto-tehokkuusMechanical EngineeringProcess (computing)metamodelingMetamodeling0205 materials engineeringmulti-objective optimizationMechanics of MaterialsPrincipal component analysis020201 artificial intelligence & image processingbusinessrautateollisuus
researchProduct

Data-driven Interactive Multiobjective Optimization : Challenges and a Generic Multi-agent Architecture

2020

In many decision making problems, a decision maker needs computer support in finding a good compromise between multiple conflicting objectives that need to be optimized simultaneously. Interactive multiobjective optimization methods have a lot of potential for solving such problems. However, the growth of complexity in problem formulations and the abundance of data bring new challenges to be addressed by decision makers and method developers. On the other hand, advances in the field of artificial intelligence provide opportunities in this respect. We identify challenges and propose directions of addressing them in interactive multiobjective optimization methods with the help of multiple int…

decision supportComputer science020209 energyCompromisemedia_common.quotation_subjectpäätöksentekopäätöksentukijärjestelmät02 engineering and technologycomputer.software_genreMulti-objective optimizationField (computer science)Data-drivenIntelligent agentcomputational intelligence0202 electrical engineering electronic engineering information engineeringmulti-agent systemsAgent architecturemultiple criteria optimizationGeneral Environmental Sciencemedia_commoninteractive methodsmonitavoiteoptimointiagentsRisk analysis (engineering)data-driven decision makinginteraktiivisuusälykkäät agentitGeneral Earth and Planetary Sciences020201 artificial intelligence & image processingcomputer
researchProduct

A decomposition approach for multidimensional knapsacks with family-split penalties

2022

The optimization of Multidimensional Knapsacks with Family-Split Penalties has been introduced in the literature as a variant of the more classical Multidimensional Knapsack and Multi-Knapsack problems. This problem deals with a set of items partitioned in families, and when a single item is picked to maximize the utility, then all items in its family must be picked. Items from the same family can be assigned to different knapsacks, and in this situation split penalties are paid. This problem arises in real applications in various fields. This paper proposes a new exact and fast algorithm based on a specific Combinatorial Benders Cuts scheme. An extensive experimental campaign computational…

decomposition methodsknapsack problemsManagement of Technology and InnovationStrategy and Managementdecomposition methoddiscrete optimizationbenders cutsbenders cutknapsack problemManagement Science and Operations ResearchBusiness and International Managementinteger programmingComputer Science Applications
researchProduct

On approaches for solving computationally expensive multiobjective optimization problems

2016

In this thesis, we consider solving computationally expensive multiobjective optimization problems that take into account the preferences of a decision maker (DM). The aim is to support the DM in identifying the most preferred solution for problems that have several conflicting objectives and when the evaluation of the candidate solutions is time consuming. This is conducted by replacing computationally expensive functions with computationally inexpensive functions, known as surrogates. First, based on a literature survey, we introduce two frameworks, i.e., a sequential and an adaptive framework, based on which surrogate-based methods are classified and compared. We then identify relevant cha…

decompositionpareto-tehokkuussijaismallipäätöksentekomultiobjective optimizationsurrogatedecision-makinghajotelmamatemaattinen optimointimonitavoiteoptimointicomputational costlaskennallinen vaativuus
researchProduct

Robust delay-dependent H∞ control of uncertain time-delay systems with mixed neutral, discrete, and distributed time-delays and Markovian switching p…

2011

Author's version of an article published in the journal: IEEE Transactions on Circuits and Systems I: Regular Papers. Also available from the publisher at: http://dx.doi.org/10.1109/tcsi.2011.2106090 The problem of robust mode-dependent delayed state feedback H ∞ control is investigated for a class of uncertain time-delay systems with Markovian switching parameters and mixed discrete, neutral, and distributed delays. Based on the LyapunovKrasovskii functional theory, new required sufficient conditions are established in terms of delay-dependent linear matrix inequalities for the stochastic stability and stabilization of the considered system using some free matrices. The desired control is …

delay systems H∞ control linear matrix inequalities Markov processes uncertain systems delay-dependent delayed state feedback distributed delays Lyapunov-Krasovskii functionals Markovian switching numerical example Stochastic stability and stabilization sufficient conditions uncertain time-delay system control system stability convex optimization delay control systems stabilization state feedback switching systems time delay uncertainty analysis discrete time control systemsVDP::Technology: 500::Mechanical engineering: 570VDP::Mathematics and natural science: 400::Mathematics: 410
researchProduct

Wireless Sensor Network Operating System Design Rules Based on Real-World Deployment Survey

2013

Wireless sensor networks (WSNs) have been a widely researched field since the beginning of the 21st century. The field is already maturing, and TinyOS has established itself as the de facto standard WSN Operating System (OS). However, the WSN researcher community is still active in building more flexible, efficient and user-friendly WSN operating systems. Often, WSN OS design is based either on practical requirements of a particular research project or research group's needs or on theoretical assumptions spread in the WSN community. The goal of this paper is to propose WSN OS design rules that are based on a thorough survey of 40 WSN deployments. The survey unveils trends of WSN applic…

design rulesControl and OptimizationComputer Networks and CommunicationsComputer sciencecomputer.software_genreUSablelcsh:TechnologyField (computer science)ComputerApplications_MISCELLANEOUSoperating systemdeploymentsurveyComputerSystemsOrganization_SPECIAL-PURPOSEANDAPPLICATION-BASEDSYSTEMSwireless sensor networksInstrumentationbusiness.industrylcsh:TComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSwireless sensor networks; deployment; survey; operating system; design rulesSoftware deploymentOperating systembusinessWireless sensor networkcomputerComputer networkDe facto standardJournal of Sensor and Actuator Networks; Volume 2; Issue 3; Pages: 509-556
researchProduct

Lipschitz Carnot-Carathéodory Structures and their Limits

2022

AbstractIn this paper we discuss the convergence of distances associated to converging structures of Lipschitz vector fields and continuously varying norms on a smooth manifold. We prove that, under a mild controllability assumption on the limit vector-fields structure, the distances associated to equi-Lipschitz vector-fields structures that converge uniformly on compact subsets, and to norms that converge uniformly on compact subsets, converge locally uniformly to the limit Carnot-Carathéodory distance. In the case in which the limit distance is boundedly compact, we show that the convergence of the distances is uniform on compact sets. We show an example in which the limit distance is not…

differentiaaligeometriaNumerical AnalysissäätöteoriaControl and OptimizationAlgebra and Number Theorysub-Riemannian geometryMitchell’s theoremControl and Systems Engineeringsub-Finsler geometryLipschitz vector fieldsmittateoria
researchProduct

Distributed optimal power flow for islanded microgrids: An application to the Smart Polygeneration Microgrid of the Genoa University

2016

In this work, the application of an original distributed optimal power flow method to test a microgrid in the Savona area, Italy is proposed. The microgrid shows different types of Distributed Energy Resources (DERs) and is connected to the main grid through a fixed power bus. Due to the high computational speed, the applied distributed Optimal Power Flow can be performed almost in real time, i.e. every 5 minutes or less. The operating solution found for generators, simply using local information, corresponds to a suboptimal condition with reduced losses, bus voltages and line currents within constrained intervals. The distributed optimization algorithm is iterative, but also fast. It is ba…

distributed optimization micro-grids optimal power flowbusiness.industryBusbarHeuristic (computer science)Computer science020209 energyComputer Science Applications1707 Computer Vision and Pattern Recognitionmicro-grids02 engineering and technologyMicro-gridGridDistributed optimizationEvery 5 minutesSettore ING-IND/33 - Sistemi Elettrici Per L'EnergiaPower flowComputer Networks and CommunicationControl theoryDistributed generationUrban Studie0202 electrical engineering electronic engineering information engineeringMicrogridbusinessOptimal power flowSimulationVoltage2016 IEEE International Smart Cities Conference (ISC2)
researchProduct