Search results for "optimization algorithm"

showing 10 items of 51 documents

Ant Colony Optimisation-Based Classification Using Two-Dimensional Polygons

2016

The application of Ant Colony Optimization to the field of classification has mostly been limited to hybrid approaches which attempt at boosting the performance of existing classifiers (such as Decision Trees and Support Vector Machines (SVM)) — often through guided feature reductions or parameter optimizations.

0209 industrial biotechnologyBoosting (machine learning)business.industryComputer scienceAnt colony optimization algorithmsDecision treePattern recognition02 engineering and technologyAnt colonycomputer.software_genreSwarm intelligenceSupport vector machineComputingMethodologies_PATTERNRECOGNITION020901 industrial engineering & automationKernel method0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingArtificial intelligenceData miningbusinesscomputer
researchProduct

Strategies for accelerating ant colony optimization algorithms on graphical processing units

2007

Ant colony optimization (ACO) is being used to solve many combinatorial problems. However, existing implementations fail to solve large instances of problems effectively. In this paper we propose two ACO implementations that use graphical processing units to support the needed computation. We also provide experimental results by solving several instances of the well-known orienteering problem to show their features, emphasizing the good properties that make these implementations extremely competitive versus parallel approaches.

Extremal optimizationMathematical optimizationTheoretical computer scienceOptimization problemComputer scienceComputationAnt colony optimization algorithmsArtificial lifeMetaheuristicParallel metaheuristic2007 IEEE Congress on Evolutionary Computation
researchProduct

Damage identification by Lévy ant colony optimization

2010

This paper deals with the identification of incipient damage in structural elements by non-destructive test based on experimentally measured structural dynamical response. By applycation of the Hilbert transform to the recorded signal the so-called phase of the analytical signal is recovered and a proper functional is constructed in such a way that its global minimum gives a measure of the damage level, meant as stiffness reduction. Minimization is achieved by applying a modified Ant Colony Optimization (ACO) for continuous variables, inspired by the ants’ forageing behavior. The modification consists in the application of a new perturbation operator, based on alpha stable Lévy distribution…

business.industryComputer sciencedamage identification optimization levy acorAnt colony optimization algorithmsIdentification (biology)Pattern recognitionArtificial intelligenceSettore ICAR/08 - Scienza Delle Costruzionibusiness
researchProduct

Velocity sensorless control of uncertain load using RKF tuned with an evolutionary algorithm and mu-analysis

2010

Abstract In case of a velocity control scheme for a load directly driven by an actuator, large variations of its parameters are problematic due to possible instability and large variations of the final performances. This performances are then decreasing if a sensorless control is implemented due to cost, reliability or application constraints. This paper proposes solutions to quickly and accurately tune an observer with a lower computer time consumption and lower conception time. A previous calculated state feedback is used as base for a Kalman filter with special noise matrices. An evolutionary algorithm optimizes the observers degrees of freedom all over the variations. The mu-analysis th…

Engineeringevolutionary algorithmOptimization algorithmbusiness.industrymotion controlEvolutionary algorithmrobust Kalman filterKalman filtermu-analysiMotion controlInstabilityMotion control ; Robustness ; OptimizationSettore ING-INF/04 - AutomaticaRobustness (computer science)Control theorySenseless controlbusinessActuatorrobustneoptimization[SPI.NRJ] Engineering Sciences [physics]/Electric powerIFAC Proceedings Volumes
researchProduct

An environment based approach for the ant colony convergence

2020

Abstract Ant colony optimization (ACO) algorithms are a bio inspired solutions which have been very successful in combinatorial problem solving, also known as NP-hard problems, including transportation system optimization. As opposed to exact methods, which could give the best results of a tested problem, this meta-heuristics is based on the stochastic logic but not on theoretical mathematics demonstration (or only on certain well defined applications). According to this, the weak point of this meta-heuristics is his convergence, its termination condition. We can finds many different termination criteria in the scientific literature, yet most of them are costly in resources and unsuitable f…

Ant ColonyEnvironment approachMathematical optimization021103 operations researchComputer science[SPI] Engineering Sciences [physics]Ant colony optimization algorithms0211 other engineering and technologiesSystem optimization02 engineering and technologyAnt colonyStochastic logic[SPI]Engineering Sciences [physics]Order (exchange)Convergence (routing)0202 electrical engineering electronic engineering information engineeringDynamic convergenceGeneral Earth and Planetary Sciences020201 artificial intelligence & image processingPoint (geometry)ComputingMilieux_MISCELLANEOUSGeneral Environmental Science
researchProduct

On the Extension of the DIRECT Algorithm to Multiple Objectives

2020

