Patent Document ID: 20020010692
Application ID: 09081604
Patent Flag: 0

Claim One:
1. An arrangement optimization problem processing method for arranging a plurality of nodes, whose connection relationships are indicated in a system space, in a generation space, comprising: a hyper node formation step of grouping the plurality of nodes to form a plurality of hyper nodes each formed from a set of nodes: a hyper node arrangement step of executing an optimization problem solution algorithm to determine solutions to a problem of arrangement of the plurality of hyper nodes formed by the hyper node formation step in the generation space and arranging the plurality of hyper nodes in the generation space based on one of the determined solutions: and a node optimum arrangement step of executing the optimization problem solution algorithm taking arrangement relationships of the plurality of hyper nodes obtained by the hyper node arrangement step into consideration to determine a solution to a problem of arrangement of the plurality of nodes in an optimum condition in the generation space and arranging the plurality of nodes in the generation space based on the determined solution.