@article{oai:kanazawa-u.repo.nii.ac.jp:00007753,
 author = {北山, 哲士 and 荒川, 雅生 and 山崎, 光悦 and Kitayama, Satoshi and Arakawa, Masao and Yamazaki, Koetsu},
 issue = {725},
 journal = {Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C},
 month = {Jan},
 note = {This paper proposes a new method which is called as Adaptive Range Particle Swarm Optimization (ARPSO), based on Adaptive Range Genetic Algorithm. That is, the active search domain is determined by using the mean and standard deviation of each design variable. In general, multipoints methods are utilized in the field of evolutionary computation. At the initial search stage it is preferable to explore the search domain widely, and is also preferable to explore the smaller search domain as the search goes on. To achieve this objective, new parameter which determines the active search domain is introduced. This new parameter gradually increases as the search goes on. Finally it is possible to shrink the search domain. The way to determine the maximum value of this new parameter is also shown in this paper. The optimum solution with high accuracy and a. little number of function calls is obtained by proposed method in compared with original Particle Swarm Optimization. Through numerical examples, the effectiveness and validity of proposed method are examined., 金沢大学大学院自然科学研究科知的システム創成, 金沢大学工学部},
 pages = {280--287},
 title = {Proposal of adaptive range particle swarm optimization},
 volume = {73},
 year = {2007}
}