Using Revised Adaptive Particle Swarm Algorithm to Find the Multi-Quality Optimization Parameters for a Nano-Particle Milling Process
碩士 === 國立雲林科技大學 === 工業工程與管理研究所碩士班 === 101 === Nano-particles is an advanced material, the preparation process is very important, because of the preparation process will generate a lot of sensitivity in process of complexity and variability. At present, the industry usually uses wet-type mechanical m...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2013
|
Online Access: | http://ndltd.ncl.edu.tw/handle/86830801409356107920 |
id |
ndltd-TW-101YUNT5031041 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-101YUNT50310412015-10-13T22:57:22Z http://ndltd.ncl.edu.tw/handle/86830801409356107920 Using Revised Adaptive Particle Swarm Algorithm to Find the Multi-Quality Optimization Parameters for a Nano-Particle Milling Process 運用改良式自適應粒子群演算法於奈米研磨機多品質特性最佳化之研究 Fan-yun Kung 龔凡云 碩士 國立雲林科技大學 工業工程與管理研究所碩士班 101 Nano-particles is an advanced material, the preparation process is very important, because of the preparation process will generate a lot of sensitivity in process of complexity and variability. At present, the industry usually uses wet-type mechanical milling process to make nano-particles, it can use the high-speed rotating of stirring blade to pulverize liquid of micro particle, and add a solvent and dispersing agent in order to avoid particles condensing. Due to the smaller grain size and the small variability of nano-particles, it can enhance its surface activity and catalytic, therefore, how to control the better nano-particles parameters will be a challenge. The Particle Swarm Optimization (PSO) is an algorithm that derives from observing the foraging behavior of bird populations. It has the advantage of speed up convergence, but it also has the shortcoming of early convergence and fall into local optimum. Therefore, this thesis proposes a Revised Adaptive Particle Swarm Optimization (RAPSO). In addition to add Ren-De You(2012) the concept of random particles, also add the concept of particle mating, and adjust the parameters of inertia weight and learning factors by the variation of iterations and fitness values. Expectation of adding the modified strategy, it not only can preserve the advantage of Particle Swarm Optimization, but also can improve the shortcoming of Particle Swarm Optimization, and then enhance solution accuracy. The research results showed that in the function test and nano-particles milling process parameter optimization problem, the Revised Adaptive Particle Swarm Optimization for solving capacity and performance can be improve and enhance. Tung-Hsu Hou 侯東旭 2013 學位論文 ; thesis 70 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立雲林科技大學 === 工業工程與管理研究所碩士班 === 101 === Nano-particles is an advanced material, the preparation process is very important, because of the preparation process will generate a lot of sensitivity in process of complexity and variability. At present, the industry usually uses wet-type mechanical milling process to make nano-particles, it can use the high-speed rotating of stirring blade to pulverize liquid of micro particle, and add a solvent and dispersing agent in order to avoid particles condensing. Due to the smaller grain size and the small variability of nano-particles, it can enhance its surface activity and catalytic, therefore, how to control the better nano-particles parameters will be a challenge.
The Particle Swarm Optimization (PSO) is an algorithm that derives from observing the foraging behavior of bird populations. It has the advantage of speed up convergence, but it also has the shortcoming of early convergence and fall into local optimum. Therefore, this thesis proposes a Revised Adaptive Particle Swarm Optimization (RAPSO). In addition to add Ren-De You(2012) the concept of random particles, also add the concept of particle mating, and adjust the parameters of inertia weight and learning factors by the variation of iterations and fitness values. Expectation of adding the modified strategy, it not only can preserve the advantage of Particle Swarm Optimization, but also can improve the shortcoming of Particle Swarm Optimization, and then enhance solution accuracy.
The research results showed that in the function test and nano-particles milling process parameter optimization problem, the Revised Adaptive Particle Swarm Optimization for solving capacity and performance can be improve and enhance.
|
author2 |
Tung-Hsu Hou |
author_facet |
Tung-Hsu Hou Fan-yun Kung 龔凡云 |
author |
Fan-yun Kung 龔凡云 |
spellingShingle |
Fan-yun Kung 龔凡云 Using Revised Adaptive Particle Swarm Algorithm to Find the Multi-Quality Optimization Parameters for a Nano-Particle Milling Process |
author_sort |
Fan-yun Kung |
title |
Using Revised Adaptive Particle Swarm Algorithm to Find the Multi-Quality Optimization Parameters for a Nano-Particle Milling Process |
title_short |
Using Revised Adaptive Particle Swarm Algorithm to Find the Multi-Quality Optimization Parameters for a Nano-Particle Milling Process |
title_full |
Using Revised Adaptive Particle Swarm Algorithm to Find the Multi-Quality Optimization Parameters for a Nano-Particle Milling Process |
title_fullStr |
Using Revised Adaptive Particle Swarm Algorithm to Find the Multi-Quality Optimization Parameters for a Nano-Particle Milling Process |
title_full_unstemmed |
Using Revised Adaptive Particle Swarm Algorithm to Find the Multi-Quality Optimization Parameters for a Nano-Particle Milling Process |
title_sort |
using revised adaptive particle swarm algorithm to find the multi-quality optimization parameters for a nano-particle milling process |
publishDate |
2013 |
url |
http://ndltd.ncl.edu.tw/handle/86830801409356107920 |
work_keys_str_mv |
AT fanyunkung usingrevisedadaptiveparticleswarmalgorithmtofindthemultiqualityoptimizationparametersforananoparticlemillingprocess AT gōngfányún usingrevisedadaptiveparticleswarmalgorithmtofindthemultiqualityoptimizationparametersforananoparticlemillingprocess AT fanyunkung yùnyònggǎiliángshìzìshìyīnglìziqúnyǎnsuànfǎyúnàimǐyánmójīduōpǐnzhìtèxìngzuìjiāhuàzhīyánjiū AT gōngfányún yùnyònggǎiliángshìzìshìyīnglìziqúnyǎnsuànfǎyúnàimǐyánmójīduōpǐnzhìtèxìngzuìjiāhuàzhīyánjiū |
_version_ |
1718082722053750784 |