Chapters have been written previously about how genetic algorithms and other evolution-based algorithms could aid construction site layout planning. These articles presented approaches that solved of the layout problem by applying costs on the moving of construction materials across the site. Our goal was to build an algorithm which is specialized in solving problems of distributing building materials- brick for example-on a site by placing their pallets at the optimal spots, for every unit built from a given material to be within optimal reach. This article describes a solution of this problem for the engineering practice and interprets the slow but accurate method of the Hungarian Algorithm, further it proposes a Memetic Algorithm as a faster but almost as accurate solution. Conclusions are drawn about the usability of this method. © Springer International Publishing Switzerland 2014.