Abstract: Three dimension packing problem with multi constraints is a complicated combinatorial optimization,and is NP HARD problem.It is difficult to obtain on optimal solution.The Heuristic Method is usually employed in practical applications.Considering multi constraints in applications,a heuristic method for the three dimension packing problem is presented in this paper.The measures of three divided spaces,average high packing,goods combining and spares combining were taken and constraints of orientation,weight,priority,packing place and average packing were considered in the algorithm.Satisfied result is obtained by washing out worse packing.Some cases are used,and it is shown that the algorithm is effective and practical,and can be directly used in applications.