Research on Based on Ant Colony Algorithm Dynamic Product Configuration Method

In this paper the defeat of product configuration method based the problem of restriction- satisfied is analyzed. Aiming to the problem of low quality of solution, big algorithm space and low computing speed, a dynamic product configuration method based on ant colony algorithm is proposed. This method adopts ambiguous integrated judgment and other algorithm to build the filter at first. Then, through the filter, the proper sequence based on components node from the need of client and contiguous matrix are built dynamic for the logic space structure and restriction link built for the component of optimized configuration of product. The dimensions of algorithm space are lowed. From the ant colony algorithm, the optimized configuration is built and the need of client is feed. Final the feasibility and availability is approved from the instance.