Evaluating a data analysis solution of distribution of values for the bin packing problem where the values of the Objects cannot be know before they are instantiated. The bin packing problem is defined in as where "Objects of different volumes must be packed into a finite number of bins of capacity in a way that minimizes the number of bins used." This analysis can be seen as a formal examining any resource allocation problem such as a distributed crawler.In this project a solution of competitive game of learning automata should be the main focus of the distribution of the objects.