Zobrazeno 1 - 10
of 107
pro vyhledávání: '"Shinzo Kitamura"'
Publikováno v:
IEEJ Transactions on Electronics, Information and Systems. 126:888-896
Publikováno v:
Transactions of the Institute of Systems, Control and Information Engineers. 18:458-466
Recently, as performance of computers improves, it is possible to simulate larger-scale and more detailed traffic flows. In this paper, a road traffic system is modeled as a hierarchical autonomous decentralized system by constructing three kinds of
Publikováno v:
Transactions of the Institute of Systems, Control and Information Engineers. 17:257-263
In this paper, we consider an extended class of flexible shop scheduling problems. First, we translate the problem into a mathematical programming formula, i.e., a mixed-integer programming problem. This makes it possible to apply standard packages o
Publikováno v:
Electrical Engineering in Japan. 150:42-49
We propose a parallel genetic algorithm with sexual selection. In genetic algorithms with sexual selection with one population, females keep their traits around local optima by using a lower mutation rate than that of the males, while the males chang
Autor:
Toshiharu Iwatani, Hisashi Tamaki, Shinzo Kitamura, Kazutoshi Sakakibara, Kouichi Matsuda, Hajime Murao
Publikováno v:
IEEJ Transactions on Electronics, Information and Systems. 123:823-831
In this paper, we adopt a genetic-based machine learning (GBML) approach to a realtime scheduling problem in which several products are to be assigned to one of the buffers, and propose a method of generating and selecting rules for assigning each pr
Publikováno v:
IEEJ Transactions on Electronics, Information and Systems. 123:2056-2062
Publikováno v:
IEEJ Transactions on Electronics, Information and Systems. 123:1334-1340
In this paper, we propose a framework for obtaining the optimal car service to elevator operation problems by applying branch-and-bound methods based on the deterministic optimization model. In building the model, we assume the followings: the number
Publikováno v:
Artificial Life and Robotics. 6:221-227
This paper introduces a coevolutionary approach to genetic algorithms (GAs) for exploring not only within a part of the solution space defined by the genotype-phenotype map but also the map itself. In canonical GAs with the fixed map, how a large are
Publikováno v:
Transactions of the Institute of Systems, Control and Information Engineers. 15:422-429
Publikováno v:
Transactions of the Society of Instrument and Control Engineers. 38:193-200