Academic literature on the topic 'Algoritmus PSO'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Algoritmus PSO.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Algoritmus PSO"

1

Tang, Zhonghua, and Yongquan Zhou. "A Glowworm Swarm Optimization Algorithm for Uninhabited Combat Air Vehicle Path Planning." Journal of Intelligent Systems 24, no. 1 (March 1, 2015): 69–83. http://dx.doi.org/10.1515/jisys-2013-0066.

Full text
Abstract:
AbstractUninhabited combat air vehicle (UCAV) path planning is a complicated, high-dimension optimization problem. To solve this problem, we present in this article an improved glowworm swarm optimization (GSO) algorithm based on the particle swarm optimization (PSO) algorithm, which we call the PGSO algorithm. In PGSO, the mechanism of a glowworm individual was modified via the individual generation mechanism of PSO. Meanwhile, to improve the presented algorithm’s convergence rate and computational accuracy, we reference the idea of parallel hybrid mutation and local search near the global optimal location. To prove the performance of the proposed algorithm, PGSO was compared with 10 other population-based optimization methods. The experiment results show that the proposed approach is more effective in UCAV path planning than most of the other meta-heuristic algorithms.
APA, Harvard, Vancouver, ISO, and other styles
2

Jovanović, Dražen, Martin Ćalasan, and Milovan Radulović. "Estimation of solar cell parameters using PSO algorithm." Tehnika 74, no. 1 (2019): 91–96. http://dx.doi.org/10.5937/tehnika1901091j.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mujičić, Danilo, Martin Ćalasan, and Milovan Radulović. "Application of PSO algorithm in transformer parameter estimation." Tehnika 74, no. 2 (2019): 251–57. http://dx.doi.org/10.5937/tehnika1902251m.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lemonge, Afonso Celso de Castro, Patrícia Habib Hallak, and José Pedro Gonçalves Carvalho. "Otimização estrutural de treliças considerando restrições de frequências naturais de vibração." Principia: Caminhos da Iniciação Científica 18, no. 2 (March 5, 2020): 14. http://dx.doi.org/10.34019/2179-3700.2018.v18.29874.

Full text
Abstract:
Este artigo apresenta um Algoritmo Evolucionário (AE) baseado no comportamento de enxame de partículas (Particle Swarm Optimization - PSO) adaptado para a obtenção de soluções de problemas de otimização estrutural com restrições. O PSO é um algoritmo de fácil implementação e competitivo perante os demais algoritmos populacionais inspirados na natureza. Neste artigo, são analisados problemas de otimização estrutural de treliças submetidas a restrições de frequências naturais de vibração. Para o tratamento destas restrições, incorpora-se ao PSO uma técnica de penalização adaptativa (Adaptive Penalty Method - APM), que tem demonstrado robustez e eficiência quando aplicada no tratamento de problemas de otimização com restrições. O algoritmo proposto é validado através de experimentos computacionais em problemas de otimização estrutural amplamente discutidos na literatura.
APA, Harvard, Vancouver, ISO, and other styles
5

Quah, Titus, Derek Machalek, and Kody M. Powell. "Comparing Reinforcement Learning Methods for Real-Time Optimization of a Chemical Process." Processes 8, no. 11 (November 19, 2020): 1497. http://dx.doi.org/10.3390/pr8111497.

Full text
Abstract:
One popular method for optimizing systems, referred to as ANN-PSO, uses an artificial neural network (ANN) to approximate the system and an optimization method like particle swarm optimization (PSO) to select inputs. However, with reinforcement learning developments, it is important to compare ANN-PSO to newer algorithms, like Proximal Policy Optimization (PPO). To investigate ANN-PSO’s and PPO’s performance and applicability, we compare their methodologies, apply them on steady-state economic optimization of a chemical process, and compare their results to a conventional first principles modeling with nonlinear programming (FP-NLP). Our results show that ANN-PSO and PPO achieve profits nearly as high as FP-NLP, but PPO achieves slightly higher profits compared to ANN-PSO. We also find PPO has the fastest computational times, 10 and 10,000 times faster than FP-NLP and ANN-PSO, respectively. However, PPO requires more training data than ANN-PSO to converge to an optimal policy. This case study suggests PPO has better performance as it achieves higher profits and faster online computational times. ANN-PSO shows better applicability with its capability to train on historical operational data and higher training efficiency.
APA, Harvard, Vancouver, ISO, and other styles
6

Obando Paredes, Edgar Dario. "Algoritmos genéticos y PSO aplicados a un problema de generación distribuida." Scientia et technica 22, no. 1 (March 30, 2017): 15. http://dx.doi.org/10.22517/23447214.14301.

Full text
Abstract:
En este informe se presentan los resultados de la aplicación de algoritmos genéticos y PSO (Particle Swarm Optimization), para optimizar un problema de generación distribuida (GD) de potencia que debe cumplir ciertas restricciones. Para la implementación del algoritmo genético se utiliza el toolbox de Matlab ya implementado variando algunos parámetros como fracción de mutación, población etc. Lo anterior para compararlo con la función fmincon ya implementada dentro del ambiente Matlab y sacar conclusiones en cuanto a tasa de convergencia y error entre los datos. El Algoritmo PSO fue implementado teniendo en cuenta procesos estocásticos basados en suerte, definiendo propiedades intrínsecas a él, tal como tamaño de población, factor de inercia etc.
APA, Harvard, Vancouver, ISO, and other styles
7

