Resolving set has several applications in the fields of science, engineering, and computer science. One application of the resolving set problem includes navigation robots, chemical structures, and supply chain management. Suppose the set $W=\left\{s_1,s_2,\dots ,s_k\right\}\subset V\left(G\right)$, the vertex representations of $x\in V\left(G\right)$ is $r_m\left(x\right|W)=\{d(x,s_1),d(x,s_2),\dots ,d(x,s_k)\}$, where $d(x,s_i)$ is the length of the shortest path of the vertex $x$ and the vertex in $W$ together with their multiplicity. The set $W$ is called a local $m$-resolving set of graphs $G$ if $r_m\left(v|W\right)\ne r_m\left(u\right|W)$ for $uv\in E\left(G\right)$. The local $m$-resolving set having minimum cardinality is called the local multiset basis and its cardinality is called the local multiset dimension of $G$, denoted by $m{d}_l\left(G\right)$. In our paper, we determined the bounds of the local multiset dimension of the comb product of tree graphs.