JPH05233574

PURPOSE:To attain the asynchronous ordering among all agents by performing the partial exchange of the problem information between the agents which are adjacent to each other and connected together with a restriction. CONSTITUTION:A global restriction checking part 27 refers to the received local solution information and checks the restriction to the local solution of its own. An ordering processor 24 calculates the processor probability where the local solution of its own produces a violation of restriction to the local solution of another agent. This probability is stored in a local solution accumulating part 23 as the additional information on a local solution candidate. Then the part 24 refers to the part 23 to calculate the probability where the local solution of its own produces a violation of restriction to another agent. That is, the local solution having the lower probability of causing a violation of restriction has the higher probability of being the final solution. Furthermore the part 24 performs the sequencing in order to take the local solutions out of the part 23 in the order of lower probability of causing the violations of restriction.