Vojtíšek, Michal, and Martin Kotek. "Estimation of Engine Intake Air Mass Flow using a generic Speed-Density method." Journal of Middle European Construction and Design of Cars 12, no. 1 (October 1, 2014): 7–15. http://dx.doi.org/10.2478/mecdc-2014-0002.

Full text
Abstract:
SHRNUTÍ Měření výfukových emisí spalovacích motorů během reálného provozu přenosnými zařízeními umístěnými na palubě vozidla (PEMS) je důležitou součástí hodnocení dopadu nových paliv a technologií na životní prostředí a lidské zdraví. Znalost aktuálního toku výfukových plynů je jedním z nezbytných předpokladů pro takové provozní měření. Jedním z nejjednodušších způsobů je výpočet z toku nasáveného vzduchu, který je vypočten z měřených otáček motoru a tlaku a teploty náplně v sacím potrubí. V této práci byl obecný algoritmus využívající odhad dopravní účinnosti libovolného běžného čtyřdobého motoru aplikován na tři produkční evropské motory běžně využívané v ČR: těžký a automobilový přeplňovaný vznětový motor, a atmosférický zážehový motor. Vypočtené průtoky nasávaného vzduchu byly porovnány s různými referenčními metodami. Výsledky ukazují, že nejistota stanovení toku nasáveného vzduchu obecným algoritmem je v řádu 10% pro většinu provozních režimů motoru, kromě případů recirkulace velké části výfukových plynů, kdy nejistota vzrůstá na desítky procent. Desetiprocentní nejistota pro motory bez vysoké míry recirkulace výfukových plynů je přijatelná pro mnohá, zvláště průzkumná a orientační, měření emisí za provozu, a může být snížena kalibrací algoritmu pro daný motor.
APA, Harvard, Vancouver, ISO, and other styles
8

Lenin, K. "POLAR PARTICLE SWARM OPTIMIZATION ALGORITHM FOR SOLVING OPTIMAL REACTIVE POWER PROBLEM." International Journal of Research -GRANTHAALAYAH 6, no. 6 (June 30, 2018): 335–45. http://dx.doi.org/10.29121/granthaalayah.v6.i6.2018.1378.

Full text
Abstract:
This paper presents Polar Particle Swarm optimization (PPSO) algorithm for solving optimal reactive power problem. The standard Particle Swarm Optimization (PSO) algorithm is an innovative evolutionary algorithm in which each particle studies its own previous best solution and the group’s previous best to optimize problems. In the proposed PPSO algorithm that enhances the behaviour of PSO and avoids the local minima problem by using a polar function to search for more points in the search space in order to evaluate the efficiency of proposed algorithm, it has been tested on IEEE 30 bus system and compared to other algorithms. Simulation results demonstrate good performance of the Polar Particle Swarm optimization (PPSO) algorithm in solving an optimal reactive power problem.
APA, Harvard, Vancouver, ISO, and other styles
9

Chu, Shu-Chuan, Zhi-Gang Du, and Jeng-Shyang Pan. "Symbiotic Organism Search Algorithm with Multi-Group Quantum-Behavior Communication Scheme Applied in Wireless Sensor Networks." Applied Sciences 10, no. 3 (January 31, 2020): 930. http://dx.doi.org/10.3390/app10030930.

Full text
Abstract:
The symbiotic organism search (SOS) algorithm is a promising meta-heuristic evolutionary algorithm. Its excellent quality of global optimization solution has aroused the interest of many researchers. In this work, we not only applied the strategy of multi-group communication and quantum behavior to the SOS algorithm, but also formed a novel global optimization algorithm called the MQSOS algorithm. It has speed and convergence ability and plays a good role in solving practical problems with multiple arguments. We also compared MQSOS with other intelligent algorithms under the CEC2013 large-scale optimization test suite, such as particle swarm optimization (PSO), parallel PSO (PPSO), adaptive PSO (APSO), QUasi-Affine TRansformation Evolutionary (QUATRE), and oppositional SOS (OSOS). The experimental results show that MQSOS algorithm had better performance than the other intelligent algorithms. In addition, we combined and optimized the DV-hop algorithm for node localization in wireless sensor networks, and also improved the DV-hop localization algorithm to achieve higher localization accuracy than some existing algorithms.
APA, Harvard, Vancouver, ISO, and other styles
10

Cheng, Shi, Yuhui Shi, and Quande Qin. "Experimental Study on Boundary Constraints Handling in Particle Swarm Optimization." International Journal of Swarm Intelligence Research 2, no. 3 (July 2011): 43–69. http://dx.doi.org/10.4018/jsir.2011070104.

Full text
Abstract:
Premature convergence happens in Particle Swarm Optimization (PSO) for solving both multimodal problems and unimodal problems. With an improper boundary constraints handling method, particles may get “stuck in” the boundary. Premature convergence means that an algorithm has lost its ability of exploration. Population diversity is an effective way to monitor an algorithm’s ability of exploration and exploitation. Through the population diversity measurement, useful search information can be obtained. PSO with a different topology structure and a different boundary constraints handling strategy will have a different impact on particles’ exploration and exploitation ability. In this paper, the phenomenon of particles gets “stuck in” the boundary in PSO is experimentally studied and reported. The authors observe the position diversity time-changing curves of PSOs with different topologies and different boundary constraints handling techniques, and analyze the impact of these setting on the algorithm’s ability of exploration and exploitation. From these experimental studies, an algorithm’s ability of exploration and exploitation can be observed and the search information obtained; therefore, more effective algorithms can be designed to solve problems.
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Algoritmus PSO"

