Eitaro Aiyoshi

Keio University, Edo, Tōkyō, Japan

Are you Eitaro Aiyoshi?

Claim your profile

Publications (51)6.24 Total impact

  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we consider the use of a multi‐objective optimization method in order to obtain a preferred solution for the buffer material optimal design problem in the high‐level geological disposal of radioactive waste. The buffer material optimal design problem is formulated as a constrained multi‐objective optimization problem. Its Pareto optimal solutions are distributed evenly over the entire feasible region. Hence, we develop a search method to find a preferred solution easily for a decision maker from the Pareto optimal solutions, which are distributed evenly and broadly. In the preferred solution search method, a technique for visualization of a Pareto optimal solution set using a self‐organizing map is introduced into the satisficing trade‐off method, which is an interactive method for obtaining a Pareto optimal solution that satisfies a decision maker. We confirm the effectiveness of the preferred solution search method in the buffer material optimal design problem. © 2014 Wiley Periodicals, Inc. Electr Eng Jpn, 187(2): 17–32, 2014; Published online in Wiley Online Library (wileyonlinelibrary.com). DOI 10.1002/eej.22634
    Electrical Engineering in Japan 01/2014; 187(2). · 0.10 Impact Factor
  • Takashi Okamoto, Eitaro Aiyoshi
    [Show abstract] [Hide abstract]
    ABSTRACT: In this study, we transform an optimization problem into a game problem by multiple decision makers. This transformation is called gamification of the optimization problem. Then, we discuss correspondence of the dynamics to search the rational solution of the game problem with the multi-point type optimization method to search the optimal solution of the original problem. Specifically, we propose a condition to compose objective functions of multiple decision makers who interfere with each other from the objective function of the original problem so that equivalence of the Nash equilibrium solution of the game problem to the optimal solution of the original problem is guaranteed. Then, correspondence of the gradient dynamics to solve the game problem with the multi-point type optimization method is discussed. We also show some numerical examples in order to explain the gamification of the optimization problem.
    Proceedings of the 2013 IEEE International Conference on Systems, Man, and Cybernetics; 10/2013
  • Kenichi Muranaka, Eitaro Aiyoshi
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we present a new type of hybrid methods for global optimization with Particle Swarm Optimization (PSO) and Differential Evolution (DE), which have attracted interests as heuristic and global optimization methods recently. Concretely, “p-best solutions” as the targets of PSO's particles are actuated by DE's evolutional mechanism in order to promote PSO's global searching ability. The presented hybrid method works effectively because PSO acts as a local optimizer and DE plays a role as a global optimizer. To evaluate performance of the hybridization, our method is applied to some benchmarks and is compared with the separated PSO and DE. Through computer simulations, it is certified that the proposed hybrid method performs fairy better than their separated algorithm.
    IEEJ Transactions on Electronics Information and Systems 01/2012; 132(7):1128-1135.
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we consider a multi-objective optimization method in order to obtain a preferred solution for the buffer material optimal design problem in the high-level radioactive wastes geological disposal. The buffer material optimal design problem is formulated as a constrained multi-objective optimization problem. Its Pareto optimal solutions are distributed evenly on whole bounds of the feasible region. Hence, we develop a search method to find a preferred solution easily for a decision maker from the Pareto optimal solutions which are distributed evenly and vastly. In the preferred solution search method, the visualization technique of a Pareto optimal solution set using the self-organizing map is introduced into the satisficing trade-off method which is the interactive method to obtain a Pareto optimal solution that satisfies a decision maker. We confirm the effectiveness of the preferred solution search method in the buffer material optimal design problem.
    IEEJ Transactions on Electronics Information and Systems 01/2012; 132(7):1116-1127.
  • Source
    Eitaro Aiyoshi, Atsushi Maki, Takashi Okamoto
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper proposes a Nash equilibrium model that applies continuous time replicator dynamics to the analysis of oligopoly markets. The robustness of the proposed simple Nash equilibrium model under the simultaneous constraints of allocation of product and market share using a simulation method to derive an optimal solution for production decisions by rival firms in oligopoly markets is tested by changing profit and cost function parameters, as well as the initial production values and market shares of the firms examined in this study. The effects of differences in conjectural variation and initial allocation of market share on the convergent values are considered, particularly in the case of corner solutions. This approach facilitates the understanding of the robustness of attaining equilibrium in an oligopoly market.
    Mathematics and Computers in Simulation. 01/2011; 81:1518-1526.
  • Yoshinao Ishii, Takashi Okamoto, Eitaro Aiyoshi
    [Show abstract] [Hide abstract]
    ABSTRACT: Asynchronous Digenetic Particle Swarm Optimization for Global and Sustainable Search
    IEEJ Transactions on Electronics Information and Systems 01/2011; 131:626-634.
  • Kazuaki Masuda, Kenzo Kurihara, Eitaro Aiyoshi
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, a method for solving min-max problems, especially for finding a solution which satisfies “min-max = max-min” condition, by using a modified particle swarm optimization (PSO) algorithm, is proposed. According to recent development in computer science, multi-point global search methods, most of which are classified into evolutionary computation and/or meta-heuristic methods, have been proposed and applied to various types of optimization problems. However, applications of them to min-max problems have been scarce despite their theoretical and practical importance. Since direct application of evolutionary computation methods to min-max problems wouldn't work effectively, a modified PSO algorithm for solving them is proposed. The proposed method is designed: (1) to approximate the minimized and maximized functions of min-max problems by using a finite number of search points; and, (2) to obtain one of “min-max = max-min” solutions by finding the minimum of the maximized function and the maximum of the minimized function. Numerical examples demonstrate the usefulness of the proposed method.
    Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Anchorage, Alaska, USA, October 9-12, 2011; 01/2011
  • Kazuaki Masuda, Eitaro Aiyoshi
    [Show abstract] [Hide abstract]
    ABSTRACT: Optimal Price Decision Problem for Simultaneous Multi-article Auction and Its Optimal Price Searching Method by Particle Swarm Optimization
    IEEJ Transactions on Electronics Information and Systems 01/2011; 131:461-467.
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we propose a new global optimization model which is described as discrete time-varying inertial gradient dynamics. The proposed model has a autonomous damping term adjustment structure which takes the search history into consideration. In the proposed model, its dynamics destabilizes autonomously when its search point approaches to the best point in the search history. Thus, stagnation of search around the neighborhood of the best point is restrained, in consequence, global search is continued. Furthermore, in this paper, we analytically explain a characteristic of the search trajectory generated by the inertial gradient system. The characteristic is the implementation of intensive and diverse search in the attracting region for the inertial gradient system. Consequently, we propose a multi-point type search model in which search points are attracted to a promising region, where objective function value is small, by a coupling structure in order to make the attracting region the promising region. We confirm effectiveness of the proposed model through numerical experiments using several benchmark problems.
    Transactions of the Society of Instrument and Control Engineers. 01/2011; 46(11):642-650.
  • Kazuaki Masuda, Eitaro Aiyoshi
    [Show abstract] [Hide abstract]
    ABSTRACT: An autoassociative memory which is modeled as the standard recurrent neural network (N.N.) is capable of storing multiple patterns and subsequently recalling one of them in response to an input signal. However, we found in our recent trials that it can't always recall correct patterns accurately. In this paper, we demonstrate such phenomena by numerical examples and identify the cause of memorization errors. We also propose an immediate solution to memorize correct patterns without fail by storing extra patterns at the same time.
    SICE Annual Conference (SICE), 2011 Proceedings of; 01/2011
  • Yuji Koguma, Atsuro Furusawa, Eitaro Aiyoshi
    [Show abstract] [Hide abstract]
    ABSTRACT: It is known that the evolutional computing methods hybridized with local search methods, which are called Memetic Algorithm, are efficient as global optimization methods. The memetic algorithms are divided into two classes of hybridization strategies, which are called Baldwinian and Lamarchian types. This paper is concerned with computational considerations for these two types of hybridization strategies in a case when Particle Swarm Optimization is used as evolutional algorithm from the standpoint of global optimization methods. Especially, applications to optimization problems with constraints described by disconnected plural sets, which are difficult to solve by usual methods, are considered.
    Transactions of the Society of Instrument and Control Engineers. 01/2011; 45(10):512-521.
  • K. Masuda, K. Kurihara, E. Aiyoshi
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper proposes a penalty method for solving nonlinear optimization problems with inequalities by the particle swarm optimization (PSO) algorithm. The proposed method is not only very simple but also useful. One should only search for the global solution of a series of unconstrained minimization problems simply by a standard PSO algorithm. It does not require to check the feasibility of search points during the search. Moreover, it is shown that the global best solution gets feasible as the penalty parameter is increased to a sufficiently but finitely large value. The proposed method is verified by numerical experiments to famous benchmark problems.
    Systems Man and Cybernetics (SMC), 2010 IEEE International Conference on; 11/2010
  • Kazuaki Masuda, Eitaro Aiyoshi
    [Show abstract] [Hide abstract]
    ABSTRACT: Associative memories are capable of memorizing particular patterns and recalling them from their partial information. Different from simple associative memory models based on Hopfield neural networks with sigmoid neurons, a particular model based on the chaotic neural network was also proposed for dynamic associative memory, which can generate various patterns from given information. However, the chaotic network model is so complicated that its behavior has not been analyzed well and can't be controlled easily. To the contrary, this paper shows that a discrete-time simple associative memory model with Euler's difference scheme has possibility to generate chaos. It follows that even such a simple model can be used for dynamic associative memory. Numerical examples also confirm the emergence of chaotic trajectories of the model and demonstrate their use for dynamic associative memory.
    01/2010;
  • Eitaro Aiyoshi, Kazuaki Masuda
    [Show abstract] [Hide abstract]
    ABSTRACT: On the basis of market fundamentalism, new types of social systems with the market mechanism such as electricity trading markets and carbon dioxide (CO2) emission trading markets have been developed. However, there are few textbooks in science and technology which present the explanation that Lagrange multipliers can be interpreted as market prices. This tutorial paper explains that (1) the steepest descent method for dual problems in optimization, and (2) Gauss-Seidel method for solving the stationary conditions of Lagrange problems with market principles, can formulate the mechanism of market pricing, which works even in the information-oriented modern society. The authors expect readers to acquire basic knowledge on optimization theory and algorithms related to economics and to utilize them for designing the mechanism of more complicated markets.
    IEEJ Transactions on Electronics Information and Systems 01/2010; 130(4):534-539.
  • Yuji Koguma, Eitaro Aiyoshi
    [Show abstract] [Hide abstract]
    ABSTRACT: Particle Swarm Optimization (PSO), which has attracted special interest as a global optimization method recently, has a drawback in that its sustainable search can not be executed until the end of computation. In order to endow global searching abilities to PSO, repetition of unstable and stable states of the particles is necessary. In this paper, based on stability analysis of PSO's model, with considering its random numbers, we realize sustainable search by choosing system parameters on boundary region between unstable and stable states, and then introduce an optimization model with global searching abilities as a revision of the conventional PSO.
    IEEJ Transactions on Electronics Information and Systems 01/2010; 130(1):29-38.
  • Sodo Hiraoka, Takashi Okamoto, Eitaro Aiyoshi
    [Show abstract] [Hide abstract]
    ABSTRACT: Particle Swarm Optimization (PSO), which has attracted a great deal of attention as a global optimization method in recent years, has a drawback in that its continuous search based on its excellent dynamic characteristics can not be executed stably until the end of computation due to its much strong convergence trend. In this paper, we propose “Repetitive Search Guideline” which differs from a common guideline in the improved methods which have ever been proposed and by which the continuous search of PSO is achieved without lack of PSO's excellent dynamic characteristics due to the repetitive search in a promise area where objective function value is expected to be small. We consider four improved methods based on the proposed guideline, and then, their effectiveness are confirmed through applications to 100 variables multi-peaked benchmark problems.
    IEEJ Transactions on Electronics Information and Systems 01/2010; 128:1143-1153.
  • Source
    Eitaro Aiyoshi, Atsushi Maki
    [Show abstract] [Hide abstract]
    ABSTRACT: The present analysis applies continuous time replicator dynamics to the analysis of oligopoly markets. In the present paper, we discuss continuous game problems in which decision-making variables for each player are bounded on a simplex by equalities and non-negative constraints. Several types of problems are considered under conditions of normalized constraints and non-negative constraints. These problems can be classified into two types based on their constraints. For one type, the simplex constraint applies to the variables for each player independently, such as in a product allocation problem. For the other type, the simplex constraint applies to interference among all players, creating a market share problem. In the present paper, we consider a game problem under the constraints of allocation of product and market share simultaneously. We assume that a Nash equilibrium solution can be applied and derive the gradient system dynamics that attain the Nash equilibrium solution without violating the simplex constraints. Models assume that three or more firms exist in a market. Firms behave to maximize their profits, as defined by the difference between their sales and cost functions with conjectural variations. The effectiveness of the derived dynamics is demonstrated using simple data. The present approach facilitates understanding the process of attaining equilibrium in an oligopoly market.
    Mathematics and Computers in Simulation 01/2009; 79:2724-2732. · 0.84 Impact Factor
  • Hideki Murata, Keiichiro Yasuda, Eitaro Aiyoshi
    [Show abstract] [Hide abstract]
    ABSTRACT: Optimization methods based on metaheuristics are proposed as a class of global optimization methods, by which the global minimum can be obtained without being trapped in local minima. Particle swarm optimization (PSO), which is one of these methods, is known for its high searching ability and easy implementation. However, it might be difficult to find the global optimum for optimization problems with a number of decision variables and multiple local optima. In this paper, we propose three types of new PSO methods to overcome this difficulty. One is a model with nonlinear dissipative term introduced by Fujita and colleagues [4] to prohibit the search point's velocity from being zero. The others are models with the nonlinear dissipative term with the pbest or the gbest information to disturb the search around them. © 2008 Wiley Periodicals, Inc. Electron Comm Jpn, 91(2): 23–30, 2008; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/eej.10028
    Electronics and Communications in Japan 09/2008; 91(2):23 - 30. · 0.18 Impact Factor
  • Takashi Okamoto, Eitaro Aiyoshi
    [Show abstract] [Hide abstract]
    ABSTRACT: In the present paper, we propose a new multipoint type global optimization model using a chaotic dynamic model and a synchronization phenomenon in nonlinear dynamic systems for a continuously differentiable optimization problem. We first improve the Discrete Gradient Chaos Model (DGCM), which drives each search point’s autonomous movement, based on theoretical analysis. We then derive a new coupling structure called PD type coupling in order to obtain stable synchronization of all search points with the chaotic dynamic model in a discrete time system. Finally, we propose a new multipoint type global optimization model, in which each search point moves autonomously by improved DGCM and their trajectories are synchronized to elite search points by the PD type coupling model. The proposed model properly achieves diversification and intensification, which are reported to be important strategies for global optimization in the Meta-heuristics research field. Through application to proper benchmark problems [Liang et al. Novel composition test functions for numerical global optimization. In: Proceedings of Swarm Intelligence Symposium, 2005 (SIS 2005), pp. 68–75 (2005); Liang et al. Nat. Comput. 5(1), 83–96, 2006] (in which the drawbacks of typical benchmark problems are improved) with 100 or 1000 variables, we confirm that the proposed model is more effective than other gradient-based methods.
    Journal of Global Optimization 01/2008; 41:219-244. · 1.31 Impact Factor
  • T. Okamoto, E. Aiyoshi
    [Show abstract] [Hide abstract]
    ABSTRACT: We have proposed "draining method (DM)". DM is based on the discrete gradient chaos model (DGCM) and the objective function transformation which is developed by the analysis of DGCM. Applying DM to typical benchmark problems, we have confirmed its superior global optimization capability. Besides, DM has a problem that we need to set objective function value (OFV) of global minima (or desired value) at the start of the search. In this study, we propose to improve draining procedure so that OFV of the global minimum is not needed. Then, we apply the improved DM to more proper benchmark problems which are created by recommended methods. Through several numerical simulations, we confirm that improved DM is generally effective for proper benchmark problems. This result suggests that improved DM is effective in general situations
    SICE-ICASE, 2006. International Joint Conference; 11/2006