A general social intelligent algorithmic framework for packing problem with multi-processors

In this paper we establish a general social intelligent algorithmic framework for packing problem under the help of the conception of social computing. In this framework, packing problem can be solved intelligently, with the same asymptotic bounds by applying the existing packing algorithms. More precisely, our framework is designed to intelligently adopt the most proper one among all the given existing packing algorithms to pack the fixed given rectangle according to the present packing scenario. Moreover, for single packing processor, the algorithm created by our framework certainly turns out to be the algorithm the processor holds. But for multiple packing processors, it can construct and provide one social parallel intelligent packing algorithm based on all existing ones. This constructed algorithm certainly better than any algorithm involved, since the most proper algorithm is always adopted.