We consider the problem of constructing embeddings of 2-dimensional FEM graphs into grids. Our goal is to minimize the edge-congestion and dilation and optimize the load. We introduce some heuristics, analyze their performance, and present experimental results comparing the heuristics with the methods based on the usage of standard graph partitioning libraries.