AbstractDeterministic global optimization algorithms like Piyavskii–Shubert, direct, ego and many more, have a recognized standing, for problems with many local optima. Although many single objective optimization algorithms have been extended to multiple objectives, completely deterministic algorithms for nonlinear problems with guarantees of convergence to global Pareto optimality are still missing. For instance, deterministic algorithms usually make use of some form of scalarization, which may lead to incomplete representations of the Pareto optimal set. Thus, all global Pareto optima may not be obtained, especially in nonconvex cases. On the other hand, algorithms attempting to produce r…

Control and Optimization0211 other engineering and technologies02 engineering and technologyManagement Science and Operations ResearchMulti-objective optimizationSet (abstract data type)Local optimumoptimointialgoritmitConvergence (routing)0202 electrical engineering electronic engineering information engineeringmultiobjective optimizationmultiple criteria optimizationMathematics021103 operations researchApplied MathematicsPareto principleDIRECT algorithmmonitavoiteoptimointiComputer Science Applicationsglobal convergenceNonlinear systemdeterminantitHausdorff distancemonimuuttujamenetelmät020201 artificial intelligence & image processingHeuristicsdeterministic optimization algorithmsAlgorithmJournal of Global Optimization
researchProduct

Design Optimization Automation for Luminaire Reflectors Using COMSOL Multiphysics and Performance Comparison Against Zemax Opticstudio

2019

This work showcases the complete design pipeline based on COMSOL Multiphysics for one of the luminaire models manufactured by Vizulo. Generation of optimization targets, ray tracing models and utilized optimization algorithms are described. The authors also evaluate the performance of COMSOL against Zemax OpticStudio Premium, a specialized optics design suite widely used by the optics industry. Out-of-the-box version of both packages are tested: ray tracing and optimization performance are compared. It is found that, while OpticStudio' ray tracer is by far superior, OpticStudio is greatly outperformed by COMSOL in optimization tasks for considered problems. Other aspects of both packages ar…

Optimization algorithmComputer sciencebusiness.industryPerformance comparisonMultiphysicsMechanical engineeringRay tracing (graphics)businessAutomationZemax2019 XXI International Conference Complex Systems: Control and Modeling Problems (CSCMP)
researchProduct

Synthetic Genes for artificial ants. Diversity in ant colony optimization algorithms

2010

Inspired from the fact that the real world ants from within a colony are not clones (although they may look alike, they are different from one another), in this paper, the authors are presenting an adapted ant colony optimisation (ACO) algorithm that incorporates methods and ideas from genetic algorithms (GA). Following the first (introductory) section of the paper is presented the history and the state of the art, beginning with the stigmergy and genetic concepts and ending with the latest ACO algorithm variants as multiagent systems (MAS). The rationale and the approach sections are aiming at presenting the problems with current stigmergy-based algorithms and at proposing a (possible - ye…

Computer Networks and CommunicationsComputer sciencebusiness.industryMulti-agent systemAnt colony optimization algorithmsLocal variableAnt colonyStigmergyComputer Science ApplicationsComputational Theory and MathematicsConvergence (routing)Artificial intelligenceState (computer science)businessClosing (morphology)
researchProduct

2019

Worries about possible harmful effects of new technologies (modern health worries) have intensely been investigated in the last decade. However, the comparability of translated self-report measures across countries is often problematic. This study aimed to overcome this problem by developing psychometrically sound brief versions of the widely used 25-item Modern Health Worries Scale (MHWS) suitable for multi-country use. Based on data of overall 5,176 individuals from four European countries (England, Germany, Hungary, Sweden), Ant Colony Optimization was used to identify the indicators that optimize model fit and measurement invariance across countries. Two scales were developed. A short (…

050103 clinical psychologyMultidisciplinaryPublic economicsPsychometricsEmerging technologiesAnt colony optimization algorithms05 social sciencesComparabilityItem selection050109 social psychologyCross-cultural studies0501 psychology and cognitive sciencesMeasurement invariancePsychologyPLOS ONE
researchProduct

Efficient evolutionary approach to approximate the Pareto-optimal set in multiobjective optimization, UPS-EMOA

2010

Solving real-life engineering problems requires often multiobjective, global, and efficient (in terms of objective function evaluations) treatment. In this study, we consider problems of this type by discussing some drawbacks of the current methods and then introduce a new population-based multiobjective optimization algorithm UPS-EMOA which produces a dense (not limited to the population size) approximation of the Pareto-optimal set in a computationally effective manner.

Set (abstract data type)Pareto optimalMathematical optimizationControl and OptimizationApplied MathematicsPopulation sizeNew populationMulti-objective optimizationSoftwareMathematicsMultiobjective optimization algorithmOptimization Methods and Software
researchProduct