| 摘要 |
<p>PURPOSE:To efficiently find an approximate optimum solution. CONSTITUTION:To the combination optimization problem which is formularized as P:min(max)f(x), subject to x F(possible area), a tree search is made while values are substituted in all variables, an initial solution is given first, a subset called minimum contradiction which is not improved more is found; and a variation node (xa) which is at the bottom among its elements is found, the value of the node is varied, and a variation mark is added. The part below the varied node (xa') is searched and when a node (xb) below the node (xa') is found as a variation node, a similar process is performed, but when a node (xb) above the node (xa') is found as a variation node by the search, the variation mark of the node (xa') is deleted; when the node (xa') to which the variation mark is added becomes a variation node, the value of the node (xa') is put back to the original value and an advancing process for varying the node (xb) right above it is performed.</p> |