1

Ondráček, Pavel. "Optimalizační techniky v obrazových aplikacích." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2021. http://www.nusl.cz/ntk/nusl-442498.

Full text
Abstract:
This thesis deals with methods for optimization in image processing. There is described some of optimization techniques and some applications in image processing. There is also described detailed procedure and realization of bee algorithm, genetic algorithm, PSO algorithm and their realization in image registration, matched filtering, image segmentation and image reconstruction. Algorithms and their efficiencies are compared in the particular application for image processing.
APA, Harvard, Vancouver, ISO, and other styles
2

Götthans, Tomáš. "Pokročilé algoritmy analýzy datových sekvencí v Matlabu." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2010. http://www.nusl.cz/ntk/nusl-218618.

Full text
Abstract:
Cílem této práce je se seznámení s možnostmi programu Matlab z hlediska detailní analýzy deterministických dynamických systémů. Jedná se především o analýzu časové posloupnosti a o nalezení Lyapunových exponentů. Dalším cílem je navrhnout algoritmus umožňující specifikovat chování systému na základě znalosti příslušných diferenciálních rovnic. To znamená, nalezení chaotických systémů.
APA, Harvard, Vancouver, ISO, and other styles
3

Kolářová, Jana. "Evoluční algoritmy pro ultrazvukovou perfúzní analýzu." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2019. http://www.nusl.cz/ntk/nusl-401037.

Full text
Abstract:
This master´s thesis is focused on the application of evolutionary algorithms for interleaving data obtained by ultrasound scanning of tissue. The interleaved curve serves to estimate perfusion parameters, thus allowing to detect possible pathophysiology in the scanned area. The theoretical introduction is devoted to perfusion and its parameters, contrast agents for ultrasonic application, ultrasonic modality scanning, optimization, evolutionary algorithms in general and two selected evolutionary algorithms - genetic algorithm and bee algorithm. These algorithms were tested on noisy data obtained from clinical images of mice with tumor. The final part summarizes the results of the practical part and provides suggestions and recommendations for further possible development.
APA, Harvard, Vancouver, ISO, and other styles
4

Rusnák, Jakub. "Vizualizace algoritmů pro plánování cesty." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2017. http://www.nusl.cz/ntk/nusl-363819.

Full text
Abstract:
Thesis describes library for algorithm vizualization. It helps to create user interface for application with algorithms. It’s usage is demonstrated on some pathfinding algorithms.These applications are presented on web page.
APA, Harvard, Vancouver, ISO, and other styles
5

Hulva, Jiří. "Koevoluční algoritmus pro úlohy založené na testu." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2014. http://www.nusl.cz/ntk/nusl-236019.

Full text
Abstract:
This thesis deals with the usage of coevolution in the task of symbolic regression. Symbolic regression is used for obtaining mathematical formula which approximates the measured data. It can be executed by genetic programming - a method from the category of evolutionary algorithms that is inspired by natural evolutionary processes. Coevolution works with multiple evolutionary processes that are running simultaneously and influencing each other. This work deals with the design and implementation of the application which performs symbolic regression using coevolution on test-based problems. The test set was generated by a new method, which allows to adjust its size dynamically. Functionality of the application was verified on a set of five test tasks. The results were compared with a coevolution algorithm with a fixed-sized test set. In three cases the new method needed lesser number of generations to find a solution of a desired quality, however, in most cases more data-point evaluations were required.
APA, Harvard, Vancouver, ISO, and other styles
6

Volf, Lukáš. "Program pro testování rychlosti šifrovacích algoritmů." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2010. http://www.nusl.cz/ntk/nusl-218674.

Full text
Abstract:
Program for testing of speed of encryption algorithms is project aimed to build a program, which will be able to test specific properties of each single encryption algorithm protocol and results of testing will be saved for later statistical analysis. Program is going to be build in C# program language. In statistical analysis part all data and results from testing of each single algorithm will be processed and reviewed in transparent reports.
APA, Harvard, Vancouver, ISO, and other styles
7

Bodeček, Miroslav. "Algoritmus pro cílené doporučování produktů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2011. http://www.nusl.cz/ntk/nusl-412860.

Full text
Abstract:
The goal of this project is to explore the problem of product recommendations in the area of e-commerce and to evaluate known techniques, design product recommendation system for an existing e-commerce site, implement it and test it. This report introduces the problem, briefly examines current state of affairs in this area and defines requirements for a product recommendation module. The concept of data mining in general is introduced. The report proceeds to present detailed design corresponding to defined requirements and summarizes data gathered during testing phase. It concludes with evaluation and with discussion of the remaining goals for this thesis.
APA, Harvard, Vancouver, ISO, and other styles
8

Povalač, Karel. "Sledování spektra a optimalizace systémů s více nosnými pro kognitivní rádio." Doctoral thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2012. http://www.nusl.cz/ntk/nusl-233577.

