Yuji Shigehiro

Stochastic tabu search for rectangle packing

The rectangle packing problem is a combinatorial optimization problem, and is hard to solve it exactly in practical applications. In this paper, a tabu search heuristic is applied to the rectangle packing problem. First, each solution of the problem is represented by a pair of permutations of rectangles, and then the proposed method is described in detail, where the first admissible move strategy and a concept of stochastic tabu restrictions are employed. The experimental results are given to demonstrate the effectiveness of the proposed method.

An agent-based method for combinatorial optimization problems

In this paper, a new method for combinatorial optimization problems by means of multi-agent system is proposed. In our method, a lot of agents explore in the solution space, locally and globally, for finding an optimal solution. A part of experimental results is also shown in order to demonstrate the effectiveness of our method.

Pseudo innerizing control by state feedback

In this paper, we will propose the method of pseudo innerizing by state feedback for a given strictly proper transfer function matrix. The method is an extended result for transfer function matrices which have proper left-inverse, and a generalization of inverted interactorizing for minimum phase transfer function matrices. Numerical examples will be also shown to illustrate the presented method.