KAJI Taichi

Faculty
Department of Information and Management Science
PositionProfessorMail
BirthdayWebsite
TEL(代表)0134-27-5206
Message
Last Updated :2019/07/10

Researcher Profile and Settings

Education

  •  - 1988 , Hokkaido University, Graduate School, Division of Engineering, Division of Engineering
  •  - 1986 , Hokkaido University, Faculty of Fisheries, Biology

Degree

  • Doctor of Engineering(Hokkaido University)

Association Memberships

  • JAPAN INDUSTRIAL MANAGEMENT ASSOCIATION

Academic & Professional Experience

  •   1994 ,  - 2003 , , Associate Professor,
  •   2003 , -The Present, Professor,
  •   2001 ,  - 2002 , , Visiting Professor
  •   1989 ,  - 1994 , , Research Assistant,
  •   1988 ,  - 1989 , , Researcher, Toshiba Corporation
  • Hokkaido Information University
  • Otaru University of Commerce
  • (University of Colorado at Boulder,
  • Leeds School of Business)
  • Otaru University of Commerce

Research Activities

Research Areas

  • Informatics, Fundamental theory of informatics
  • Social/Safety system science, Social systems engineering/Safety system

Research Interests

    Metaheuristics, Combinatorial Optimization, OR(Operations Research), Algorithm

Published Papers

  • Scatter Search Cauchy Particle Swarm Optimization for Multimodal Functions
    KAJI Taichi, 64, (4) 510 - 518, 01 , Refereed, DOI
  • Time Series Analysis for Fitness Landscapes of Combinatorial Optimization Problems
    KAJI Taichi, 13th Czech-Japan Seminar on Data Analysis and Decision Making in Service Science, 155 - 160
  • PROBABILISTIC ANALYSIS OF NEIGHBORHOOD USING AR(1) MODEL FOR COMBINATORIAL OPTIMIZATION PROBLEMS
    Kaji Taichi, Transactions of the Operations Research Society of Japan, 日本オペレーションズ・リサーチ学会和文論文誌, 51, 112 - 135, 12 , Refereed
  • Probabilistic Analysis of Local Search using AR(1) Model in the Graph
    KAJI Taichi, Proc. of the Fifth Metaheuristics International, 1 - 6, Refereed
  • Parallel Agent Passing Tabu Search Algorithm for Graph Partitioning Problem
    KAJI Taichi, Vol. 43, pp.163-175, Refereed
  • Approach by Ant Tabu Agents for Traveling Salesman problem
    KAJI Taichi, pp.3429-3434, Refereed
  • Parallel Tabu Search Algorithm for Graph Partitioning Problem
    KAJI Taichi, Proc. of the 2nd Joint International Workshop ORSJ and ASOR, 90 - 97
  • A Simulated Annealing Algorithm with the Random Compound Move for the Sequential Partitioning Problem of Directed Acyclic Graphs
    Kaji,T. and Ohuchi,A, Vol.112, No.1, pp.147-157, (1) 147 - 157, Refereed, DOI
  • Improvement and Analysis of Ant System Algorithm for TSP
    KAJI Taichi, The Proceedings of the 15th National Conference of the Australian Society for Operations Research, 644 - 651, Refereed
  • Parallel Revised Ant System Algorithm by New Agents for TSP
    KAJI Taichi, The Proc. Of The Second AsiaPacific Conference on Industrial Engineering and Management System, 639 - 642, Refereed
  • Assignment Problem for System with Precedence Relationships among Elements
    Kaji,T. and Ohuchi,A., The Electrical Engineering in Japan, Scripta Technica, INC., 121, (2) 54 - 62, Refereed
  • A Tabu Search Approach to the Optimal Sequential Partitions of Directed Acyclic Graph
    Kaji,T. and Ohuchi,A, 119, (4) 42 - 51, Refereed
  • Exact and Approximation Approach of Assignment Problem for System with Precedence Relationships among Elements
    KAJI Taichi, 47, (6) 344 - 350, 02 , Refereed, DOI
  • Simulated Annealing Algorithm for the Sequential Partitioning Problem of Directed Acyclic Graphs
    KAJI Taichi, The Economic Review,Otaru University of Commerce , 47, (2,3) 287 - 302
  • The Assignment Problem for System with Precedence Relationships among Elements using a Simulated Annealing Algorithm
    KAJI Taichi, Pro. of the 14th International Conference on Production Research, 1056 - 1059, Refereed
  • A Tabu Search Approach to the Optimal Sequential Partitions of Directed Acyclic Graphs
    Kaji,T. and Ohuchi,A., 116, (10) 1149 - 1157, 10 , Refereed, DOI

Misc

Research Grants & Projects



Copyright (c) MEDIA FUSION Co.,Ltd. All rights reserved.