A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs. - Taichi Kaji; Azuma Ohuchi (Eur. J. Oper. Res., 1999)

Approach by ant tabu agents for Traveling Salesman Problem. - Taichi Kaji (SMC, 2001)

A probabilistic analysis of neighborhoods for combinatorial optimization problems and its application. - Taichi Kaji (J. Heuristics, 2021)