J-GLOBAL         Last updated: Oct 23, 2018 at 13:56
Okayama University of Science
Faculty of Engineering, Department of Information and Computer Engineering
(BLANK)(Okayama University of Science)

Research Areas


Academic & Professional Experience

Professor, Okayama University of Science


Graduate School, Division of Engineering, Okayama University of Science
Faculty of Engineering, Okayama University of Science

Published Papers

A Local Search based on Variant Variable Depth Search for the Quadratic Assignment Problem
Takeshi Okano, Kengo Katayama, Kazuho Kanahara, Noritaka Nishihara
Proc. of 2018 IEEE 7th Global Conference on Consumer Electronics (GCCE 2018)      2018   [Refereed]
A Deep Q-Network Based Simulation System for Actor Node Mobility Control in WSANs Considering Three-Dimensional Environment: A Comparison Study for Normal and Uniform Distributions
Tetsuya Oda, Elis Kulla, Kengo Katayama, Makoto Ikeda, Leonard Barolli
CISIS 2018      2018   [Refereed]
A Restart Diversification Strategy for Iterated Local Search to Maximum Clique Problem
Kazuho Kanahara, Kengo Katayama, Takeshi Okano, Elis Kulla, Tetsuya Oda, Noritaka Nishihara
CISIS 2018      2018   [Refereed]
Route Lifetime Prediction Method in VANET by Using AODV Routing Protocol
Elis Kulla, Soushi Morita, Kengo Katayama, Leonard Barolli
CISIS 2018      2018   [Refereed]
A Modified Energy-Aware B.A.T.M.A.N Routing Protocol
H. Oda, E. Kulla, and K. Katayama
Proc. of the 20-th International Conference on Network-Based Information Systems (NBiS-2017)      2017   [Refereed]
An Improved Noisy Gradient Descent Bit-Flipping Decoding Algorithm for LDPC Codes
Jun Asatani, Yuya Kondo, Kengo Katayama, Elis Kulla, and Hitoshi Tokushige
Proc. of 2016 International Symposium on Information Theory and its Applications (ISITA-2016)      2016   [Refereed]
Variable Neighborhood Search Algorithms for the Node Placement Problem in Multihop Networks
K. Katayama, Y. Okamoto, E. Kulla, and N. Nishihara
Proc. of the 11-th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA-2016)      2016   [Refereed]
Elis Kulla, Ryo Ozaki, Akira Uejima, Hideyuki Shimada, Kengo Katayama, Noritaka Nishihara
CISIS 2015      2015   [Refereed]
Kengo Katayama, Yuto Akagi, Elis Kulla, Hideo Minamihara, and Noritaka Nishihara
Proc. of the 17th International Conference on Network-Based Information Systems (NBiS-2014)      2014   [Refereed]
Jun Asatani, Hiroaki Kawanishi, Hitoshi Tokushige, Kengo Katayama
IEEJ Transactions on Electrical and Electronic Engineering   10(5) 585-591   2015   [Refereed]
An Improvement in Performance of a Gradient Descent Bit Flipping Algorithm
Jun Asatani, Hiroaki Kawanishi, Hitoshi Tokushige, Kengo Katayama
Proc. of International Workshop on Nonlinear Circuits, Communications and Signal Processing      2014   [Refereed]
Kengo Katayama, Akinori Kohmura, Keiko Kohmoto, and Hideo Minamihara
Proc. of the 26th Annual ACM Symposium on Applied Computing (SAC-2011)      2011   [Refereed]
Kengo Katayama, Hiroshi Yamashita, and Hiroyuki Narihisa
Proc. of the 2007 IEEE Congress on Evolutionary Computation (CEC-2007)      2007   [Refereed]
Iterated k-opt Local Search for the Maximum Clique Problem
Kengo Katayama, Masashi Sadamatsu, and Hiroyuki Narihisa
Proc. of the 7th European Conference on Evolutionary Computation in Combinatorial Optimisation (EvoCOP-2007)      2007   [Refereed]
Kengo Katayama, Akihiro Hamamoto, and Hiroyuki Narihisa
Information Processing Letters   95(5) 503-511   2005   [Refereed]
Peter Merz and Kengo Katayama
BioSystems   78(1-3) 99-118   2004   [Refereed]
Transactions of the Japanese Society for Artificial Intelligence   19(4), 279-291    2004   [Refereed]
Performance of a Genetic Algorithm for the Graph Partitioning Problem
Mathematical and Computer Modelling   38(11-13), 1325-1332    2003   [Refereed]
Analysis of Crossovers and Selections in Coarse-grained Parallel Genetic Algorithm
Mathematical and Computer Modelling   38(11-13), 1275-1282    2003   [Refereed]
Evolutionary Programming Using Exponential Mutation
Proc. of the 6th World Multi-Conference on Systemics, Cybernetics and Informatics(SCI-2002)   9, 405-410    2002
An Evolutionary Approach for the Maximum Diversity Problem
Proc. of the 3rd International Workshop on Memetic Algorithms(WOMA III)      2002
Performance of Evolutionary Programming Using Exponential Mutation
Proc. of the 4th Asia-Pacific Conference on Simulated Evolution and Learning (SEAL-2002)   2, 454-458    2002
On Fundamental Design of Parthenogenetic Algorithm for the Binary Quadratic Programming Problem
Proc. of the 2001 Congress on Evolutionary Computation (CEC-2001)   1, 356-363    2001
Kengo Katayama and Hiroyuki Narihisa
European Journal of Operational Research   134(1), 103-119    2001
Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm
Proc. of the 2000 Genetic and Evolutionary Computation Conference(GECCO-2000)   643-650    2000
Iterated Local Search Approach using Genetic Transformation to the Traveling Salesman Problem
Proc. of the 1999 Genetic and Evolutionary Computation Conference (GECCO-99)   1, 321-328    1999
Performance of Genetic Approach using Only Two Individuals
Proc. of the 1999 IEEE International Conference on Systems, Man, and Cybernetics (SMC-99)   1, I-677-I-682    1999


Memetic Algorithm
Kengo Katayama, Hisao Ishibuchi
SICE   47(6) 487-492   2008
A Genetic Local Search for Large Maximum Diversity Problem
IPSJ Transactions on Mathematical Modeling and its Applications   45(SIG 2 (TOM 10)), 99-109    2004
An Effective Local Search for the Maximum Clique Problem
Proc. of the 5th Metaheuristics International Conference (MIC-2003)      2003
An Efficiency Enhancement of k-opt Local Search Heuristic for Quadratic Programming Problem
Transactions of Institute of Electronics, Information and Communication Engineers(D-I)   J85-D-I(3), 322-328    2002
Landscape Analysis of Binary Quadratic Programming Problems and Genetic Local Search Performance
Transactions of Institute of Electronics, Information and Communication Engineers(A)   J184-A(10), 1258-1271    2001

Research Grants & Projects

Studies on Efficient Algorithms for Combinatorial Optimization Problems