Search Sites

Transactions of the Institute of Systems, Control and Information Engineers Vol. 23 (2010), No. 8

ISIJ International
belloff
ONLINE ISSN: 2185-811X
PRINT ISSN: 1342-5668
Publisher: THE INSTITUTE OF SYSTEMS, CONTROL AND INFORMATION ENGINEERS (ISCIE)

Backnumber

  1. Vol. 37 (2024)

  2. Vol. 36 (2023)

  3. Vol. 35 (2022)

  4. Vol. 34 (2021)

  5. Vol. 33 (2020)

  6. Vol. 32 (2019)

  7. Vol. 31 (2018)

  8. Vol. 30 (2017)

  9. Vol. 29 (2016)

  10. Vol. 28 (2015)

  11. Vol. 27 (2014)

  12. Vol. 26 (2013)

  13. Vol. 25 (2012)

  14. Vol. 24 (2011)

  15. Vol. 23 (2010)

  16. Vol. 22 (2009)

  17. Vol. 21 (2008)

  18. Vol. 20 (2007)

  19. Vol. 19 (2006)

  20. Vol. 18 (2005)

  21. Vol. 17 (2004)

  22. Vol. 16 (2003)

  23. Vol. 15 (2002)

  24. Vol. 14 (2001)

  25. Vol. 13 (2000)

  26. Vol. 12 (1999)

  27. Vol. 11 (1998)

  28. Vol. 10 (1997)

  29. Vol. 9 (1996)

  30. Vol. 8 (1995)

  31. Vol. 7 (1994)

  32. Vol. 6 (1993)

  33. Vol. 5 (1992)

  34. Vol. 4 (1991)

  35. Vol. 3 (1990)

  36. Vol. 2 (1989)

  37. Vol. 1 (1988)

Transactions of the Institute of Systems, Control and Information Engineers Vol. 23 (2010), No. 8

Incorporation of Hypervolume Approximation with Scalarizing Functions into Indicator-Based Evolutionary Multiobjective Optimization Algorithms

Noritaka Tsukamoto, Yuji Sakane, Yusuke Nojima, Hisao Ishibuchi

pp. 165-177

Abstract

The handling of many-objective problems is a hot issue in the evolutionary multiobjective optimization (EMO) community. Whereas Pareto-based EMO algorithms usually work very well on two-objective problems, they do not work well on many-objective problems. A promising approach to the search for the non-dominated solutions of many-objective problems is a class of indicator-based EMO algorithms. The goal of indicator-based EMO algorithms is to maximize an indicator function which evaluates the quality of a set of solutions. The hypervolume has been frequently used as an indicator function. The main difficulty of the use of hypervolume is that the computation load for its calculation increases exponentially with the number of objectives. Thus the application of indicator-based EMO algorithms to many-objective problems is time-consuming. In our former study, we proposed an idea of approximating the hypervolume using a number of achievement functions with uniformly distributed weight vectors. In this paper, we incorporate our hypervolume approximation into indicator-based EMO algorithms. Experimental results show that the computation time of indicator-based EMO algorithms for many-objective problems is drastically decreased by the use of our hypervolume approximation method with no severe deterioration in its search ability.

Bookmark

Share it with SNS

Article Title

Incorporation of Hypervolume Approximation with Scalarizing Functions into Indicator-Based Evolutionary Multiobjective Optimization Algorithms

Selection of Initial Solutions for Local Search in Multiobjective Genetic Local Search

Yasuhiro Hitotsuyanagi, Yoshihiko Wakamatsu, Yusuke Nojima, Hisao Ishibuchi

pp. 178-187

Abstract

In this paper, we propose a new selection scheme of initial solutions for the local search of a multiobjective genetic local search (MOGLS) algorithm. The MOGLS algorithm is the hybridization of an evolutionary multiobjective optimization (EMO) algorithm and local search. It is shown that the MOGLS algorithm has higher search ability than pure EMO algorithms. In the conventional MOGLS algorithm, the local search method is applied to the offspring population generated by the genetic operators. However, the generated offspring population often includes poor individuals because the genetic operators involve some random procedures and allow the generation of inferior offspring. The basic idea of our approach is to apply local search to the parent population. Thus our approach can apply local search to better solutions than the original MOGLS algorithm on average. Through computational experiments, we show that our approach improves the search ability of the MOGLS algorithm.

Bookmark

Share it with SNS

Article Title

Selection of Initial Solutions for Local Search in Multiobjective Genetic Local Search

Evaluation of Cognitive Function of Children with Developmental Disabilities by means of Button-Press Task

Shogo Nakazono, Satoshi Kobori

pp. 188-195

Abstract

The button-press task means that the subject observes a moving target and presses a button to stop it when the target enters a specified area on a computer display. Subjects perform normal task, suppressed task and delayed task. In the suppressed task, the moving target disappears at some point during the trial. In the delayed task, there is some lag time between the time of pressing button and of stopping target. In these tasks, subjects estimate the movement of the target, and press the button considering his/her own reaction time. In our previous study, we showed that cognitive and motor function was able to be evaluated by these tasks. In this study, we examined error data of children with developmental disabilities to evaluate the cognitive function, and investigated the learning processes. Moreover, we discussed the developmental stages by comparing the children with disabilities to normal control children, and we clarified the behavior characteristics of children with developmental disabilities. Asa result, it was shown that our evaluation method and system for the button-press task were effective to evaluate cognitive ability of children with developmental disabilities.

Bookmark

Share it with SNS

Article Title

Evaluation of Cognitive Function of Children with Developmental Disabilities by means of Button-Press Task

You can use this feature after you logged into the site.
Please click the button below.

Advanced Search

Article Title

Author

Abstract

Journal Title

Year

Please enter the publication date
with Christian era
(4 digits).

Please enter your search criteria.