Full text
Abstract:
The doctoral thesis deals with spectrum sensing and subsequent use of the frequency spectrum by multicarrier communication system, which parameters are set on the basis of the optimization technique. Adaptation settings can be made with respect to several requirements as well as state and occupancy of individual communication channels. The system, which is characterized above is often referred as cognitive radio. Equipments operating on cognitive radio principles will be widely used in the near future, because of frequency spectrum limitation. One of the main contributions of the work is the novel usage of the Kolmogorov – Smirnov statistical test as an alternative detection of primary user signal presence. The new fitness function for Particle Swarm Optimization (PSO) has been introduced and the Error Vector Magnitude (EVM) parameter has been used in the adaptive greedy algorithm and PSO optimization. The dissertation thesis also incorporates information about the reliability of the frequency spectrum sensing in the modified greedy algorithm. The proposed methods are verified by the simulations and the frequency domain energy detection is implemented on the development board with FPGA.
APA, Harvard, Vancouver, ISO, and other styles
9

Melo, Leonardo Alves Moreira de. "Comparação de algoritmos de enxame de partículas para otimização de problemas em larga escala." Universidade Federal de Goiás, 2018. http://repositorio.bc.ufg.br/tede/handle/tede/9108.

Full text
Abstract:
Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2018-11-29T10:40:19Z No. of bitstreams: 2 Dissertação - Leonardo Alves Moreira de Melo - 2018.pdf: 2693689 bytes, checksum: 850fbad5a82099825d2478ba3415dcac (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2018-11-29T11:09:58Z (GMT) No. of bitstreams: 2 Dissertação - Leonardo Alves Moreira de Melo - 2018.pdf: 2693689 bytes, checksum: 850fbad5a82099825d2478ba3415dcac (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Made available in DSpace on 2018-11-29T11:09:58Z (GMT). No. of bitstreams: 2 Dissertação - Leonardo Alves Moreira de Melo - 2018.pdf: 2693689 bytes, checksum: 850fbad5a82099825d2478ba3415dcac (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2018-10-26
Fundação de Amparo à Pesquisa do Estado de Goiás - FAPEG
In order to address an issue concerning the increasing number of algorithms based on particle swarm optimization (PSO) applied to solve large-scale optimization problems (up to 2000 variables), this article presents analysis and comparisons among five state- of-the-art PSO algorithms (CCPSO2, LSS- PSO, OBL-PSO, SPSO and VCPSO). Tests were performed to illustrate the e ciency and feasibility of using the algorithms for this type of problem. Six benchmark functions most commonly used in the literature (Ackley 1, Griewank, Rastrigin, Rosenbrock, Schwefel 1.2 and Sphere) were tested. The experiments were performed using a high-dimensional problem (500 variables), varying the number of particles (50, 100 and 200 particles) in each algorithm, thus increasing the computational complexity. The analysis showed that the CCPSO2 and OBL-PSO algorithms found significantly better solutions than the other algorithms for more complex multimodal problems (which most resemble realworld problems). However, considering unimodal functions, the CCPSO2 algorithm stood out before the others. Our results and experimental analysis suggest that CCPSO2 and OBL- PSO seem to be highly competitive optimization algorithms to solve complex and multimodal optimization problems.
O número de algoritmos baseados na otimização por enxame de partículas (PSO) aplicados para resolver problemas de otimização em grande escala (até 2.000 variáveis) aumentou significativamente. Este trabalho apresenta análises e comparações entre cinco algoritmos (CCPSO2, LSSPSO, OBL-CPSO, SPSO e VCPSO). Testes foram realizados para ilustrar a eficiência e viabilidade de usar os algoritmos para resolver problemas em larga escala. Seis funções de referência que são comumente utilizadas na literatura (Ackley 1, Griewank, Rastrigin, Rosenbrock, Schwefel 1.2 e Sphere) foram utilizadas para testar a performancedesses algoritmos. Os experimentos foram realizados utilizando um problema de alta dimensionalidade (500 variáveis), variando o número de partículas (50, 100 e 200 partículas) em cada algoritmo, aumentando assim a complexidade computacional. A análise mostrou que os algoritmos CCPSO2 e OBL-CPSO mostraram-se significativamente melhores que os outros algoritmos para problemas multimodais mais complexos (que mais se assemelham a problemas reais). No entanto, considerando as funções unimodais, o algoritmo CCPSO2 destacou-se perante os demais. Nossos resultados e análises experimentais sugerem que o CCPSO2 e o OBL-CPSO são algoritmos de otimização altamente competitivos para resolver problemas de otimização complexos e multimodais em larga escala.
APA, Harvard, Vancouver, ISO, and other styles
10

Horáková, Pavla. "Optimalizace pro registraci obrazů založená na genetických algoritmech." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2012. http://www.nusl.cz/ntk/nusl-219505.

Full text
Abstract:
Diploma thesis is focused on global optimization methods and their utilization for medical image registration. The main aim is creation of the genetic algorithm and test its functionality on synthetic data. Besides test functions and test figures algorithm was subjected to real medical images. For this purpose was created graphical user interface with choise of parameters according to actual requirement. After adding an iterative gradient method it became of hybrid genetic algorithm.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Algoritmus PSO"

1

Ayyadevara, V. Kishore. Pro Machine Learning Algorithms. Berkeley, CA: Apress, 2018. http://dx.doi.org/10.1007/978-1-4842-3564-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Višňák, Jakub. Kvantově chemické algoritmy pro kvantové počítače. Praha: Academia, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Štuller, Július. Inteligentní modely, algoritmy, metody a nástroje pro vytváření sémantického webu: Seminář projektu programu "Informační společnost", 5.10.-7.10.2006, hotel Olympia, Zadov. Praha: Ústav informatiky AV ČR, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ayyadevara, V. Kishore. Pro Machine Learning Algorithms: A Hands-On Approach to Implementing Algorithms in Python and R. Apress, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

López, Javier. Optimización multi-objetivo. Editorial de la Universidad Nacional de La Plata (EDULP), 2015. http://dx.doi.org/10.35537/10915/45214.

Full text
Abstract:
Cuando hablamos de optimización en el ámbito de las ciencias de la computación hacemos referencia al mismo concepto coloquial asociado a esa palabra, la concreción de un objetivo utilizando la menor cantidad de recursos disponibles, o en una visión similar, la obtención del mejor objetivo posible utilizando todos los recursos con lo que se cuenta. Los métodos para encontrar la mejor solución (óptima) varían de acuerdo a la complejidad del problema enfrentado. Para problemas triviales, el cerebro humano posee la capacidad de resolverlos (encontrar la mejor solución) directamente, pero a medida que aumenta la complejidad del problema, se hace necesario contar con herramientas adicionales. En esta dirección, existe una amplia variedad de técnicas para resolver problemas complejos. Dentro de estas técnicas, podemos mencionar las técnicas exactas. Este tipo de algoritmos son capaces de encontrar las soluciones óptimas a un problema dado en una cantidad finita de tiempo. Como contrapartida, requiere que el problema a resolver cumpla con condiciones bastante restrictivas. Existen además un conjunto muy amplio de técnica aproximadas, conocidas como metaheurísticas. Estas técnicas se caracterizan por integrar de diversas maneras procedimientos de mejora local y estrategias de alto nivel para crear un proceso capaz de escapar de óptimos locales y realizar una búsqueda robusta en el espacio de búsqueda del problema. En su evolución, estos métodos han incorporado diferentes estrategias para evitar la convergencia a óptimos locales, especialmente en espacios de búsqueda complejos. Este tipo de procedimientos tienen como principal característica que son aplicables a cualquier tipo de problemas, sin requerir ninguna condición particular a cumplir por los mismos. Estas técnicas no garantizan en ningún caso la obtención de los valores óptimos de los problemas en cuestión, pero se ha demostrado que son capaces de alcanzar muy buenos valores de soluciones en períodos de tiempo cortos. Además, es posible aplicarlas a problemas de diferentes tipos sin mayores modificaciones, mostrando su robustez y su amplio espectro de uso. La mayoría de estas técnicas están inspiradas en procesos biológicos y/o físicos, y tratan de simular el comportamiento propio de estos procesos que favorecen la búsqueda y detección de soluciones mejores en forma iterativa. La más difundida de estas técnicas son los algoritmos genéticos, basados en el mecanismo de evolución natural de las especies. Existen diferentes tipos de problemas, y multitud de taxonomías para clasificar los mismos. En el alcance de este trabajo nos interesa diferenciar los problemas en cuanto a la cantidad de objetivos a optimizar. Con esta consideración en mente, surge una primera clasificación evidente, los problemas mono-objetivo, donde existe solo una función objetivo a optimizar, y los problemas multi-objetivo donde existe más de una función objetivo. En el presente trabajo se estudia la utilización de metaheurísticas evolutivas para la resolución de problemas complejos, con uno y con más de un objetivo. Se efectúa un análisis del estado de situación en la materia, y se proponen nuevas variantes de algoritmos existentes, validando que las mismas mejoran resultados reportados en la literatura. En una primera instancia, se propone una mejora a la versión canónica y mono-objetivo del algoritmo PSO, luego de un estudio detallado del patrón de movimientos de las partículas en el espacio de soluciones. Estas mejoras se proponen en las versiones de PSO para espacios continuos y para espacios binarios. Asimismo, se analiza la implementación de una versión paralela de esta técnica evolutiva. Como segunda contribución, se plantea una nueva versión de un algoritmo PSO multiobjetivo (MOPSO Multi Objective Particle Swarm Optimization) incorporando la posibilidad de variar dinámicamente el tamaño de la población, lo que constituye una contribución innovadora en problemas con mas de una función objetivo. Por último, se utilizan las técnicas representativas del estado del arte en optimización multi-objetivo aplicando estos métodos a la problemática de una empresa de emergencias médicas y atención de consultas domiciliarias. Se logró poner en marcha un proceso de asignación de móviles a prestaciones médicas basado en metaheurísticas, logrando optimizar el proceso de asignación de móviles médicos a prestaciones médicas en la principal compañía de esta industria a nivel nacional.
APA, Harvard, Vancouver, ISO, and other styles
6

Coates, Laura C., Arthur Kavanaugh, and Christopher T. Ritchlin. Treatment algorithm and treat to target. Oxford University Press, 2018. http://dx.doi.org/10.1093/med/9780198737582.003.0032.

Full text
Abstract:
This chapter covers the evidence for treatment algorithms and treatment to target in PsA. Evidence for treatment algorithms including step up vs step down approaches to prescribing and early vs delayed treatment is discussed. EULAR recommendations for treating to target in SpA are outlined with a summary of the level of evidence available at that time. Key outcome measures that could be utilized as targets in PsA are reviewed with discussion of their merits and deficiencies. A detailed description of the first treat to target study in PsA is presented: the TICOPA study. The impact of comorbidities on treatment decisions is discussed, both related SpA conditions such as uveitis and inflammatory bowel disease, and non-SpA comorbidities such as the metabolic syndrome and liver disease. Finally, suggestions for translation into clinical practice are outlined, highlighting the need for multi-speciality collaborative working, full assessment of disease activity and subsequent optimal treatment.
APA, Harvard, Vancouver, ISO, and other styles
7

Pro .NET Performance: Optimize Your C# Applications. Apress, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Programming Like A Pro For Teens. Course Technology, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

(Editor), Dorit Hochbaum, Klaus Jansen (Editor), Jose D.P. Rolim (Editor), and Alistair Sinclair (Editor), eds. Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques: Third International Workshop on Randomization and Approximation ... 1999 Pro (Lecture Notes in Computer Science). Springer, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Rosales Torres, César Said, César Buenadicha Sánchez, and Tetsuro Narita. Autoevaluación ética de IA para actores del ecosistema emprendedor: Guía de aplicación. Inter-American Development Bank, 2021. http://dx.doi.org/10.18235/0003269.

Full text
Abstract:
fAIr LAC, la iniciativa del Grupo BID que promueve el uso ético y responsable de la inteligencia artificial, a través de BID Lab ha elaborado una herramienta práctica de autoevaluación ética de IA para emprendedores, que permite llevar a cabo un análisis de la solución tecnológica basada en IA y manejo de datos. Este diagnóstico ayuda a los emprendedores a mejorar su desarrollo de producto, mientras que identifica las principales áreas de atención para prevenir errores, sesgos, discriminaciones y exclusiones resultantes del despliegue tecnológico. La autoevaluación ética de IA para emprendedores que tiene en sus manos es el primer producto de fAIr LAC para emprendedores, y es una guía orientativa en español con enfoque multidisciplinario que contempla seis dimensiones principales: 1. Conceptualización y diseño, 2. Gobernanza y seguridad, 3. Involucramiento humano en los sistemas de IA, 4. Ciclo de vida de la IA (datos y algoritmos), 5. Actores relevantes y 6. Comunicaciones. El propósito es que los emprendedores tengan una referencia rápida de cuáles son los aspectos más importantes a considerar en cada una de estas dimensiones, a fin de tener una visión completa sobre las implicaciones éticas de sus productos y así establecer las medidas pertinentes de mejora y mitigación de riesgos. La principal innovación de este documento radica en dos aspectos principales: el primero que no pone el peso de la autorregulación únicamente en los emprendedores, sino que involucra dos actores clave para el ecosistema: los financiadores de proyectos y las aceleradoras. El segundo aspecto es que las preguntas orientadoras se corresponden con tres niveles de desarrollo de las empresas desde etapas tempranas en fases de ideación hasta emprendimientos maduros o pequeñas y medianas empresas (PyMEs) desarrollando productos innovadores. Asimismo, si bien el documento está pensado principalmente para orientar en el desarrollo e implementación de soluciones basadas en IA, también es útil para aquellas soluciones basadas en el manejo de datos. Invitamos a los interesados a descargar la publicación y a formar parte del viaje del emprendedor en su camino por desarrollar soluciones tecnológicas de impacto social que contribuyan a un desarrollo regional sostenido que no deje a nadie atrás.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Algoritmus PSO"

1

Krzeszowski, Tomasz, Krzysztof Wiktorowicz, and Krzysztof Przednowek. "Comparison of Selected Fuzzy PSO Algorithms." In Recent Advances in Computational Optimization, 107–22. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-59861-1_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Voss, Michael, Rafael Asenjo, and James Reinders. "Generic Parallel Algorithms." In Pro TBB, 33–78. Berkeley, CA: Apress, 2019. http://dx.doi.org/10.1007/978-1-4842-4398-5_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Saremi, Shahrzad, and Seyedali Mirjalili. "Evaluating PSO and MOPSO Equipped with Evolutionary Population Dynamics." In Algorithms for Intelligent Systems, 61–88. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-9757-8_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kumar, Manish, Manish Gupta, Divesh Kumar, and Vinay kumar Deolia. "Optimization of Low Power LNA Using PSO for UWB Application." In Algorithms for Intelligent Systems, 393–99. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-15-6707-0_37.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Yamada, Shinichi, and Kourosh Neshatian. "Improving Representation in Benchmarking of Binary PSO Algorithms." In AI 2018: Advances in Artificial Intelligence, 371–83. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-03991-2_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Abdulla, Parosh Aziz, Stavros Aronis, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson, and Konstantinos Sagonas. "Stateless Model Checking for TSO and PSO." In Tools and Algorithms for the Construction and Analysis of Systems, 353–67. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-46681-0_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Din, Maiya, Saibal K. Pal, and S. K. Muttoo. "Analysis of RC4 Crypts Using PSO Based Swarm Technique." In Harmony Search and Nature Inspired Optimization Algorithms, 1049–56. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-0761-4_98.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Voss, Michael, Rafael Asenjo, and James Reinders. "Using Tasks to Create Your Own Algorithms." In Pro TBB, 277–311. Berkeley, CA: Apress, 2019. http://dx.doi.org/10.1007/978-1-4842-4398-5_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Suthar, Jaswant, Virendra Sangtani, and Ajay Kumar Bansal. "Optimal Design of a Stand-Alone Hybrid System Using GA, PSO and ABC." In Algorithms for Intelligent Systems, 179–88. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-1059-5_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ahmad, Salman, and Atif Iqbal. "Switching Angles Computations Using PSO in Selective Harmonics Minimization PWM." In Metaheuristic and Evolutionary Computation: Algorithms and Applications, 437–61. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-7571-6_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Algoritmus PSO"

1

Nguyen, Thanh-Trung, Van-Huy Nguyen, and Xuan-Huong Nguyen. "Comparing the Results of Applying DE, PSO and Proposed Pro DE, Pro PSO Algorithms for Inverse Kinematics Problem of a 5-DOF Scara Robot." In 2020 International Conference on Advanced Mechatronic Systems (ICAMechS). IEEE, 2020. http://dx.doi.org/10.1109/icamechs49982.2020.9310157.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Syed Abdullah, Sharifah Lailee, Naimah Mohd Hussin, Hazaruddin Harun, and Noor Elaiza Abd Khalid. "Comparative study of random-PSO and Linear-PSO algorithms." In 2012 International Conference on Computer & Information Science (ICCIS). IEEE, 2012. http://dx.doi.org/10.1109/iccisci.2012.6297280.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Anescu, George, and Ilie Prisecaru. "NSC-PSO, a Novel PSO Variant without Speeds and Coefficients." In 2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2015. http://dx.doi.org/10.1109/synasc.2015.74.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

M. R. Baccarini, João, Francisco C. R. Coelho, Lane M. Rabelo, and Gleison F. V. Amaral. "Estimação Online dos Parâmetros do Circuito Equivalente do Motor de Indução Trifásico via Metaheurísticas." In Congresso Brasileiro de Automática - 2020. sbabra, 2020. http://dx.doi.org/10.48011/asba.v2i1.1408.

Full text
Abstract:
A representação do Motor de Indução Trifásico (MIT) por meio de um modelo matemático é uma ferramenta muito utilizada em projetos e implementações de engenharia elétrica. A obtenção dos parâmetros do circuito equivalente por meio de testes definidos nas normas nem sempre é viável em uma planta industrial. Assim, técnicas de estimação online destes parâmetros podem ser empregadas como alternativa. Neste trabalho, as metaheurísticas Enxame de Partículas (PSO), Algoritmo Genético e Estratégias de Evolução são empregadas para estimação dos parâmetros do MIT com base na comparação de valores calculados a partir do circuito estimado, com valores medidos. A metodologia é aplicada a um MIT de 2HP e quatro polos. Os resultados obtidos demonstram que o problema formulado possui múltiplas soluções ótimas, com diferentes conjuntos de parâmetros, dificultando a tarefa dos algoritmos de otimização. Por meio de análises estatísticas, constata-se a superioridade do PSO na resolução do problema aqui formulado, em termos de precisão e tempo computacional, sendo está última característica essencial para algoritmos com atuação em tempo real (online).
APA, Harvard, Vancouver, ISO, and other styles
5

Yoder, Marcus, Zachary Satterfield, Mohammad Fazelpour, Joshua D. Summers, and Georges Fadel. "Numerical Methods for the Design of Meso-Structures: A Comparative Review." In ASME 2015 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/detc2015-46289.

Full text
Abstract:
Over the past decade, there has been an increase in the intentional design of meso-structured materials that are optimized to target desired material properties. This paper reviews and critically compares common numerical methodologies and optimization techniques used to design these meso-structures by analyzing the methods themselves and published applications and results. Most of the reviewed research targets mechanical material properties, including effective stiffness and crushing energy absorption. The numerical methodologies reviewed include topology and size/shape optimization methods such as homogenization, Solid Isotropic Material with Penalization, and level sets. The optimization techniques reviewed include genetic algorithms (GAs), particle swarm optimization (PSO), gradient based, and exhaustive search methods. The research reviewed shows notable patterns. The literature reveals a push to apply topology optimization in an ever-growing number of 3-dimensional applications. Additionally, researchers are beginning to apply topology optimization and size/shape optimization to multiphysics problems. The research also shows notable gaps. Although PSOs are comparable evolutionary algorithms to GAs, the use of GAs dominates over PSOs. These patterns and gaps, along with others, are discussed in terms of possible future research in the design of meso-structured materials.
APA, Harvard, Vancouver, ISO, and other styles
6

Breaban, Mihaela, and Silvia Luchian. "Shaping Up Clusters with PSO." In 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. IEEE, 2008. http://dx.doi.org/10.1109/synasc.2008.70.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Jiang, Weichang, Yating Zhang, and Ruihua Wang. "Comparative study on several PSO algorithms." In 2014 26th Chinese Control And Decision Conference (CCDC). IEEE, 2014. http://dx.doi.org/10.1109/ccdc.2014.6852332.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Babaee, H., and A. Khosravi. "An Improve PSO Based Hybrid Algorithms." In 2011 International Conference on Management and Service Science (MASS 2011). IEEE, 2011. http://dx.doi.org/10.1109/icmss.2011.5999410.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Arakawa, Masao. "PSO Driven Genetic Range Genetic Algorithms." In ASME 2005 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2005. http://dx.doi.org/10.1115/detc2005-84942.

Full text
Abstract:
This paper deals with development of Genetic Range Genetic Algorithms (GRGAs). In GRGAs, one of the key is to set a new searching range, it needs to be followed after current searching situations, to be focused on local minute search and to be scattered as widely as possible for global search. However, first two strategies have a possibility of early stage convergence, and random scattering cause vain function calls to produce the range which seems no chance to prosper for a number of generations. In this paper, we propose a new method of setting it by using Particle Swarm Optimization (PSO) to overcome dilemma of the conventional method.
APA, Harvard, Vancouver, ISO, and other styles
10

Rocha, Lídia, and Kelen Vivaldini. "Comparison between Meta-Heuristic Algorithms for Path Planning." In VIII Workshop de Teses e Dissertações em Robótica/Concurso de Teses e Dissertações em Robótica. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/wtdr_ctdr.2020.14950.

Full text
Abstract:
Unmanned Aerial Vehicle (UAV) has been increasingly employed in several missions with a pre-defined path. Over the years, UAV has become necessary in complex environments, where it demands high computational cost and execution time for traditional algorithms. To solve this problem meta-heuristic algorithms are used. Meta-heuristics are generic algorithms to solve problems without having to describe each step until the result and search for the best possible answer in an acceptable computational time. The simulations are made in Python, with it, a statistical analyses was realized based on execution time and path length between algorithms Particle Swarm Optimization (PSO), Grey Wolf Optimization (GWO) and Glowworm Swarm Optimization (GSO). Despite the GWO returns the paths in a shorter time, the PSO showed better performance with similar execution time and shorter path length. However, the reliability of the algorithms will depend on the size of the environment. PSO is less reliable in large environments, while the GWO maintains the same reliability.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Algoritmus PSO"

1

Labunskaya, A. D., B. A. Mukhin, P. G. Kolyadin, V. A. Kosyrev, E. A. Chepurnaya, and A. L. Shevchenko. The model of optimal allocation of resources of the warring parties on the basis of genetic algorithms (MOPP PS). OFERNIO, March 2020. http://dx.doi.org/10.12731/ofernio.2020.24495.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Elacqua, Gregory, Isabel Jacas, Thomas Krussig, Carolina Méndez, Christopher Neilson, Alonso Román, and Sammara Soares. Sistemas centralizados de asignación escolar: guía de implementación. Inter-American Development Bank, June 2021. http://dx.doi.org/10.18235/0003362.

Full text
Abstract:
En el último tiempo, gracias al desarrollo de la literatura de algoritmos de asignación y emparejamiento, se comenzó a expandir el uso de sistemas centralizados de asignación de cupos para estudiantes, tanto para solucionar los problemas que se generan en los procesos tradicionales de matrícula, como para hacerlos más transparentes, eficientes y equitativos. Sin embargo, la mayoría de los países todavía posee sistemas descentralizados, los cuales son una suerte de caja negra para las familias e incluso para los gobiernos. En ese sentido, esta guía entrega una mirada general acerca de cómo implementar un sistema centralizado de matrícula. Para hacerlo, es importante tener claras cuatro etapas: 1) diagnóstico y planificación; 2) definiciones generales; 3) desarrollo de la plataforma; y 4) intervenciones de información y campañas comunicacionales. A estas se les suma una quinta relativa a la evaluación y mejoramiento, que busca identificar los puntos de optimización de la implementación para ajustarlos en el siguiente proceso. En la etapa de diagnóstico y planificación se evalúa el sistema actual de asignación escolar para que el nuevo sistema se adapte a la idiosincrasia del territorio en donde se implementará por primera vez. Se considera el grado de centralización que se tiene actualmente en el proceso de matrícula escolar, y se determinan los problemas a solucionar. Además, se considera la infraestructura técnica y física ya desarrollada. En la etapa de definiciones y lineamientos generales se determinan los objetivos de política pública que busca alcanzar el nuevo sistema y cada uno de los componentes que forman su estructura, como es el mecanismo de asignación y las prioridades, entre otros. Luego, estas definiciones se materializan en las normativas que los países deben desarrollar y en la etapa de desarrollo de la plataforma, donde los postulantes podrán registrarse y explorar las distintas instituciones educativas a su disposición, para luego realizar sus postulaciones. La etapa de intervenciones de información y campañas comunicacionales es una etapa continua a lo largo del proceso, constituye una instancia de apoyo a las familias basada en campañas comunicacionales y herramientas de entrega de información personalizada. Esta etapa responde a una necesidad propia de la instalación de un nuevo sistema centralizado, donde el éxito depende de cómo los usuarios logran entenderlo y realizar sus postulaciones de manera exitosa. Para ello, es preciso entregarles la mayor cantidad de información posible y de la mejor manera, para así garantizar su comprensión. Por último, se lleva a cabo una etapa de evaluación y mejoramiento, que aun cuando no se aborde como una sección por sí misma en esta guía, es importante tenerla en mente a lo largo de todo el proceso. Se identifican puntos de mejora en las cuatro etapas anteriores y se realizan los ajustes necesarios para la próxima implementación del sistema. Luego de llevar a cabo el piloto de un sistema centralizado, se da paso a un nuevo proceso de mejora continua, investigación y escalamiento. En este se considera la evaluación y puntos de mejora que se identifican de la primera implementación, junto con la realización de estudios e investigación sobre todo del proceso, a fin de planificar su escalamiento paulatino a nivel nacional.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography