A Bin-packing Model Based on File Preservation Problem

This paper established a bin-packing model according to file preservation problems, which is a NP hard problem, the paper use FF and FFD algorithm to obtain the corresponding results, by comparing the results, with the bound theory of the optimal solution to prove the obtained solution from FFD algorithm shall be the optimal solution. This paper further analysis of a large-scale one-dimensional packing problem solving method, in order to overcome the disadvantage of classical algorithm in space and time, and for searching a good convergence, with strong local search and to avoid falling into local optimal solution algorithm, this paper give the processes of simulated annealing algorithm.