Hisao Ishibuchi

Hisao Ishibuchi

Auto-generated profile, based on publicly available information

Hisao Ishibuchi

Southern University of Science and Technology, China

Research Focus & Metrics

Academic Career Length

38Years (1989-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 1998 in IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews)
Verified
Journal Article
Closed access
HIH. Ishibuchi
H. Ishibuchi
TMT. Murata
T. Murata

1 September 1990 in European Journal of Operational Research
Verified
Journal Article
Closed access
HIHisao Ishibuchi
Hisao Ishibuchi
HTHideo Tanaka
Hideo Tanaka

1 April 2003 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
HIH. Ishibuchi
H. Ishibuchi
TYT. Yoshida
T. Yoshida
TMT. Murata
T. Murata
This paper shows how the performance of evolutionary multiobjective optimization (EMO) algorithms can be improved by hybridization with local search. The main positive effect of the hybridization is the improvement in the convergence speed to the Pareto front. On the other hand, the main negative effect is the increase in the computation time per generation. Thus, the number of generations is decreased when the available computation time is limited. As a result, the global search ability of EMO algorithms is not fully utilized. These positive and negative effects are examined by computational experiments on multiobjective permutation flowshop scheduling problems. Results of our computational experiments clearly show the importance of striking a balance between genetic search and local search. In this paper, we first modify our former multiobjective genetic local search (MOGLS) algorithm by choosing only good individuals as initial solutions for local search and assigning an appropriate local search direction to each initial solution. Next, we demonstrate the importance of striking a balance between genetic search and local search through computational experiments. Then we compare the modified MOGLS with recently developed EMO algorithms: the strength Pareto evolutionary algorithm and revised nondominated sorting genetic algorithm. Finally, we demonstrate that a local search can be easily combined with those EMO algorithms for designing multiobjective memetic algorithms.

1 August 1995 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
HIH. Ishibuchi
H. Ishibuchi
KNK. Nozaki
K. Nozaki
NYN. Yamamoto
N. Yamamoto
HTH. Tanaka
H. Tanaka
This paper proposes a genetic-algorithm-based method for selecting a small number of significant fuzzy if-then rules to construct a compact fuzzy classification system with high classification power. The rule selection problem is formulated as a combinatorial optimization problem with two objectives: to maximize the number of correctly classified patterns and to minimize the number of fuzzy if-then rules. Genetic algorithms are applied to this problem. A set of fuzzy if-then rules is coded into a string and treated as an individual in genetic algorithms. The fitness of each individual is specified by the two objectives in the combinatorial optimization problem. The performance of the proposed method for training data and test data is examined by computer simulations on the iris data of Fisher.

12 July 2016 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Open access
HIHisao Ishibuchi
Hisao Ishibuchi
YSYu Setoguchi
Yu Setoguchi
HMHiroyuki Masuda
Hiroyuki Masuda
YNYusuke Nojima
Yusuke Nojima
Recently, a number of high performance many-objective evolutionary algorithms with systematically generated weight vectors have been proposed in the literature. Those algorithms often show surprisingly good performance on widely used DTLZ and WFG test problems. The performance of those algorithms has continued to be improved. The aim of this paper is to show our concern that such a performance improvement race may lead to the overspecialization of developed algorithms for the frequently used many-objective test problems. In this paper, we first explain the DTLZ and WFG test problems. Next, we explain many-objective evolutionary algorithms characterized by the use of systematically generated weight vectors. Then we discuss the relation between the features of the test problems and the search mechanisms of weight vector-based algorithms such as multiobjective evolutionary algorithm based on decomposition (MOEA/D), nondominated sorting genetic algorithm III (NSGA-III), MOEA/dominance and decomposition (MOEA/DD), and θ-dominance based evolutionary algorithm (θ-DEA). Through computational experiments, we demonstrate that a slight change in the problem formulations of DTLZ and WFG deteriorates the performance of those algorithms. After explaining the reason for the performance deterioration, we discuss the necessity of more general test problems and more flexible algorithms.